./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB --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 64bit --witnessprinter.graph.data.programhash 8026e8fad442d359c5ad25f6b8e6c64a8eb4f5fda678822051ba0bded2a5b47e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:09:32,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:09:32,094 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-27 20:09:32,100 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:09:32,100 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:09:32,138 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:09:32,139 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:09:32,139 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:09:32,139 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:09:32,140 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:09:32,140 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:09:32,140 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:09:32,141 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:09:32,142 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:09:32,142 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:09:32,143 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:09:32,143 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:09:32,143 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:09:32,143 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:09:32,143 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:09:32,143 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:09:32,143 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:09:32,144 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:09:32,144 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:09:32,144 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:09:32,144 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:09:32,144 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:09:32,144 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:09:32,144 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:09:32,144 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:09:32,145 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:09:32,145 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:09:32,145 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:09:32,145 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:09:32,145 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:09:32,145 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:09:32,146 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:09:32,146 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:09:32,146 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:09:32,146 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:09:32,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:09:32,146 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:09:32,146 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:09:32,146 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:09:32,147 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:09:32,147 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8026e8fad442d359c5ad25f6b8e6c64a8eb4f5fda678822051ba0bded2a5b47e [2024-11-27 20:09:32,428 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:09:32,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:09:32,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:09:32,440 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:09:32,441 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:09:32,442 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c [2024-11-27 20:09:35,415 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/data/970f65b5e/d1ee9a8c2b184d34b28de5c63a8cf648/FLAG663a9d73e [2024-11-27 20:09:35,804 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:09:35,805 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c [2024-11-27 20:09:35,822 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/data/970f65b5e/d1ee9a8c2b184d34b28de5c63a8cf648/FLAG663a9d73e [2024-11-27 20:09:35,837 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/data/970f65b5e/d1ee9a8c2b184d34b28de5c63a8cf648 [2024-11-27 20:09:35,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:09:35,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:09:35,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:09:35,843 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:09:35,847 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:09:35,848 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:09:35" (1/1) ... [2024-11-27 20:09:35,849 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@523f81dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:35, skipping insertion in model container [2024-11-27 20:09:35,849 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:09:35" (1/1) ... [2024-11-27 20:09:35,911 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:09:36,136 WARN L250 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_48ad991a-e05c-4675-91bc-47fb318e8564/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c[1257,1270] [2024-11-27 20:09:36,620 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:09:36,630 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:09:36,641 WARN L250 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_48ad991a-e05c-4675-91bc-47fb318e8564/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c[1257,1270] [2024-11-27 20:09:36,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:09:36,973 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:09:36,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:36 WrapperNode [2024-11-27 20:09:36,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:09:36,975 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:09:36,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:09:36,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:09:36,988 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:36" (1/1) ... [2024-11-27 20:09:37,045 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:36" (1/1) ... [2024-11-27 20:09:37,587 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3696 [2024-11-27 20:09:37,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:09:37,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:09:37,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:09:37,594 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:09:37,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:36" (1/1) ... [2024-11-27 20:09:37,613 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:36" (1/1) ... [2024-11-27 20:09:37,719 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:36" (1/1) ... [2024-11-27 20:09:37,865 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-27 20:09:37,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:36" (1/1) ... [2024-11-27 20:09:37,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:36" (1/1) ... [2024-11-27 20:09:38,056 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:36" (1/1) ... [2024-11-27 20:09:38,089 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:36" (1/1) ... [2024-11-27 20:09:38,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:36" (1/1) ... [2024-11-27 20:09:38,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:36" (1/1) ... [2024-11-27 20:09:38,194 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:36" (1/1) ... [2024-11-27 20:09:38,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:09:38,288 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:09:38,289 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:09:38,289 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:09:38,290 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:36" (1/1) ... [2024-11-27 20:09:38,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:09:38,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:09:38,325 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:09:38,329 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:09:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:09:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 20:09:38,354 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:09:38,354 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:09:38,852 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:09:38,854 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:09:43,465 INFO L? ?]: Removed 2341 outVars from TransFormulas that were not future-live. [2024-11-27 20:09:43,465 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:09:43,525 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:09:43,525 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-27 20:09:43,525 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:09:43 BoogieIcfgContainer [2024-11-27 20:09:43,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:09:43,528 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:09:43,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:09:43,534 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:09:43,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:09:35" (1/3) ... [2024-11-27 20:09:43,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36debbb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:09:43, skipping insertion in model container [2024-11-27 20:09:43,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:09:36" (2/3) ... [2024-11-27 20:09:43,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36debbb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:09:43, skipping insertion in model container [2024-11-27 20:09:43,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:09:43" (3/3) ... [2024-11-27 20:09:43,537 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_two_p2.c [2024-11-27 20:09:43,554 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:09:43,556 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_two_p2.c that has 1 procedures, 1041 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 20:09:43,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:09:43,687 INFO L333 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, 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;@1ef4fadd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:09:43,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 20:09:43,698 INFO L276 IsEmpty]: Start isEmpty. Operand has 1041 states, 1039 states have (on average 1.5024061597690086) internal successors, (1561), 1040 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:43,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-11-27 20:09:43,717 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:43,718 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:43,719 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:43,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:43,725 INFO L85 PathProgramCache]: Analyzing trace with hash -374697008, now seen corresponding path program 1 times [2024-11-27 20:09:43,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:43,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124157567] [2024-11-27 20:09:43,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:43,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:44,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:09:46,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:46,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124157567] [2024-11-27 20:09:46,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124157567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:46,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:46,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:09:46,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313033595] [2024-11-27 20:09:46,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:46,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:09:46,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:46,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:09:46,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:09:46,761 INFO L87 Difference]: Start difference. First operand has 1041 states, 1039 states have (on average 1.5024061597690086) internal successors, (1561), 1040 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:46,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:46,954 INFO L93 Difference]: Finished difference Result 2039 states and 3061 transitions. [2024-11-27 20:09:46,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:09:46,956 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 155 [2024-11-27 20:09:46,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:46,971 INFO L225 Difference]: With dead ends: 2039 [2024-11-27 20:09:46,971 INFO L226 Difference]: Without dead ends: 1040 [2024-11-27 20:09:46,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:09:46,979 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 0 mSDsluCounter, 3104 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4659 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:46,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4659 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:09:46,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1040 states. [2024-11-27 20:09:47,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1040 to 1040. [2024-11-27 20:09:47,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1040 states, 1039 states have (on average 1.5004812319538017) internal successors, (1559), 1039 states have internal predecessors, (1559), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1559 transitions. [2024-11-27 20:09:47,093 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1559 transitions. Word has length 155 [2024-11-27 20:09:47,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:47,094 INFO L471 AbstractCegarLoop]: Abstraction has 1040 states and 1559 transitions. [2024-11-27 20:09:47,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:47,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1559 transitions. [2024-11-27 20:09:47,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-27 20:09:47,101 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:47,101 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:47,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:09:47,102 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:47,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:47,102 INFO L85 PathProgramCache]: Analyzing trace with hash 1270990803, now seen corresponding path program 1 times [2024-11-27 20:09:47,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:47,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818789487] [2024-11-27 20:09:47,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:47,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:48,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:09:48,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:48,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818789487] [2024-11-27 20:09:48,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818789487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:48,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:48,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:09:48,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486152301] [2024-11-27 20:09:48,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:48,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:09:48,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:48,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:09:48,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:09:48,254 INFO L87 Difference]: Start difference. First operand 1040 states and 1559 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:48,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:48,353 INFO L93 Difference]: Finished difference Result 2040 states and 3059 transitions. [2024-11-27 20:09:48,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:09:48,354 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2024-11-27 20:09:48,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:48,362 INFO L225 Difference]: With dead ends: 2040 [2024-11-27 20:09:48,362 INFO L226 Difference]: Without dead ends: 1042 [2024-11-27 20:09:48,365 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:09:48,370 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 0 mSDsluCounter, 3100 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4655 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:48,370 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4655 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:09:48,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1042 states. [2024-11-27 20:09:48,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1042 to 1042. [2024-11-27 20:09:48,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 1041 states have (on average 1.4995196926032661) internal successors, (1561), 1041 states have internal predecessors, (1561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:48,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1561 transitions. [2024-11-27 20:09:48,422 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1561 transitions. Word has length 156 [2024-11-27 20:09:48,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:48,422 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1561 transitions. [2024-11-27 20:09:48,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:48,423 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1561 transitions. [2024-11-27 20:09:48,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2024-11-27 20:09:48,429 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:48,429 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:48,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:09:48,430 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:48,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:48,430 INFO L85 PathProgramCache]: Analyzing trace with hash -351955703, now seen corresponding path program 1 times [2024-11-27 20:09:48,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:48,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916818922] [2024-11-27 20:09:48,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:48,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:09:53,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:09:57,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:09:57,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:09:57,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916818922] [2024-11-27 20:09:57,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916818922] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:09:57,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:09:57,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:09:57,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622515833] [2024-11-27 20:09:57,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:09:57,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:09:57,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:09:57,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:09:57,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:09:57,571 INFO L87 Difference]: Start difference. First operand 1042 states and 1561 transitions. Second operand has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:58,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:09:58,584 INFO L93 Difference]: Finished difference Result 2802 states and 4199 transitions. [2024-11-27 20:09:58,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:09:58,585 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2024-11-27 20:09:58,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:09:58,592 INFO L225 Difference]: With dead ends: 2802 [2024-11-27 20:09:58,592 INFO L226 Difference]: Without dead ends: 1802 [2024-11-27 20:09:58,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:09:58,595 INFO L435 NwaCegarLoop]: 1388 mSDtfsCounter, 1107 mSDsluCounter, 4147 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1107 SdHoareTripleChecker+Valid, 5535 SdHoareTripleChecker+Invalid, 632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-27 20:09:58,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1107 Valid, 5535 Invalid, 632 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 632 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-27 20:09:58,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2024-11-27 20:09:58,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1183. [2024-11-27 20:09:58,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.5) internal successors, (1773), 1182 states have internal predecessors, (1773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:58,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1773 transitions. [2024-11-27 20:09:58,635 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1773 transitions. Word has length 157 [2024-11-27 20:09:58,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:09:58,636 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1773 transitions. [2024-11-27 20:09:58,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.4) internal successors, (157), 5 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:09:58,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1773 transitions. [2024-11-27 20:09:58,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-27 20:09:58,638 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:09:58,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:09:58,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 20:09:58,639 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:09:58,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:09:58,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1848655630, now seen corresponding path program 1 times [2024-11-27 20:09:58,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:09:58,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301350873] [2024-11-27 20:09:58,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:09:58,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:10:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:04,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:10:04,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:10:04,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301350873] [2024-11-27 20:10:04,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301350873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:10:04,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:10:04,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:10:04,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773261860] [2024-11-27 20:10:04,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:10:04,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:10:04,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:10:04,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:10:04,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:10:04,645 INFO L87 Difference]: Start difference. First operand 1183 states and 1773 transitions. Second operand has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:05,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:10:05,590 INFO L93 Difference]: Finished difference Result 2802 states and 4198 transitions. [2024-11-27 20:10:05,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:10:05,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 158 [2024-11-27 20:10:05,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:10:05,600 INFO L225 Difference]: With dead ends: 2802 [2024-11-27 20:10:05,600 INFO L226 Difference]: Without dead ends: 1802 [2024-11-27 20:10:05,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:10:05,604 INFO L435 NwaCegarLoop]: 1389 mSDtfsCounter, 1105 mSDsluCounter, 4147 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1105 SdHoareTripleChecker+Valid, 5536 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:10:05,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1105 Valid, 5536 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 631 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-27 20:10:05,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1802 states. [2024-11-27 20:10:05,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1802 to 1184. [2024-11-27 20:10:05,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1184 states, 1183 states have (on average 1.4995773457311918) internal successors, (1774), 1183 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:05,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1184 states to 1184 states and 1774 transitions. [2024-11-27 20:10:05,654 INFO L78 Accepts]: Start accepts. Automaton has 1184 states and 1774 transitions. Word has length 158 [2024-11-27 20:10:05,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:10:05,654 INFO L471 AbstractCegarLoop]: Abstraction has 1184 states and 1774 transitions. [2024-11-27 20:10:05,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:05,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1184 states and 1774 transitions. [2024-11-27 20:10:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-11-27 20:10:05,657 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:10:05,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:10:05,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 20:10:05,658 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:10:05,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:10:05,659 INFO L85 PathProgramCache]: Analyzing trace with hash 47819398, now seen corresponding path program 1 times [2024-11-27 20:10:05,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:10:05,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911350342] [2024-11-27 20:10:05,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:10:05,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:10:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:09,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:10:09,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:10:09,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911350342] [2024-11-27 20:10:09,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911350342] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:10:09,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:10:09,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:10:09,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810756879] [2024-11-27 20:10:09,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:10:09,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:10:09,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:10:09,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:10:09,508 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:10:09,509 INFO L87 Difference]: Start difference. First operand 1184 states and 1774 transitions. Second operand has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:10,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:10:10,522 INFO L93 Difference]: Finished difference Result 2995 states and 4487 transitions. [2024-11-27 20:10:10,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:10:10,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 159 [2024-11-27 20:10:10,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:10:10,529 INFO L225 Difference]: With dead ends: 2995 [2024-11-27 20:10:10,529 INFO L226 Difference]: Without dead ends: 1995 [2024-11-27 20:10:10,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:10:10,532 INFO L435 NwaCegarLoop]: 1615 mSDtfsCounter, 1365 mSDsluCounter, 6001 mSDsCounter, 0 mSdLazyCounter, 654 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1365 SdHoareTripleChecker+Valid, 7616 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 654 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-27 20:10:10,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1365 Valid, 7616 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 654 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-27 20:10:10,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2024-11-27 20:10:10,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1204. [2024-11-27 20:10:10,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1203 states have (on average 1.4987531172069826) internal successors, (1803), 1203 states have internal predecessors, (1803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:10,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1803 transitions. [2024-11-27 20:10:10,569 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1803 transitions. Word has length 159 [2024-11-27 20:10:10,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:10:10,569 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1803 transitions. [2024-11-27 20:10:10,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.5) internal successors, (159), 6 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:10,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1803 transitions. [2024-11-27 20:10:10,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-27 20:10:10,571 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:10:10,572 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:10:10,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 20:10:10,572 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:10:10,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:10:10,573 INFO L85 PathProgramCache]: Analyzing trace with hash -275717235, now seen corresponding path program 1 times [2024-11-27 20:10:10,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:10:10,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372076941] [2024-11-27 20:10:10,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:10:10,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:10:12,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:10:15,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:10:15,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372076941] [2024-11-27 20:10:15,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372076941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:10:15,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:10:15,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:10:15,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933443131] [2024-11-27 20:10:15,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:10:15,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:10:15,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:10:15,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:10:15,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:10:15,417 INFO L87 Difference]: Start difference. First operand 1204 states and 1803 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:16,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:10:16,098 INFO L93 Difference]: Finished difference Result 2741 states and 4104 transitions. [2024-11-27 20:10:16,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:10:16,099 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 160 [2024-11-27 20:10:16,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:10:16,106 INFO L225 Difference]: With dead ends: 2741 [2024-11-27 20:10:16,106 INFO L226 Difference]: Without dead ends: 1498 [2024-11-27 20:10:16,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:10:16,110 INFO L435 NwaCegarLoop]: 1516 mSDtfsCounter, 3299 mSDsluCounter, 4433 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3299 SdHoareTripleChecker+Valid, 5949 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:10:16,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3299 Valid, 5949 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 20:10:16,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1498 states. [2024-11-27 20:10:16,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1498 to 1204. [2024-11-27 20:10:16,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1204 states, 1203 states have (on average 1.4979218620116377) internal successors, (1802), 1203 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1204 states to 1204 states and 1802 transitions. [2024-11-27 20:10:16,147 INFO L78 Accepts]: Start accepts. Automaton has 1204 states and 1802 transitions. Word has length 160 [2024-11-27 20:10:16,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:10:16,147 INFO L471 AbstractCegarLoop]: Abstraction has 1204 states and 1802 transitions. [2024-11-27 20:10:16,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:16,148 INFO L276 IsEmpty]: Start isEmpty. Operand 1204 states and 1802 transitions. [2024-11-27 20:10:16,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-27 20:10:16,154 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:10:16,154 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:10:16,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 20:10:16,155 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:10:16,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:10:16,155 INFO L85 PathProgramCache]: Analyzing trace with hash -610417796, now seen corresponding path program 1 times [2024-11-27 20:10:16,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:10:16,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536561062] [2024-11-27 20:10:16,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:10:16,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:10:18,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:20,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:10:20,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:10:20,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536561062] [2024-11-27 20:10:20,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536561062] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:10:20,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:10:20,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:10:20,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106154063] [2024-11-27 20:10:20,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:10:20,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:10:20,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:10:20,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:10:20,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:10:20,164 INFO L87 Difference]: Start difference. First operand 1204 states and 1802 transitions. Second operand has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:21,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:10:21,074 INFO L93 Difference]: Finished difference Result 2874 states and 4303 transitions. [2024-11-27 20:10:21,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:10:21,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 161 [2024-11-27 20:10:21,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:10:21,082 INFO L225 Difference]: With dead ends: 2874 [2024-11-27 20:10:21,082 INFO L226 Difference]: Without dead ends: 1874 [2024-11-27 20:10:21,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:10:21,084 INFO L435 NwaCegarLoop]: 1392 mSDtfsCounter, 1197 mSDsluCounter, 4147 mSDsCounter, 0 mSdLazyCounter, 628 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1197 SdHoareTripleChecker+Valid, 5539 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 628 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:10:21,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1197 Valid, 5539 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 628 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-27 20:10:21,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2024-11-27 20:10:21,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1205. [2024-11-27 20:10:21,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 1204 states have (on average 1.4975083056478404) internal successors, (1803), 1204 states have internal predecessors, (1803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:21,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1803 transitions. [2024-11-27 20:10:21,121 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1803 transitions. Word has length 161 [2024-11-27 20:10:21,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:10:21,122 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1803 transitions. [2024-11-27 20:10:21,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.2) internal successors, (161), 5 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:21,122 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1803 transitions. [2024-11-27 20:10:21,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2024-11-27 20:10:21,125 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:10:21,125 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:10:21,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 20:10:21,125 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:10:21,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:10:21,126 INFO L85 PathProgramCache]: Analyzing trace with hash 854778356, now seen corresponding path program 1 times [2024-11-27 20:10:21,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:10:21,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223370528] [2024-11-27 20:10:21,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:10:21,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:10:24,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:25,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:10:25,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:10:25,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223370528] [2024-11-27 20:10:25,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223370528] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:10:25,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:10:25,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:10:25,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851778168] [2024-11-27 20:10:25,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:10:25,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:10:25,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:10:25,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:10:25,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:10:25,787 INFO L87 Difference]: Start difference. First operand 1205 states and 1803 transitions. Second operand has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:26,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:10:26,644 INFO L93 Difference]: Finished difference Result 2711 states and 4055 transitions. [2024-11-27 20:10:26,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:10:26,645 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 162 [2024-11-27 20:10:26,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:10:26,650 INFO L225 Difference]: With dead ends: 2711 [2024-11-27 20:10:26,651 INFO L226 Difference]: Without dead ends: 1580 [2024-11-27 20:10:26,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:10:26,653 INFO L435 NwaCegarLoop]: 1462 mSDtfsCounter, 819 mSDsluCounter, 5704 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 7166 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:10:26,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 7166 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-27 20:10:26,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2024-11-27 20:10:26,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1205. [2024-11-27 20:10:26,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1205 states, 1204 states have (on average 1.4966777408637875) internal successors, (1802), 1204 states have internal predecessors, (1802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:26,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1205 states to 1205 states and 1802 transitions. [2024-11-27 20:10:26,686 INFO L78 Accepts]: Start accepts. Automaton has 1205 states and 1802 transitions. Word has length 162 [2024-11-27 20:10:26,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:10:26,688 INFO L471 AbstractCegarLoop]: Abstraction has 1205 states and 1802 transitions. [2024-11-27 20:10:26,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.0) internal successors, (162), 6 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:26,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1205 states and 1802 transitions. [2024-11-27 20:10:26,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2024-11-27 20:10:26,690 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:10:26,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:10:26,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 20:10:26,690 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:10:26,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:10:26,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1997244551, now seen corresponding path program 1 times [2024-11-27 20:10:26,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:10:26,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388305724] [2024-11-27 20:10:26,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:10:26,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:10:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:29,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:10:29,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:10:29,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388305724] [2024-11-27 20:10:29,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388305724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:10:29,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:10:29,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:10:29,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109320483] [2024-11-27 20:10:29,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:10:29,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:10:29,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:10:29,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:10:29,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:10:29,459 INFO L87 Difference]: Start difference. First operand 1205 states and 1802 transitions. Second operand has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:29,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:10:29,980 INFO L93 Difference]: Finished difference Result 2356 states and 3525 transitions. [2024-11-27 20:10:29,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:10:29,981 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 163 [2024-11-27 20:10:29,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:10:29,985 INFO L225 Difference]: With dead ends: 2356 [2024-11-27 20:10:29,986 INFO L226 Difference]: Without dead ends: 1213 [2024-11-27 20:10:29,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:10:29,990 INFO L435 NwaCegarLoop]: 1398 mSDtfsCounter, 1534 mSDsluCounter, 2793 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 4191 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:10:29,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 4191 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 20:10:29,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1213 states. [2024-11-27 20:10:30,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1213 to 1209. [2024-11-27 20:10:30,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1209 states, 1208 states have (on average 1.4950331125827814) internal successors, (1806), 1208 states have internal predecessors, (1806), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:30,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1209 states to 1209 states and 1806 transitions. [2024-11-27 20:10:30,021 INFO L78 Accepts]: Start accepts. Automaton has 1209 states and 1806 transitions. Word has length 163 [2024-11-27 20:10:30,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:10:30,021 INFO L471 AbstractCegarLoop]: Abstraction has 1209 states and 1806 transitions. [2024-11-27 20:10:30,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.6) internal successors, (163), 5 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:30,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1209 states and 1806 transitions. [2024-11-27 20:10:30,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-27 20:10:30,024 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:10:30,024 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:10:30,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 20:10:30,024 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:10:30,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:10:30,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1437899551, now seen corresponding path program 1 times [2024-11-27 20:10:30,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:10:30,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750035891] [2024-11-27 20:10:30,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:10:30,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:10:32,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:34,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:10:34,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:10:34,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750035891] [2024-11-27 20:10:34,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750035891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:10:34,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:10:34,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:10:34,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34038477] [2024-11-27 20:10:34,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:10:34,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:10:34,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:10:34,347 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:10:34,347 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:10:34,347 INFO L87 Difference]: Start difference. First operand 1209 states and 1806 transitions. Second operand has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:35,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:10:35,191 INFO L93 Difference]: Finished difference Result 2818 states and 4213 transitions. [2024-11-27 20:10:35,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:10:35,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 164 [2024-11-27 20:10:35,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:10:35,198 INFO L225 Difference]: With dead ends: 2818 [2024-11-27 20:10:35,199 INFO L226 Difference]: Without dead ends: 1816 [2024-11-27 20:10:35,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:10:35,201 INFO L435 NwaCegarLoop]: 1459 mSDtfsCounter, 1075 mSDsluCounter, 5692 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1075 SdHoareTripleChecker+Valid, 7151 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-27 20:10:35,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1075 Valid, 7151 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-27 20:10:35,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1816 states. [2024-11-27 20:10:35,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1816 to 1253. [2024-11-27 20:10:35,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1252 states have (on average 1.494408945686901) internal successors, (1871), 1252 states have internal predecessors, (1871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:35,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1871 transitions. [2024-11-27 20:10:35,238 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1871 transitions. Word has length 164 [2024-11-27 20:10:35,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:10:35,238 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1871 transitions. [2024-11-27 20:10:35,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.333333333333332) internal successors, (164), 6 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:35,239 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1871 transitions. [2024-11-27 20:10:35,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-27 20:10:35,241 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:10:35,241 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:10:35,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 20:10:35,242 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:10:35,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:10:35,243 INFO L85 PathProgramCache]: Analyzing trace with hash 2071498850, now seen corresponding path program 1 times [2024-11-27 20:10:35,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:10:35,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20348292] [2024-11-27 20:10:35,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:10:35,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:10:37,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:39,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:10:39,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:10:39,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20348292] [2024-11-27 20:10:39,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20348292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:10:39,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:10:39,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:10:39,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662870341] [2024-11-27 20:10:39,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:10:39,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:10:39,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:10:39,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:10:39,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:10:39,304 INFO L87 Difference]: Start difference. First operand 1253 states and 1871 transitions. Second operand has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:40,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:10:40,036 INFO L93 Difference]: Finished difference Result 2751 states and 4110 transitions. [2024-11-27 20:10:40,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:10:40,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 165 [2024-11-27 20:10:40,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:10:40,042 INFO L225 Difference]: With dead ends: 2751 [2024-11-27 20:10:40,042 INFO L226 Difference]: Without dead ends: 1574 [2024-11-27 20:10:40,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:10:40,044 INFO L435 NwaCegarLoop]: 1399 mSDtfsCounter, 803 mSDsluCounter, 4151 mSDsCounter, 0 mSdLazyCounter, 617 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 5550 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:10:40,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 5550 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 617 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-27 20:10:40,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2024-11-27 20:10:40,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1253. [2024-11-27 20:10:40,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1253 states, 1252 states have (on average 1.4936102236421724) internal successors, (1870), 1252 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:40,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1253 states to 1253 states and 1870 transitions. [2024-11-27 20:10:40,073 INFO L78 Accepts]: Start accepts. Automaton has 1253 states and 1870 transitions. Word has length 165 [2024-11-27 20:10:40,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:10:40,073 INFO L471 AbstractCegarLoop]: Abstraction has 1253 states and 1870 transitions. [2024-11-27 20:10:40,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.0) internal successors, (165), 5 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:40,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1253 states and 1870 transitions. [2024-11-27 20:10:40,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-27 20:10:40,075 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:10:40,075 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:10:40,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 20:10:40,076 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:10:40,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:10:40,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1057666024, now seen corresponding path program 1 times [2024-11-27 20:10:40,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:10:40,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689013361] [2024-11-27 20:10:40,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:10:40,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:10:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:10:43,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:10:43,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689013361] [2024-11-27 20:10:43,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689013361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:10:43,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:10:43,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:10:43,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692927035] [2024-11-27 20:10:43,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:10:43,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:10:43,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:10:43,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:10:43,974 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:10:43,974 INFO L87 Difference]: Start difference. First operand 1253 states and 1870 transitions. Second operand has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:44,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:10:44,651 INFO L93 Difference]: Finished difference Result 2960 states and 4425 transitions. [2024-11-27 20:10:44,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:10:44,652 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 166 [2024-11-27 20:10:44,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:10:44,655 INFO L225 Difference]: With dead ends: 2960 [2024-11-27 20:10:44,656 INFO L226 Difference]: Without dead ends: 1958 [2024-11-27 20:10:44,657 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:10:44,657 INFO L435 NwaCegarLoop]: 1396 mSDtfsCounter, 1286 mSDsluCounter, 4147 mSDsCounter, 0 mSdLazyCounter, 624 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 5543 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:10:44,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 5543 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 624 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-27 20:10:44,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1958 states. [2024-11-27 20:10:44,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1958 to 1254. [2024-11-27 20:10:44,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 1.493216280925778) internal successors, (1871), 1253 states have internal predecessors, (1871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:44,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1871 transitions. [2024-11-27 20:10:44,684 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1871 transitions. Word has length 166 [2024-11-27 20:10:44,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:10:44,686 INFO L471 AbstractCegarLoop]: Abstraction has 1254 states and 1871 transitions. [2024-11-27 20:10:44,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.2) internal successors, (166), 5 states have internal predecessors, (166), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:44,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1871 transitions. [2024-11-27 20:10:44,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-27 20:10:44,689 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:10:44,689 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:10:44,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 20:10:44,690 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:10:44,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:10:44,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1950670102, now seen corresponding path program 1 times [2024-11-27 20:10:44,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:10:44,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519695205] [2024-11-27 20:10:44,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:10:44,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:10:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:49,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:10:49,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:10:49,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519695205] [2024-11-27 20:10:49,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519695205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:10:49,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:10:49,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:10:49,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399989230] [2024-11-27 20:10:49,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:10:49,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:10:49,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:10:49,036 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:10:49,036 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:10:49,039 INFO L87 Difference]: Start difference. First operand 1254 states and 1871 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:49,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:10:49,486 INFO L93 Difference]: Finished difference Result 2448 states and 3655 transitions. [2024-11-27 20:10:49,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:10:49,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2024-11-27 20:10:49,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:10:49,490 INFO L225 Difference]: With dead ends: 2448 [2024-11-27 20:10:49,490 INFO L226 Difference]: Without dead ends: 1262 [2024-11-27 20:10:49,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:10:49,492 INFO L435 NwaCegarLoop]: 1451 mSDtfsCounter, 1534 mSDsluCounter, 4349 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1534 SdHoareTripleChecker+Valid, 5800 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:10:49,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1534 Valid, 5800 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 20:10:49,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1262 states. [2024-11-27 20:10:49,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1262 to 1258. [2024-11-27 20:10:49,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.4916467780429594) internal successors, (1875), 1257 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:49,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1875 transitions. [2024-11-27 20:10:49,517 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1875 transitions. Word has length 167 [2024-11-27 20:10:49,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:10:49,518 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1875 transitions. [2024-11-27 20:10:49,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:49,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1875 transitions. [2024-11-27 20:10:49,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2024-11-27 20:10:49,520 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:10:49,521 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:10:49,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 20:10:49,521 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:10:49,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:10:49,521 INFO L85 PathProgramCache]: Analyzing trace with hash -2146320902, now seen corresponding path program 1 times [2024-11-27 20:10:49,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:10:49,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593734601] [2024-11-27 20:10:49,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:10:49,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:10:52,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:53,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:10:53,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:10:53,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593734601] [2024-11-27 20:10:53,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593734601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:10:53,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:10:53,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:10:53,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085799460] [2024-11-27 20:10:53,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:10:53,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:10:53,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:10:53,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:10:53,682 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:10:53,682 INFO L87 Difference]: Start difference. First operand 1258 states and 1875 transitions. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:54,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:10:54,265 INFO L93 Difference]: Finished difference Result 2901 states and 4327 transitions. [2024-11-27 20:10:54,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:10:54,265 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2024-11-27 20:10:54,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:10:54,269 INFO L225 Difference]: With dead ends: 2901 [2024-11-27 20:10:54,269 INFO L226 Difference]: Without dead ends: 1820 [2024-11-27 20:10:54,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:10:54,270 INFO L435 NwaCegarLoop]: 1462 mSDtfsCounter, 2162 mSDsluCounter, 4331 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2162 SdHoareTripleChecker+Valid, 5793 SdHoareTripleChecker+Invalid, 433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:10:54,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2162 Valid, 5793 Invalid, 433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 20:10:54,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1820 states. [2024-11-27 20:10:54,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1820 to 1258. [2024-11-27 20:10:54,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.49085123309467) internal successors, (1874), 1257 states have internal predecessors, (1874), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:54,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1874 transitions. [2024-11-27 20:10:54,298 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1874 transitions. Word has length 167 [2024-11-27 20:10:54,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:10:54,298 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1874 transitions. [2024-11-27 20:10:54,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:54,298 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1874 transitions. [2024-11-27 20:10:54,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2024-11-27 20:10:54,300 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:10:54,300 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:10:54,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 20:10:54,301 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:10:54,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:10:54,301 INFO L85 PathProgramCache]: Analyzing trace with hash 462857796, now seen corresponding path program 1 times [2024-11-27 20:10:54,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:10:54,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478723467] [2024-11-27 20:10:54,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:10:54,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:10:56,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:10:57,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:10:57,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:10:57,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478723467] [2024-11-27 20:10:57,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [478723467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:10:57,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:10:57,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:10:57,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167232856] [2024-11-27 20:10:57,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:10:57,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:10:57,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:10:57,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:10:57,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:10:57,472 INFO L87 Difference]: Start difference. First operand 1258 states and 1874 transitions. Second operand has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:58,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:10:58,128 INFO L93 Difference]: Finished difference Result 2891 states and 4312 transitions. [2024-11-27 20:10:58,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:10:58,129 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 168 [2024-11-27 20:10:58,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:10:58,134 INFO L225 Difference]: With dead ends: 2891 [2024-11-27 20:10:58,134 INFO L226 Difference]: Without dead ends: 1810 [2024-11-27 20:10:58,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:10:58,136 INFO L435 NwaCegarLoop]: 1398 mSDtfsCounter, 1098 mSDsluCounter, 4147 mSDsCounter, 0 mSdLazyCounter, 622 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 5545 SdHoareTripleChecker+Invalid, 622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 622 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:10:58,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 5545 Invalid, 622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 622 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-27 20:10:58,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2024-11-27 20:10:58,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1258. [2024-11-27 20:10:58,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.4900556881463802) internal successors, (1873), 1257 states have internal predecessors, (1873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:58,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1873 transitions. [2024-11-27 20:10:58,160 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1873 transitions. Word has length 168 [2024-11-27 20:10:58,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:10:58,161 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1873 transitions. [2024-11-27 20:10:58,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.6) internal successors, (168), 5 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:10:58,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1873 transitions. [2024-11-27 20:10:58,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2024-11-27 20:10:58,163 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:10:58,163 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:10:58,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 20:10:58,163 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:10:58,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:10:58,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1001569303, now seen corresponding path program 1 times [2024-11-27 20:10:58,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:10:58,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220008112] [2024-11-27 20:10:58,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:10:58,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:11:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:11:02,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:11:02,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:11:02,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220008112] [2024-11-27 20:11:02,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220008112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:11:02,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:11:02,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:11:02,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037608540] [2024-11-27 20:11:02,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:11:02,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:11:02,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:11:02,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:11:02,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:11:02,761 INFO L87 Difference]: Start difference. First operand 1258 states and 1873 transitions. Second operand has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:03,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:11:03,324 INFO L93 Difference]: Finished difference Result 2987 states and 4457 transitions. [2024-11-27 20:11:03,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:11:03,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 169 [2024-11-27 20:11:03,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:11:03,330 INFO L225 Difference]: With dead ends: 2987 [2024-11-27 20:11:03,330 INFO L226 Difference]: Without dead ends: 1972 [2024-11-27 20:11:03,332 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:11:03,332 INFO L435 NwaCegarLoop]: 1464 mSDtfsCounter, 2539 mSDsluCounter, 4330 mSDsCounter, 0 mSdLazyCounter, 429 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2539 SdHoareTripleChecker+Valid, 5794 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:11:03,332 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2539 Valid, 5794 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 429 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 20:11:03,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1972 states. [2024-11-27 20:11:03,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1972 to 1258. [2024-11-27 20:11:03,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.4892601431980907) internal successors, (1872), 1257 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1872 transitions. [2024-11-27 20:11:03,355 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1872 transitions. Word has length 169 [2024-11-27 20:11:03,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:11:03,356 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1872 transitions. [2024-11-27 20:11:03,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.166666666666668) internal successors, (169), 6 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:03,356 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1872 transitions. [2024-11-27 20:11:03,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2024-11-27 20:11:03,358 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:11:03,358 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:11:03,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-27 20:11:03,358 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:11:03,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:11:03,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1596963239, now seen corresponding path program 1 times [2024-11-27 20:11:03,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:11:03,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68462319] [2024-11-27 20:11:03,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:11:03,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:11:05,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:11:06,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:11:06,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:11:06,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68462319] [2024-11-27 20:11:06,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68462319] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:11:06,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:11:06,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:11:06,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264862419] [2024-11-27 20:11:06,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:11:06,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:11:06,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:11:06,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:11:06,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:11:06,692 INFO L87 Difference]: Start difference. First operand 1258 states and 1872 transitions. Second operand has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:07,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:11:07,370 INFO L93 Difference]: Finished difference Result 2977 states and 4442 transitions. [2024-11-27 20:11:07,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:11:07,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 170 [2024-11-27 20:11:07,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:11:07,375 INFO L225 Difference]: With dead ends: 2977 [2024-11-27 20:11:07,376 INFO L226 Difference]: Without dead ends: 1962 [2024-11-27 20:11:07,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:11:07,378 INFO L435 NwaCegarLoop]: 1400 mSDtfsCounter, 1286 mSDsluCounter, 4147 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1286 SdHoareTripleChecker+Valid, 5547 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:11:07,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1286 Valid, 5547 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-27 20:11:07,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1962 states. [2024-11-27 20:11:07,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1962 to 1258. [2024-11-27 20:11:07,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.488464598249801) internal successors, (1871), 1257 states have internal predecessors, (1871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:07,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1871 transitions. [2024-11-27 20:11:07,396 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1871 transitions. Word has length 170 [2024-11-27 20:11:07,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:11:07,397 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1871 transitions. [2024-11-27 20:11:07,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.0) internal successors, (170), 5 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:07,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1871 transitions. [2024-11-27 20:11:07,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2024-11-27 20:11:07,399 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:11:07,399 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:11:07,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-27 20:11:07,399 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:11:07,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:11:07,400 INFO L85 PathProgramCache]: Analyzing trace with hash -174873676, now seen corresponding path program 1 times [2024-11-27 20:11:07,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:11:07,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002432934] [2024-11-27 20:11:07,400 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:11:07,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:11:09,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:11:10,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:11:10,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:11:10,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002432934] [2024-11-27 20:11:10,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002432934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:11:10,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:11:10,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:11:10,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501715069] [2024-11-27 20:11:10,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:11:10,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:11:10,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:11:10,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:11:10,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:11:10,905 INFO L87 Difference]: Start difference. First operand 1258 states and 1871 transitions. Second operand has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:11:11,533 INFO L93 Difference]: Finished difference Result 2756 states and 4103 transitions. [2024-11-27 20:11:11,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:11:11,533 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2024-11-27 20:11:11,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:11:11,537 INFO L225 Difference]: With dead ends: 2756 [2024-11-27 20:11:11,537 INFO L226 Difference]: Without dead ends: 1588 [2024-11-27 20:11:11,539 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:11:11,539 INFO L435 NwaCegarLoop]: 1470 mSDtfsCounter, 802 mSDsluCounter, 5712 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 802 SdHoareTripleChecker+Valid, 7182 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:11:11,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [802 Valid, 7182 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-27 20:11:11,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1588 states. [2024-11-27 20:11:11,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1588 to 1258. [2024-11-27 20:11:11,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.4876690533015116) internal successors, (1870), 1257 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:11,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1870 transitions. [2024-11-27 20:11:11,556 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1870 transitions. Word has length 171 [2024-11-27 20:11:11,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:11:11,557 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1870 transitions. [2024-11-27 20:11:11,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.5) internal successors, (171), 6 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:11,557 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1870 transitions. [2024-11-27 20:11:11,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-27 20:11:11,558 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:11:11,558 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:11:11,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-27 20:11:11,558 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:11:11,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:11:11,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1069152960, now seen corresponding path program 1 times [2024-11-27 20:11:11,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:11:11,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354905776] [2024-11-27 20:11:11,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:11:11,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:11:13,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:11:14,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:11:14,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:11:14,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354905776] [2024-11-27 20:11:14,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354905776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:11:14,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:11:14,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:11:14,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84506436] [2024-11-27 20:11:14,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:11:14,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:11:14,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:11:14,787 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:11:14,787 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:11:14,788 INFO L87 Difference]: Start difference. First operand 1258 states and 1870 transitions. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:15,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:11:15,396 INFO L93 Difference]: Finished difference Result 2746 states and 4088 transitions. [2024-11-27 20:11:15,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:11:15,397 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 172 [2024-11-27 20:11:15,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:11:15,399 INFO L225 Difference]: With dead ends: 2746 [2024-11-27 20:11:15,399 INFO L226 Difference]: Without dead ends: 1578 [2024-11-27 20:11:15,400 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:11:15,401 INFO L435 NwaCegarLoop]: 1406 mSDtfsCounter, 788 mSDsluCounter, 4151 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 5557 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:11:15,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 5557 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 610 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-27 20:11:15,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2024-11-27 20:11:15,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1258. [2024-11-27 20:11:15,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.4868735083532219) internal successors, (1869), 1257 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:15,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1869 transitions. [2024-11-27 20:11:15,413 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1869 transitions. Word has length 172 [2024-11-27 20:11:15,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:11:15,413 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1869 transitions. [2024-11-27 20:11:15,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:15,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1869 transitions. [2024-11-27 20:11:15,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2024-11-27 20:11:15,414 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:11:15,414 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:11:15,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-27 20:11:15,415 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:11:15,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:11:15,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1601450159, now seen corresponding path program 1 times [2024-11-27 20:11:15,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:11:15,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153889997] [2024-11-27 20:11:15,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:11:15,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:11:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:11:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:11:18,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:11:18,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153889997] [2024-11-27 20:11:18,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153889997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:11:18,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:11:18,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:11:18,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381662220] [2024-11-27 20:11:18,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:11:18,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:11:18,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:11:18,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:11:18,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:11:18,581 INFO L87 Difference]: Start difference. First operand 1258 states and 1869 transitions. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:18,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:11:18,986 INFO L93 Difference]: Finished difference Result 2718 states and 4038 transitions. [2024-11-27 20:11:18,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:11:18,986 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 173 [2024-11-27 20:11:18,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:11:18,988 INFO L225 Difference]: With dead ends: 2718 [2024-11-27 20:11:18,988 INFO L226 Difference]: Without dead ends: 1506 [2024-11-27 20:11:18,989 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:11:18,990 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 2899 mSDsluCounter, 4440 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2899 SdHoareTripleChecker+Valid, 5963 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:11:18,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2899 Valid, 5963 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:11:18,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states. [2024-11-27 20:11:19,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1258. [2024-11-27 20:11:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.4860779634049324) internal successors, (1868), 1257 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:19,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1868 transitions. [2024-11-27 20:11:19,005 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1868 transitions. Word has length 173 [2024-11-27 20:11:19,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:11:19,005 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1868 transitions. [2024-11-27 20:11:19,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:19,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1868 transitions. [2024-11-27 20:11:19,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2024-11-27 20:11:19,006 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:11:19,006 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:11:19,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-27 20:11:19,007 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:11:19,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:11:19,007 INFO L85 PathProgramCache]: Analyzing trace with hash -713891049, now seen corresponding path program 1 times [2024-11-27 20:11:19,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:11:19,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524362369] [2024-11-27 20:11:19,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:11:19,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:11:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:11:22,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:11:22,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:11:22,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524362369] [2024-11-27 20:11:22,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524362369] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:11:22,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:11:22,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:11:22,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [454288301] [2024-11-27 20:11:22,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:11:22,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:11:22,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:11:22,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:11:22,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:11:22,571 INFO L87 Difference]: Start difference. First operand 1258 states and 1868 transitions. Second operand has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:23,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:11:23,052 INFO L93 Difference]: Finished difference Result 2918 states and 4348 transitions. [2024-11-27 20:11:23,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:11:23,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 174 [2024-11-27 20:11:23,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:11:23,056 INFO L225 Difference]: With dead ends: 2918 [2024-11-27 20:11:23,056 INFO L226 Difference]: Without dead ends: 1882 [2024-11-27 20:11:23,057 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:11:23,058 INFO L435 NwaCegarLoop]: 1455 mSDtfsCounter, 2298 mSDsluCounter, 4300 mSDsCounter, 0 mSdLazyCounter, 414 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2298 SdHoareTripleChecker+Valid, 5755 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 414 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:11:23,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2298 Valid, 5755 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 414 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 20:11:23,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2024-11-27 20:11:23,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1258. [2024-11-27 20:11:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.4852824184566429) internal successors, (1867), 1257 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:23,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1867 transitions. [2024-11-27 20:11:23,077 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1867 transitions. Word has length 174 [2024-11-27 20:11:23,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:11:23,078 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1867 transitions. [2024-11-27 20:11:23,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.0) internal successors, (174), 6 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:23,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1867 transitions. [2024-11-27 20:11:23,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2024-11-27 20:11:23,079 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:11:23,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:11:23,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-27 20:11:23,079 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:11:23,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:11:23,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1971246587, now seen corresponding path program 1 times [2024-11-27 20:11:23,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:11:23,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878556980] [2024-11-27 20:11:23,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:11:23,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:11:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:11:25,810 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:11:25,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:11:25,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878556980] [2024-11-27 20:11:25,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878556980] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:11:25,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:11:25,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:11:25,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258615028] [2024-11-27 20:11:25,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:11:25,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:11:25,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:11:25,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:11:25,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:11:25,812 INFO L87 Difference]: Start difference. First operand 1258 states and 1867 transitions. Second operand has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:11:26,432 INFO L93 Difference]: Finished difference Result 2918 states and 4347 transitions. [2024-11-27 20:11:26,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:11:26,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 175 [2024-11-27 20:11:26,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:11:26,437 INFO L225 Difference]: With dead ends: 2918 [2024-11-27 20:11:26,437 INFO L226 Difference]: Without dead ends: 1882 [2024-11-27 20:11:26,439 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:11:26,441 INFO L435 NwaCegarLoop]: 1405 mSDtfsCounter, 1168 mSDsluCounter, 4147 mSDsCounter, 0 mSdLazyCounter, 615 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 5552 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 615 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:11:26,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 5552 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-27 20:11:26,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1882 states. [2024-11-27 20:11:26,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1882 to 1258. [2024-11-27 20:11:26,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1258 states, 1257 states have (on average 1.4844868735083532) internal successors, (1866), 1257 states have internal predecessors, (1866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:26,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1258 states to 1258 states and 1866 transitions. [2024-11-27 20:11:26,455 INFO L78 Accepts]: Start accepts. Automaton has 1258 states and 1866 transitions. Word has length 175 [2024-11-27 20:11:26,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:11:26,456 INFO L471 AbstractCegarLoop]: Abstraction has 1258 states and 1866 transitions. [2024-11-27 20:11:26,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.0) internal successors, (175), 5 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:26,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1866 transitions. [2024-11-27 20:11:26,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2024-11-27 20:11:26,457 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:11:26,457 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:11:26,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-27 20:11:26,457 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:11:26,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:11:26,458 INFO L85 PathProgramCache]: Analyzing trace with hash 625195892, now seen corresponding path program 1 times [2024-11-27 20:11:26,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:11:26,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421862020] [2024-11-27 20:11:26,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:11:26,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:11:29,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:11:29,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:11:29,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:11:29,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421862020] [2024-11-27 20:11:29,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421862020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:11:29,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:11:29,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:11:29,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209929609] [2024-11-27 20:11:29,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:11:29,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:11:29,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:11:29,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:11:29,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:11:29,942 INFO L87 Difference]: Start difference. First operand 1258 states and 1866 transitions. Second operand has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:30,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:11:30,310 INFO L93 Difference]: Finished difference Result 2474 states and 3671 transitions. [2024-11-27 20:11:30,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:11:30,311 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 176 [2024-11-27 20:11:30,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:11:30,313 INFO L225 Difference]: With dead ends: 2474 [2024-11-27 20:11:30,313 INFO L226 Difference]: Without dead ends: 1266 [2024-11-27 20:11:30,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:11:30,315 INFO L435 NwaCegarLoop]: 1398 mSDtfsCounter, 1540 mSDsluCounter, 2793 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 4191 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:11:30,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 4191 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:11:30,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1266 states. [2024-11-27 20:11:30,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1266 to 1262. [2024-11-27 20:11:30,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1261 states have (on average 1.4829500396510706) internal successors, (1870), 1261 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:30,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1870 transitions. [2024-11-27 20:11:30,331 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1870 transitions. Word has length 176 [2024-11-27 20:11:30,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:11:30,332 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1870 transitions. [2024-11-27 20:11:30,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:30,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1870 transitions. [2024-11-27 20:11:30,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2024-11-27 20:11:30,333 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:11:30,333 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:11:30,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-27 20:11:30,333 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:11:30,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:11:30,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1207890521, now seen corresponding path program 1 times [2024-11-27 20:11:30,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:11:30,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867347078] [2024-11-27 20:11:30,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:11:30,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:11:33,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:11:34,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:11:34,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:11:34,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867347078] [2024-11-27 20:11:34,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867347078] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:11:34,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:11:34,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:11:34,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443670521] [2024-11-27 20:11:34,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:11:34,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:11:34,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:11:34,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:11:34,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:11:34,882 INFO L87 Difference]: Start difference. First operand 1262 states and 1870 transitions. Second operand has 6 states, 6 states have (on average 29.5) internal successors, (177), 6 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:35,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:11:35,508 INFO L93 Difference]: Finished difference Result 2799 states and 4158 transitions. [2024-11-27 20:11:35,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:11:35,508 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 6 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 177 [2024-11-27 20:11:35,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:11:35,511 INFO L225 Difference]: With dead ends: 2799 [2024-11-27 20:11:35,511 INFO L226 Difference]: Without dead ends: 1662 [2024-11-27 20:11:35,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:11:35,512 INFO L435 NwaCegarLoop]: 1459 mSDtfsCounter, 885 mSDsluCounter, 5683 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 7142 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:11:35,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 7142 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-27 20:11:35,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2024-11-27 20:11:35,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1262. [2024-11-27 20:11:35,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1261 states have (on average 1.4821570182394925) internal successors, (1869), 1261 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:35,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1869 transitions. [2024-11-27 20:11:35,527 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1869 transitions. Word has length 177 [2024-11-27 20:11:35,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:11:35,527 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1869 transitions. [2024-11-27 20:11:35,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.5) internal successors, (177), 6 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:35,528 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1869 transitions. [2024-11-27 20:11:35,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2024-11-27 20:11:35,529 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:11:35,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:11:35,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-27 20:11:35,529 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:11:35,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:11:35,530 INFO L85 PathProgramCache]: Analyzing trace with hash -70953686, now seen corresponding path program 1 times [2024-11-27 20:11:35,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:11:35,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466724608] [2024-11-27 20:11:35,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:11:35,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:11:37,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:11:38,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:11:38,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:11:38,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466724608] [2024-11-27 20:11:38,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466724608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:11:38,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:11:38,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:11:38,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367585753] [2024-11-27 20:11:38,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:11:38,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:11:38,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:11:38,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:11:38,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:11:38,792 INFO L87 Difference]: Start difference. First operand 1262 states and 1869 transitions. Second operand has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:39,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:11:39,396 INFO L93 Difference]: Finished difference Result 2799 states and 4157 transitions. [2024-11-27 20:11:39,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:11:39,396 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2024-11-27 20:11:39,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:11:39,399 INFO L225 Difference]: With dead ends: 2799 [2024-11-27 20:11:39,400 INFO L226 Difference]: Without dead ends: 1662 [2024-11-27 20:11:39,401 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:11:39,401 INFO L435 NwaCegarLoop]: 1409 mSDtfsCounter, 883 mSDsluCounter, 4149 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 883 SdHoareTripleChecker+Valid, 5558 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:11:39,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [883 Valid, 5558 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-27 20:11:39,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1662 states. [2024-11-27 20:11:39,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1662 to 1262. [2024-11-27 20:11:39,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1262 states, 1261 states have (on average 1.4813639968279144) internal successors, (1868), 1261 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:39,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1262 states to 1262 states and 1868 transitions. [2024-11-27 20:11:39,420 INFO L78 Accepts]: Start accepts. Automaton has 1262 states and 1868 transitions. Word has length 178 [2024-11-27 20:11:39,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:11:39,421 INFO L471 AbstractCegarLoop]: Abstraction has 1262 states and 1868 transitions. [2024-11-27 20:11:39,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:39,421 INFO L276 IsEmpty]: Start isEmpty. Operand 1262 states and 1868 transitions. [2024-11-27 20:11:39,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-27 20:11:39,422 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:11:39,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:11:39,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-27 20:11:39,422 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:11:39,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:11:39,423 INFO L85 PathProgramCache]: Analyzing trace with hash -235192604, now seen corresponding path program 1 times [2024-11-27 20:11:39,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:11:39,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301967539] [2024-11-27 20:11:39,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:11:39,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:11:43,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:11:43,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:11:43,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:11:43,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301967539] [2024-11-27 20:11:43,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301967539] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:11:43,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:11:43,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:11:43,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719074491] [2024-11-27 20:11:43,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:11:43,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:11:43,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:11:43,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:11:43,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:11:43,901 INFO L87 Difference]: Start difference. First operand 1262 states and 1868 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:44,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:11:44,306 INFO L93 Difference]: Finished difference Result 2476 states and 3667 transitions. [2024-11-27 20:11:44,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:11:44,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2024-11-27 20:11:44,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:11:44,309 INFO L225 Difference]: With dead ends: 2476 [2024-11-27 20:11:44,309 INFO L226 Difference]: Without dead ends: 1270 [2024-11-27 20:11:44,310 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:11:44,310 INFO L435 NwaCegarLoop]: 1451 mSDtfsCounter, 1540 mSDsluCounter, 4349 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 5800 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:11:44,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 5800 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:11:44,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2024-11-27 20:11:44,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 1266. [2024-11-27 20:11:44,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.4798418972332015) internal successors, (1872), 1265 states have internal predecessors, (1872), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:44,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1872 transitions. [2024-11-27 20:11:44,326 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1872 transitions. Word has length 179 [2024-11-27 20:11:44,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:11:44,326 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1872 transitions. [2024-11-27 20:11:44,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:44,326 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1872 transitions. [2024-11-27 20:11:44,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-27 20:11:44,327 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:11:44,327 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:11:44,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-27 20:11:44,328 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:11:44,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:11:44,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1678716616, now seen corresponding path program 1 times [2024-11-27 20:11:44,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:11:44,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819055148] [2024-11-27 20:11:44,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:11:44,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:11:47,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:11:48,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:11:48,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:11:48,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819055148] [2024-11-27 20:11:48,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819055148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:11:48,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:11:48,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:11:48,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984006742] [2024-11-27 20:11:48,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:11:48,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:11:48,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:11:48,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:11:48,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:11:48,748 INFO L87 Difference]: Start difference. First operand 1266 states and 1872 transitions. Second operand has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:49,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:11:49,217 INFO L93 Difference]: Finished difference Result 2856 states and 4238 transitions. [2024-11-27 20:11:49,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:11:49,217 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 179 [2024-11-27 20:11:49,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:11:49,220 INFO L225 Difference]: With dead ends: 2856 [2024-11-27 20:11:49,220 INFO L226 Difference]: Without dead ends: 1738 [2024-11-27 20:11:49,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:11:49,222 INFO L435 NwaCegarLoop]: 1461 mSDtfsCounter, 1916 mSDsluCounter, 4306 mSDsCounter, 0 mSdLazyCounter, 402 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1916 SdHoareTripleChecker+Valid, 5767 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:11:49,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1916 Valid, 5767 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 402 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 20:11:49,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2024-11-27 20:11:49,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1266. [2024-11-27 20:11:49,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.4790513833992094) internal successors, (1871), 1265 states have internal predecessors, (1871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:49,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1871 transitions. [2024-11-27 20:11:49,241 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1871 transitions. Word has length 179 [2024-11-27 20:11:49,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:11:49,241 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1871 transitions. [2024-11-27 20:11:49,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 29.833333333333332) internal successors, (179), 6 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:49,242 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1871 transitions. [2024-11-27 20:11:49,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-27 20:11:49,242 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:11:49,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:11:49,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-27 20:11:49,243 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:11:49,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:11:49,243 INFO L85 PathProgramCache]: Analyzing trace with hash 1547504801, now seen corresponding path program 1 times [2024-11-27 20:11:49,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:11:49,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026390638] [2024-11-27 20:11:49,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:11:49,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:11:51,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:11:52,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:11:52,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:11:52,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026390638] [2024-11-27 20:11:52,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026390638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:11:52,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:11:52,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:11:52,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192015353] [2024-11-27 20:11:52,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:11:52,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:11:52,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:11:52,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:11:52,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:11:52,718 INFO L87 Difference]: Start difference. First operand 1266 states and 1871 transitions. Second operand has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:11:53,322 INFO L93 Difference]: Finished difference Result 2856 states and 4237 transitions. [2024-11-27 20:11:53,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:11:53,323 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 180 [2024-11-27 20:11:53,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:11:53,325 INFO L225 Difference]: With dead ends: 2856 [2024-11-27 20:11:53,326 INFO L226 Difference]: Without dead ends: 1738 [2024-11-27 20:11:53,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:11:53,329 INFO L435 NwaCegarLoop]: 1411 mSDtfsCounter, 977 mSDsluCounter, 4149 mSDsCounter, 0 mSdLazyCounter, 607 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 977 SdHoareTripleChecker+Valid, 5560 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 607 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:11:53,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [977 Valid, 5560 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 607 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-27 20:11:53,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2024-11-27 20:11:53,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1266. [2024-11-27 20:11:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.4782608695652173) internal successors, (1870), 1265 states have internal predecessors, (1870), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1870 transitions. [2024-11-27 20:11:53,351 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1870 transitions. Word has length 180 [2024-11-27 20:11:53,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:11:53,351 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1870 transitions. [2024-11-27 20:11:53,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.0) internal successors, (180), 5 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:53,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1870 transitions. [2024-11-27 20:11:53,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-27 20:11:53,353 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:11:53,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:11:53,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-27 20:11:53,353 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:11:53,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:11:53,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1821299963, now seen corresponding path program 1 times [2024-11-27 20:11:53,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:11:53,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805992] [2024-11-27 20:11:53,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:11:53,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:11:57,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:11:58,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:11:58,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:11:58,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805992] [2024-11-27 20:11:58,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:11:58,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:11:58,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:11:58,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007955355] [2024-11-27 20:11:58,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:11:58,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:11:58,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:11:58,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:11:58,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:11:58,832 INFO L87 Difference]: Start difference. First operand 1266 states and 1870 transitions. Second operand has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:59,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:11:59,285 INFO L93 Difference]: Finished difference Result 2817 states and 4174 transitions. [2024-11-27 20:11:59,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:11:59,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 181 [2024-11-27 20:11:59,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:11:59,288 INFO L225 Difference]: With dead ends: 2817 [2024-11-27 20:11:59,288 INFO L226 Difference]: Without dead ends: 1666 [2024-11-27 20:11:59,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:11:59,289 INFO L435 NwaCegarLoop]: 1463 mSDtfsCounter, 1732 mSDsluCounter, 4308 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1732 SdHoareTripleChecker+Valid, 5771 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:11:59,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1732 Valid, 5771 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 20:11:59,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2024-11-27 20:11:59,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1266. [2024-11-27 20:11:59,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.4774703557312252) internal successors, (1869), 1265 states have internal predecessors, (1869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:59,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1869 transitions. [2024-11-27 20:11:59,304 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1869 transitions. Word has length 181 [2024-11-27 20:11:59,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:11:59,304 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1869 transitions. [2024-11-27 20:11:59,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.166666666666668) internal successors, (181), 6 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:11:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1869 transitions. [2024-11-27 20:11:59,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-27 20:11:59,305 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:11:59,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:11:59,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-27 20:11:59,305 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:11:59,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:11:59,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1899049429, now seen corresponding path program 1 times [2024-11-27 20:11:59,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:11:59,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783820028] [2024-11-27 20:11:59,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:11:59,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:12:01,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:12:02,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:12:02,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783820028] [2024-11-27 20:12:02,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783820028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:02,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:02,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:12:02,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202370320] [2024-11-27 20:12:02,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:02,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:12:02,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:12:02,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:12:02,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:12:02,860 INFO L87 Difference]: Start difference. First operand 1266 states and 1869 transitions. Second operand has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:03,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:03,465 INFO L93 Difference]: Finished difference Result 2817 states and 4173 transitions. [2024-11-27 20:12:03,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:12:03,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 182 [2024-11-27 20:12:03,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:03,468 INFO L225 Difference]: With dead ends: 2817 [2024-11-27 20:12:03,468 INFO L226 Difference]: Without dead ends: 1666 [2024-11-27 20:12:03,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:12:03,470 INFO L435 NwaCegarLoop]: 1413 mSDtfsCounter, 885 mSDsluCounter, 4149 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 5562 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:03,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 5562 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-27 20:12:03,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1666 states. [2024-11-27 20:12:03,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1666 to 1266. [2024-11-27 20:12:03,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.4766798418972331) internal successors, (1868), 1265 states have internal predecessors, (1868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:03,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1868 transitions. [2024-11-27 20:12:03,489 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1868 transitions. Word has length 182 [2024-11-27 20:12:03,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:03,489 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1868 transitions. [2024-11-27 20:12:03,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:03,490 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1868 transitions. [2024-11-27 20:12:03,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-27 20:12:03,491 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:03,491 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:03,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-27 20:12:03,491 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:12:03,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:03,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1774294434, now seen corresponding path program 1 times [2024-11-27 20:12:03,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:12:03,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569722069] [2024-11-27 20:12:03,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:03,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:12:07,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:09,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:12:09,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:12:09,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569722069] [2024-11-27 20:12:09,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569722069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:09,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:09,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:12:09,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131425364] [2024-11-27 20:12:09,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:09,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:12:09,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:12:09,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:12:09,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:12:09,277 INFO L87 Difference]: Start difference. First operand 1266 states and 1868 transitions. Second operand has 6 states, 6 states have (on average 30.5) internal successors, (183), 6 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:09,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:09,731 INFO L93 Difference]: Finished difference Result 2844 states and 4216 transitions. [2024-11-27 20:12:09,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:12:09,732 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.5) internal successors, (183), 6 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 183 [2024-11-27 20:12:09,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:09,733 INFO L225 Difference]: With dead ends: 2844 [2024-11-27 20:12:09,733 INFO L226 Difference]: Without dead ends: 1738 [2024-11-27 20:12:09,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:12:09,735 INFO L435 NwaCegarLoop]: 1465 mSDtfsCounter, 1888 mSDsluCounter, 4310 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1888 SdHoareTripleChecker+Valid, 5775 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:09,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1888 Valid, 5775 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 20:12:09,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1738 states. [2024-11-27 20:12:09,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1738 to 1266. [2024-11-27 20:12:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.475889328063241) internal successors, (1867), 1265 states have internal predecessors, (1867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1867 transitions. [2024-11-27 20:12:09,749 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1867 transitions. Word has length 183 [2024-11-27 20:12:09,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:09,749 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1867 transitions. [2024-11-27 20:12:09,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.5) internal successors, (183), 6 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:09,749 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1867 transitions. [2024-11-27 20:12:09,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-27 20:12:09,750 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:09,750 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:09,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-27 20:12:09,751 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:12:09,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:09,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1172306546, now seen corresponding path program 1 times [2024-11-27 20:12:09,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:12:09,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300763100] [2024-11-27 20:12:09,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:09,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:12:11,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:13,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:12:13,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:12:13,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300763100] [2024-11-27 20:12:13,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300763100] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:13,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:13,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:12:13,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987800422] [2024-11-27 20:12:13,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:13,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:12:13,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:12:13,688 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:12:13,688 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:12:13,688 INFO L87 Difference]: Start difference. First operand 1266 states and 1867 transitions. Second operand has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:14,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:14,310 INFO L93 Difference]: Finished difference Result 2692 states and 3987 transitions. [2024-11-27 20:12:14,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:12:14,310 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 184 [2024-11-27 20:12:14,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:14,311 INFO L225 Difference]: With dead ends: 2692 [2024-11-27 20:12:14,311 INFO L226 Difference]: Without dead ends: 1586 [2024-11-27 20:12:14,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:12:14,313 INFO L435 NwaCegarLoop]: 1417 mSDtfsCounter, 735 mSDsluCounter, 4148 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 5565 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:14,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 5565 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-27 20:12:14,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1586 states. [2024-11-27 20:12:14,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1586 to 1266. [2024-11-27 20:12:14,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.475098814229249) internal successors, (1866), 1265 states have internal predecessors, (1866), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:14,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1866 transitions. [2024-11-27 20:12:14,331 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1866 transitions. Word has length 184 [2024-11-27 20:12:14,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:14,331 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1866 transitions. [2024-11-27 20:12:14,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.8) internal successors, (184), 5 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:14,332 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1866 transitions. [2024-11-27 20:12:14,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-27 20:12:14,333 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:14,333 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:14,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-27 20:12:14,333 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:12:14,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:14,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1557056127, now seen corresponding path program 1 times [2024-11-27 20:12:14,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:12:14,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887608398] [2024-11-27 20:12:14,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:14,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:12:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:20,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:12:20,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:12:20,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887608398] [2024-11-27 20:12:20,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887608398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:20,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:20,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 20:12:20,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994015146] [2024-11-27 20:12:20,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:20,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 20:12:20,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:12:20,191 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 20:12:20,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:12:20,191 INFO L87 Difference]: Start difference. First operand 1266 states and 1866 transitions. Second operand has 9 states, 9 states have (on average 20.555555555555557) internal successors, (185), 9 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:20,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:20,391 INFO L93 Difference]: Finished difference Result 2282 states and 3386 transitions. [2024-11-27 20:12:20,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 20:12:20,392 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 20.555555555555557) internal successors, (185), 9 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 185 [2024-11-27 20:12:20,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:20,393 INFO L225 Difference]: With dead ends: 2282 [2024-11-27 20:12:20,393 INFO L226 Difference]: Without dead ends: 1274 [2024-11-27 20:12:20,394 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-27 20:12:20,395 INFO L435 NwaCegarLoop]: 1529 mSDtfsCounter, 1397 mSDsluCounter, 9150 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 10679 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:20,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 10679 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:12:20,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1274 states. [2024-11-27 20:12:20,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1274 to 1274. [2024-11-27 20:12:20,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1274 states, 1273 states have (on average 1.4736842105263157) internal successors, (1876), 1273 states have internal predecessors, (1876), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:20,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1274 states to 1274 states and 1876 transitions. [2024-11-27 20:12:20,405 INFO L78 Accepts]: Start accepts. Automaton has 1274 states and 1876 transitions. Word has length 185 [2024-11-27 20:12:20,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:20,405 INFO L471 AbstractCegarLoop]: Abstraction has 1274 states and 1876 transitions. [2024-11-27 20:12:20,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 20.555555555555557) internal successors, (185), 9 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:20,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1274 states and 1876 transitions. [2024-11-27 20:12:20,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-27 20:12:20,406 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:20,406 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:20,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-27 20:12:20,406 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:12:20,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:20,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1379412279, now seen corresponding path program 1 times [2024-11-27 20:12:20,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:12:20,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379600207] [2024-11-27 20:12:20,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:20,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:12:24,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:25,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:12:25,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:12:25,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379600207] [2024-11-27 20:12:25,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379600207] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:25,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:25,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 20:12:25,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463799706] [2024-11-27 20:12:25,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:25,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 20:12:25,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:12:25,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 20:12:25,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:12:25,345 INFO L87 Difference]: Start difference. First operand 1274 states and 1876 transitions. Second operand has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:25,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:25,527 INFO L93 Difference]: Finished difference Result 2331 states and 3455 transitions. [2024-11-27 20:12:25,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 20:12:25,528 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 186 [2024-11-27 20:12:25,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:25,529 INFO L225 Difference]: With dead ends: 2331 [2024-11-27 20:12:25,529 INFO L226 Difference]: Without dead ends: 1315 [2024-11-27 20:12:25,530 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-27 20:12:25,530 INFO L435 NwaCegarLoop]: 1544 mSDtfsCounter, 1483 mSDsluCounter, 10780 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 12324 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:25,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1483 Valid, 12324 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:12:25,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1315 states. [2024-11-27 20:12:25,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1315 to 1315. [2024-11-27 20:12:25,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1315 states, 1314 states have (on average 1.4718417047184171) internal successors, (1934), 1314 states have internal predecessors, (1934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:25,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1315 states to 1315 states and 1934 transitions. [2024-11-27 20:12:25,545 INFO L78 Accepts]: Start accepts. Automaton has 1315 states and 1934 transitions. Word has length 186 [2024-11-27 20:12:25,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:25,546 INFO L471 AbstractCegarLoop]: Abstraction has 1315 states and 1934 transitions. [2024-11-27 20:12:25,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 18.6) internal successors, (186), 10 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:25,546 INFO L276 IsEmpty]: Start isEmpty. Operand 1315 states and 1934 transitions. [2024-11-27 20:12:25,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-27 20:12:25,547 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:25,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:25,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-11-27 20:12:25,547 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:12:25,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:25,548 INFO L85 PathProgramCache]: Analyzing trace with hash -1234242160, now seen corresponding path program 1 times [2024-11-27 20:12:25,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:12:25,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045212212] [2024-11-27 20:12:25,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:25,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:12:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:31,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:12:31,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:12:31,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045212212] [2024-11-27 20:12:31,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045212212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:31,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:31,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 20:12:31,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846985463] [2024-11-27 20:12:31,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:31,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:12:31,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:12:31,481 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:12:31,481 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:12:31,482 INFO L87 Difference]: Start difference. First operand 1315 states and 1934 transitions. Second operand has 7 states, 7 states have (on average 26.571428571428573) internal successors, (186), 7 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:31,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:31,711 INFO L93 Difference]: Finished difference Result 2558 states and 3768 transitions. [2024-11-27 20:12:31,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:12:31,712 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 26.571428571428573) internal successors, (186), 7 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 186 [2024-11-27 20:12:31,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:31,713 INFO L225 Difference]: With dead ends: 2558 [2024-11-27 20:12:31,713 INFO L226 Difference]: Without dead ends: 1349 [2024-11-27 20:12:31,715 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:12:31,715 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 1545 mSDsluCounter, 4589 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 6117 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:31,715 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1545 Valid, 6117 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:12:31,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1349 states. [2024-11-27 20:12:31,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1349 to 1339. [2024-11-27 20:12:31,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1339 states, 1338 states have (on average 1.4693572496263079) internal successors, (1966), 1338 states have internal predecessors, (1966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:31,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1339 states to 1339 states and 1966 transitions. [2024-11-27 20:12:31,732 INFO L78 Accepts]: Start accepts. Automaton has 1339 states and 1966 transitions. Word has length 186 [2024-11-27 20:12:31,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:31,732 INFO L471 AbstractCegarLoop]: Abstraction has 1339 states and 1966 transitions. [2024-11-27 20:12:31,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.571428571428573) internal successors, (186), 7 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:31,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1339 states and 1966 transitions. [2024-11-27 20:12:31,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-27 20:12:31,733 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:31,734 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:31,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-11-27 20:12:31,734 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:12:31,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:31,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1712088301, now seen corresponding path program 1 times [2024-11-27 20:12:31,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:12:31,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243010259] [2024-11-27 20:12:31,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:31,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:12:35,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:12:36,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:12:36,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243010259] [2024-11-27 20:12:36,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243010259] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:36,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:36,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:12:36,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822695445] [2024-11-27 20:12:36,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:36,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:12:36,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:12:36,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:12:36,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:12:36,314 INFO L87 Difference]: Start difference. First operand 1339 states and 1966 transitions. Second operand has 8 states, 8 states have (on average 23.375) internal successors, (187), 8 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:36,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:36,429 INFO L93 Difference]: Finished difference Result 2625 states and 3863 transitions. [2024-11-27 20:12:36,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:12:36,429 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.375) internal successors, (187), 8 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 187 [2024-11-27 20:12:36,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:36,431 INFO L225 Difference]: With dead ends: 2625 [2024-11-27 20:12:36,431 INFO L226 Difference]: Without dead ends: 1409 [2024-11-27 20:12:36,431 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:12:36,432 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 31 mSDsluCounter, 9233 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 10775 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:36,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 10775 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:12:36,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2024-11-27 20:12:36,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1405. [2024-11-27 20:12:36,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1405 states, 1404 states have (on average 1.4658119658119657) internal successors, (2058), 1404 states have internal predecessors, (2058), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:36,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1405 states to 1405 states and 2058 transitions. [2024-11-27 20:12:36,448 INFO L78 Accepts]: Start accepts. Automaton has 1405 states and 2058 transitions. Word has length 187 [2024-11-27 20:12:36,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:36,448 INFO L471 AbstractCegarLoop]: Abstraction has 1405 states and 2058 transitions. [2024-11-27 20:12:36,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.375) internal successors, (187), 8 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:36,448 INFO L276 IsEmpty]: Start isEmpty. Operand 1405 states and 2058 transitions. [2024-11-27 20:12:36,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-27 20:12:36,449 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:36,449 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:36,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-11-27 20:12:36,450 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:12:36,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:36,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1897835078, now seen corresponding path program 1 times [2024-11-27 20:12:36,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:12:36,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120272125] [2024-11-27 20:12:36,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:36,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:12:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:12:37,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:12:37,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120272125] [2024-11-27 20:12:37,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120272125] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:37,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:37,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:12:37,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974454941] [2024-11-27 20:12:37,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:37,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:12:37,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:12:37,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:12:37,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:12:37,006 INFO L87 Difference]: Start difference. First operand 1405 states and 2058 transitions. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:37,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:37,051 INFO L93 Difference]: Finished difference Result 2706 states and 3974 transitions. [2024-11-27 20:12:37,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:12:37,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 187 [2024-11-27 20:12:37,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:37,053 INFO L225 Difference]: With dead ends: 2706 [2024-11-27 20:12:37,053 INFO L226 Difference]: Without dead ends: 1413 [2024-11-27 20:12:37,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:12:37,054 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 0 mSDsluCounter, 3100 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4655 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 [2024-11-27 20:12:37,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4655 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:12:37,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2024-11-27 20:12:37,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1413. [2024-11-27 20:12:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1413 states, 1412 states have (on average 1.4631728045325778) internal successors, (2066), 1412 states have internal predecessors, (2066), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:37,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1413 states to 1413 states and 2066 transitions. [2024-11-27 20:12:37,072 INFO L78 Accepts]: Start accepts. Automaton has 1413 states and 2066 transitions. Word has length 187 [2024-11-27 20:12:37,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:37,073 INFO L471 AbstractCegarLoop]: Abstraction has 1413 states and 2066 transitions. [2024-11-27 20:12:37,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:37,073 INFO L276 IsEmpty]: Start isEmpty. Operand 1413 states and 2066 transitions. [2024-11-27 20:12:37,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-27 20:12:37,074 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:37,074 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:37,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-11-27 20:12:37,074 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:12:37,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:37,075 INFO L85 PathProgramCache]: Analyzing trace with hash 847353271, now seen corresponding path program 1 times [2024-11-27 20:12:37,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:12:37,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187639170] [2024-11-27 20:12:37,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:37,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:12:37,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:37,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:12:37,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:12:37,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187639170] [2024-11-27 20:12:37,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187639170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:37,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:37,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:12:37,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719995239] [2024-11-27 20:12:37,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:37,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:12:37,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:12:37,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:12:37,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:12:37,800 INFO L87 Difference]: Start difference. First operand 1413 states and 2066 transitions. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:37,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:37,940 INFO L93 Difference]: Finished difference Result 2728 states and 3998 transitions. [2024-11-27 20:12:37,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:12:37,941 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 187 [2024-11-27 20:12:37,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:37,942 INFO L225 Difference]: With dead ends: 2728 [2024-11-27 20:12:37,942 INFO L226 Difference]: Without dead ends: 1417 [2024-11-27 20:12:37,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:12:37,944 INFO L435 NwaCegarLoop]: 1555 mSDtfsCounter, 0 mSDsluCounter, 4574 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6129 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:37,944 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6129 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:12:37,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2024-11-27 20:12:37,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 1417. [2024-11-27 20:12:37,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1417 states, 1416 states have (on average 1.4618644067796611) internal successors, (2070), 1416 states have internal predecessors, (2070), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:37,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 2070 transitions. [2024-11-27 20:12:37,956 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 2070 transitions. Word has length 187 [2024-11-27 20:12:37,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:37,956 INFO L471 AbstractCegarLoop]: Abstraction has 1417 states and 2070 transitions. [2024-11-27 20:12:37,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:37,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 2070 transitions. [2024-11-27 20:12:37,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-27 20:12:37,957 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:37,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:37,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-11-27 20:12:37,958 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:12:37,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:37,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1875283448, now seen corresponding path program 1 times [2024-11-27 20:12:37,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:12:37,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618527788] [2024-11-27 20:12:37,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:37,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:12:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:12:38,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:12:38,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618527788] [2024-11-27 20:12:38,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618527788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:38,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:38,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:12:38,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895669222] [2024-11-27 20:12:38,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:38,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:12:38,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:12:38,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:12:38,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:12:38,553 INFO L87 Difference]: Start difference. First operand 1417 states and 2070 transitions. Second operand has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:38,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:38,627 INFO L93 Difference]: Finished difference Result 2672 states and 3923 transitions. [2024-11-27 20:12:38,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:12:38,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2024-11-27 20:12:38,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:38,629 INFO L225 Difference]: With dead ends: 2672 [2024-11-27 20:12:38,629 INFO L226 Difference]: Without dead ends: 1483 [2024-11-27 20:12:38,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:12:38,630 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 29 mSDsluCounter, 6171 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 7717 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:38,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 7717 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:12:38,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2024-11-27 20:12:38,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1477. [2024-11-27 20:12:38,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1477 states, 1476 states have (on average 1.4593495934959348) internal successors, (2154), 1476 states have internal predecessors, (2154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:38,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1477 states to 1477 states and 2154 transitions. [2024-11-27 20:12:38,647 INFO L78 Accepts]: Start accepts. Automaton has 1477 states and 2154 transitions. Word has length 188 [2024-11-27 20:12:38,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:38,648 INFO L471 AbstractCegarLoop]: Abstraction has 1477 states and 2154 transitions. [2024-11-27 20:12:38,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:38,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1477 states and 2154 transitions. [2024-11-27 20:12:38,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-27 20:12:38,649 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:38,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:38,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2024-11-27 20:12:38,649 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:12:38,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:38,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1431941427, now seen corresponding path program 1 times [2024-11-27 20:12:38,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:12:38,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660244089] [2024-11-27 20:12:38,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:38,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:12:42,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:42,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:12:42,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:12:42,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660244089] [2024-11-27 20:12:42,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660244089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:42,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:42,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:12:42,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601227647] [2024-11-27 20:12:42,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:42,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:12:42,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:12:42,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:12:42,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:12:42,906 INFO L87 Difference]: Start difference. First operand 1477 states and 2154 transitions. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:42,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:42,991 INFO L93 Difference]: Finished difference Result 2804 states and 4106 transitions. [2024-11-27 20:12:42,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:12:42,992 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2024-11-27 20:12:42,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:42,993 INFO L225 Difference]: With dead ends: 2804 [2024-11-27 20:12:42,993 INFO L226 Difference]: Without dead ends: 1483 [2024-11-27 20:12:42,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:12:42,994 INFO L435 NwaCegarLoop]: 1535 mSDtfsCounter, 1504 mSDsluCounter, 3061 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 4596 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:42,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 4596 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:12:42,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1483 states. [2024-11-27 20:12:43,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1483 to 1483. [2024-11-27 20:12:43,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1483 states, 1482 states have (on average 1.4588394062078271) internal successors, (2162), 1482 states have internal predecessors, (2162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:43,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1483 states to 1483 states and 2162 transitions. [2024-11-27 20:12:43,004 INFO L78 Accepts]: Start accepts. Automaton has 1483 states and 2162 transitions. Word has length 188 [2024-11-27 20:12:43,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:43,004 INFO L471 AbstractCegarLoop]: Abstraction has 1483 states and 2162 transitions. [2024-11-27 20:12:43,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:43,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1483 states and 2162 transitions. [2024-11-27 20:12:43,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-27 20:12:43,005 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:43,006 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:43,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2024-11-27 20:12:43,006 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:12:43,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:43,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1872338007, now seen corresponding path program 1 times [2024-11-27 20:12:43,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:12:43,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576615693] [2024-11-27 20:12:43,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:43,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:12:47,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:47,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:12:47,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:12:47,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576615693] [2024-11-27 20:12:47,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576615693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:47,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:47,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:12:47,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477718725] [2024-11-27 20:12:47,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:47,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:12:47,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:12:47,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:12:47,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:12:47,459 INFO L87 Difference]: Start difference. First operand 1483 states and 2162 transitions. Second operand has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:47,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:47,838 INFO L93 Difference]: Finished difference Result 2855 states and 4175 transitions. [2024-11-27 20:12:47,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:12:47,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2024-11-27 20:12:47,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:47,840 INFO L225 Difference]: With dead ends: 2855 [2024-11-27 20:12:47,840 INFO L226 Difference]: Without dead ends: 1495 [2024-11-27 20:12:47,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:12:47,842 INFO L435 NwaCegarLoop]: 1452 mSDtfsCounter, 1510 mSDsluCounter, 4350 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1510 SdHoareTripleChecker+Valid, 5802 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:47,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1510 Valid, 5802 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:12:47,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states. [2024-11-27 20:12:47,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1493. [2024-11-27 20:12:47,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1493 states, 1492 states have (on average 1.4584450402144773) internal successors, (2176), 1492 states have internal predecessors, (2176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:47,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1493 states to 1493 states and 2176 transitions. [2024-11-27 20:12:47,853 INFO L78 Accepts]: Start accepts. Automaton has 1493 states and 2176 transitions. Word has length 188 [2024-11-27 20:12:47,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:47,853 INFO L471 AbstractCegarLoop]: Abstraction has 1493 states and 2176 transitions. [2024-11-27 20:12:47,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1493 states and 2176 transitions. [2024-11-27 20:12:47,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-27 20:12:47,854 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:47,854 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:47,854 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2024-11-27 20:12:47,854 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:12:47,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:47,855 INFO L85 PathProgramCache]: Analyzing trace with hash 2093355895, now seen corresponding path program 1 times [2024-11-27 20:12:47,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:12:47,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944085004] [2024-11-27 20:12:47,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:47,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:12:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:51,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:12:51,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:12:51,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944085004] [2024-11-27 20:12:51,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944085004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:51,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:51,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:12:51,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608196931] [2024-11-27 20:12:51,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:51,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:12:51,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:12:51,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:12:51,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:12:51,598 INFO L87 Difference]: Start difference. First operand 1493 states and 2176 transitions. Second operand has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:51,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:51,939 INFO L93 Difference]: Finished difference Result 2886 states and 4216 transitions. [2024-11-27 20:12:51,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:12:51,940 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 188 [2024-11-27 20:12:51,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:51,941 INFO L225 Difference]: With dead ends: 2886 [2024-11-27 20:12:51,941 INFO L226 Difference]: Without dead ends: 1501 [2024-11-27 20:12:51,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:12:51,943 INFO L435 NwaCegarLoop]: 1452 mSDtfsCounter, 1518 mSDsluCounter, 4350 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1518 SdHoareTripleChecker+Valid, 5802 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:51,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1518 Valid, 5802 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:12:51,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2024-11-27 20:12:51,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1499. [2024-11-27 20:12:51,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1499 states, 1498 states have (on average 1.4579439252336448) internal successors, (2184), 1498 states have internal predecessors, (2184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:51,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1499 states to 1499 states and 2184 transitions. [2024-11-27 20:12:51,957 INFO L78 Accepts]: Start accepts. Automaton has 1499 states and 2184 transitions. Word has length 188 [2024-11-27 20:12:51,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:51,957 INFO L471 AbstractCegarLoop]: Abstraction has 1499 states and 2184 transitions. [2024-11-27 20:12:51,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:51,957 INFO L276 IsEmpty]: Start isEmpty. Operand 1499 states and 2184 transitions. [2024-11-27 20:12:51,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-27 20:12:51,958 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:51,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:51,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2024-11-27 20:12:51,959 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:12:51,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:51,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1248705730, now seen corresponding path program 1 times [2024-11-27 20:12:51,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:12:51,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84613627] [2024-11-27 20:12:51,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:51,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:12:52,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:52,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:12:52,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:12:52,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84613627] [2024-11-27 20:12:52,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84613627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:52,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:52,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:12:52,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991961631] [2024-11-27 20:12:52,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:52,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:12:52,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:12:52,478 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:12:52,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:12:52,479 INFO L87 Difference]: Start difference. First operand 1499 states and 2184 transitions. Second operand has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:52,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:52,555 INFO L93 Difference]: Finished difference Result 2762 states and 4050 transitions. [2024-11-27 20:12:52,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:12:52,556 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 189 [2024-11-27 20:12:52,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:52,557 INFO L225 Difference]: With dead ends: 2762 [2024-11-27 20:12:52,557 INFO L226 Difference]: Without dead ends: 1565 [2024-11-27 20:12:52,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:12:52,558 INFO L435 NwaCegarLoop]: 1546 mSDtfsCounter, 29 mSDsluCounter, 6171 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 7717 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:52,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 7717 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:12:52,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1565 states. [2024-11-27 20:12:52,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1565 to 1559. [2024-11-27 20:12:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1558 states have (on average 1.4557124518613607) internal successors, (2268), 1558 states have internal predecessors, (2268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2268 transitions. [2024-11-27 20:12:52,576 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2268 transitions. Word has length 189 [2024-11-27 20:12:52,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:52,577 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2268 transitions. [2024-11-27 20:12:52,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2268 transitions. [2024-11-27 20:12:52,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-27 20:12:52,578 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:52,578 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:52,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2024-11-27 20:12:52,578 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:12:52,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:52,579 INFO L85 PathProgramCache]: Analyzing trace with hash -326858222, now seen corresponding path program 1 times [2024-11-27 20:12:52,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:12:52,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [884297256] [2024-11-27 20:12:52,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:52,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:12:56,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:12:58,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:12:58,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:12:58,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [884297256] [2024-11-27 20:12:58,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [884297256] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:12:58,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:12:58,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-27 20:12:58,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973248899] [2024-11-27 20:12:58,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:12:58,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-27 20:12:58,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:12:58,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-27 20:12:58,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-27 20:12:58,027 INFO L87 Difference]: Start difference. First operand 1559 states and 2268 transitions. Second operand has 13 states, 13 states have (on average 14.538461538461538) internal successors, (189), 13 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:58,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:12:58,301 INFO L93 Difference]: Finished difference Result 2904 states and 4246 transitions. [2024-11-27 20:12:58,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 20:12:58,301 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 14.538461538461538) internal successors, (189), 13 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 189 [2024-11-27 20:12:58,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:12:58,303 INFO L225 Difference]: With dead ends: 2904 [2024-11-27 20:12:58,303 INFO L226 Difference]: Without dead ends: 1581 [2024-11-27 20:12:58,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=194, Unknown=0, NotChecked=0, Total=240 [2024-11-27 20:12:58,305 INFO L435 NwaCegarLoop]: 1533 mSDtfsCounter, 1548 mSDsluCounter, 13774 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 15307 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:12:58,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 15307 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:12:58,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2024-11-27 20:12:58,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1571. [2024-11-27 20:12:58,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1570 states have (on average 1.4547770700636942) internal successors, (2284), 1570 states have internal predecessors, (2284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:58,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2284 transitions. [2024-11-27 20:12:58,316 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2284 transitions. Word has length 189 [2024-11-27 20:12:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:12:58,317 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2284 transitions. [2024-11-27 20:12:58,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.538461538461538) internal successors, (189), 13 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:12:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2284 transitions. [2024-11-27 20:12:58,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-27 20:12:58,317 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:12:58,318 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:12:58,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2024-11-27 20:12:58,318 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:12:58,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:12:58,318 INFO L85 PathProgramCache]: Analyzing trace with hash 2057561970, now seen corresponding path program 1 times [2024-11-27 20:12:58,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:12:58,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1990839007] [2024-11-27 20:12:58,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:12:58,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:02,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:03,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:03,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:03,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1990839007] [2024-11-27 20:13:03,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1990839007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:03,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:03,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-27 20:13:03,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775488331] [2024-11-27 20:13:03,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:03,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 20:13:03,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:03,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 20:13:03,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:13:03,735 INFO L87 Difference]: Start difference. First operand 1571 states and 2284 transitions. Second operand has 11 states, 11 states have (on average 17.181818181818183) internal successors, (189), 11 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:04,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:04,028 INFO L93 Difference]: Finished difference Result 3195 states and 4637 transitions. [2024-11-27 20:13:04,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 20:13:04,028 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 17.181818181818183) internal successors, (189), 11 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 189 [2024-11-27 20:13:04,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:04,029 INFO L225 Difference]: With dead ends: 3195 [2024-11-27 20:13:04,029 INFO L226 Difference]: Without dead ends: 1701 [2024-11-27 20:13:04,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2024-11-27 20:13:04,031 INFO L435 NwaCegarLoop]: 1541 mSDtfsCounter, 1622 mSDsluCounter, 10761 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1622 SdHoareTripleChecker+Valid, 12302 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:04,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1622 Valid, 12302 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:13:04,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2024-11-27 20:13:04,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1697. [2024-11-27 20:13:04,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1697 states, 1696 states have (on average 1.446933962264151) internal successors, (2454), 1696 states have internal predecessors, (2454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:04,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1697 states to 1697 states and 2454 transitions. [2024-11-27 20:13:04,044 INFO L78 Accepts]: Start accepts. Automaton has 1697 states and 2454 transitions. Word has length 189 [2024-11-27 20:13:04,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:04,045 INFO L471 AbstractCegarLoop]: Abstraction has 1697 states and 2454 transitions. [2024-11-27 20:13:04,045 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.181818181818183) internal successors, (189), 11 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:04,045 INFO L276 IsEmpty]: Start isEmpty. Operand 1697 states and 2454 transitions. [2024-11-27 20:13:04,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-27 20:13:04,046 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:04,046 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:04,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2024-11-27 20:13:04,047 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:04,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:04,047 INFO L85 PathProgramCache]: Analyzing trace with hash 803251779, now seen corresponding path program 1 times [2024-11-27 20:13:04,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:04,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147499550] [2024-11-27 20:13:04,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:04,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:08,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:08,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147499550] [2024-11-27 20:13:08,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147499550] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:08,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:08,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:13:08,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379496776] [2024-11-27 20:13:08,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:08,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:13:08,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:08,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:13:08,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:13:08,351 INFO L87 Difference]: Start difference. First operand 1697 states and 2454 transitions. Second operand has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:08,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:08,614 INFO L93 Difference]: Finished difference Result 3207 states and 4658 transitions. [2024-11-27 20:13:08,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:13:08,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 189 [2024-11-27 20:13:08,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:08,616 INFO L225 Difference]: With dead ends: 3207 [2024-11-27 20:13:08,616 INFO L226 Difference]: Without dead ends: 1697 [2024-11-27 20:13:08,617 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:13:08,617 INFO L435 NwaCegarLoop]: 1471 mSDtfsCounter, 1505 mSDsluCounter, 4408 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1505 SdHoareTripleChecker+Valid, 5879 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:08,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1505 Valid, 5879 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:13:08,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1697 states. [2024-11-27 20:13:08,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1697 to 1677. [2024-11-27 20:13:08,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1677 states, 1676 states have (on average 1.4451073985680192) internal successors, (2422), 1676 states have internal predecessors, (2422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:08,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1677 states to 1677 states and 2422 transitions. [2024-11-27 20:13:08,636 INFO L78 Accepts]: Start accepts. Automaton has 1677 states and 2422 transitions. Word has length 189 [2024-11-27 20:13:08,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:08,637 INFO L471 AbstractCegarLoop]: Abstraction has 1677 states and 2422 transitions. [2024-11-27 20:13:08,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:08,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1677 states and 2422 transitions. [2024-11-27 20:13:08,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-27 20:13:08,638 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:08,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:08,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2024-11-27 20:13:08,639 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:08,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:08,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1399736414, now seen corresponding path program 1 times [2024-11-27 20:13:08,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:08,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279371284] [2024-11-27 20:13:08,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:08,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:13,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:14,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:14,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:14,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279371284] [2024-11-27 20:13:14,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279371284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:14,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:14,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 20:13:14,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396652408] [2024-11-27 20:13:14,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:14,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:13:14,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:14,492 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:13:14,492 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:13:14,494 INFO L87 Difference]: Start difference. First operand 1677 states and 2422 transitions. Second operand has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:14,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:14,682 INFO L93 Difference]: Finished difference Result 3101 states and 4508 transitions. [2024-11-27 20:13:14,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:13:14,683 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 189 [2024-11-27 20:13:14,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:14,684 INFO L225 Difference]: With dead ends: 3101 [2024-11-27 20:13:14,684 INFO L226 Difference]: Without dead ends: 1745 [2024-11-27 20:13:14,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:13:14,686 INFO L435 NwaCegarLoop]: 1527 mSDtfsCounter, 1501 mSDsluCounter, 6094 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1501 SdHoareTripleChecker+Valid, 7621 SdHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:14,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1501 Valid, 7621 Invalid, 158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:13:14,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2024-11-27 20:13:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 1725. [2024-11-27 20:13:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1725 states, 1724 states have (on average 1.4419953596287702) internal successors, (2486), 1724 states have internal predecessors, (2486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:14,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 2486 transitions. [2024-11-27 20:13:14,700 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 2486 transitions. Word has length 189 [2024-11-27 20:13:14,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:14,700 INFO L471 AbstractCegarLoop]: Abstraction has 1725 states and 2486 transitions. [2024-11-27 20:13:14,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.0) internal successors, (189), 7 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:14,700 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 2486 transitions. [2024-11-27 20:13:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-27 20:13:14,701 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:14,701 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:14,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2024-11-27 20:13:14,701 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:14,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:14,701 INFO L85 PathProgramCache]: Analyzing trace with hash -225262211, now seen corresponding path program 1 times [2024-11-27 20:13:14,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:14,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372105148] [2024-11-27 20:13:14,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:14,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:18,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:18,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:18,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:18,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372105148] [2024-11-27 20:13:18,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372105148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:18,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:18,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:13:18,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219725911] [2024-11-27 20:13:18,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:18,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:13:18,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:18,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:13:18,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:13:18,937 INFO L87 Difference]: Start difference. First operand 1725 states and 2486 transitions. Second operand has 8 states, 8 states have (on average 23.75) internal successors, (190), 8 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:19,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:19,046 INFO L93 Difference]: Finished difference Result 3142 states and 4565 transitions. [2024-11-27 20:13:19,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 20:13:19,050 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.75) internal successors, (190), 8 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 190 [2024-11-27 20:13:19,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:19,051 INFO L225 Difference]: With dead ends: 3142 [2024-11-27 20:13:19,051 INFO L226 Difference]: Without dead ends: 1799 [2024-11-27 20:13:19,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:13:19,053 INFO L435 NwaCegarLoop]: 1585 mSDtfsCounter, 30 mSDsluCounter, 9445 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 11030 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:19,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 11030 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:13:19,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2024-11-27 20:13:19,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1735. [2024-11-27 20:13:19,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1735 states, 1734 states have (on average 1.4405997693194925) internal successors, (2498), 1734 states have internal predecessors, (2498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2498 transitions. [2024-11-27 20:13:19,095 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2498 transitions. Word has length 190 [2024-11-27 20:13:19,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:19,095 INFO L471 AbstractCegarLoop]: Abstraction has 1735 states and 2498 transitions. [2024-11-27 20:13:19,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.75) internal successors, (190), 8 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:19,095 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2498 transitions. [2024-11-27 20:13:19,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-27 20:13:19,096 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:19,096 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:19,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2024-11-27 20:13:19,096 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:19,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:19,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1831868374, now seen corresponding path program 1 times [2024-11-27 20:13:19,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:19,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958635269] [2024-11-27 20:13:19,097 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:19,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:19,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:19,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:19,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958635269] [2024-11-27 20:13:19,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958635269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:19,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:19,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:13:19,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004651706] [2024-11-27 20:13:19,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:19,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:13:19,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:19,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:13:19,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:19,607 INFO L87 Difference]: Start difference. First operand 1735 states and 2498 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:19,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:19,791 INFO L93 Difference]: Finished difference Result 3153 states and 4576 transitions. [2024-11-27 20:13:19,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:13:19,792 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 190 [2024-11-27 20:13:19,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:19,793 INFO L225 Difference]: With dead ends: 3153 [2024-11-27 20:13:19,793 INFO L226 Difference]: Without dead ends: 1751 [2024-11-27 20:13:19,794 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:19,795 INFO L435 NwaCegarLoop]: 1476 mSDtfsCounter, 1514 mSDsluCounter, 2947 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 4423 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:19,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 4423 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:13:19,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1751 states. [2024-11-27 20:13:19,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1751 to 1751. [2024-11-27 20:13:19,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1751 states, 1750 states have (on average 1.4365714285714286) internal successors, (2514), 1750 states have internal predecessors, (2514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:19,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1751 states to 1751 states and 2514 transitions. [2024-11-27 20:13:19,808 INFO L78 Accepts]: Start accepts. Automaton has 1751 states and 2514 transitions. Word has length 190 [2024-11-27 20:13:19,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:19,808 INFO L471 AbstractCegarLoop]: Abstraction has 1751 states and 2514 transitions. [2024-11-27 20:13:19,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:19,808 INFO L276 IsEmpty]: Start isEmpty. Operand 1751 states and 2514 transitions. [2024-11-27 20:13:19,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-27 20:13:19,809 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:19,809 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:19,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2024-11-27 20:13:19,810 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:19,810 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:19,810 INFO L85 PathProgramCache]: Analyzing trace with hash -24115129, now seen corresponding path program 1 times [2024-11-27 20:13:19,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:19,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634463776] [2024-11-27 20:13:19,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:19,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:20,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:20,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:20,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634463776] [2024-11-27 20:13:20,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634463776] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:20,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:20,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:13:20,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300595060] [2024-11-27 20:13:20,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:20,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:13:20,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:20,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:13:20,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:20,465 INFO L87 Difference]: Start difference. First operand 1751 states and 2514 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:20,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:20,641 INFO L93 Difference]: Finished difference Result 3197 states and 4624 transitions. [2024-11-27 20:13:20,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:13:20,642 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 190 [2024-11-27 20:13:20,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:20,643 INFO L225 Difference]: With dead ends: 3197 [2024-11-27 20:13:20,643 INFO L226 Difference]: Without dead ends: 1759 [2024-11-27 20:13:20,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:20,645 INFO L435 NwaCegarLoop]: 1476 mSDtfsCounter, 1522 mSDsluCounter, 2946 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1522 SdHoareTripleChecker+Valid, 4422 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:20,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1522 Valid, 4422 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:13:20,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1759 states. [2024-11-27 20:13:20,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1759 to 1759. [2024-11-27 20:13:20,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1759 states, 1758 states have (on average 1.434584755403868) internal successors, (2522), 1758 states have internal predecessors, (2522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:20,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1759 states to 1759 states and 2522 transitions. [2024-11-27 20:13:20,657 INFO L78 Accepts]: Start accepts. Automaton has 1759 states and 2522 transitions. Word has length 190 [2024-11-27 20:13:20,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:20,657 INFO L471 AbstractCegarLoop]: Abstraction has 1759 states and 2522 transitions. [2024-11-27 20:13:20,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:20,657 INFO L276 IsEmpty]: Start isEmpty. Operand 1759 states and 2522 transitions. [2024-11-27 20:13:20,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-27 20:13:20,658 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:20,659 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:20,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2024-11-27 20:13:20,659 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:20,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:20,659 INFO L85 PathProgramCache]: Analyzing trace with hash 285056284, now seen corresponding path program 1 times [2024-11-27 20:13:20,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:20,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631472840] [2024-11-27 20:13:20,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:20,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:24,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:26,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:26,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631472840] [2024-11-27 20:13:26,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631472840] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:26,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:26,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-27 20:13:26,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636782221] [2024-11-27 20:13:26,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:26,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 20:13:26,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:26,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 20:13:26,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:13:26,018 INFO L87 Difference]: Start difference. First operand 1759 states and 2522 transitions. Second operand has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:26,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:26,371 INFO L93 Difference]: Finished difference Result 3145 states and 4555 transitions. [2024-11-27 20:13:26,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 20:13:26,372 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 191 [2024-11-27 20:13:26,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:26,374 INFO L225 Difference]: With dead ends: 3145 [2024-11-27 20:13:26,374 INFO L226 Difference]: Without dead ends: 1851 [2024-11-27 20:13:26,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-27 20:13:26,376 INFO L435 NwaCegarLoop]: 1533 mSDtfsCounter, 1540 mSDsluCounter, 12245 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 13778 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:26,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 13778 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:13:26,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states. [2024-11-27 20:13:26,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1845. [2024-11-27 20:13:26,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1845 states, 1844 states have (on average 1.433297180043384) internal successors, (2643), 1844 states have internal predecessors, (2643), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:26,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1845 states to 1845 states and 2643 transitions. [2024-11-27 20:13:26,396 INFO L78 Accepts]: Start accepts. Automaton has 1845 states and 2643 transitions. Word has length 191 [2024-11-27 20:13:26,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:26,397 INFO L471 AbstractCegarLoop]: Abstraction has 1845 states and 2643 transitions. [2024-11-27 20:13:26,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.363636363636363) internal successors, (191), 11 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:26,397 INFO L276 IsEmpty]: Start isEmpty. Operand 1845 states and 2643 transitions. [2024-11-27 20:13:26,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-27 20:13:26,398 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:26,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:26,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2024-11-27 20:13:26,399 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:26,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:26,399 INFO L85 PathProgramCache]: Analyzing trace with hash -1679107146, now seen corresponding path program 1 times [2024-11-27 20:13:26,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:26,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032757363] [2024-11-27 20:13:26,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:26,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:28,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:28,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:28,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:28,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032757363] [2024-11-27 20:13:28,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032757363] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:28,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:28,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 20:13:28,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530050122] [2024-11-27 20:13:28,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:28,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 20:13:28,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:28,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 20:13:28,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:13:28,955 INFO L87 Difference]: Start difference. First operand 1845 states and 2643 transitions. Second operand has 10 states, 10 states have (on average 19.2) internal successors, (192), 10 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:29,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:29,236 INFO L93 Difference]: Finished difference Result 3322 states and 4807 transitions. [2024-11-27 20:13:29,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 20:13:29,236 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 19.2) internal successors, (192), 10 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2024-11-27 20:13:29,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:29,238 INFO L225 Difference]: With dead ends: 3322 [2024-11-27 20:13:29,238 INFO L226 Difference]: Without dead ends: 1913 [2024-11-27 20:13:29,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-27 20:13:29,241 INFO L435 NwaCegarLoop]: 1527 mSDtfsCounter, 1493 mSDsluCounter, 10661 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1493 SdHoareTripleChecker+Valid, 12188 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:29,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1493 Valid, 12188 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:13:29,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1913 states. [2024-11-27 20:13:29,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1913 to 1913. [2024-11-27 20:13:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1913 states, 1912 states have (on average 1.4299163179916319) internal successors, (2734), 1912 states have internal predecessors, (2734), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:29,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1913 states to 1913 states and 2734 transitions. [2024-11-27 20:13:29,264 INFO L78 Accepts]: Start accepts. Automaton has 1913 states and 2734 transitions. Word has length 192 [2024-11-27 20:13:29,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:29,264 INFO L471 AbstractCegarLoop]: Abstraction has 1913 states and 2734 transitions. [2024-11-27 20:13:29,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 19.2) internal successors, (192), 10 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:29,264 INFO L276 IsEmpty]: Start isEmpty. Operand 1913 states and 2734 transitions. [2024-11-27 20:13:29,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2024-11-27 20:13:29,266 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:29,267 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:29,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2024-11-27 20:13:29,267 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:29,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:29,267 INFO L85 PathProgramCache]: Analyzing trace with hash 2136297071, now seen corresponding path program 1 times [2024-11-27 20:13:29,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:29,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112335279] [2024-11-27 20:13:29,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:29,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:29,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:29,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:29,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:29,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112335279] [2024-11-27 20:13:29,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112335279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:29,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:29,979 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:13:29,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172931350] [2024-11-27 20:13:29,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:29,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:13:29,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:29,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:13:29,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:29,980 INFO L87 Difference]: Start difference. First operand 1913 states and 2734 transitions. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:30,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:30,100 INFO L93 Difference]: Finished difference Result 3352 states and 4838 transitions. [2024-11-27 20:13:30,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:13:30,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 192 [2024-11-27 20:13:30,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:30,102 INFO L225 Difference]: With dead ends: 3352 [2024-11-27 20:13:30,102 INFO L226 Difference]: Without dead ends: 1917 [2024-11-27 20:13:30,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:30,104 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 0 mSDsluCounter, 4572 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6126 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:30,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6126 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:13:30,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2024-11-27 20:13:30,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1917. [2024-11-27 20:13:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1917 states, 1916 states have (on average 1.42901878914405) internal successors, (2738), 1916 states have internal predecessors, (2738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1917 states to 1917 states and 2738 transitions. [2024-11-27 20:13:30,117 INFO L78 Accepts]: Start accepts. Automaton has 1917 states and 2738 transitions. Word has length 192 [2024-11-27 20:13:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:30,118 INFO L471 AbstractCegarLoop]: Abstraction has 1917 states and 2738 transitions. [2024-11-27 20:13:30,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:30,118 INFO L276 IsEmpty]: Start isEmpty. Operand 1917 states and 2738 transitions. [2024-11-27 20:13:30,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-27 20:13:30,119 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:30,119 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:30,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2024-11-27 20:13:30,119 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:30,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:30,120 INFO L85 PathProgramCache]: Analyzing trace with hash -618786739, now seen corresponding path program 1 times [2024-11-27 20:13:30,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:30,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893883421] [2024-11-27 20:13:30,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:30,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:34,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:35,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:35,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:35,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893883421] [2024-11-27 20:13:35,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893883421] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:35,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:35,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 20:13:35,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462250157] [2024-11-27 20:13:35,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:35,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 20:13:35,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:35,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 20:13:35,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:13:35,663 INFO L87 Difference]: Start difference. First operand 1917 states and 2738 transitions. Second operand has 7 states, 7 states have (on average 27.571428571428573) internal successors, (193), 7 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:35,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:35,841 INFO L93 Difference]: Finished difference Result 3327 states and 4805 transitions. [2024-11-27 20:13:35,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:13:35,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 27.571428571428573) internal successors, (193), 7 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 193 [2024-11-27 20:13:35,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:35,843 INFO L225 Difference]: With dead ends: 3327 [2024-11-27 20:13:35,843 INFO L226 Difference]: Without dead ends: 1949 [2024-11-27 20:13:35,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-27 20:13:35,844 INFO L435 NwaCegarLoop]: 1529 mSDtfsCounter, 1417 mSDsluCounter, 6101 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1417 SdHoareTripleChecker+Valid, 7630 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:35,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1417 Valid, 7630 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:13:35,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1949 states. [2024-11-27 20:13:35,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1949 to 1941. [2024-11-27 20:13:35,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1941 states, 1940 states have (on average 1.4288659793814433) internal successors, (2772), 1940 states have internal predecessors, (2772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:35,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1941 states to 1941 states and 2772 transitions. [2024-11-27 20:13:35,860 INFO L78 Accepts]: Start accepts. Automaton has 1941 states and 2772 transitions. Word has length 193 [2024-11-27 20:13:35,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:35,860 INFO L471 AbstractCegarLoop]: Abstraction has 1941 states and 2772 transitions. [2024-11-27 20:13:35,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 27.571428571428573) internal successors, (193), 7 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:35,861 INFO L276 IsEmpty]: Start isEmpty. Operand 1941 states and 2772 transitions. [2024-11-27 20:13:35,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-27 20:13:35,862 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:35,862 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:35,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2024-11-27 20:13:35,862 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:35,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:35,863 INFO L85 PathProgramCache]: Analyzing trace with hash -473616620, now seen corresponding path program 1 times [2024-11-27 20:13:35,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:35,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253229559] [2024-11-27 20:13:35,863 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:35,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:36,344 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:36,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:36,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253229559] [2024-11-27 20:13:36,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253229559] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:36,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:36,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:13:36,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593391138] [2024-11-27 20:13:36,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:36,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:13:36,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:36,346 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:13:36,346 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:13:36,346 INFO L87 Difference]: Start difference. First operand 1941 states and 2772 transitions. Second operand has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:36,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:36,414 INFO L93 Difference]: Finished difference Result 3394 states and 4902 transitions. [2024-11-27 20:13:36,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:13:36,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 193 [2024-11-27 20:13:36,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:36,416 INFO L225 Difference]: With dead ends: 3394 [2024-11-27 20:13:36,416 INFO L226 Difference]: Without dead ends: 1992 [2024-11-27 20:13:36,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:13:36,417 INFO L435 NwaCegarLoop]: 1545 mSDtfsCounter, 32 mSDsluCounter, 6167 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 7712 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:36,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 7712 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:13:36,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1992 states. [2024-11-27 20:13:36,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1992 to 1988. [2024-11-27 20:13:36,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1988 states, 1987 states have (on average 1.4287871162556618) internal successors, (2839), 1987 states have internal predecessors, (2839), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:36,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1988 states to 1988 states and 2839 transitions. [2024-11-27 20:13:36,435 INFO L78 Accepts]: Start accepts. Automaton has 1988 states and 2839 transitions. Word has length 193 [2024-11-27 20:13:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:36,435 INFO L471 AbstractCegarLoop]: Abstraction has 1988 states and 2839 transitions. [2024-11-27 20:13:36,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:36,435 INFO L276 IsEmpty]: Start isEmpty. Operand 1988 states and 2839 transitions. [2024-11-27 20:13:36,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-27 20:13:36,437 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:36,437 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:36,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2024-11-27 20:13:36,437 INFO L396 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:36,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:36,437 INFO L85 PathProgramCache]: Analyzing trace with hash 461080195, now seen corresponding path program 1 times [2024-11-27 20:13:36,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:36,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88671651] [2024-11-27 20:13:36,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:36,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:39,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:40,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:40,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:40,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88671651] [2024-11-27 20:13:40,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88671651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:40,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:40,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:13:40,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047019636] [2024-11-27 20:13:40,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:40,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:13:40,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:40,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:13:40,278 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:13:40,278 INFO L87 Difference]: Start difference. First operand 1988 states and 2839 transitions. Second operand has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:40,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:40,611 INFO L93 Difference]: Finished difference Result 3502 states and 5049 transitions. [2024-11-27 20:13:40,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:13:40,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 193 [2024-11-27 20:13:40,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:40,614 INFO L225 Difference]: With dead ends: 3502 [2024-11-27 20:13:40,614 INFO L226 Difference]: Without dead ends: 1996 [2024-11-27 20:13:40,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:13:40,615 INFO L435 NwaCegarLoop]: 1452 mSDtfsCounter, 1432 mSDsluCounter, 4350 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1432 SdHoareTripleChecker+Valid, 5802 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:40,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1432 Valid, 5802 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 426 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:13:40,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states. [2024-11-27 20:13:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1994. [2024-11-27 20:13:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1994 states, 1993 states have (on average 1.4284997491219267) internal successors, (2847), 1993 states have internal predecessors, (2847), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:40,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1994 states to 1994 states and 2847 transitions. [2024-11-27 20:13:40,629 INFO L78 Accepts]: Start accepts. Automaton has 1994 states and 2847 transitions. Word has length 193 [2024-11-27 20:13:40,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:40,630 INFO L471 AbstractCegarLoop]: Abstraction has 1994 states and 2847 transitions. [2024-11-27 20:13:40,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.166666666666664) internal successors, (193), 6 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:40,630 INFO L276 IsEmpty]: Start isEmpty. Operand 1994 states and 2847 transitions. [2024-11-27 20:13:40,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-27 20:13:40,631 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:40,631 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:40,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2024-11-27 20:13:40,632 INFO L396 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:40,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:40,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1721448120, now seen corresponding path program 1 times [2024-11-27 20:13:40,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:40,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889990296] [2024-11-27 20:13:40,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:40,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:41,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:41,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:41,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889990296] [2024-11-27 20:13:41,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889990296] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:41,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:41,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:13:41,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689578823] [2024-11-27 20:13:41,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:41,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:13:41,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:41,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:13:41,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:41,193 INFO L87 Difference]: Start difference. First operand 1994 states and 2847 transitions. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:41,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:41,225 INFO L93 Difference]: Finished difference Result 3452 states and 4982 transitions. [2024-11-27 20:13:41,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:13:41,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2024-11-27 20:13:41,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:41,228 INFO L225 Difference]: With dead ends: 3452 [2024-11-27 20:13:41,228 INFO L226 Difference]: Without dead ends: 2000 [2024-11-27 20:13:41,229 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:41,229 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 0 mSDsluCounter, 3098 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4652 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 [2024-11-27 20:13:41,229 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4652 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:13:41,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2000 states. [2024-11-27 20:13:41,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2000 to 2000. [2024-11-27 20:13:41,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2000 states, 1999 states have (on average 1.4272136068034016) internal successors, (2853), 1999 states have internal predecessors, (2853), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:41,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2000 states to 2000 states and 2853 transitions. [2024-11-27 20:13:41,251 INFO L78 Accepts]: Start accepts. Automaton has 2000 states and 2853 transitions. Word has length 194 [2024-11-27 20:13:41,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:41,252 INFO L471 AbstractCegarLoop]: Abstraction has 2000 states and 2853 transitions. [2024-11-27 20:13:41,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:41,252 INFO L276 IsEmpty]: Start isEmpty. Operand 2000 states and 2853 transitions. [2024-11-27 20:13:41,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-27 20:13:41,253 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:41,254 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:41,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2024-11-27 20:13:41,254 INFO L396 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:41,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:41,254 INFO L85 PathProgramCache]: Analyzing trace with hash 94242004, now seen corresponding path program 1 times [2024-11-27 20:13:41,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:41,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484333111] [2024-11-27 20:13:41,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:41,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:41,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:41,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:41,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:41,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484333111] [2024-11-27 20:13:41,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484333111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:41,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:41,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:13:41,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901882356] [2024-11-27 20:13:41,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:41,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:13:41,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:41,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:13:41,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:41,823 INFO L87 Difference]: Start difference. First operand 2000 states and 2853 transitions. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:41,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:41,872 INFO L93 Difference]: Finished difference Result 3467 states and 4997 transitions. [2024-11-27 20:13:41,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:13:41,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2024-11-27 20:13:41,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:41,874 INFO L225 Difference]: With dead ends: 3467 [2024-11-27 20:13:41,874 INFO L226 Difference]: Without dead ends: 2009 [2024-11-27 20:13:41,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:41,875 INFO L435 NwaCegarLoop]: 1548 mSDtfsCounter, 3 mSDsluCounter, 4633 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6181 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:41,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 6181 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:13:41,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2009 states. [2024-11-27 20:13:41,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2009 to 2005. [2024-11-27 20:13:41,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2005 states, 2004 states have (on average 1.4266467065868262) internal successors, (2859), 2004 states have internal predecessors, (2859), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:41,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2005 states to 2005 states and 2859 transitions. [2024-11-27 20:13:41,889 INFO L78 Accepts]: Start accepts. Automaton has 2005 states and 2859 transitions. Word has length 194 [2024-11-27 20:13:41,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:41,889 INFO L471 AbstractCegarLoop]: Abstraction has 2005 states and 2859 transitions. [2024-11-27 20:13:41,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:41,889 INFO L276 IsEmpty]: Start isEmpty. Operand 2005 states and 2859 transitions. [2024-11-27 20:13:41,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-27 20:13:41,890 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:41,890 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:41,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2024-11-27 20:13:41,891 INFO L396 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:41,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:41,891 INFO L85 PathProgramCache]: Analyzing trace with hash -174809939, now seen corresponding path program 1 times [2024-11-27 20:13:41,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:41,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124265419] [2024-11-27 20:13:41,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:41,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:42,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:42,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:42,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:42,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124265419] [2024-11-27 20:13:42,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124265419] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:42,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:42,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:13:42,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238316080] [2024-11-27 20:13:42,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:42,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:13:42,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:42,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:13:42,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:42,418 INFO L87 Difference]: Start difference. First operand 2005 states and 2859 transitions. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:42,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:42,538 INFO L93 Difference]: Finished difference Result 3480 states and 5015 transitions. [2024-11-27 20:13:42,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:13:42,538 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2024-11-27 20:13:42,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:42,540 INFO L225 Difference]: With dead ends: 3480 [2024-11-27 20:13:42,540 INFO L226 Difference]: Without dead ends: 2017 [2024-11-27 20:13:42,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:42,541 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 0 mSDsluCounter, 4572 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 6126 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:42,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 6126 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 20:13:42,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2017 states. [2024-11-27 20:13:42,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2017 to 2017. [2024-11-27 20:13:42,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2017 states, 2016 states have (on average 1.4241071428571428) internal successors, (2871), 2016 states have internal predecessors, (2871), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:42,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2017 states to 2017 states and 2871 transitions. [2024-11-27 20:13:42,557 INFO L78 Accepts]: Start accepts. Automaton has 2017 states and 2871 transitions. Word has length 194 [2024-11-27 20:13:42,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:42,557 INFO L471 AbstractCegarLoop]: Abstraction has 2017 states and 2871 transitions. [2024-11-27 20:13:42,557 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:42,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2017 states and 2871 transitions. [2024-11-27 20:13:42,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-27 20:13:42,558 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:42,558 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:42,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2024-11-27 20:13:42,558 INFO L396 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:42,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:42,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1429412010, now seen corresponding path program 1 times [2024-11-27 20:13:42,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:42,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305511867] [2024-11-27 20:13:42,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:42,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:47,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:47,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:47,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305511867] [2024-11-27 20:13:47,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305511867] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:47,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:47,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-27 20:13:47,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421349247] [2024-11-27 20:13:47,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:47,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-27 20:13:47,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:47,835 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-27 20:13:47,835 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-27 20:13:47,835 INFO L87 Difference]: Start difference. First operand 2017 states and 2871 transitions. Second operand has 13 states, 13 states have (on average 14.923076923076923) internal successors, (194), 13 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:48,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:48,142 INFO L93 Difference]: Finished difference Result 3761 states and 5390 transitions. [2024-11-27 20:13:48,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 20:13:48,142 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 14.923076923076923) internal successors, (194), 13 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2024-11-27 20:13:48,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:48,144 INFO L225 Difference]: With dead ends: 3761 [2024-11-27 20:13:48,144 INFO L226 Difference]: Without dead ends: 2167 [2024-11-27 20:13:48,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=356, Unknown=0, NotChecked=0, Total=420 [2024-11-27 20:13:48,145 INFO L435 NwaCegarLoop]: 1537 mSDtfsCounter, 1521 mSDsluCounter, 15335 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1521 SdHoareTripleChecker+Valid, 16872 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:48,145 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1521 Valid, 16872 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:13:48,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2167 states. [2024-11-27 20:13:48,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2167 to 2159. [2024-11-27 20:13:48,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2159 states, 2158 states have (on average 1.4212233549582947) internal successors, (3067), 2158 states have internal predecessors, (3067), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:48,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 3067 transitions. [2024-11-27 20:13:48,161 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 3067 transitions. Word has length 194 [2024-11-27 20:13:48,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:48,161 INFO L471 AbstractCegarLoop]: Abstraction has 2159 states and 3067 transitions. [2024-11-27 20:13:48,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 14.923076923076923) internal successors, (194), 13 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:48,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 3067 transitions. [2024-11-27 20:13:48,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-27 20:13:48,162 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:48,162 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:48,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2024-11-27 20:13:48,162 INFO L396 AbstractCegarLoop]: === Iteration 61 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:48,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:48,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1873672765, now seen corresponding path program 1 times [2024-11-27 20:13:48,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:48,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072369305] [2024-11-27 20:13:48,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:48,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:48,840 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:48,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:48,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072369305] [2024-11-27 20:13:48,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072369305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:48,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:48,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:13:48,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772044391] [2024-11-27 20:13:48,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:48,841 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:13:48,841 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:48,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:13:48,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:48,842 INFO L87 Difference]: Start difference. First operand 2159 states and 3067 transitions. Second operand has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:48,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:48,873 INFO L93 Difference]: Finished difference Result 3802 states and 5454 transitions. [2024-11-27 20:13:48,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:13:48,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2024-11-27 20:13:48,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:48,875 INFO L225 Difference]: With dead ends: 3802 [2024-11-27 20:13:48,875 INFO L226 Difference]: Without dead ends: 2175 [2024-11-27 20:13:48,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:13:48,876 INFO L435 NwaCegarLoop]: 1554 mSDtfsCounter, 0 mSDsluCounter, 3098 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4652 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 [2024-11-27 20:13:48,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4652 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 20:13:48,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2175 states. [2024-11-27 20:13:48,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2175 to 2175. [2024-11-27 20:13:48,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2175 states, 2174 states have (on average 1.4181232750689972) internal successors, (3083), 2174 states have internal predecessors, (3083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2175 states to 2175 states and 3083 transitions. [2024-11-27 20:13:48,892 INFO L78 Accepts]: Start accepts. Automaton has 2175 states and 3083 transitions. Word has length 194 [2024-11-27 20:13:48,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:48,892 INFO L471 AbstractCegarLoop]: Abstraction has 2175 states and 3083 transitions. [2024-11-27 20:13:48,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.8) internal successors, (194), 5 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:48,892 INFO L276 IsEmpty]: Start isEmpty. Operand 2175 states and 3083 transitions. [2024-11-27 20:13:48,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-27 20:13:48,894 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:48,894 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:48,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2024-11-27 20:13:48,894 INFO L396 AbstractCegarLoop]: === Iteration 62 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:48,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:48,894 INFO L85 PathProgramCache]: Analyzing trace with hash -155846613, now seen corresponding path program 1 times [2024-11-27 20:13:48,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:48,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008372204] [2024-11-27 20:13:48,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:48,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:13:55,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:13:55,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:13:55,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008372204] [2024-11-27 20:13:55,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008372204] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:13:55,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:13:55,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:13:55,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579356258] [2024-11-27 20:13:55,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:13:55,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:13:55,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:13:55,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:13:55,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:13:55,110 INFO L87 Difference]: Start difference. First operand 2175 states and 3083 transitions. Second operand has 8 states, 8 states have (on average 24.25) internal successors, (194), 8 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:55,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:13:55,643 INFO L93 Difference]: Finished difference Result 4682 states and 6713 transitions. [2024-11-27 20:13:55,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:13:55,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 24.25) internal successors, (194), 8 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2024-11-27 20:13:55,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:13:55,646 INFO L225 Difference]: With dead ends: 4682 [2024-11-27 20:13:55,646 INFO L226 Difference]: Without dead ends: 2976 [2024-11-27 20:13:55,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:13:55,647 INFO L435 NwaCegarLoop]: 1494 mSDtfsCounter, 1154 mSDsluCounter, 8895 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1154 SdHoareTripleChecker+Valid, 10389 SdHoareTripleChecker+Invalid, 442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 20:13:55,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1154 Valid, 10389 Invalid, 442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 20:13:55,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2024-11-27 20:13:55,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 2169. [2024-11-27 20:13:55,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2169 states, 2168 states have (on average 1.4174354243542435) internal successors, (3073), 2168 states have internal predecessors, (3073), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:55,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2169 states to 2169 states and 3073 transitions. [2024-11-27 20:13:55,664 INFO L78 Accepts]: Start accepts. Automaton has 2169 states and 3073 transitions. Word has length 194 [2024-11-27 20:13:55,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:13:55,664 INFO L471 AbstractCegarLoop]: Abstraction has 2169 states and 3073 transitions. [2024-11-27 20:13:55,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.25) internal successors, (194), 8 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:13:55,664 INFO L276 IsEmpty]: Start isEmpty. Operand 2169 states and 3073 transitions. [2024-11-27 20:13:55,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-27 20:13:55,666 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:13:55,666 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:13:55,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2024-11-27 20:13:55,666 INFO L396 AbstractCegarLoop]: === Iteration 63 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:13:55,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:13:55,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1059610676, now seen corresponding path program 1 times [2024-11-27 20:13:55,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:13:55,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022038241] [2024-11-27 20:13:55,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:13:55,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:13:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:00,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:00,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:00,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022038241] [2024-11-27 20:14:00,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022038241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:00,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:00,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 20:14:00,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010297188] [2024-11-27 20:14:00,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:00,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 20:14:00,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:00,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 20:14:00,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:14:00,618 INFO L87 Difference]: Start difference. First operand 2169 states and 3073 transitions. Second operand has 8 states, 8 states have (on average 24.25) internal successors, (194), 8 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:00,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:00,946 INFO L93 Difference]: Finished difference Result 3806 states and 5443 transitions. [2024-11-27 20:14:00,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 20:14:00,946 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 24.25) internal successors, (194), 8 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2024-11-27 20:14:00,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:00,948 INFO L225 Difference]: With dead ends: 3806 [2024-11-27 20:14:00,948 INFO L226 Difference]: Without dead ends: 2169 [2024-11-27 20:14:00,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-27 20:14:00,949 INFO L435 NwaCegarLoop]: 1470 mSDtfsCounter, 1554 mSDsluCounter, 5873 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 7343 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:00,949 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 7343 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:14:00,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2169 states. [2024-11-27 20:14:00,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2169 to 2163. [2024-11-27 20:14:00,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2163 states, 2162 states have (on average 1.4158186864014801) internal successors, (3061), 2162 states have internal predecessors, (3061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:00,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2163 states to 2163 states and 3061 transitions. [2024-11-27 20:14:00,964 INFO L78 Accepts]: Start accepts. Automaton has 2163 states and 3061 transitions. Word has length 194 [2024-11-27 20:14:00,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:00,964 INFO L471 AbstractCegarLoop]: Abstraction has 2163 states and 3061 transitions. [2024-11-27 20:14:00,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 24.25) internal successors, (194), 8 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:00,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2163 states and 3061 transitions. [2024-11-27 20:14:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-27 20:14:00,965 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:00,965 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:00,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62 [2024-11-27 20:14:00,965 INFO L396 AbstractCegarLoop]: === Iteration 64 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:00,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:00,966 INFO L85 PathProgramCache]: Analyzing trace with hash -455698132, now seen corresponding path program 1 times [2024-11-27 20:14:00,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:00,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294885849] [2024-11-27 20:14:00,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:00,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:06,650 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:06,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:06,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294885849] [2024-11-27 20:14:06,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294885849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:06,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:06,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-27 20:14:06,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781688579] [2024-11-27 20:14:06,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:06,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-27 20:14:06,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:06,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-27 20:14:06,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-11-27 20:14:06,652 INFO L87 Difference]: Start difference. First operand 2163 states and 3061 transitions. Second operand has 11 states, 11 states have (on average 17.636363636363637) internal successors, (194), 11 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:06,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:06,921 INFO L93 Difference]: Finished difference Result 4272 states and 6060 transitions. [2024-11-27 20:14:06,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-27 20:14:06,921 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 17.636363636363637) internal successors, (194), 11 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2024-11-27 20:14:06,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:06,923 INFO L225 Difference]: With dead ends: 4272 [2024-11-27 20:14:06,923 INFO L226 Difference]: Without dead ends: 2341 [2024-11-27 20:14:06,924 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-27 20:14:06,924 INFO L435 NwaCegarLoop]: 1532 mSDtfsCounter, 1619 mSDsluCounter, 12236 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1619 SdHoareTripleChecker+Valid, 13768 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:06,924 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1619 Valid, 13768 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:14:06,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2341 states. [2024-11-27 20:14:06,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2341 to 2227. [2024-11-27 20:14:06,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2227 states, 2226 states have (on average 1.4146451033243486) internal successors, (3149), 2226 states have internal predecessors, (3149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:06,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 2227 states and 3149 transitions. [2024-11-27 20:14:06,942 INFO L78 Accepts]: Start accepts. Automaton has 2227 states and 3149 transitions. Word has length 194 [2024-11-27 20:14:06,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:06,942 INFO L471 AbstractCegarLoop]: Abstraction has 2227 states and 3149 transitions. [2024-11-27 20:14:06,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.636363636363637) internal successors, (194), 11 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:06,942 INFO L276 IsEmpty]: Start isEmpty. Operand 2227 states and 3149 transitions. [2024-11-27 20:14:06,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2024-11-27 20:14:06,943 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:06,943 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:06,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63 [2024-11-27 20:14:06,944 INFO L396 AbstractCegarLoop]: === Iteration 65 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:06,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:06,944 INFO L85 PathProgramCache]: Analyzing trace with hash 197320315, now seen corresponding path program 1 times [2024-11-27 20:14:06,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:06,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737602416] [2024-11-27 20:14:06,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:06,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:13,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:13,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:13,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737602416] [2024-11-27 20:14:13,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737602416] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:13,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:13,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:14:13,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627466699] [2024-11-27 20:14:13,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:13,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:14:13,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:13,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:14:13,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:14:13,103 INFO L87 Difference]: Start difference. First operand 2227 states and 3149 transitions. Second operand has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 6 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:13,934 INFO L93 Difference]: Finished difference Result 4835 states and 6841 transitions. [2024-11-27 20:14:13,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:14:13,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 6 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 194 [2024-11-27 20:14:13,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:13,937 INFO L225 Difference]: With dead ends: 4835 [2024-11-27 20:14:13,937 INFO L226 Difference]: Without dead ends: 2655 [2024-11-27 20:14:13,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-27 20:14:13,939 INFO L435 NwaCegarLoop]: 1371 mSDtfsCounter, 2827 mSDsluCounter, 4103 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2827 SdHoareTripleChecker+Valid, 5474 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:13,939 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2827 Valid, 5474 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-27 20:14:13,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2655 states. [2024-11-27 20:14:13,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2655 to 2224. [2024-11-27 20:14:13,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2224 states, 2223 states have (on average 1.4143049932523617) internal successors, (3144), 2223 states have internal predecessors, (3144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:13,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 3144 transitions. [2024-11-27 20:14:13,956 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 3144 transitions. Word has length 194 [2024-11-27 20:14:13,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:13,957 INFO L471 AbstractCegarLoop]: Abstraction has 2224 states and 3144 transitions. [2024-11-27 20:14:13,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.333333333333336) internal successors, (194), 6 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:13,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 3144 transitions. [2024-11-27 20:14:13,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-27 20:14:13,958 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:13,958 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:13,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable64 [2024-11-27 20:14:13,958 INFO L396 AbstractCegarLoop]: === Iteration 66 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:13,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:13,958 INFO L85 PathProgramCache]: Analyzing trace with hash -2139418247, now seen corresponding path program 1 times [2024-11-27 20:14:13,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:13,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567530057] [2024-11-27 20:14:13,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:13,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:18,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:18,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:18,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567530057] [2024-11-27 20:14:18,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567530057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:18,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:18,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:14:18,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196499151] [2024-11-27 20:14:18,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:18,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:14:18,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:18,200 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:14:18,200 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:14:18,200 INFO L87 Difference]: Start difference. First operand 2224 states and 3144 transitions. Second operand has 6 states, 6 states have (on average 32.5) internal successors, (195), 6 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:18,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:18,543 INFO L93 Difference]: Finished difference Result 4397 states and 6216 transitions. [2024-11-27 20:14:18,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:14:18,543 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.5) internal successors, (195), 6 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2024-11-27 20:14:18,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:18,545 INFO L225 Difference]: With dead ends: 4397 [2024-11-27 20:14:18,545 INFO L226 Difference]: Without dead ends: 2228 [2024-11-27 20:14:18,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:14:18,546 INFO L435 NwaCegarLoop]: 1451 mSDtfsCounter, 1536 mSDsluCounter, 4349 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1536 SdHoareTripleChecker+Valid, 5800 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:18,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1536 Valid, 5800 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:14:18,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2228 states. [2024-11-27 20:14:18,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2228 to 2226. [2024-11-27 20:14:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2226 states, 2225 states have (on average 1.4139325842696628) internal successors, (3146), 2225 states have internal predecessors, (3146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:18,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 3146 transitions. [2024-11-27 20:14:18,563 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 3146 transitions. Word has length 195 [2024-11-27 20:14:18,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:18,563 INFO L471 AbstractCegarLoop]: Abstraction has 2226 states and 3146 transitions. [2024-11-27 20:14:18,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.5) internal successors, (195), 6 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:18,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 3146 transitions. [2024-11-27 20:14:18,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-27 20:14:18,565 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:18,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:18,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65 [2024-11-27 20:14:18,565 INFO L396 AbstractCegarLoop]: === Iteration 67 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:18,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:18,565 INFO L85 PathProgramCache]: Analyzing trace with hash 2114655253, now seen corresponding path program 1 times [2024-11-27 20:14:18,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:18,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100311048] [2024-11-27 20:14:18,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:18,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:23,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:24,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:24,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:24,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100311048] [2024-11-27 20:14:24,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100311048] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:24,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:24,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:14:24,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009056983] [2024-11-27 20:14:24,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:24,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:14:24,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:24,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:14:24,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:14:24,721 INFO L87 Difference]: Start difference. First operand 2226 states and 3146 transitions. Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:25,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:25,246 INFO L93 Difference]: Finished difference Result 4819 states and 6818 transitions. [2024-11-27 20:14:25,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:14:25,246 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2024-11-27 20:14:25,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:25,249 INFO L225 Difference]: With dead ends: 4819 [2024-11-27 20:14:25,249 INFO L226 Difference]: Without dead ends: 2654 [2024-11-27 20:14:25,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-27 20:14:25,250 INFO L435 NwaCegarLoop]: 1391 mSDtfsCounter, 2812 mSDsluCounter, 2779 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2812 SdHoareTripleChecker+Valid, 4170 SdHoareTripleChecker+Invalid, 495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:25,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2812 Valid, 4170 Invalid, 495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 20:14:25,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2654 states. [2024-11-27 20:14:25,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2654 to 2223. [2024-11-27 20:14:25,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2223 states, 2222 states have (on average 1.4135913591359135) internal successors, (3141), 2222 states have internal predecessors, (3141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 3141 transitions. [2024-11-27 20:14:25,273 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 3141 transitions. Word has length 195 [2024-11-27 20:14:25,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:25,273 INFO L471 AbstractCegarLoop]: Abstraction has 2223 states and 3141 transitions. [2024-11-27 20:14:25,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 3141 transitions. [2024-11-27 20:14:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-27 20:14:25,275 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:25,275 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:25,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable66 [2024-11-27 20:14:25,276 INFO L396 AbstractCegarLoop]: === Iteration 68 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:25,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:25,276 INFO L85 PathProgramCache]: Analyzing trace with hash 203212751, now seen corresponding path program 1 times [2024-11-27 20:14:25,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:25,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58871761] [2024-11-27 20:14:25,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:25,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:28,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:29,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:29,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:14:29,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58871761] [2024-11-27 20:14:29,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58871761] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:29,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:29,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 20:14:29,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357685075] [2024-11-27 20:14:29,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:29,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 20:14:29,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:14:29,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 20:14:29,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 20:14:29,355 INFO L87 Difference]: Start difference. First operand 2223 states and 3141 transitions. Second operand has 6 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:29,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:29,682 INFO L93 Difference]: Finished difference Result 4319 states and 6114 transitions. [2024-11-27 20:14:29,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 20:14:29,683 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 196 [2024-11-27 20:14:29,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:29,684 INFO L225 Difference]: With dead ends: 4319 [2024-11-27 20:14:29,685 INFO L226 Difference]: Without dead ends: 2227 [2024-11-27 20:14:29,686 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-27 20:14:29,686 INFO L435 NwaCegarLoop]: 1451 mSDtfsCounter, 1527 mSDsluCounter, 4349 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1527 SdHoareTripleChecker+Valid, 5800 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:29,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1527 Valid, 5800 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 20:14:29,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2227 states. [2024-11-27 20:14:29,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2227 to 2225. [2024-11-27 20:14:29,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2225 states, 2224 states have (on average 1.4132194244604317) internal successors, (3143), 2224 states have internal predecessors, (3143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:29,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 3143 transitions. [2024-11-27 20:14:29,702 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 3143 transitions. Word has length 196 [2024-11-27 20:14:29,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:29,702 INFO L471 AbstractCegarLoop]: Abstraction has 2225 states and 3143 transitions. [2024-11-27 20:14:29,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.666666666666664) internal successors, (196), 6 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:29,702 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 3143 transitions. [2024-11-27 20:14:29,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-27 20:14:29,704 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:29,704 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:29,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable67 [2024-11-27 20:14:29,704 INFO L396 AbstractCegarLoop]: === Iteration 69 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:29,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:29,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1405077110, now seen corresponding path program 1 times [2024-11-27 20:14:29,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:14:29,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698254222] [2024-11-27 20:14:29,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:29,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:14:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:14:34,397 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:14:38,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:14:38,760 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 20:14:38,762 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 20:14:38,763 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 20:14:38,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable68 [2024-11-27 20:14:38,768 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:38,951 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 20:14:38,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 08:14:38 BoogieIcfgContainer [2024-11-27 20:14:38,961 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 20:14:38,962 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 20:14:38,962 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 20:14:38,962 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 20:14:38,963 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:09:43" (3/4) ... [2024-11-27 20:14:38,966 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-27 20:14:38,966 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 20:14:38,967 INFO L158 Benchmark]: Toolchain (without parser) took 303126.47ms. Allocated memory was 117.4MB in the beginning and 2.3GB in the end (delta: 2.2GB). Free memory was 90.0MB in the beginning and 941.7MB in the end (delta: -851.7MB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-27 20:14:38,967 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 74.1MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:14:38,968 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1132.37ms. Allocated memory is still 117.4MB. Free memory was 89.8MB in the beginning and 73.1MB in the end (delta: 16.6MB). Peak memory consumption was 82.8MB. Max. memory is 16.1GB. [2024-11-27 20:14:38,968 INFO L158 Benchmark]: Boogie Procedure Inliner took 615.99ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 73.1MB in the beginning and 186.2MB in the end (delta: -113.1MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. [2024-11-27 20:14:38,968 INFO L158 Benchmark]: Boogie Preprocessor took 694.16ms. Allocated memory is still 285.2MB. Free memory was 186.2MB in the beginning and 179.8MB in the end (delta: 6.4MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. [2024-11-27 20:14:38,968 INFO L158 Benchmark]: RCFGBuilder took 5237.97ms. Allocated memory was 285.2MB in the beginning and 679.5MB in the end (delta: 394.3MB). Free memory was 179.8MB in the beginning and 394.3MB in the end (delta: -214.5MB). Peak memory consumption was 192.0MB. Max. memory is 16.1GB. [2024-11-27 20:14:38,968 INFO L158 Benchmark]: TraceAbstraction took 295433.01ms. Allocated memory was 679.5MB in the beginning and 2.3GB in the end (delta: 1.6GB). Free memory was 394.3MB in the beginning and 941.9MB in the end (delta: -547.6MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2024-11-27 20:14:38,968 INFO L158 Benchmark]: Witness Printer took 4.61ms. Allocated memory is still 2.3GB. Free memory was 941.9MB in the beginning and 941.7MB in the end (delta: 131.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:14:38,969 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34ms. Allocated memory is still 117.4MB. Free memory was 74.3MB in the beginning and 74.1MB in the end (delta: 146.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1132.37ms. Allocated memory is still 117.4MB. Free memory was 89.8MB in the beginning and 73.1MB in the end (delta: 16.6MB). Peak memory consumption was 82.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 615.99ms. Allocated memory was 117.4MB in the beginning and 285.2MB in the end (delta: 167.8MB). Free memory was 73.1MB in the beginning and 186.2MB in the end (delta: -113.1MB). Peak memory consumption was 79.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 694.16ms. Allocated memory is still 285.2MB. Free memory was 186.2MB in the beginning and 179.8MB in the end (delta: 6.4MB). Peak memory consumption was 37.1MB. Max. memory is 16.1GB. * RCFGBuilder took 5237.97ms. Allocated memory was 285.2MB in the beginning and 679.5MB in the end (delta: 394.3MB). Free memory was 179.8MB in the beginning and 394.3MB in the end (delta: -214.5MB). Peak memory consumption was 192.0MB. Max. memory is 16.1GB. * TraceAbstraction took 295433.01ms. Allocated memory was 679.5MB in the beginning and 2.3GB in the end (delta: 1.6GB). Free memory was 394.3MB in the beginning and 941.9MB in the end (delta: -547.6MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 4.61ms. Allocated memory is still 2.3GB. Free memory was 941.9MB in the beginning and 941.7MB in the end (delta: 131.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 461, overapproximation of bitwiseAnd at line 417, overapproximation of bitwiseAnd at line 581, overapproximation of bitwiseAnd at line 297, overapproximation of bitwiseAnd at line 663, overapproximation of bitwiseAnd at line 215, overapproximation of bitwiseAnd at line 499, overapproximation of bitwiseAnd at line 543, overapproximation of bitwiseAnd at line 379, overapproximation of bitwiseAnd at line 625, overapproximation of bitwiseAnd at line 140, overapproximation of bitwiseAnd at line 253, overapproximation of bitwiseAnd at line 220, overapproximation of bitwiseAnd at line 335, overapproximation of bitwiseAnd at line 178. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 3); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (3 - 1); [L32] const SORT_6 mask_SORT_6 = (SORT_6)-1 >> (sizeof(SORT_6) * 8 - 32); [L33] const SORT_6 msb_SORT_6 = (SORT_6)1 << (32 - 1); [L35] const SORT_235 mask_SORT_235 = (SORT_235)-1 >> (sizeof(SORT_235) * 8 - 2); [L36] const SORT_235 msb_SORT_235 = (SORT_235)1 << (2 - 1); [L38] const SORT_3 var_7 = 7; [L39] const SORT_3 var_10 = 6; [L40] const SORT_1 var_13 = 0; [L41] const SORT_3 var_15 = 5; [L42] const SORT_3 var_18 = 4; [L43] const SORT_3 var_23 = 3; [L44] const SORT_3 var_26 = 2; [L45] const SORT_3 var_30 = 1; [L46] const SORT_3 var_33 = 0; [L47] const SORT_6 var_40 = 5; [L48] const SORT_6 var_42 = 1; [L49] const SORT_6 var_53 = 4; [L50] const SORT_1 var_56 = 1; [L51] const SORT_6 var_66 = 0; [L52] const SORT_235 var_244 = 0; [L53] const SORT_235 var_246 = 1; [L54] const SORT_235 var_255 = 2; [L55] const SORT_235 var_261 = 3; [L57] SORT_1 input_2; [L58] SORT_3 input_4; [L59] SORT_3 input_5; [L60] SORT_3 input_271; [L61] SORT_3 input_282; [L62] SORT_3 input_296; [L63] SORT_3 input_299; [L65] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, var_10=6, var_13=0, var_15=5, var_18=4, var_23=3, var_244=0, var_246=1, var_255=2, var_261=3, var_26=2, var_30=1, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L65] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, var_10=6, var_13=0, var_15=5, var_18=4, var_23=3, var_244=0, var_246=1, var_255=2, var_261=3, var_26=2, var_30=1, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L66] SORT_3 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, var_10=6, var_13=0, var_15=5, var_18=4, var_23=3, var_244=0, var_246=1, var_255=2, var_261=3, var_26=2, var_30=1, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L67] SORT_3 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, var_10=6, var_13=0, var_15=5, var_18=4, var_23=3, var_244=0, var_246=1, var_255=2, var_261=3, var_26=2, var_30=1, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L68] SORT_3 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, var_10=6, var_13=0, var_15=5, var_18=4, var_23=3, var_244=0, var_246=1, var_255=2, var_261=3, var_26=2, var_30=1, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L69] SORT_3 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, var_10=6, var_13=0, var_15=5, var_18=4, var_23=3, var_244=0, var_246=1, var_255=2, var_261=3, var_26=2, var_30=1, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L70] SORT_3 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, var_10=6, var_13=0, var_15=5, var_18=4, var_23=3, var_244=0, var_246=1, var_255=2, var_261=3, var_26=2, var_30=1, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L71] SORT_3 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, var_10=6, var_13=0, var_15=5, var_18=4, var_23=3, var_244=0, var_246=1, var_255=2, var_261=3, var_26=2, var_30=1, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L72] SORT_3 state_34 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, var_10=6, var_13=0, var_15=5, var_18=4, var_23=3, var_244=0, var_246=1, var_255=2, var_261=3, var_26=2, var_30=1, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L73] SORT_3 state_218 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, var_10=6, var_13=0, var_15=5, var_18=4, var_23=3, var_244=0, var_246=1, var_255=2, var_261=3, var_26=2, var_30=1, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L74] SORT_3 state_222 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L76] SORT_3 init_9_arg_1 = var_7; [L77] state_8 = init_9_arg_1 [L78] SORT_3 init_12_arg_1 = var_10; [L79] state_11 = init_12_arg_1 [L80] SORT_3 init_17_arg_1 = var_15; [L81] state_16 = init_17_arg_1 [L82] SORT_3 init_20_arg_1 = var_18; [L83] state_19 = init_20_arg_1 [L84] SORT_3 init_25_arg_1 = var_23; [L85] state_24 = init_25_arg_1 [L86] SORT_3 init_28_arg_1 = var_26; [L87] state_27 = init_28_arg_1 [L88] SORT_3 init_32_arg_1 = var_30; [L89] state_31 = init_32_arg_1 [L90] SORT_3 init_35_arg_1 = var_33; [L91] state_34 = init_35_arg_1 [L92] SORT_3 init_219_arg_1 = var_33; [L93] state_218 = init_219_arg_1 [L94] SORT_3 init_223_arg_1 = var_33; [L95] state_222 = init_223_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L98] input_2 = __VERIFIER_nondet_uchar() [L99] input_4 = __VERIFIER_nondet_uchar() [L100] input_5 = __VERIFIER_nondet_uchar() [L101] input_271 = __VERIFIER_nondet_uchar() [L102] input_282 = __VERIFIER_nondet_uchar() [L103] input_296 = __VERIFIER_nondet_uchar() [L104] input_299 = __VERIFIER_nondet_uchar() [L107] SORT_1 var_36_arg_0 = var_13; [L108] SORT_3 var_36_arg_1 = state_34; [L109] SORT_3 var_36_arg_2 = state_31; [L110] SORT_3 var_36 = var_36_arg_0 ? var_36_arg_1 : var_36_arg_2; [L111] SORT_1 var_29_arg_0 = var_13; [L112] SORT_3 var_29_arg_1 = state_27; [L113] SORT_3 var_29_arg_2 = state_24; [L114] SORT_3 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; [L115] SORT_1 var_37_arg_0 = var_13; [L116] SORT_3 var_37_arg_1 = var_36; [L117] SORT_3 var_37_arg_2 = var_29; [L118] SORT_3 var_37 = var_37_arg_0 ? var_37_arg_1 : var_37_arg_2; [L119] SORT_1 var_21_arg_0 = var_13; [L120] SORT_3 var_21_arg_1 = state_19; [L121] SORT_3 var_21_arg_2 = state_16; [L122] SORT_3 var_21 = var_21_arg_0 ? var_21_arg_1 : var_21_arg_2; [L123] SORT_1 var_14_arg_0 = var_13; [L124] SORT_3 var_14_arg_1 = state_11; [L125] SORT_3 var_14_arg_2 = state_8; [L126] SORT_3 var_14 = var_14_arg_0 ? var_14_arg_1 : var_14_arg_2; [L127] SORT_1 var_22_arg_0 = var_13; [L128] SORT_3 var_22_arg_1 = var_21; [L129] SORT_3 var_22_arg_2 = var_14; [L130] SORT_3 var_22 = var_22_arg_0 ? var_22_arg_1 : var_22_arg_2; [L131] SORT_1 var_38_arg_0 = var_13; [L132] SORT_3 var_38_arg_1 = var_37; [L133] SORT_3 var_38_arg_2 = var_22; [L134] SORT_3 var_38 = var_38_arg_0 ? var_38_arg_1 : var_38_arg_2; [L135] SORT_3 var_39_arg_0 = var_38; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_39_arg_0=7, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L136] EXPR var_39_arg_0 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L136] var_39_arg_0 = var_39_arg_0 & mask_SORT_3 [L137] SORT_6 var_39 = var_39_arg_0; [L138] SORT_6 var_41_arg_0 = var_39; [L139] SORT_6 var_41_arg_1 = var_40; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_41_arg_0=7, var_41_arg_1=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L140] EXPR var_41_arg_0 & var_41_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L140] SORT_6 var_41 = var_41_arg_0 & var_41_arg_1; [L141] EXPR var_41 & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L141] var_41 = var_41 & mask_SORT_6 [L142] SORT_6 var_43_arg_0 = var_41; [L143] SORT_6 var_43_arg_1 = var_42; [L144] SORT_1 var_43 = var_43_arg_0 == var_43_arg_1; [L145] SORT_1 var_48_arg_0 = var_13; [L146] SORT_3 var_48_arg_1 = state_34; [L147] SORT_3 var_48_arg_2 = state_31; [L148] SORT_3 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L149] SORT_1 var_47_arg_0 = var_13; [L150] SORT_3 var_47_arg_1 = state_27; [L151] SORT_3 var_47_arg_2 = state_24; [L152] SORT_3 var_47 = var_47_arg_0 ? var_47_arg_1 : var_47_arg_2; [L153] SORT_1 var_49_arg_0 = var_13; [L154] SORT_3 var_49_arg_1 = var_48; [L155] SORT_3 var_49_arg_2 = var_47; [L156] SORT_3 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L157] SORT_1 var_45_arg_0 = var_13; [L158] SORT_3 var_45_arg_1 = state_19; [L159] SORT_3 var_45_arg_2 = state_16; [L160] SORT_3 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; [L161] SORT_1 var_44_arg_0 = var_13; [L162] SORT_3 var_44_arg_1 = state_11; [L163] SORT_3 var_44_arg_2 = state_8; [L164] SORT_3 var_44 = var_44_arg_0 ? var_44_arg_1 : var_44_arg_2; [L165] SORT_1 var_46_arg_0 = var_13; [L166] SORT_3 var_46_arg_1 = var_45; [L167] SORT_3 var_46_arg_2 = var_44; [L168] SORT_3 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L169] SORT_1 var_50_arg_0 = var_13; [L170] SORT_3 var_50_arg_1 = var_49; [L171] SORT_3 var_50_arg_2 = var_46; [L172] SORT_3 var_50 = var_50_arg_0 ? var_50_arg_1 : var_50_arg_2; [L173] SORT_3 var_51_arg_0 = var_50; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_43=0, var_51_arg_0=7, var_53=4, var_56=1, var_66=0, var_7=7] [L174] EXPR var_51_arg_0 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_43=0, var_53=4, var_56=1, var_66=0, var_7=7] [L174] var_51_arg_0 = var_51_arg_0 & mask_SORT_3 [L175] SORT_6 var_51 = var_51_arg_0; [L176] SORT_6 var_52_arg_0 = var_51; [L177] SORT_6 var_52_arg_1 = var_40; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_43=0, var_52_arg_0=7, var_52_arg_1=5, var_53=4, var_56=1, var_66=0, var_7=7] [L178] EXPR var_52_arg_0 & var_52_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_43=0, var_53=4, var_56=1, var_66=0, var_7=7] [L178] SORT_6 var_52 = var_52_arg_0 & var_52_arg_1; [L179] EXPR var_52 & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_43=0, var_53=4, var_56=1, var_66=0, var_7=7] [L179] var_52 = var_52 & mask_SORT_6 [L180] SORT_6 var_54_arg_0 = var_52; [L181] SORT_6 var_54_arg_1 = var_53; [L182] SORT_1 var_54 = var_54_arg_0 == var_54_arg_1; [L183] SORT_1 var_55_arg_0 = var_43; [L184] SORT_1 var_55_arg_1 = var_54; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_55_arg_0=0, var_55_arg_1=0, var_56=1, var_66=0, var_7=7] [L185] EXPR var_55_arg_0 | var_55_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L185] SORT_1 var_55 = var_55_arg_0 | var_55_arg_1; [L186] SORT_1 var_61_arg_0 = var_56; [L187] SORT_3 var_61_arg_1 = state_34; [L188] SORT_3 var_61_arg_2 = state_31; [L189] SORT_3 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L190] SORT_1 var_60_arg_0 = var_56; [L191] SORT_3 var_60_arg_1 = state_27; [L192] SORT_3 var_60_arg_2 = state_24; [L193] SORT_3 var_60 = var_60_arg_0 ? var_60_arg_1 : var_60_arg_2; [L194] SORT_1 var_62_arg_0 = var_13; [L195] SORT_3 var_62_arg_1 = var_61; [L196] SORT_3 var_62_arg_2 = var_60; [L197] SORT_3 var_62 = var_62_arg_0 ? var_62_arg_1 : var_62_arg_2; [L198] SORT_1 var_58_arg_0 = var_56; [L199] SORT_3 var_58_arg_1 = state_19; [L200] SORT_3 var_58_arg_2 = state_16; [L201] SORT_3 var_58 = var_58_arg_0 ? var_58_arg_1 : var_58_arg_2; [L202] SORT_1 var_57_arg_0 = var_56; [L203] SORT_3 var_57_arg_1 = state_11; [L204] SORT_3 var_57_arg_2 = state_8; [L205] SORT_3 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L206] SORT_1 var_59_arg_0 = var_13; [L207] SORT_3 var_59_arg_1 = var_58; [L208] SORT_3 var_59_arg_2 = var_57; [L209] SORT_3 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L210] SORT_1 var_63_arg_0 = var_13; [L211] SORT_3 var_63_arg_1 = var_62; [L212] SORT_3 var_63_arg_2 = var_59; [L213] SORT_3 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L214] SORT_3 var_64_arg_0 = var_63; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_55=0, var_56=1, var_64_arg_0=6, var_66=0, var_7=7] [L215] EXPR var_64_arg_0 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_55=0, var_56=1, var_66=0, var_7=7] [L215] var_64_arg_0 = var_64_arg_0 & mask_SORT_3 [L216] SORT_6 var_64 = var_64_arg_0; [L217] SORT_6 var_65_arg_0 = var_64; [L218] SORT_6 var_65_arg_1 = var_40; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_55=0, var_56=1, var_65_arg_0=5, var_65_arg_1=5, var_66=0, var_7=7] [L219] EXPR var_65_arg_0 & var_65_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_55=0, var_56=1, var_66=0, var_7=7] [L219] SORT_6 var_65 = var_65_arg_0 & var_65_arg_1; [L220] EXPR var_65 & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_55=0, var_56=1, var_66=0, var_7=7] [L220] var_65 = var_65 & mask_SORT_6 [L221] SORT_6 var_67_arg_0 = var_65; [L222] SORT_6 var_67_arg_1 = var_66; [L223] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L224] SORT_1 var_72_arg_0 = var_56; [L225] SORT_3 var_72_arg_1 = state_34; [L226] SORT_3 var_72_arg_2 = state_31; [L227] SORT_3 var_72 = var_72_arg_0 ? var_72_arg_1 : var_72_arg_2; [L228] SORT_1 var_71_arg_0 = var_56; [L229] SORT_3 var_71_arg_1 = state_27; [L230] SORT_3 var_71_arg_2 = state_24; [L231] SORT_3 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L232] SORT_1 var_73_arg_0 = var_13; [L233] SORT_3 var_73_arg_1 = var_72; [L234] SORT_3 var_73_arg_2 = var_71; [L235] SORT_3 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L236] SORT_1 var_69_arg_0 = var_56; [L237] SORT_3 var_69_arg_1 = state_19; [L238] SORT_3 var_69_arg_2 = state_16; [L239] SORT_3 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L240] SORT_1 var_68_arg_0 = var_56; [L241] SORT_3 var_68_arg_1 = state_11; [L242] SORT_3 var_68_arg_2 = state_8; [L243] SORT_3 var_68 = var_68_arg_0 ? var_68_arg_1 : var_68_arg_2; [L244] SORT_1 var_70_arg_0 = var_13; [L245] SORT_3 var_70_arg_1 = var_69; [L246] SORT_3 var_70_arg_2 = var_68; [L247] SORT_3 var_70 = var_70_arg_0 ? var_70_arg_1 : var_70_arg_2; [L248] SORT_1 var_74_arg_0 = var_13; [L249] SORT_3 var_74_arg_1 = var_73; [L250] SORT_3 var_74_arg_2 = var_70; [L251] SORT_3 var_74 = var_74_arg_0 ? var_74_arg_1 : var_74_arg_2; [L252] SORT_3 var_75_arg_0 = var_74; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_55=0, var_56=1, var_66=0, var_67=0, var_75_arg_0=6, var_7=7] [L253] EXPR var_75_arg_0 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_55=0, var_56=1, var_66=0, var_67=0, var_7=7] [L253] var_75_arg_0 = var_75_arg_0 & mask_SORT_3 [L254] SORT_6 var_75 = var_75_arg_0; [L255] SORT_6 var_76_arg_0 = var_75; [L256] SORT_6 var_76_arg_1 = var_40; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_55=0, var_56=1, var_66=0, var_67=0, var_76_arg_0=0, var_76_arg_1=5, var_7=7] [L257] EXPR var_76_arg_0 & var_76_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_55=0, var_56=1, var_66=0, var_67=0, var_7=7] [L257] SORT_6 var_76 = var_76_arg_0 & var_76_arg_1; [L258] EXPR var_76 & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_55=0, var_56=1, var_66=0, var_67=0, var_7=7] [L258] var_76 = var_76 & mask_SORT_6 [L259] SORT_6 var_77_arg_0 = var_76; [L260] SORT_6 var_77_arg_1 = var_40; [L261] SORT_1 var_77 = var_77_arg_0 == var_77_arg_1; [L262] SORT_1 var_78_arg_0 = var_67; [L263] SORT_1 var_78_arg_1 = var_77; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_55=0, var_56=1, var_66=0, var_78_arg_0=0, var_78_arg_1=0, var_7=7] [L264] EXPR var_78_arg_0 | var_78_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_55=0, var_56=1, var_66=0, var_7=7] [L264] SORT_1 var_78 = var_78_arg_0 | var_78_arg_1; [L265] SORT_1 var_79_arg_0 = var_55; [L266] SORT_1 var_79_arg_1 = var_78; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_79_arg_0=0, var_79_arg_1=0, var_7=7] [L267] EXPR var_79_arg_0 ^ var_79_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L267] SORT_1 var_79 = var_79_arg_0 ^ var_79_arg_1; [L268] SORT_1 var_84_arg_0 = var_13; [L269] SORT_3 var_84_arg_1 = state_34; [L270] SORT_3 var_84_arg_2 = state_31; [L271] SORT_3 var_84 = var_84_arg_0 ? var_84_arg_1 : var_84_arg_2; [L272] SORT_1 var_83_arg_0 = var_13; [L273] SORT_3 var_83_arg_1 = state_27; [L274] SORT_3 var_83_arg_2 = state_24; [L275] SORT_3 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L276] SORT_1 var_85_arg_0 = var_56; [L277] SORT_3 var_85_arg_1 = var_84; [L278] SORT_3 var_85_arg_2 = var_83; [L279] SORT_3 var_85 = var_85_arg_0 ? var_85_arg_1 : var_85_arg_2; [L280] SORT_1 var_81_arg_0 = var_13; [L281] SORT_3 var_81_arg_1 = state_19; [L282] SORT_3 var_81_arg_2 = state_16; [L283] SORT_3 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L284] SORT_1 var_80_arg_0 = var_13; [L285] SORT_3 var_80_arg_1 = state_11; [L286] SORT_3 var_80_arg_2 = state_8; [L287] SORT_3 var_80 = var_80_arg_0 ? var_80_arg_1 : var_80_arg_2; [L288] SORT_1 var_82_arg_0 = var_56; [L289] SORT_3 var_82_arg_1 = var_81; [L290] SORT_3 var_82_arg_2 = var_80; [L291] SORT_3 var_82 = var_82_arg_0 ? var_82_arg_1 : var_82_arg_2; [L292] SORT_1 var_86_arg_0 = var_13; [L293] SORT_3 var_86_arg_1 = var_85; [L294] SORT_3 var_86_arg_2 = var_82; [L295] SORT_3 var_86 = var_86_arg_0 ? var_86_arg_1 : var_86_arg_2; [L296] SORT_3 var_87_arg_0 = var_86; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_79=0, var_7=7, var_87_arg_0=5] [L297] EXPR var_87_arg_0 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_79=0, var_7=7] [L297] var_87_arg_0 = var_87_arg_0 & mask_SORT_3 [L298] SORT_6 var_87 = var_87_arg_0; [L299] SORT_6 var_88_arg_0 = var_87; [L300] SORT_6 var_88_arg_1 = var_40; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_79=0, var_7=7, var_88_arg_0=0, var_88_arg_1=5] [L301] EXPR var_88_arg_0 & var_88_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_79=0, var_7=7] [L301] SORT_6 var_88 = var_88_arg_0 & var_88_arg_1; [L302] EXPR var_88 & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_79=0, var_7=7] [L302] var_88 = var_88 & mask_SORT_6 [L303] SORT_6 var_89_arg_0 = var_88; [L304] SORT_6 var_89_arg_1 = var_42; [L305] SORT_1 var_89 = var_89_arg_0 == var_89_arg_1; [L306] SORT_1 var_94_arg_0 = var_13; [L307] SORT_3 var_94_arg_1 = state_34; [L308] SORT_3 var_94_arg_2 = state_31; [L309] SORT_3 var_94 = var_94_arg_0 ? var_94_arg_1 : var_94_arg_2; [L310] SORT_1 var_93_arg_0 = var_13; [L311] SORT_3 var_93_arg_1 = state_27; [L312] SORT_3 var_93_arg_2 = state_24; [L313] SORT_3 var_93 = var_93_arg_0 ? var_93_arg_1 : var_93_arg_2; [L314] SORT_1 var_95_arg_0 = var_56; [L315] SORT_3 var_95_arg_1 = var_94; [L316] SORT_3 var_95_arg_2 = var_93; [L317] SORT_3 var_95 = var_95_arg_0 ? var_95_arg_1 : var_95_arg_2; [L318] SORT_1 var_91_arg_0 = var_13; [L319] SORT_3 var_91_arg_1 = state_19; [L320] SORT_3 var_91_arg_2 = state_16; [L321] SORT_3 var_91 = var_91_arg_0 ? var_91_arg_1 : var_91_arg_2; [L322] SORT_1 var_90_arg_0 = var_13; [L323] SORT_3 var_90_arg_1 = state_11; [L324] SORT_3 var_90_arg_2 = state_8; [L325] SORT_3 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L326] SORT_1 var_92_arg_0 = var_56; [L327] SORT_3 var_92_arg_1 = var_91; [L328] SORT_3 var_92_arg_2 = var_90; [L329] SORT_3 var_92 = var_92_arg_0 ? var_92_arg_1 : var_92_arg_2; [L330] SORT_1 var_96_arg_0 = var_13; [L331] SORT_3 var_96_arg_1 = var_95; [L332] SORT_3 var_96_arg_2 = var_92; [L333] SORT_3 var_96 = var_96_arg_0 ? var_96_arg_1 : var_96_arg_2; [L334] SORT_3 var_97_arg_0 = var_96; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_79=0, var_7=7, var_89=0, var_97_arg_0=5] [L335] EXPR var_97_arg_0 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_79=0, var_7=7, var_89=0] [L335] var_97_arg_0 = var_97_arg_0 & mask_SORT_3 [L336] SORT_6 var_97 = var_97_arg_0; [L337] SORT_6 var_98_arg_0 = var_97; [L338] SORT_6 var_98_arg_1 = var_40; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_79=0, var_7=7, var_89=0, var_98_arg_0=0, var_98_arg_1=5] [L339] EXPR var_98_arg_0 & var_98_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_79=0, var_7=7, var_89=0] [L339] SORT_6 var_98 = var_98_arg_0 & var_98_arg_1; [L340] EXPR var_98 & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_79=0, var_7=7, var_89=0] [L340] var_98 = var_98 & mask_SORT_6 [L341] SORT_6 var_99_arg_0 = var_98; [L342] SORT_6 var_99_arg_1 = var_53; [L343] SORT_1 var_99 = var_99_arg_0 == var_99_arg_1; [L344] SORT_1 var_100_arg_0 = var_89; [L345] SORT_1 var_100_arg_1 = var_99; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_100_arg_0=0, var_100_arg_1=0, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_79=0, var_7=7] [L346] EXPR var_100_arg_0 | var_100_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_79=0, var_7=7] [L346] SORT_1 var_100 = var_100_arg_0 | var_100_arg_1; [L347] SORT_1 var_101_arg_0 = var_79; [L348] SORT_1 var_101_arg_1 = var_100; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_101_arg_0=0, var_101_arg_1=0, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L349] EXPR var_101_arg_0 ^ var_101_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L349] SORT_1 var_101 = var_101_arg_0 ^ var_101_arg_1; [L350] SORT_1 var_106_arg_0 = var_56; [L351] SORT_3 var_106_arg_1 = state_34; [L352] SORT_3 var_106_arg_2 = state_31; [L353] SORT_3 var_106 = var_106_arg_0 ? var_106_arg_1 : var_106_arg_2; [L354] SORT_1 var_105_arg_0 = var_56; [L355] SORT_3 var_105_arg_1 = state_27; [L356] SORT_3 var_105_arg_2 = state_24; [L357] SORT_3 var_105 = var_105_arg_0 ? var_105_arg_1 : var_105_arg_2; [L358] SORT_1 var_107_arg_0 = var_56; [L359] SORT_3 var_107_arg_1 = var_106; [L360] SORT_3 var_107_arg_2 = var_105; [L361] SORT_3 var_107 = var_107_arg_0 ? var_107_arg_1 : var_107_arg_2; [L362] SORT_1 var_103_arg_0 = var_56; [L363] SORT_3 var_103_arg_1 = state_19; [L364] SORT_3 var_103_arg_2 = state_16; [L365] SORT_3 var_103 = var_103_arg_0 ? var_103_arg_1 : var_103_arg_2; [L366] SORT_1 var_102_arg_0 = var_56; [L367] SORT_3 var_102_arg_1 = state_11; [L368] SORT_3 var_102_arg_2 = state_8; [L369] SORT_3 var_102 = var_102_arg_0 ? var_102_arg_1 : var_102_arg_2; [L370] SORT_1 var_104_arg_0 = var_56; [L371] SORT_3 var_104_arg_1 = var_103; [L372] SORT_3 var_104_arg_2 = var_102; [L373] SORT_3 var_104 = var_104_arg_0 ? var_104_arg_1 : var_104_arg_2; [L374] SORT_1 var_108_arg_0 = var_13; [L375] SORT_3 var_108_arg_1 = var_107; [L376] SORT_3 var_108_arg_2 = var_104; [L377] SORT_3 var_108 = var_108_arg_0 ? var_108_arg_1 : var_108_arg_2; [L378] SORT_3 var_109_arg_0 = var_108; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_101=0, var_109_arg_0=4, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L379] EXPR var_109_arg_0 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_101=0, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L379] var_109_arg_0 = var_109_arg_0 & mask_SORT_3 [L380] SORT_6 var_109 = var_109_arg_0; [L381] SORT_6 var_110_arg_0 = var_109; [L382] SORT_6 var_110_arg_1 = var_40; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_101=0, var_110_arg_0=0, var_110_arg_1=5, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L383] EXPR var_110_arg_0 & var_110_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_101=0, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L383] SORT_6 var_110 = var_110_arg_0 & var_110_arg_1; [L384] EXPR var_110 & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_101=0, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L384] var_110 = var_110 & mask_SORT_6 [L385] SORT_6 var_111_arg_0 = var_110; [L386] SORT_6 var_111_arg_1 = var_66; [L387] SORT_1 var_111 = var_111_arg_0 == var_111_arg_1; [L388] SORT_1 var_116_arg_0 = var_56; [L389] SORT_3 var_116_arg_1 = state_34; [L390] SORT_3 var_116_arg_2 = state_31; [L391] SORT_3 var_116 = var_116_arg_0 ? var_116_arg_1 : var_116_arg_2; [L392] SORT_1 var_115_arg_0 = var_56; [L393] SORT_3 var_115_arg_1 = state_27; [L394] SORT_3 var_115_arg_2 = state_24; [L395] SORT_3 var_115 = var_115_arg_0 ? var_115_arg_1 : var_115_arg_2; [L396] SORT_1 var_117_arg_0 = var_56; [L397] SORT_3 var_117_arg_1 = var_116; [L398] SORT_3 var_117_arg_2 = var_115; [L399] SORT_3 var_117 = var_117_arg_0 ? var_117_arg_1 : var_117_arg_2; [L400] SORT_1 var_113_arg_0 = var_56; [L401] SORT_3 var_113_arg_1 = state_19; [L402] SORT_3 var_113_arg_2 = state_16; [L403] SORT_3 var_113 = var_113_arg_0 ? var_113_arg_1 : var_113_arg_2; [L404] SORT_1 var_112_arg_0 = var_56; [L405] SORT_3 var_112_arg_1 = state_11; [L406] SORT_3 var_112_arg_2 = state_8; [L407] SORT_3 var_112 = var_112_arg_0 ? var_112_arg_1 : var_112_arg_2; [L408] SORT_1 var_114_arg_0 = var_56; [L409] SORT_3 var_114_arg_1 = var_113; [L410] SORT_3 var_114_arg_2 = var_112; [L411] SORT_3 var_114 = var_114_arg_0 ? var_114_arg_1 : var_114_arg_2; [L412] SORT_1 var_118_arg_0 = var_13; [L413] SORT_3 var_118_arg_1 = var_117; [L414] SORT_3 var_118_arg_2 = var_114; [L415] SORT_3 var_118 = var_118_arg_0 ? var_118_arg_1 : var_118_arg_2; [L416] SORT_3 var_119_arg_0 = var_118; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_101=0, var_111=1, var_119_arg_0=4, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L417] EXPR var_119_arg_0 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_101=0, var_111=1, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L417] var_119_arg_0 = var_119_arg_0 & mask_SORT_3 [L418] SORT_6 var_119 = var_119_arg_0; [L419] SORT_6 var_120_arg_0 = var_119; [L420] SORT_6 var_120_arg_1 = var_40; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_101=0, var_111=1, var_120_arg_0=0, var_120_arg_1=5, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L421] EXPR var_120_arg_0 & var_120_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_101=0, var_111=1, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L421] SORT_6 var_120 = var_120_arg_0 & var_120_arg_1; [L422] EXPR var_120 & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_101=0, var_111=1, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L422] var_120 = var_120 & mask_SORT_6 [L423] SORT_6 var_121_arg_0 = var_120; [L424] SORT_6 var_121_arg_1 = var_40; [L425] SORT_1 var_121 = var_121_arg_0 == var_121_arg_1; [L426] SORT_1 var_122_arg_0 = var_111; [L427] SORT_1 var_122_arg_1 = var_121; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_101=0, var_122_arg_0=1, var_122_arg_1=0, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L428] EXPR var_122_arg_0 | var_122_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_101=0, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L428] SORT_1 var_122 = var_122_arg_0 | var_122_arg_1; [L429] SORT_1 var_123_arg_0 = var_101; [L430] SORT_1 var_123_arg_1 = var_122; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_123_arg_0=0, var_123_arg_1=1, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L431] EXPR var_123_arg_0 ^ var_123_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L431] SORT_1 var_123 = var_123_arg_0 ^ var_123_arg_1; [L432] SORT_1 var_128_arg_0 = var_13; [L433] SORT_3 var_128_arg_1 = state_34; [L434] SORT_3 var_128_arg_2 = state_31; [L435] SORT_3 var_128 = var_128_arg_0 ? var_128_arg_1 : var_128_arg_2; [L436] SORT_1 var_127_arg_0 = var_13; [L437] SORT_3 var_127_arg_1 = state_27; [L438] SORT_3 var_127_arg_2 = state_24; [L439] SORT_3 var_127 = var_127_arg_0 ? var_127_arg_1 : var_127_arg_2; [L440] SORT_1 var_129_arg_0 = var_13; [L441] SORT_3 var_129_arg_1 = var_128; [L442] SORT_3 var_129_arg_2 = var_127; [L443] SORT_3 var_129 = var_129_arg_0 ? var_129_arg_1 : var_129_arg_2; [L444] SORT_1 var_125_arg_0 = var_13; [L445] SORT_3 var_125_arg_1 = state_19; [L446] SORT_3 var_125_arg_2 = state_16; [L447] SORT_3 var_125 = var_125_arg_0 ? var_125_arg_1 : var_125_arg_2; [L448] SORT_1 var_124_arg_0 = var_13; [L449] SORT_3 var_124_arg_1 = state_11; [L450] SORT_3 var_124_arg_2 = state_8; [L451] SORT_3 var_124 = var_124_arg_0 ? var_124_arg_1 : var_124_arg_2; [L452] SORT_1 var_126_arg_0 = var_13; [L453] SORT_3 var_126_arg_1 = var_125; [L454] SORT_3 var_126_arg_2 = var_124; [L455] SORT_3 var_126 = var_126_arg_0 ? var_126_arg_1 : var_126_arg_2; [L456] SORT_1 var_130_arg_0 = var_56; [L457] SORT_3 var_130_arg_1 = var_129; [L458] SORT_3 var_130_arg_2 = var_126; [L459] SORT_3 var_130 = var_130_arg_0 ? var_130_arg_1 : var_130_arg_2; [L460] SORT_3 var_131_arg_0 = var_130; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_123=1, var_131_arg_0=3, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L461] EXPR var_131_arg_0 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_123=1, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L461] var_131_arg_0 = var_131_arg_0 & mask_SORT_3 [L462] SORT_6 var_131 = var_131_arg_0; [L463] SORT_6 var_132_arg_0 = var_131; [L464] SORT_6 var_132_arg_1 = var_40; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_123=1, var_132_arg_0=0, var_132_arg_1=5, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L465] EXPR var_132_arg_0 & var_132_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_123=1, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L465] SORT_6 var_132 = var_132_arg_0 & var_132_arg_1; [L466] EXPR var_132 & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_123=1, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L466] var_132 = var_132 & mask_SORT_6 [L467] SORT_6 var_133_arg_0 = var_132; [L468] SORT_6 var_133_arg_1 = var_42; [L469] SORT_1 var_133 = var_133_arg_0 == var_133_arg_1; [L470] SORT_1 var_138_arg_0 = var_13; [L471] SORT_3 var_138_arg_1 = state_34; [L472] SORT_3 var_138_arg_2 = state_31; [L473] SORT_3 var_138 = var_138_arg_0 ? var_138_arg_1 : var_138_arg_2; [L474] SORT_1 var_137_arg_0 = var_13; [L475] SORT_3 var_137_arg_1 = state_27; [L476] SORT_3 var_137_arg_2 = state_24; [L477] SORT_3 var_137 = var_137_arg_0 ? var_137_arg_1 : var_137_arg_2; [L478] SORT_1 var_139_arg_0 = var_13; [L479] SORT_3 var_139_arg_1 = var_138; [L480] SORT_3 var_139_arg_2 = var_137; [L481] SORT_3 var_139 = var_139_arg_0 ? var_139_arg_1 : var_139_arg_2; [L482] SORT_1 var_135_arg_0 = var_13; [L483] SORT_3 var_135_arg_1 = state_19; [L484] SORT_3 var_135_arg_2 = state_16; [L485] SORT_3 var_135 = var_135_arg_0 ? var_135_arg_1 : var_135_arg_2; [L486] SORT_1 var_134_arg_0 = var_13; [L487] SORT_3 var_134_arg_1 = state_11; [L488] SORT_3 var_134_arg_2 = state_8; [L489] SORT_3 var_134 = var_134_arg_0 ? var_134_arg_1 : var_134_arg_2; [L490] SORT_1 var_136_arg_0 = var_13; [L491] SORT_3 var_136_arg_1 = var_135; [L492] SORT_3 var_136_arg_2 = var_134; [L493] SORT_3 var_136 = var_136_arg_0 ? var_136_arg_1 : var_136_arg_2; [L494] SORT_1 var_140_arg_0 = var_56; [L495] SORT_3 var_140_arg_1 = var_139; [L496] SORT_3 var_140_arg_2 = var_136; [L497] SORT_3 var_140 = var_140_arg_0 ? var_140_arg_1 : var_140_arg_2; [L498] SORT_3 var_141_arg_0 = var_140; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_123=1, var_133=0, var_13=0, var_141_arg_0=3, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L499] EXPR var_141_arg_0 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_123=1, var_133=0, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L499] var_141_arg_0 = var_141_arg_0 & mask_SORT_3 [L500] SORT_6 var_141 = var_141_arg_0; [L501] SORT_6 var_142_arg_0 = var_141; [L502] SORT_6 var_142_arg_1 = var_40; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_123=1, var_133=0, var_13=0, var_142_arg_0=0, var_142_arg_1=5, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L503] EXPR var_142_arg_0 & var_142_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_123=1, var_133=0, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L503] SORT_6 var_142 = var_142_arg_0 & var_142_arg_1; [L504] EXPR var_142 & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_123=1, var_133=0, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L504] var_142 = var_142 & mask_SORT_6 [L505] SORT_6 var_143_arg_0 = var_142; [L506] SORT_6 var_143_arg_1 = var_53; [L507] SORT_1 var_143 = var_143_arg_0 == var_143_arg_1; [L508] SORT_1 var_144_arg_0 = var_133; [L509] SORT_1 var_144_arg_1 = var_143; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_123=1, var_13=0, var_144_arg_0=0, var_144_arg_1=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L510] EXPR var_144_arg_0 | var_144_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_123=1, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L510] SORT_1 var_144 = var_144_arg_0 | var_144_arg_1; [L511] SORT_1 var_145_arg_0 = var_123; [L512] SORT_1 var_145_arg_1 = var_144; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_145_arg_0=1, var_145_arg_1=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L513] EXPR var_145_arg_0 ^ var_145_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L513] SORT_1 var_145 = var_145_arg_0 ^ var_145_arg_1; [L514] SORT_1 var_150_arg_0 = var_56; [L515] SORT_3 var_150_arg_1 = state_34; [L516] SORT_3 var_150_arg_2 = state_31; [L517] SORT_3 var_150 = var_150_arg_0 ? var_150_arg_1 : var_150_arg_2; [L518] SORT_1 var_149_arg_0 = var_56; [L519] SORT_3 var_149_arg_1 = state_27; [L520] SORT_3 var_149_arg_2 = state_24; [L521] SORT_3 var_149 = var_149_arg_0 ? var_149_arg_1 : var_149_arg_2; [L522] SORT_1 var_151_arg_0 = var_13; [L523] SORT_3 var_151_arg_1 = var_150; [L524] SORT_3 var_151_arg_2 = var_149; [L525] SORT_3 var_151 = var_151_arg_0 ? var_151_arg_1 : var_151_arg_2; [L526] SORT_1 var_147_arg_0 = var_56; [L527] SORT_3 var_147_arg_1 = state_19; [L528] SORT_3 var_147_arg_2 = state_16; [L529] SORT_3 var_147 = var_147_arg_0 ? var_147_arg_1 : var_147_arg_2; [L530] SORT_1 var_146_arg_0 = var_56; [L531] SORT_3 var_146_arg_1 = state_11; [L532] SORT_3 var_146_arg_2 = state_8; [L533] SORT_3 var_146 = var_146_arg_0 ? var_146_arg_1 : var_146_arg_2; [L534] SORT_1 var_148_arg_0 = var_13; [L535] SORT_3 var_148_arg_1 = var_147; [L536] SORT_3 var_148_arg_2 = var_146; [L537] SORT_3 var_148 = var_148_arg_0 ? var_148_arg_1 : var_148_arg_2; [L538] SORT_1 var_152_arg_0 = var_56; [L539] SORT_3 var_152_arg_1 = var_151; [L540] SORT_3 var_152_arg_2 = var_148; [L541] SORT_3 var_152 = var_152_arg_0 ? var_152_arg_1 : var_152_arg_2; [L542] SORT_3 var_153_arg_0 = var_152; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_145=1, var_153_arg_0=2, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L543] EXPR var_153_arg_0 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_145=1, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L543] var_153_arg_0 = var_153_arg_0 & mask_SORT_3 [L544] SORT_6 var_153 = var_153_arg_0; [L545] SORT_6 var_154_arg_0 = var_153; [L546] SORT_6 var_154_arg_1 = var_40; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_145=1, var_154_arg_0=0, var_154_arg_1=5, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L547] EXPR var_154_arg_0 & var_154_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_145=1, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L547] SORT_6 var_154 = var_154_arg_0 & var_154_arg_1; [L548] EXPR var_154 & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_145=1, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L548] var_154 = var_154 & mask_SORT_6 [L549] SORT_6 var_155_arg_0 = var_154; [L550] SORT_6 var_155_arg_1 = var_66; [L551] SORT_1 var_155 = var_155_arg_0 == var_155_arg_1; [L552] SORT_1 var_160_arg_0 = var_56; [L553] SORT_3 var_160_arg_1 = state_34; [L554] SORT_3 var_160_arg_2 = state_31; [L555] SORT_3 var_160 = var_160_arg_0 ? var_160_arg_1 : var_160_arg_2; [L556] SORT_1 var_159_arg_0 = var_56; [L557] SORT_3 var_159_arg_1 = state_27; [L558] SORT_3 var_159_arg_2 = state_24; [L559] SORT_3 var_159 = var_159_arg_0 ? var_159_arg_1 : var_159_arg_2; [L560] SORT_1 var_161_arg_0 = var_13; [L561] SORT_3 var_161_arg_1 = var_160; [L562] SORT_3 var_161_arg_2 = var_159; [L563] SORT_3 var_161 = var_161_arg_0 ? var_161_arg_1 : var_161_arg_2; [L564] SORT_1 var_157_arg_0 = var_56; [L565] SORT_3 var_157_arg_1 = state_19; [L566] SORT_3 var_157_arg_2 = state_16; [L567] SORT_3 var_157 = var_157_arg_0 ? var_157_arg_1 : var_157_arg_2; [L568] SORT_1 var_156_arg_0 = var_56; [L569] SORT_3 var_156_arg_1 = state_11; [L570] SORT_3 var_156_arg_2 = state_8; [L571] SORT_3 var_156 = var_156_arg_0 ? var_156_arg_1 : var_156_arg_2; [L572] SORT_1 var_158_arg_0 = var_13; [L573] SORT_3 var_158_arg_1 = var_157; [L574] SORT_3 var_158_arg_2 = var_156; [L575] SORT_3 var_158 = var_158_arg_0 ? var_158_arg_1 : var_158_arg_2; [L576] SORT_1 var_162_arg_0 = var_56; [L577] SORT_3 var_162_arg_1 = var_161; [L578] SORT_3 var_162_arg_2 = var_158; [L579] SORT_3 var_162 = var_162_arg_0 ? var_162_arg_1 : var_162_arg_2; [L580] SORT_3 var_163_arg_0 = var_162; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_145=1, var_155=1, var_163_arg_0=2, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L581] EXPR var_163_arg_0 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_145=1, var_155=1, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L581] var_163_arg_0 = var_163_arg_0 & mask_SORT_3 [L582] SORT_6 var_163 = var_163_arg_0; [L583] SORT_6 var_164_arg_0 = var_163; [L584] SORT_6 var_164_arg_1 = var_40; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_145=1, var_155=1, var_164_arg_0=0, var_164_arg_1=5, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L585] EXPR var_164_arg_0 & var_164_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_145=1, var_155=1, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L585] SORT_6 var_164 = var_164_arg_0 & var_164_arg_1; [L586] EXPR var_164 & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_145=1, var_155=1, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L586] var_164 = var_164 & mask_SORT_6 [L587] SORT_6 var_165_arg_0 = var_164; [L588] SORT_6 var_165_arg_1 = var_40; [L589] SORT_1 var_165 = var_165_arg_0 == var_165_arg_1; [L590] SORT_1 var_166_arg_0 = var_155; [L591] SORT_1 var_166_arg_1 = var_165; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_145=1, var_166_arg_0=1, var_166_arg_1=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L592] EXPR var_166_arg_0 | var_166_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_145=1, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L592] SORT_1 var_166 = var_166_arg_0 | var_166_arg_1; [L593] SORT_1 var_167_arg_0 = var_145; [L594] SORT_1 var_167_arg_1 = var_166; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_167_arg_0=1, var_167_arg_1=1, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L595] EXPR var_167_arg_0 ^ var_167_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L595] SORT_1 var_167 = var_167_arg_0 ^ var_167_arg_1; [L596] SORT_1 var_172_arg_0 = var_13; [L597] SORT_3 var_172_arg_1 = state_34; [L598] SORT_3 var_172_arg_2 = state_31; [L599] SORT_3 var_172 = var_172_arg_0 ? var_172_arg_1 : var_172_arg_2; [L600] SORT_1 var_171_arg_0 = var_13; [L601] SORT_3 var_171_arg_1 = state_27; [L602] SORT_3 var_171_arg_2 = state_24; [L603] SORT_3 var_171 = var_171_arg_0 ? var_171_arg_1 : var_171_arg_2; [L604] SORT_1 var_173_arg_0 = var_56; [L605] SORT_3 var_173_arg_1 = var_172; [L606] SORT_3 var_173_arg_2 = var_171; [L607] SORT_3 var_173 = var_173_arg_0 ? var_173_arg_1 : var_173_arg_2; [L608] SORT_1 var_169_arg_0 = var_13; [L609] SORT_3 var_169_arg_1 = state_19; [L610] SORT_3 var_169_arg_2 = state_16; [L611] SORT_3 var_169 = var_169_arg_0 ? var_169_arg_1 : var_169_arg_2; [L612] SORT_1 var_168_arg_0 = var_13; [L613] SORT_3 var_168_arg_1 = state_11; [L614] SORT_3 var_168_arg_2 = state_8; [L615] SORT_3 var_168 = var_168_arg_0 ? var_168_arg_1 : var_168_arg_2; [L616] SORT_1 var_170_arg_0 = var_56; [L617] SORT_3 var_170_arg_1 = var_169; [L618] SORT_3 var_170_arg_2 = var_168; [L619] SORT_3 var_170 = var_170_arg_0 ? var_170_arg_1 : var_170_arg_2; [L620] SORT_1 var_174_arg_0 = var_56; [L621] SORT_3 var_174_arg_1 = var_173; [L622] SORT_3 var_174_arg_2 = var_170; [L623] SORT_3 var_174 = var_174_arg_0 ? var_174_arg_1 : var_174_arg_2; [L624] SORT_3 var_175_arg_0 = var_174; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_167=0, var_175_arg_0=1, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L625] EXPR var_175_arg_0 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_167=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L625] var_175_arg_0 = var_175_arg_0 & mask_SORT_3 [L626] SORT_6 var_175 = var_175_arg_0; [L627] SORT_6 var_176_arg_0 = var_175; [L628] SORT_6 var_176_arg_1 = var_40; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_167=0, var_176_arg_0=0, var_176_arg_1=5, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L629] EXPR var_176_arg_0 & var_176_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_167=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L629] SORT_6 var_176 = var_176_arg_0 & var_176_arg_1; [L630] EXPR var_176 & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_167=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L630] var_176 = var_176 & mask_SORT_6 [L631] SORT_6 var_177_arg_0 = var_176; [L632] SORT_6 var_177_arg_1 = var_42; [L633] SORT_1 var_177 = var_177_arg_0 == var_177_arg_1; [L634] SORT_1 var_182_arg_0 = var_13; [L635] SORT_3 var_182_arg_1 = state_34; [L636] SORT_3 var_182_arg_2 = state_31; [L637] SORT_3 var_182 = var_182_arg_0 ? var_182_arg_1 : var_182_arg_2; [L638] SORT_1 var_181_arg_0 = var_13; [L639] SORT_3 var_181_arg_1 = state_27; [L640] SORT_3 var_181_arg_2 = state_24; [L641] SORT_3 var_181 = var_181_arg_0 ? var_181_arg_1 : var_181_arg_2; [L642] SORT_1 var_183_arg_0 = var_56; [L643] SORT_3 var_183_arg_1 = var_182; [L644] SORT_3 var_183_arg_2 = var_181; [L645] SORT_3 var_183 = var_183_arg_0 ? var_183_arg_1 : var_183_arg_2; [L646] SORT_1 var_179_arg_0 = var_13; [L647] SORT_3 var_179_arg_1 = state_19; [L648] SORT_3 var_179_arg_2 = state_16; [L649] SORT_3 var_179 = var_179_arg_0 ? var_179_arg_1 : var_179_arg_2; [L650] SORT_1 var_178_arg_0 = var_13; [L651] SORT_3 var_178_arg_1 = state_11; [L652] SORT_3 var_178_arg_2 = state_8; [L653] SORT_3 var_178 = var_178_arg_0 ? var_178_arg_1 : var_178_arg_2; [L654] SORT_1 var_180_arg_0 = var_56; [L655] SORT_3 var_180_arg_1 = var_179; [L656] SORT_3 var_180_arg_2 = var_178; [L657] SORT_3 var_180 = var_180_arg_0 ? var_180_arg_1 : var_180_arg_2; [L658] SORT_1 var_184_arg_0 = var_56; [L659] SORT_3 var_184_arg_1 = var_183; [L660] SORT_3 var_184_arg_2 = var_180; [L661] SORT_3 var_184 = var_184_arg_0 ? var_184_arg_1 : var_184_arg_2; [L662] SORT_3 var_185_arg_0 = var_184; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_167=0, var_177=0, var_185_arg_0=1, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L663] EXPR var_185_arg_0 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_167=0, var_177=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L663] var_185_arg_0 = var_185_arg_0 & mask_SORT_3 [L664] SORT_6 var_185 = var_185_arg_0; [L665] SORT_6 var_186_arg_0 = var_185; [L666] SORT_6 var_186_arg_1 = var_40; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_167=0, var_177=0, var_186_arg_0=0, var_186_arg_1=5, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L667] EXPR var_186_arg_0 & var_186_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_167=0, var_177=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L667] SORT_6 var_186 = var_186_arg_0 & var_186_arg_1; [L668] EXPR var_186 & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_167=0, var_177=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L668] var_186 = var_186 & mask_SORT_6 [L669] SORT_6 var_187_arg_0 = var_186; [L670] SORT_6 var_187_arg_1 = var_53; [L671] SORT_1 var_187 = var_187_arg_0 == var_187_arg_1; [L672] SORT_1 var_188_arg_0 = var_177; [L673] SORT_1 var_188_arg_1 = var_187; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_167=0, var_188_arg_0=0, var_188_arg_1=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L674] EXPR var_188_arg_0 | var_188_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_167=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L674] SORT_1 var_188 = var_188_arg_0 | var_188_arg_1; [L675] SORT_1 var_189_arg_0 = var_167; [L676] SORT_1 var_189_arg_1 = var_188; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_189_arg_0=0, var_189_arg_1=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L677] EXPR var_189_arg_0 ^ var_189_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L677] SORT_1 var_189 = var_189_arg_0 ^ var_189_arg_1; [L678] SORT_1 var_194_arg_0 = var_56; [L679] SORT_3 var_194_arg_1 = state_34; [L680] SORT_3 var_194_arg_2 = state_31; [L681] SORT_3 var_194 = var_194_arg_0 ? var_194_arg_1 : var_194_arg_2; [L682] SORT_1 var_193_arg_0 = var_56; [L683] SORT_3 var_193_arg_1 = state_27; [L684] SORT_3 var_193_arg_2 = state_24; [L685] SORT_3 var_193 = var_193_arg_0 ? var_193_arg_1 : var_193_arg_2; [L686] SORT_1 var_195_arg_0 = var_56; [L687] SORT_3 var_195_arg_1 = var_194; [L688] SORT_3 var_195_arg_2 = var_193; [L689] SORT_3 var_195 = var_195_arg_0 ? var_195_arg_1 : var_195_arg_2; [L690] SORT_1 var_191_arg_0 = var_56; [L691] SORT_3 var_191_arg_1 = state_19; [L692] SORT_3 var_191_arg_2 = state_16; [L693] SORT_3 var_191 = var_191_arg_0 ? var_191_arg_1 : var_191_arg_2; [L694] SORT_1 var_190_arg_0 = var_56; [L695] SORT_3 var_190_arg_1 = state_11; [L696] SORT_3 var_190_arg_2 = state_8; [L697] SORT_3 var_190 = var_190_arg_0 ? var_190_arg_1 : var_190_arg_2; [L698] SORT_1 var_192_arg_0 = var_56; [L699] SORT_3 var_192_arg_1 = var_191; [L700] SORT_3 var_192_arg_2 = var_190; [L701] SORT_3 var_192 = var_192_arg_0 ? var_192_arg_1 : var_192_arg_2; [L702] SORT_1 var_196_arg_0 = var_56; [L703] SORT_3 var_196_arg_1 = var_195; [L704] SORT_3 var_196_arg_2 = var_192; [L705] SORT_3 var_196 = var_196_arg_0 ? var_196_arg_1 : var_196_arg_2; [L706] SORT_3 var_197_arg_0 = var_196; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_189=0, var_197_arg_0=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L707] EXPR var_197_arg_0 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_189=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L707] var_197_arg_0 = var_197_arg_0 & mask_SORT_3 [L708] SORT_6 var_197 = var_197_arg_0; [L709] SORT_6 var_198_arg_0 = var_197; [L710] SORT_6 var_198_arg_1 = var_40; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_189=0, var_198_arg_0=0, var_198_arg_1=5, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L711] EXPR var_198_arg_0 & var_198_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_189=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L711] SORT_6 var_198 = var_198_arg_0 & var_198_arg_1; [L712] EXPR var_198 & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_189=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L712] var_198 = var_198 & mask_SORT_6 [L713] SORT_6 var_199_arg_0 = var_198; [L714] SORT_6 var_199_arg_1 = var_66; [L715] SORT_1 var_199 = var_199_arg_0 == var_199_arg_1; [L716] SORT_1 var_204_arg_0 = var_56; [L717] SORT_3 var_204_arg_1 = state_34; [L718] SORT_3 var_204_arg_2 = state_31; [L719] SORT_3 var_204 = var_204_arg_0 ? var_204_arg_1 : var_204_arg_2; [L720] SORT_1 var_203_arg_0 = var_56; [L721] SORT_3 var_203_arg_1 = state_27; [L722] SORT_3 var_203_arg_2 = state_24; [L723] SORT_3 var_203 = var_203_arg_0 ? var_203_arg_1 : var_203_arg_2; [L724] SORT_1 var_205_arg_0 = var_56; [L725] SORT_3 var_205_arg_1 = var_204; [L726] SORT_3 var_205_arg_2 = var_203; [L727] SORT_3 var_205 = var_205_arg_0 ? var_205_arg_1 : var_205_arg_2; [L728] SORT_1 var_201_arg_0 = var_56; [L729] SORT_3 var_201_arg_1 = state_19; [L730] SORT_3 var_201_arg_2 = state_16; [L731] SORT_3 var_201 = var_201_arg_0 ? var_201_arg_1 : var_201_arg_2; [L732] SORT_1 var_200_arg_0 = var_56; [L733] SORT_3 var_200_arg_1 = state_11; [L734] SORT_3 var_200_arg_2 = state_8; [L735] SORT_3 var_200 = var_200_arg_0 ? var_200_arg_1 : var_200_arg_2; [L736] SORT_1 var_202_arg_0 = var_56; [L737] SORT_3 var_202_arg_1 = var_201; [L738] SORT_3 var_202_arg_2 = var_200; [L739] SORT_3 var_202 = var_202_arg_0 ? var_202_arg_1 : var_202_arg_2; [L740] SORT_1 var_206_arg_0 = var_56; [L741] SORT_3 var_206_arg_1 = var_205; [L742] SORT_3 var_206_arg_2 = var_202; [L743] SORT_3 var_206 = var_206_arg_0 ? var_206_arg_1 : var_206_arg_2; [L744] SORT_3 var_207_arg_0 = var_206; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_189=0, var_199=1, var_207_arg_0=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L745] EXPR var_207_arg_0 & mask_SORT_3 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_189=0, var_199=1, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L745] var_207_arg_0 = var_207_arg_0 & mask_SORT_3 [L746] SORT_6 var_207 = var_207_arg_0; [L747] SORT_6 var_208_arg_0 = var_207; [L748] SORT_6 var_208_arg_1 = var_40; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_189=0, var_199=1, var_208_arg_0=0, var_208_arg_1=5, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L749] EXPR var_208_arg_0 & var_208_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_189=0, var_199=1, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L749] SORT_6 var_208 = var_208_arg_0 & var_208_arg_1; [L750] EXPR var_208 & mask_SORT_6 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_189=0, var_199=1, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L750] var_208 = var_208 & mask_SORT_6 [L751] SORT_6 var_209_arg_0 = var_208; [L752] SORT_6 var_209_arg_1 = var_40; [L753] SORT_1 var_209 = var_209_arg_0 == var_209_arg_1; [L754] SORT_1 var_210_arg_0 = var_199; [L755] SORT_1 var_210_arg_1 = var_209; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_189=0, var_210_arg_0=1, var_210_arg_1=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L756] EXPR var_210_arg_0 | var_210_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_189=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L756] SORT_1 var_210 = var_210_arg_0 | var_210_arg_1; [L757] SORT_1 var_211_arg_0 = var_189; [L758] SORT_1 var_211_arg_1 = var_210; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_211_arg_0=0, var_211_arg_1=1, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L759] EXPR var_211_arg_0 ^ var_211_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L759] SORT_1 var_211 = var_211_arg_0 ^ var_211_arg_1; [L760] SORT_1 var_212_arg_0 = var_211; [L761] SORT_1 var_212 = ~var_212_arg_0; [L762] SORT_1 var_215_arg_0 = var_212; [L763] SORT_1 var_215 = ~var_215_arg_0; [L764] SORT_1 var_216_arg_0 = var_56; [L765] SORT_1 var_216_arg_1 = var_215; VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_216_arg_0=1, var_216_arg_1=-255, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L766] EXPR var_216_arg_0 & var_216_arg_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L766] SORT_1 var_216 = var_216_arg_0 & var_216_arg_1; [L767] EXPR var_216 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_235=3, mask_SORT_3=7, mask_SORT_6=-1, state_11=6, state_16=5, state_19=4, state_218=0, state_222=0, state_24=3, state_27=2, state_31=1, state_34=0, state_8=7, var_13=0, var_244=0, var_246=1, var_255=2, var_261=3, var_33=0, var_40=5, var_42=1, var_53=4, var_56=1, var_66=0, var_7=7] [L767] var_216 = var_216 & mask_SORT_1 [L768] SORT_1 bad_217_arg_0 = var_216; [L769] CALL __VERIFIER_assert(!(bad_217_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1041 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 295.2s, OverallIterations: 69, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 28.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 81900 SdHoareTripleChecker+Valid, 23.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 81900 mSDsluCounter, 472029 SdHoareTripleChecker+Invalid, 20.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 371284 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24000 IncrementalHoareTripleChecker+Invalid, 24066 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 100745 mSDtfsCounter, 24000 mSolverCounterSat, 0.9s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 594 GetRequests, 173 SyntacticMatches, 1 SemanticMatches, 420 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2227occurred in iteration=64, InterpolantAutomatonStates: 419, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 68 MinimizatonAttempts, 14957 StatesRemovedByMinimization, 54 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.1s SsaConstructionTime, 179.7s SatisfiabilityAnalysisTime, 74.3s InterpolantComputationTime, 12498 NumberOfCodeBlocks, 12498 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 12234 ConstructedInterpolants, 0 QuantifiedInterpolants, 53043 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 68 InterpolantComputations, 68 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-27 20:14:39,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB --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 64bit --witnessprinter.graph.data.programhash 8026e8fad442d359c5ad25f6b8e6c64a8eb4f5fda678822051ba0bded2a5b47e --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:14:41,762 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:14:41,890 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-27 20:14:41,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:14:41,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:14:41,935 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:14:41,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:14:41,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:14:41,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 20:14:41,938 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 20:14:41,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:14:41,939 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:14:41,940 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:14:41,940 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:14:41,940 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:14:41,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:14:41,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:14:41,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:14:41,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:14:41,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:14:41,941 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:14:41,942 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 20:14:41,942 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 20:14:41,942 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 20:14:41,942 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:14:41,942 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:14:41,942 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:14:41,942 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:14:41,942 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:14:41,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:14:41,943 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:14:41,943 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:14:41,943 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:14:41,943 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:14:41,943 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 20:14:41,945 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:14:41,945 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:14:41,945 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:14:41,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:14:41,945 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:14:41,945 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:14:41,945 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 20:14:41,946 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 20:14:41,946 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:14:41,946 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:14:41,946 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:14:41,946 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:14:41,946 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8026e8fad442d359c5ad25f6b8e6c64a8eb4f5fda678822051ba0bded2a5b47e [2024-11-27 20:14:42,288 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:14:42,297 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:14:42,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:14:42,300 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:14:42,301 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:14:42,302 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c [2024-11-27 20:14:45,289 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/data/68f8dd73b/dbda888086e04de3ab68adc604b97d07/FLAGd494430d7 [2024-11-27 20:14:45,684 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:14:45,684 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c [2024-11-27 20:14:45,717 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/data/68f8dd73b/dbda888086e04de3ab68adc604b97d07/FLAGd494430d7 [2024-11-27 20:14:45,739 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/data/68f8dd73b/dbda888086e04de3ab68adc604b97d07 [2024-11-27 20:14:45,741 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:14:45,743 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:14:45,745 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:14:45,745 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:14:45,754 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:14:45,755 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:14:45" (1/1) ... [2024-11-27 20:14:45,755 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52ee13e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:45, skipping insertion in model container [2024-11-27 20:14:45,756 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:14:45" (1/1) ... [2024-11-27 20:14:45,825 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:14:46,042 WARN L250 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_48ad991a-e05c-4675-91bc-47fb318e8564/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c[1257,1270] [2024-11-27 20:14:46,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:14:46,419 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:14:46,432 WARN L250 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_48ad991a-e05c-4675-91bc-47fb318e8564/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vis_arrays_two_p2.c[1257,1270] [2024-11-27 20:14:46,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:14:46,617 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:14:46,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:46 WrapperNode [2024-11-27 20:14:46,618 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:14:46,620 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:14:46,620 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:14:46,620 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:14:46,626 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:46" (1/1) ... [2024-11-27 20:14:46,664 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:46" (1/1) ... [2024-11-27 20:14:46,783 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1634 [2024-11-27 20:14:46,783 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:14:46,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:14:46,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:14:46,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:14:46,794 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:46" (1/1) ... [2024-11-27 20:14:46,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:46" (1/1) ... [2024-11-27 20:14:46,814 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:46" (1/1) ... [2024-11-27 20:14:46,867 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-27 20:14:46,871 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:46" (1/1) ... [2024-11-27 20:14:46,871 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:46" (1/1) ... [2024-11-27 20:14:46,922 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:46" (1/1) ... [2024-11-27 20:14:46,930 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:46" (1/1) ... [2024-11-27 20:14:46,935 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:46" (1/1) ... [2024-11-27 20:14:46,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:46" (1/1) ... [2024-11-27 20:14:46,960 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:46" (1/1) ... [2024-11-27 20:14:46,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:14:46,984 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:14:46,984 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:14:46,984 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:14:46,985 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:46" (1/1) ... [2024-11-27 20:14:46,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:14:47,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:47,026 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:14:47,034 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:14:47,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:14:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 20:14:47,064 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:14:47,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:14:47,451 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:14:47,456 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:14:50,655 INFO L? ?]: Removed 660 outVars from TransFormulas that were not future-live. [2024-11-27 20:14:50,655 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:14:50,664 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:14:50,665 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-27 20:14:50,665 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:14:50 BoogieIcfgContainer [2024-11-27 20:14:50,665 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:14:50,667 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:14:50,669 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:14:50,674 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:14:50,674 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:14:45" (1/3) ... [2024-11-27 20:14:50,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622ebcf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:14:50, skipping insertion in model container [2024-11-27 20:14:50,675 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:14:46" (2/3) ... [2024-11-27 20:14:50,675 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622ebcf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:14:50, skipping insertion in model container [2024-11-27 20:14:50,676 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:14:50" (3/3) ... [2024-11-27 20:14:50,678 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vis_arrays_two_p2.c [2024-11-27 20:14:50,693 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:14:50,695 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.vis_arrays_two_p2.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 20:14:50,753 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:14:50,768 INFO L333 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, 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;@153d70d0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:14:50,770 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 20:14:50,773 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:50,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-27 20:14:50,779 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:50,780 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-27 20:14:50,780 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:50,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:50,787 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-27 20:14:50,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:14:50,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1528298386] [2024-11-27 20:14:50,805 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:50,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:50,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:50,811 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:50,813 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 20:14:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:14:51,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 290 conjuncts are in the unsatisfiable core [2024-11-27 20:14:51,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 20:14:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:14:59,397 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 20:14:59,397 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 20:14:59,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1528298386] [2024-11-27 20:14:59,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1528298386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:14:59,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:14:59,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 20:14:59,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676964660] [2024-11-27 20:14:59,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:14:59,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 20:14:59,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 20:14:59,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 20:14:59,424 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 20:14:59,426 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:59,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 20:14:59,738 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-27 20:14:59,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 20:14:59,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-27 20:14:59,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 20:14:59,746 INFO L225 Difference]: With dead ends: 18 [2024-11-27 20:14:59,747 INFO L226 Difference]: Without dead ends: 10 [2024-11-27 20:14:59,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:14:59,752 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 20:14:59,753 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 20:14:59,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-27 20:14:59,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-27 20:14:59,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:59,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-27 20:14:59,782 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-27 20:14:59,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 20:14:59,782 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-27 20:14:59,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:14:59,783 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-27 20:14:59,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-27 20:14:59,783 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 20:14:59,783 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-27 20:14:59,799 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-27 20:14:59,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:59,988 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 20:14:59,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:14:59,988 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-27 20:14:59,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 20:14:59,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [808443804] [2024-11-27 20:14:59,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:14:59,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 20:14:59,992 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:14:59,994 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 20:14:59,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_48ad991a-e05c-4675-91bc-47fb318e8564/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 20:15:01,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:15:01,139 INFO L256 TraceCheckSpWp]: Trace formula consists of 1333 conjuncts, 351 conjuncts are in the unsatisfiable core [2024-11-27 20:15:01,190 INFO L279 TraceCheckSpWp]: Computing forward predicates...