./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30793774-eacf-4174-939d-a0e0cd56566a/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30793774-eacf-4174-939d-a0e0cd56566a/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30793774-eacf-4174-939d-a0e0cd56566a/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30793774-eacf-4174-939d-a0e0cd56566a/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30793774-eacf-4174-939d-a0e0cd56566a/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30793774-eacf-4174-939d-a0e0cd56566a/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 952f1621c7899c5ce964b8bd35a2296981cb24cd167b0d1d0e9f7406c8d49f3b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:03:35,825 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:03:35,932 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30793774-eacf-4174-939d-a0e0cd56566a/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:03:35,936 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:03:35,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:03:35,961 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:03:35,963 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:03:35,964 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:03:35,965 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:03:35,966 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:03:35,967 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:03:35,968 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:03:35,969 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:03:35,972 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:03:35,972 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:03:35,973 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:03:35,974 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:03:35,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:03:35,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:03:35,979 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:03:35,980 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:03:35,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:03:35,981 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:03:35,981 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:03:35,982 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:03:35,982 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:03:35,983 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:03:35,983 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:03:35,984 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:03:35,984 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:03:35,985 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:03:35,986 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:03:35,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:03:35,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:03:35,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:03:35,987 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:03:35,988 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:03:35,988 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:03:35,988 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:03:35,988 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30793774-eacf-4174-939d-a0e0cd56566a/bin/uautomizer-verify-uTZkv6EMXl/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30793774-eacf-4174-939d-a0e0cd56566a/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 952f1621c7899c5ce964b8bd35a2296981cb24cd167b0d1d0e9f7406c8d49f3b [2023-11-12 02:03:36,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:03:36,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:03:36,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:03:36,330 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:03:36,330 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:03:36,331 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30793774-eacf-4174-939d-a0e0cd56566a/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i [2023-11-12 02:03:39,463 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:03:39,760 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:03:39,760 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30793774-eacf-4174-939d-a0e0cd56566a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i [2023-11-12 02:03:39,773 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30793774-eacf-4174-939d-a0e0cd56566a/bin/uautomizer-verify-uTZkv6EMXl/data/275336497/e00e892bc33d47d4a2cc4e117029336c/FLAG117942fce [2023-11-12 02:03:39,793 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30793774-eacf-4174-939d-a0e0cd56566a/bin/uautomizer-verify-uTZkv6EMXl/data/275336497/e00e892bc33d47d4a2cc4e117029336c [2023-11-12 02:03:39,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:03:39,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:03:39,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:03:39,805 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:03:39,810 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:03:39,813 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:03:39" (1/1) ... [2023-11-12 02:03:39,814 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@668a4c22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:39, skipping insertion in model container [2023-11-12 02:03:39,814 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:03:39" (1/1) ... [2023-11-12 02:03:39,861 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:03:40,028 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30793774-eacf-4174-939d-a0e0cd56566a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i[916,929] [2023-11-12 02:03:40,087 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:03:40,101 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:03:40,114 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30793774-eacf-4174-939d-a0e0cd56566a/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-61.i[916,929] [2023-11-12 02:03:40,153 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:03:40,174 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:03:40,175 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:40 WrapperNode [2023-11-12 02:03:40,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:03:40,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:03:40,177 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:03:40,177 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:03:40,185 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:40" (1/1) ... [2023-11-12 02:03:40,202 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:40" (1/1) ... [2023-11-12 02:03:40,264 INFO L138 Inliner]: procedures = 29, calls = 203, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 502 [2023-11-12 02:03:40,265 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:03:40,266 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:03:40,267 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:03:40,267 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:03:40,275 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:40" (1/1) ... [2023-11-12 02:03:40,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:40" (1/1) ... [2023-11-12 02:03:40,283 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:40" (1/1) ... [2023-11-12 02:03:40,283 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:40" (1/1) ... [2023-11-12 02:03:40,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:40" (1/1) ... [2023-11-12 02:03:40,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:40" (1/1) ... [2023-11-12 02:03:40,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:40" (1/1) ... [2023-11-12 02:03:40,314 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:40" (1/1) ... [2023-11-12 02:03:40,321 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:03:40,322 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:03:40,323 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:03:40,323 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:03:40,324 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:40" (1/1) ... [2023-11-12 02:03:40,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:03:40,359 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30793774-eacf-4174-939d-a0e0cd56566a/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:03:40,396 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30793774-eacf-4174-939d-a0e0cd56566a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:03:40,427 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_30793774-eacf-4174-939d-a0e0cd56566a/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:03:40,438 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:03:40,438 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2023-11-12 02:03:40,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:03:40,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2023-11-12 02:03:40,439 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:03:40,439 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2023-11-12 02:03:40,440 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:03:40,440 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:03:40,440 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:03:40,440 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:03:40,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:03:40,633 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:03:40,636 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:03:41,383 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:03:41,393 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:03:41,394 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:03:41,397 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:03:41 BoogieIcfgContainer [2023-11-12 02:03:41,397 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:03:41,401 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:03:41,401 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:03:41,404 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:03:41,405 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:03:39" (1/3) ... [2023-11-12 02:03:41,405 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b65a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:03:41, skipping insertion in model container [2023-11-12 02:03:41,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:03:40" (2/3) ... [2023-11-12 02:03:41,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b65a40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:03:41, skipping insertion in model container [2023-11-12 02:03:41,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:03:41" (3/3) ... [2023-11-12 02:03:41,408 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-61.i [2023-11-12 02:03:41,428 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:03:41,428 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:03:41,491 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:03:41,497 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@365815b6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:03:41,497 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:03:41,502 INFO L276 IsEmpty]: Start isEmpty. Operand has 120 states, 92 states have (on average 1.358695652173913) internal successors, (125), 93 states have internal predecessors, (125), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-12 02:03:41,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-12 02:03:41,520 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:03:41,521 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:03:41,521 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:03:41,526 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:03:41,527 INFO L85 PathProgramCache]: Analyzing trace with hash 686700268, now seen corresponding path program 1 times [2023-11-12 02:03:41,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:03:41,535 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359856355] [2023-11-12 02:03:41,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:03:41,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:03:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:41,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:03:41,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:41,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:03:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:41,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:03:41,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:41,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:03:41,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:41,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:03:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:41,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:03:41,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:03:42,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:03:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:03:42,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:03:42,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:03:42,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:03:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:03:42,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:03:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:03:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:03:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:03:42,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:03:42,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:03:42,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:03:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:03:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:03:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:03:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-12 02:03:42,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-12 02:03:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,123 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-12 02:03:42,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:03:42,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359856355] [2023-11-12 02:03:42,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359856355] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:03:42,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:03:42,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:03:42,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165431565] [2023-11-12 02:03:42,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:03:42,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:03:42,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:03:42,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:03:42,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:03:42,185 INFO L87 Difference]: Start difference. First operand has 120 states, 92 states have (on average 1.358695652173913) internal successors, (125), 93 states have internal predecessors, (125), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-12 02:03:42,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:03:42,251 INFO L93 Difference]: Finished difference Result 233 states and 369 transitions. [2023-11-12 02:03:42,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:03:42,253 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 190 [2023-11-12 02:03:42,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:03:42,268 INFO L225 Difference]: With dead ends: 233 [2023-11-12 02:03:42,269 INFO L226 Difference]: Without dead ends: 116 [2023-11-12 02:03:42,279 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:03:42,285 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:03:42,286 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:03:42,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-12 02:03:42,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-11-12 02:03:42,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 89 states have internal predecessors, (118), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-12 02:03:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 168 transitions. [2023-11-12 02:03:42,359 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 168 transitions. Word has length 190 [2023-11-12 02:03:42,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:03:42,360 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 168 transitions. [2023-11-12 02:03:42,361 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.0) internal successors, (68), 2 states have internal predecessors, (68), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2023-11-12 02:03:42,361 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 168 transitions. [2023-11-12 02:03:42,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-12 02:03:42,366 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:03:42,367 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:03:42,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:03:42,368 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:03:42,368 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:03:42,369 INFO L85 PathProgramCache]: Analyzing trace with hash 326820314, now seen corresponding path program 1 times [2023-11-12 02:03:42,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:03:42,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605541301] [2023-11-12 02:03:42,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:03:42,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:03:42,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:03:42,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:03:42,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:03:42,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:03:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:03:42,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:03:42,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:03:42,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:03:42,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:03:42,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:03:42,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:03:42,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:03:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:03:42,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:03:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:03:42,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:03:42,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:03:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:42,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:03:43,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:03:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:03:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:03:43,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:03:43,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:03:43,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-12 02:03:43,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-12 02:03:43,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-12 02:03:43,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:03:43,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605541301] [2023-11-12 02:03:43,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605541301] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:03:43,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:03:43,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:03:43,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460297446] [2023-11-12 02:03:43,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:03:43,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:03:43,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:03:43,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:03:43,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:03:43,050 INFO L87 Difference]: Start difference. First operand 116 states and 168 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:03:43,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:03:43,146 INFO L93 Difference]: Finished difference Result 237 states and 344 transitions. [2023-11-12 02:03:43,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:03:43,147 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-12 02:03:43,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:03:43,156 INFO L225 Difference]: With dead ends: 237 [2023-11-12 02:03:43,156 INFO L226 Difference]: Without dead ends: 124 [2023-11-12 02:03:43,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:03:43,162 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 12 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:03:43,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 489 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:03:43,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-12 02:03:43,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 118. [2023-11-12 02:03:43,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 91 states have (on average 1.3186813186813187) internal successors, (120), 91 states have internal predecessors, (120), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-12 02:03:43,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 170 transitions. [2023-11-12 02:03:43,198 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 170 transitions. Word has length 190 [2023-11-12 02:03:43,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:03:43,201 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 170 transitions. [2023-11-12 02:03:43,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:03:43,202 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 170 transitions. [2023-11-12 02:03:43,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-12 02:03:43,213 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:03:43,214 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:03:43,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:03:43,214 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:03:43,219 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:03:43,219 INFO L85 PathProgramCache]: Analyzing trace with hash 2101827676, now seen corresponding path program 1 times [2023-11-12 02:03:43,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:03:43,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196712171] [2023-11-12 02:03:43,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:03:43,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:03:43,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:03:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:03:43,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:03:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:03:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:03:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:03:43,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:03:43,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:03:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:03:43,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:03:43,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:03:43,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:03:43,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:03:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:03:43,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:03:43,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:03:43,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:03:43,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:03:43,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:03:43,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:03:43,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:03:43,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:03:43,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:03:43,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-12 02:03:43,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-12 02:03:43,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:43,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-12 02:03:43,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:03:43,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196712171] [2023-11-12 02:03:43,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196712171] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:03:43,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:03:43,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:03:43,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560641538] [2023-11-12 02:03:43,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:03:43,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:03:43,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:03:43,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:03:43,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:03:43,703 INFO L87 Difference]: Start difference. First operand 118 states and 170 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:03:43,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:03:43,763 INFO L93 Difference]: Finished difference Result 237 states and 342 transitions. [2023-11-12 02:03:43,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:03:43,764 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-12 02:03:43,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:03:43,769 INFO L225 Difference]: With dead ends: 237 [2023-11-12 02:03:43,769 INFO L226 Difference]: Without dead ends: 122 [2023-11-12 02:03:43,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:03:43,772 INFO L413 NwaCegarLoop]: 165 mSDtfsCounter, 3 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:03:43,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 488 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:03:43,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-12 02:03:43,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 120. [2023-11-12 02:03:43,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.3118279569892473) internal successors, (122), 93 states have internal predecessors, (122), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-12 02:03:43,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 172 transitions. [2023-11-12 02:03:43,794 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 172 transitions. Word has length 190 [2023-11-12 02:03:43,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:03:43,796 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 172 transitions. [2023-11-12 02:03:43,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:03:43,797 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 172 transitions. [2023-11-12 02:03:43,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-12 02:03:43,802 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:03:43,802 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:03:43,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:03:43,803 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:03:43,804 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:03:43,805 INFO L85 PathProgramCache]: Analyzing trace with hash 2103674718, now seen corresponding path program 1 times [2023-11-12 02:03:43,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:03:43,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327317126] [2023-11-12 02:03:43,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:03:43,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:03:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:03:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:03:44,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:03:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:03:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:03:44,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:03:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:03:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:03:44,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:03:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:03:44,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:03:44,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:03:44,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:03:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:03:44,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:03:44,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:03:44,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:03:44,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:03:44,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:03:44,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:03:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:03:44,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:03:44,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:03:44,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-12 02:03:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-12 02:03:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:44,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-12 02:03:44,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:03:44,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327317126] [2023-11-12 02:03:44,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327317126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:03:44,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:03:44,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:03:44,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329165382] [2023-11-12 02:03:44,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:03:44,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:03:44,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:03:44,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:03:44,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:03:44,273 INFO L87 Difference]: Start difference. First operand 120 states and 172 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:03:44,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:03:44,305 INFO L93 Difference]: Finished difference Result 248 states and 358 transitions. [2023-11-12 02:03:44,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:03:44,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-12 02:03:44,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:03:44,308 INFO L225 Difference]: With dead ends: 248 [2023-11-12 02:03:44,308 INFO L226 Difference]: Without dead ends: 131 [2023-11-12 02:03:44,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:03:44,310 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 14 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:03:44,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 490 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:03:44,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-12 02:03:44,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 122. [2023-11-12 02:03:44,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 95 states have (on average 1.305263157894737) internal successors, (124), 95 states have internal predecessors, (124), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-12 02:03:44,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 174 transitions. [2023-11-12 02:03:44,323 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 174 transitions. Word has length 190 [2023-11-12 02:03:44,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:03:44,324 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 174 transitions. [2023-11-12 02:03:44,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:03:44,325 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 174 transitions. [2023-11-12 02:03:44,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-12 02:03:44,327 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:03:44,328 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:03:44,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:03:44,328 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:03:44,328 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:03:44,329 INFO L85 PathProgramCache]: Analyzing trace with hash 180446684, now seen corresponding path program 1 times [2023-11-12 02:03:44,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:03:44,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658944156] [2023-11-12 02:03:44,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:03:44,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:03:45,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:03:46,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:03:46,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:03:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:03:46,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:03:46,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:03:46,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:03:46,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:03:46,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:03:46,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:03:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:03:46,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:03:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:03:46,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:03:46,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:03:46,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:03:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:03:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:03:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:03:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:03:46,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:03:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:03:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:03:46,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-12 02:03:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-12 02:03:46,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:46,828 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-12 02:03:46,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:03:46,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658944156] [2023-11-12 02:03:46,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658944156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:03:46,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:03:46,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:03:46,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156880470] [2023-11-12 02:03:46,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:03:46,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:03:46,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:03:46,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:03:46,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:03:46,833 INFO L87 Difference]: Start difference. First operand 122 states and 174 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:03:47,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:03:47,308 INFO L93 Difference]: Finished difference Result 248 states and 354 transitions. [2023-11-12 02:03:47,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:03:47,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-12 02:03:47,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:03:47,312 INFO L225 Difference]: With dead ends: 248 [2023-11-12 02:03:47,312 INFO L226 Difference]: Without dead ends: 129 [2023-11-12 02:03:47,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:03:47,315 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 122 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:03:47,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 419 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:03:47,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-12 02:03:47,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 124. [2023-11-12 02:03:47,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 97 states have (on average 1.2989690721649485) internal successors, (126), 97 states have internal predecessors, (126), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-12 02:03:47,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions. [2023-11-12 02:03:47,341 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 190 [2023-11-12 02:03:47,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:03:47,342 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions. [2023-11-12 02:03:47,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:03:47,342 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions. [2023-11-12 02:03:47,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-12 02:03:47,346 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:03:47,346 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:03:47,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:03:47,347 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:03:47,347 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:03:47,347 INFO L85 PathProgramCache]: Analyzing trace with hash -805089184, now seen corresponding path program 1 times [2023-11-12 02:03:47,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:03:47,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282298458] [2023-11-12 02:03:47,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:03:47,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:03:48,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:03:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:03:49,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:03:49,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:03:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:03:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:03:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:03:49,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:03:49,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:03:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:03:49,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:03:49,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:03:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:03:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:03:49,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:03:49,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:03:49,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:03:49,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:03:49,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:03:49,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:03:49,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:03:49,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:03:49,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:03:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-12 02:03:49,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-12 02:03:49,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:49,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-12 02:03:49,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:03:49,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282298458] [2023-11-12 02:03:49,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282298458] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:03:49,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:03:49,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-12 02:03:49,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856651858] [2023-11-12 02:03:49,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:03:49,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:03:49,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:03:49,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:03:49,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:03:49,966 INFO L87 Difference]: Start difference. First operand 124 states and 176 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:03:51,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:03:51,004 INFO L93 Difference]: Finished difference Result 295 states and 420 transitions. [2023-11-12 02:03:51,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:03:51,005 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-12 02:03:51,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:03:51,007 INFO L225 Difference]: With dead ends: 295 [2023-11-12 02:03:51,007 INFO L226 Difference]: Without dead ends: 174 [2023-11-12 02:03:51,008 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:03:51,009 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 178 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-12 02:03:51,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 487 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-12 02:03:51,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2023-11-12 02:03:51,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 135. [2023-11-12 02:03:51,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 108 states have (on average 1.3240740740740742) internal successors, (143), 108 states have internal predecessors, (143), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-12 02:03:51,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 193 transitions. [2023-11-12 02:03:51,042 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 193 transitions. Word has length 190 [2023-11-12 02:03:51,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:03:51,043 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 193 transitions. [2023-11-12 02:03:51,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:03:51,044 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 193 transitions. [2023-11-12 02:03:51,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-12 02:03:51,047 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:03:51,047 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:03:51,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:03:51,047 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:03:51,048 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:03:51,048 INFO L85 PathProgramCache]: Analyzing trace with hash 1495733406, now seen corresponding path program 1 times [2023-11-12 02:03:51,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:03:51,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374586641] [2023-11-12 02:03:51,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:03:51,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:03:51,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:53,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:03:53,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:53,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:03:53,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:53,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:03:53,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:53,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:03:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:53,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:03:53,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:53,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:03:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:53,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:03:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:53,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:03:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:53,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:03:53,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:53,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:03:53,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:53,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:03:53,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:53,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:03:53,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:53,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:03:53,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:53,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:03:53,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:53,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:03:53,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:53,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:03:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:53,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:03:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:53,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:03:53,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:53,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:03:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:53,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:03:53,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:54,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:03:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:54,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:03:54,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:54,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:03:54,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:54,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-12 02:03:54,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:54,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-12 02:03:54,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:54,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-12 02:03:54,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:03:54,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374586641] [2023-11-12 02:03:54,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374586641] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:03:54,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:03:54,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-12 02:03:54,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632640750] [2023-11-12 02:03:54,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:03:54,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 02:03:54,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:03:54,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 02:03:54,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:03:54,038 INFO L87 Difference]: Start difference. First operand 135 states and 193 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:03:55,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:03:55,291 INFO L93 Difference]: Finished difference Result 380 states and 540 transitions. [2023-11-12 02:03:55,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-12 02:03:55,292 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-12 02:03:55,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:03:55,295 INFO L225 Difference]: With dead ends: 380 [2023-11-12 02:03:55,295 INFO L226 Difference]: Without dead ends: 248 [2023-11-12 02:03:55,296 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2023-11-12 02:03:55,297 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 614 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 614 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-12 02:03:55,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [614 Valid, 770 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-12 02:03:55,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-11-12 02:03:55,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 144. [2023-11-12 02:03:55,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 117 states have (on average 1.3247863247863247) internal successors, (155), 117 states have internal predecessors, (155), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-12 02:03:55,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 205 transitions. [2023-11-12 02:03:55,320 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 205 transitions. Word has length 190 [2023-11-12 02:03:55,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:03:55,321 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 205 transitions. [2023-11-12 02:03:55,321 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:03:55,321 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 205 transitions. [2023-11-12 02:03:55,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-12 02:03:55,324 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:03:55,324 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:03:55,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:03:55,325 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:03:55,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:03:55,325 INFO L85 PathProgramCache]: Analyzing trace with hash -904232631, now seen corresponding path program 1 times [2023-11-12 02:03:55,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:03:55,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515298168] [2023-11-12 02:03:55,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:03:55,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:03:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:03:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:03:56,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:03:56,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:03:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:03:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:03:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:03:56,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:03:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:03:56,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:03:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:03:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:03:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:03:56,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:03:56,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:03:56,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:03:56,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:03:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:03:56,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:03:56,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:03:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:03:56,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:03:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:03:56,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-12 02:03:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-12 02:03:56,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:03:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-12 02:03:56,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:03:56,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515298168] [2023-11-12 02:03:56,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515298168] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:03:56,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:03:56,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-12 02:03:56,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230470260] [2023-11-12 02:03:56,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:03:56,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:03:56,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:03:56,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:03:56,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:03:56,923 INFO L87 Difference]: Start difference. First operand 144 states and 205 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:03:57,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:03:57,359 INFO L93 Difference]: Finished difference Result 360 states and 513 transitions. [2023-11-12 02:03:57,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 02:03:57,360 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-12 02:03:57,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:03:57,362 INFO L225 Difference]: With dead ends: 360 [2023-11-12 02:03:57,362 INFO L226 Difference]: Without dead ends: 219 [2023-11-12 02:03:57,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:03:57,365 INFO L413 NwaCegarLoop]: 170 mSDtfsCounter, 295 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 665 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:03:57,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 665 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:03:57,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-11-12 02:03:57,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 151. [2023-11-12 02:03:57,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 124 states have (on average 1.3387096774193548) internal successors, (166), 124 states have internal predecessors, (166), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-12 02:03:57,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 216 transitions. [2023-11-12 02:03:57,391 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 216 transitions. Word has length 190 [2023-11-12 02:03:57,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:03:57,394 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 216 transitions. [2023-11-12 02:03:57,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:03:57,395 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 216 transitions. [2023-11-12 02:03:57,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-12 02:03:57,397 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:03:57,397 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:03:57,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:03:57,398 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:03:57,398 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:03:57,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1396589959, now seen corresponding path program 1 times [2023-11-12 02:03:57,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:03:57,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413306314] [2023-11-12 02:03:57,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:03:57,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:03:58,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:04:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:04:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:04:00,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:04:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:04:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:04:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:04:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:04:00,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:04:00,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:04:00,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:04:00,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:04:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:04:00,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:04:00,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:04:00,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:04:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:04:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:04:00,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:04:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:04:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:04:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:04:00,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:04:00,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-12 02:04:00,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-12 02:04:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:00,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-12 02:04:00,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:00,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413306314] [2023-11-12 02:04:00,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413306314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:00,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:00,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-12 02:04:00,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527581663] [2023-11-12 02:04:00,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:00,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 02:04:00,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:00,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 02:04:00,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:04:00,674 INFO L87 Difference]: Start difference. First operand 151 states and 216 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:04:02,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:02,397 INFO L93 Difference]: Finished difference Result 418 states and 593 transitions. [2023-11-12 02:04:02,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-12 02:04:02,398 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-12 02:04:02,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:04:02,401 INFO L225 Difference]: With dead ends: 418 [2023-11-12 02:04:02,401 INFO L226 Difference]: Without dead ends: 270 [2023-11-12 02:04:02,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2023-11-12 02:04:02,402 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 360 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 1010 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:04:02,403 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 1010 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-12 02:04:02,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2023-11-12 02:04:02,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 157. [2023-11-12 02:04:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 130 states have (on average 1.353846153846154) internal successors, (176), 130 states have internal predecessors, (176), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-12 02:04:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 226 transitions. [2023-11-12 02:04:02,431 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 226 transitions. Word has length 190 [2023-11-12 02:04:02,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:04:02,432 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 226 transitions. [2023-11-12 02:04:02,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:04:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 226 transitions. [2023-11-12 02:04:02,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-12 02:04:02,435 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:02,435 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:02,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-12 02:04:02,436 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:02,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:02,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1227791010, now seen corresponding path program 1 times [2023-11-12 02:04:02,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:02,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290420659] [2023-11-12 02:04:02,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:02,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:03,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:04:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:04:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:04:04,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:04:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:04:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:04:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:04:04,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:04:04,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:04:04,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:04:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:04:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:04:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:04:04,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:04:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:04:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:04:04,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:04:04,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:04:04,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:04:04,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:04:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:04:04,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:04:04,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:04:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-12 02:04:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-12 02:04:04,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-12 02:04:04,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:04,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290420659] [2023-11-12 02:04:04,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290420659] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:04,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:04,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-12 02:04:04,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441230702] [2023-11-12 02:04:04,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:04,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-12 02:04:04,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:04,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-12 02:04:04,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-11-12 02:04:04,969 INFO L87 Difference]: Start difference. First operand 157 states and 226 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:04:05,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:05,882 INFO L93 Difference]: Finished difference Result 356 states and 510 transitions. [2023-11-12 02:04:05,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-12 02:04:05,883 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-12 02:04:05,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:04:05,885 INFO L225 Difference]: With dead ends: 356 [2023-11-12 02:04:05,886 INFO L226 Difference]: Without dead ends: 202 [2023-11-12 02:04:05,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-11-12 02:04:05,887 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 177 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 441 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 02:04:05,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 441 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 02:04:05,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2023-11-12 02:04:05,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 157. [2023-11-12 02:04:05,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 130 states have (on average 1.353846153846154) internal successors, (176), 130 states have internal predecessors, (176), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-12 02:04:05,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 226 transitions. [2023-11-12 02:04:05,919 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 226 transitions. Word has length 190 [2023-11-12 02:04:05,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:04:05,919 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 226 transitions. [2023-11-12 02:04:05,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:04:05,920 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 226 transitions. [2023-11-12 02:04:05,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-12 02:04:05,923 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:05,923 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:05,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-12 02:04:05,923 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:05,924 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:05,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1073031580, now seen corresponding path program 1 times [2023-11-12 02:04:05,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:05,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594883158] [2023-11-12 02:04:05,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:05,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:04:08,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:04:08,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:04:08,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:04:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:04:08,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:04:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:04:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:04:08,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:04:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:04:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:04:08,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:04:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:04:08,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:04:08,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:04:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:04:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:04:08,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:04:08,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:04:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:04:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:04:08,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:04:08,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:04:08,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-12 02:04:08,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-12 02:04:08,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-12 02:04:08,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:08,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594883158] [2023-11-12 02:04:08,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594883158] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:08,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:08,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-12 02:04:08,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663964885] [2023-11-12 02:04:08,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:08,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-12 02:04:08,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:08,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-12 02:04:08,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2023-11-12 02:04:08,953 INFO L87 Difference]: Start difference. First operand 157 states and 226 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:04:10,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:10,378 INFO L93 Difference]: Finished difference Result 430 states and 611 transitions. [2023-11-12 02:04:10,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-12 02:04:10,379 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-12 02:04:10,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:04:10,383 INFO L225 Difference]: With dead ends: 430 [2023-11-12 02:04:10,383 INFO L226 Difference]: Without dead ends: 276 [2023-11-12 02:04:10,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2023-11-12 02:04:10,385 INFO L413 NwaCegarLoop]: 147 mSDtfsCounter, 547 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 921 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-12 02:04:10,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 832 Invalid, 933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 921 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-12 02:04:10,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2023-11-12 02:04:10,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 159. [2023-11-12 02:04:10,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 132 states have (on average 1.356060606060606) internal successors, (179), 132 states have internal predecessors, (179), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-12 02:04:10,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 229 transitions. [2023-11-12 02:04:10,421 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 229 transitions. Word has length 190 [2023-11-12 02:04:10,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:04:10,422 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 229 transitions. [2023-11-12 02:04:10,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:04:10,422 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 229 transitions. [2023-11-12 02:04:10,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-12 02:04:10,425 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:10,425 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:10,425 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-12 02:04:10,425 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:10,426 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:10,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1326934457, now seen corresponding path program 1 times [2023-11-12 02:04:10,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:10,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744849419] [2023-11-12 02:04:10,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:10,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:11,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:04:12,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:04:12,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:04:12,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:04:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:04:12,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:04:12,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:04:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:04:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:04:12,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:04:12,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:04:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:04:12,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:04:12,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:04:12,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:04:12,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:04:12,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:04:12,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:04:12,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:04:12,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:04:12,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:04:12,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:04:12,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:04:12,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-12 02:04:12,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-12 02:04:12,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:12,388 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-12 02:04:12,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:12,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744849419] [2023-11-12 02:04:12,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744849419] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:12,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:12,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-12 02:04:12,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314249489] [2023-11-12 02:04:12,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:12,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-12 02:04:12,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:12,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-12 02:04:12,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-12 02:04:12,392 INFO L87 Difference]: Start difference. First operand 159 states and 229 transitions. Second operand has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:04:12,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:12,907 INFO L93 Difference]: Finished difference Result 394 states and 564 transitions. [2023-11-12 02:04:12,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-12 02:04:12,908 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-12 02:04:12,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:04:12,910 INFO L225 Difference]: With dead ends: 394 [2023-11-12 02:04:12,910 INFO L226 Difference]: Without dead ends: 238 [2023-11-12 02:04:12,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2023-11-12 02:04:12,912 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 296 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:04:12,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 719 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:04:12,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2023-11-12 02:04:12,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 159. [2023-11-12 02:04:12,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 132 states have (on average 1.356060606060606) internal successors, (179), 132 states have internal predecessors, (179), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-12 02:04:12,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 229 transitions. [2023-11-12 02:04:12,947 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 229 transitions. Word has length 190 [2023-11-12 02:04:12,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:04:12,951 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 229 transitions. [2023-11-12 02:04:12,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.5) internal successors, (68), 8 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:04:12,952 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 229 transitions. [2023-11-12 02:04:12,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-12 02:04:12,956 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:12,956 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:12,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-12 02:04:12,957 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:12,957 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:12,957 INFO L85 PathProgramCache]: Analyzing trace with hash 973888133, now seen corresponding path program 1 times [2023-11-12 02:04:12,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:12,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958883113] [2023-11-12 02:04:12,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:12,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:04:13,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:04:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2023-11-12 02:04:16,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-12 02:04:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2023-11-12 02:04:16,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2023-11-12 02:04:16,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2023-11-12 02:04:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-12 02:04:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2023-11-12 02:04:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2023-11-12 02:04:16,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-12 02:04:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-12 02:04:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-12 02:04:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-12 02:04:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2023-11-12 02:04:16,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2023-11-12 02:04:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:04:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:04:16,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:04:16,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:04:16,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:04:16,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-12 02:04:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2023-11-12 02:04:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-12 02:04:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-12 02:04:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-12 02:04:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:04:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2023-11-12 02:04:16,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:04:16,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958883113] [2023-11-12 02:04:16,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958883113] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:04:16,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:04:16,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-12 02:04:16,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299210346] [2023-11-12 02:04:16,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:04:16,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-12 02:04:16,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:04:16,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-12 02:04:16,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2023-11-12 02:04:16,432 INFO L87 Difference]: Start difference. First operand 159 states and 229 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:04:18,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:04:18,859 INFO L93 Difference]: Finished difference Result 502 states and 710 transitions. [2023-11-12 02:04:18,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-12 02:04:18,860 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) Word has length 190 [2023-11-12 02:04:18,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:04:18,863 INFO L225 Difference]: With dead ends: 502 [2023-11-12 02:04:18,863 INFO L226 Difference]: Without dead ends: 346 [2023-11-12 02:04:18,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2023-11-12 02:04:18,865 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 544 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:04:18,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1030 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-11-12 02:04:18,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2023-11-12 02:04:18,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 160. [2023-11-12 02:04:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 133 states have (on average 1.3609022556390977) internal successors, (181), 133 states have internal predecessors, (181), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2023-11-12 02:04:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 231 transitions. [2023-11-12 02:04:18,891 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 231 transitions. Word has length 190 [2023-11-12 02:04:18,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:04:18,891 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 231 transitions. [2023-11-12 02:04:18,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 1 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 1 states have call successors, (25) [2023-11-12 02:04:18,892 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 231 transitions. [2023-11-12 02:04:18,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2023-11-12 02:04:18,894 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:04:18,895 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:04:18,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-12 02:04:18,895 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:04:18,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:04:18,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1361719900, now seen corresponding path program 1 times [2023-11-12 02:04:18,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:04:18,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048207185] [2023-11-12 02:04:18,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:04:18,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms