./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.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_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/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_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/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_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/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 6b894aafaf217d6baa0c5f761ec3f51539bf2a720cb529b8ece9095e2a660f16 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 19:50:37,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 19:50:37,240 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-27 19:50:37,248 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 19:50:37,248 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 19:50:37,287 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 19:50:37,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 19:50:37,289 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 19:50:37,289 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 19:50:37,290 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 19:50:37,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 19:50:37,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 19:50:37,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 19:50:37,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 19:50:37,292 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 19:50:37,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 19:50:37,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 19:50:37,293 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 19:50:37,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 19:50:37,293 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 19:50:37,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 19:50:37,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 19:50:37,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 19:50:37,293 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 19:50:37,293 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 19:50:37,293 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 19:50:37,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:50:37,293 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:50:37,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:50:37,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:37,294 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 19:50:37,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:50:37,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:50:37,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:50:37,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:37,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 19:50:37,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 19:50:37,295 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 19:50:37,295 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 19:50:37,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 19:50:37,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 19:50:37,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 19:50:37,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 19:50:37,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 19:50:37,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 19:50:37,296 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_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/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 -> 6b894aafaf217d6baa0c5f761ec3f51539bf2a720cb529b8ece9095e2a660f16 [2024-11-27 19:50:37,620 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 19:50:37,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 19:50:37,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 19:50:37,639 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 19:50:37,640 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 19:50:37,642 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c [2024-11-27 19:50:40,602 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/data/026060636/3bcd29e3aad240db95f7ead795656417/FLAGe802763a1 [2024-11-27 19:50:40,949 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 19:50:40,949 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c [2024-11-27 19:50:40,972 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/data/026060636/3bcd29e3aad240db95f7ead795656417/FLAGe802763a1 [2024-11-27 19:50:41,187 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/data/026060636/3bcd29e3aad240db95f7ead795656417 [2024-11-27 19:50:41,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 19:50:41,191 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 19:50:41,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 19:50:41,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 19:50:41,198 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 19:50:41,199 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:50:41" (1/1) ... [2024-11-27 19:50:41,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ca7ef00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:41, skipping insertion in model container [2024-11-27 19:50:41,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:50:41" (1/1) ... [2024-11-27 19:50:41,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 19:50:41,463 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_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c[1249,1262] [2024-11-27 19:50:41,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:50:41,859 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 19:50:41,870 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_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c[1249,1262] [2024-11-27 19:50:42,093 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:50:42,109 INFO L204 MainTranslator]: Completed translation [2024-11-27 19:50:42,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:42 WrapperNode [2024-11-27 19:50:42,110 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 19:50:42,111 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 19:50:42,111 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 19:50:42,112 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 19:50:42,120 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:42" (1/1) ... [2024-11-27 19:50:42,177 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:42" (1/1) ... [2024-11-27 19:50:42,381 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2217 [2024-11-27 19:50:42,382 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 19:50:42,382 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 19:50:42,383 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 19:50:42,383 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 19:50:42,392 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:42" (1/1) ... [2024-11-27 19:50:42,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:42" (1/1) ... [2024-11-27 19:50:42,434 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:42" (1/1) ... [2024-11-27 19:50:42,587 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 19:50:42,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:42" (1/1) ... [2024-11-27 19:50:42,587 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:42" (1/1) ... [2024-11-27 19:50:42,660 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:42" (1/1) ... [2024-11-27 19:50:42,675 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:42" (1/1) ... [2024-11-27 19:50:42,684 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:42" (1/1) ... [2024-11-27 19:50:42,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:42" (1/1) ... [2024-11-27 19:50:42,719 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:42" (1/1) ... [2024-11-27 19:50:42,753 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 19:50:42,754 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 19:50:42,754 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 19:50:42,754 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 19:50:42,755 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:42" (1/1) ... [2024-11-27 19:50:42,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:42,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:50:42,786 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 19:50:42,789 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 19:50:42,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 19:50:42,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-27 19:50:42,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 19:50:42,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 19:50:43,276 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 19:50:43,278 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 19:50:45,896 INFO L? ?]: Removed 1503 outVars from TransFormulas that were not future-live. [2024-11-27 19:50:45,897 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 19:50:45,918 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 19:50:45,921 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-27 19:50:45,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:50:45 BoogieIcfgContainer [2024-11-27 19:50:45,922 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 19:50:45,924 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 19:50:45,924 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 19:50:45,929 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 19:50:45,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 07:50:41" (1/3) ... [2024-11-27 19:50:45,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db7c224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:50:45, skipping insertion in model container [2024-11-27 19:50:45,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:42" (2/3) ... [2024-11-27 19:50:45,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db7c224 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:50:45, skipping insertion in model container [2024-11-27 19:50:45,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:50:45" (3/3) ... [2024-11-27 19:50:45,931 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Vending.c [2024-11-27 19:50:45,948 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 19:50:45,950 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_Vending.c that has 1 procedures, 326 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 19:50:46,030 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 19:50:46,044 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;@cd0c448, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 19:50:46,045 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 19:50:46,052 INFO L276 IsEmpty]: Start isEmpty. Operand has 326 states, 324 states have (on average 1.4969135802469136) internal successors, (485), 325 states have internal predecessors, (485), 0 states have call successors, (0), 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 19:50:46,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-27 19:50:46,064 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:46,065 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] [2024-11-27 19:50:46,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:46,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:46,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1351493187, now seen corresponding path program 1 times [2024-11-27 19:50:46,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:46,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304371819] [2024-11-27 19:50:46,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:46,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:46,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:48,316 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 19:50:48,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:48,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304371819] [2024-11-27 19:50:48,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304371819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:48,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:48,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:50:48,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327112754] [2024-11-27 19:50:48,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:48,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:50:48,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:48,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:50:48,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:50:48,356 INFO L87 Difference]: Start difference. First operand has 326 states, 324 states have (on average 1.4969135802469136) internal successors, (485), 325 states have internal predecessors, (485), 0 states have call successors, (0), 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 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 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 19:50:48,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:48,551 INFO L93 Difference]: Finished difference Result 619 states and 924 transitions. [2024-11-27 19:50:48,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:50:48,553 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-11-27 19:50:48,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:48,569 INFO L225 Difference]: With dead ends: 619 [2024-11-27 19:50:48,569 INFO L226 Difference]: Without dead ends: 327 [2024-11-27 19:50:48,575 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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 19:50:48,581 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 395 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 1418 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:48,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 1418 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:50:48,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2024-11-27 19:50:48,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 326. [2024-11-27 19:50:48,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 325 states have (on average 1.4892307692307691) internal successors, (484), 325 states have internal predecessors, (484), 0 states have call successors, (0), 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 19:50:48,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 484 transitions. [2024-11-27 19:50:48,652 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 484 transitions. Word has length 99 [2024-11-27 19:50:48,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:48,653 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 484 transitions. [2024-11-27 19:50:48,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 0 states have call successors, (0), 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 19:50:48,654 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 484 transitions. [2024-11-27 19:50:48,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-27 19:50:48,657 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:48,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] [2024-11-27 19:50:48,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 19:50:48,657 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:48,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:48,658 INFO L85 PathProgramCache]: Analyzing trace with hash 845651071, now seen corresponding path program 1 times [2024-11-27 19:50:48,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:48,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529067405] [2024-11-27 19:50:48,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:48,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:48,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:49,336 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 19:50:49,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:49,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529067405] [2024-11-27 19:50:49,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529067405] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:49,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:49,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 19:50:49,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161767934] [2024-11-27 19:50:49,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:49,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 19:50:49,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:49,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 19:50:49,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:50:49,343 INFO L87 Difference]: Start difference. First operand 326 states and 484 transitions. Second operand has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 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 19:50:49,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:49,458 INFO L93 Difference]: Finished difference Result 640 states and 951 transitions. [2024-11-27 19:50:49,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:50:49,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2024-11-27 19:50:49,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:49,460 INFO L225 Difference]: With dead ends: 640 [2024-11-27 19:50:49,460 INFO L226 Difference]: Without dead ends: 348 [2024-11-27 19:50:49,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:50:49,465 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 20 mSDsluCounter, 1894 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 2372 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:49,465 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 2372 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:50:49,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-27 19:50:49,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2024-11-27 19:50:49,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 347 states have (on average 1.4870317002881845) internal successors, (516), 347 states have internal predecessors, (516), 0 states have call successors, (0), 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 19:50:49,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 516 transitions. [2024-11-27 19:50:49,480 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 516 transitions. Word has length 100 [2024-11-27 19:50:49,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:49,481 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 516 transitions. [2024-11-27 19:50:49,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.666666666666668) internal successors, (100), 6 states have internal predecessors, (100), 0 states have call successors, (0), 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 19:50:49,481 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 516 transitions. [2024-11-27 19:50:49,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-27 19:50:49,484 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:49,484 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] [2024-11-27 19:50:49,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 19:50:49,484 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:49,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:49,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1922552128, now seen corresponding path program 1 times [2024-11-27 19:50:49,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:49,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849390461] [2024-11-27 19:50:49,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:49,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:49,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:50,216 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 19:50:50,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:50,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849390461] [2024-11-27 19:50:50,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849390461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:50,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:50,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:50:50,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622308565] [2024-11-27 19:50:50,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:50,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:50:50,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:50,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:50:50,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:50:50,219 INFO L87 Difference]: Start difference. First operand 348 states and 516 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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 19:50:50,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:50,257 INFO L93 Difference]: Finished difference Result 352 states and 520 transitions. [2024-11-27 19:50:50,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:50:50,257 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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 101 [2024-11-27 19:50:50,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:50,259 INFO L225 Difference]: With dead ends: 352 [2024-11-27 19:50:50,259 INFO L226 Difference]: Without dead ends: 350 [2024-11-27 19:50:50,260 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 19:50:50,260 INFO L435 NwaCegarLoop]: 479 mSDtfsCounter, 0 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1431 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 19:50:50,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1431 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:50:50,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2024-11-27 19:50:50,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2024-11-27 19:50:50,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 349 states have (on average 1.484240687679083) internal successors, (518), 349 states have internal predecessors, (518), 0 states have call successors, (0), 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 19:50:50,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 518 transitions. [2024-11-27 19:50:50,275 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 518 transitions. Word has length 101 [2024-11-27 19:50:50,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:50,275 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 518 transitions. [2024-11-27 19:50:50,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 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 19:50:50,276 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 518 transitions. [2024-11-27 19:50:50,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-27 19:50:50,278 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:50,279 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] [2024-11-27 19:50:50,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 19:50:50,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:50,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:50,280 INFO L85 PathProgramCache]: Analyzing trace with hash 532121940, now seen corresponding path program 1 times [2024-11-27 19:50:50,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:50,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495306200] [2024-11-27 19:50:50,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:50,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:50,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:51,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 19:50:51,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:51,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495306200] [2024-11-27 19:50:51,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495306200] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:51,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:51,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 19:50:51,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150447214] [2024-11-27 19:50:51,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:51,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 19:50:51,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:51,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 19:50:51,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:50:51,833 INFO L87 Difference]: Start difference. First operand 350 states and 518 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 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 19:50:52,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:52,632 INFO L93 Difference]: Finished difference Result 981 states and 1453 transitions. [2024-11-27 19:50:52,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:50:52,633 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2024-11-27 19:50:52,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:52,637 INFO L225 Difference]: With dead ends: 981 [2024-11-27 19:50:52,637 INFO L226 Difference]: Without dead ends: 665 [2024-11-27 19:50:52,638 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-27 19:50:52,639 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 1274 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:52,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 1807 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-27 19:50:52,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-27 19:50:52,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 467. [2024-11-27 19:50:52,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 466 states have (on average 1.4849785407725322) internal successors, (692), 466 states have internal predecessors, (692), 0 states have call successors, (0), 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 19:50:52,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 692 transitions. [2024-11-27 19:50:52,659 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 692 transitions. Word has length 102 [2024-11-27 19:50:52,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:52,659 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 692 transitions. [2024-11-27 19:50:52,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 7 states have internal predecessors, (102), 0 states have call successors, (0), 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 19:50:52,660 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 692 transitions. [2024-11-27 19:50:52,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-27 19:50:52,662 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:52,663 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] [2024-11-27 19:50:52,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 19:50:52,663 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:52,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:52,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1687514873, now seen corresponding path program 1 times [2024-11-27 19:50:52,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:52,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732106938] [2024-11-27 19:50:52,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:52,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:53,488 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 19:50:53,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:53,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732106938] [2024-11-27 19:50:53,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732106938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:53,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:53,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:50:53,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588824421] [2024-11-27 19:50:53,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:53,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:50:53,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:53,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:50:53,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:50:53,490 INFO L87 Difference]: Start difference. First operand 467 states and 692 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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 19:50:53,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:53,561 INFO L93 Difference]: Finished difference Result 789 states and 1170 transitions. [2024-11-27 19:50:53,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:50:53,562 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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 103 [2024-11-27 19:50:53,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:53,564 INFO L225 Difference]: With dead ends: 789 [2024-11-27 19:50:53,564 INFO L226 Difference]: Without dead ends: 473 [2024-11-27 19:50:53,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:50:53,565 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 17 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 1423 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:53,568 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 1423 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:50:53,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-11-27 19:50:53,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 473. [2024-11-27 19:50:53,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 472 states have (on average 1.478813559322034) internal successors, (698), 472 states have internal predecessors, (698), 0 states have call successors, (0), 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 19:50:53,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 698 transitions. [2024-11-27 19:50:53,596 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 698 transitions. Word has length 103 [2024-11-27 19:50:53,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:53,596 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 698 transitions. [2024-11-27 19:50:53,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 0 states have call successors, (0), 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 19:50:53,596 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 698 transitions. [2024-11-27 19:50:53,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-11-27 19:50:53,604 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:53,604 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] [2024-11-27 19:50:53,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 19:50:53,604 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:53,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:53,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2145927774, now seen corresponding path program 1 times [2024-11-27 19:50:53,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:53,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409596118] [2024-11-27 19:50:53,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:53,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:53,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:55,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 19:50:55,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:55,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409596118] [2024-11-27 19:50:55,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409596118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:55,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:55,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 19:50:55,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090081707] [2024-11-27 19:50:55,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:55,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 19:50:55,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:55,736 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 19:50:55,736 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-27 19:50:55,737 INFO L87 Difference]: Start difference. First operand 473 states and 698 transitions. Second operand has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 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 19:50:56,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:56,180 INFO L93 Difference]: Finished difference Result 868 states and 1280 transitions. [2024-11-27 19:50:56,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 19:50:56,183 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2024-11-27 19:50:56,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:56,185 INFO L225 Difference]: With dead ends: 868 [2024-11-27 19:50:56,185 INFO L226 Difference]: Without dead ends: 505 [2024-11-27 19:50:56,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-27 19:50:56,189 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 466 mSDsluCounter, 3163 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 3617 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:56,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 3617 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 19:50:56,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-27 19:50:56,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 497. [2024-11-27 19:50:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 496 states have (on average 1.4798387096774193) internal successors, (734), 496 states have internal predecessors, (734), 0 states have call successors, (0), 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 19:50:56,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 734 transitions. [2024-11-27 19:50:56,215 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 734 transitions. Word has length 104 [2024-11-27 19:50:56,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:56,217 INFO L471 AbstractCegarLoop]: Abstraction has 497 states and 734 transitions. [2024-11-27 19:50:56,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.4) internal successors, (104), 10 states have internal predecessors, (104), 0 states have call successors, (0), 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 19:50:56,217 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 734 transitions. [2024-11-27 19:50:56,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-27 19:50:56,220 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:56,220 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] [2024-11-27 19:50:56,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 19:50:56,220 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:56,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:56,221 INFO L85 PathProgramCache]: Analyzing trace with hash -845179228, now seen corresponding path program 1 times [2024-11-27 19:50:56,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:56,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026396660] [2024-11-27 19:50:56,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:56,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:56,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:57,410 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 19:50:57,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:57,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026396660] [2024-11-27 19:50:57,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2026396660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:57,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:57,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 19:50:57,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731000685] [2024-11-27 19:50:57,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:57,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 19:50:57,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:57,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 19:50:57,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 19:50:57,412 INFO L87 Difference]: Start difference. First operand 497 states and 734 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 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 19:50:57,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:57,575 INFO L93 Difference]: Finished difference Result 898 states and 1324 transitions. [2024-11-27 19:50:57,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:50:57,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-11-27 19:50:57,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:57,578 INFO L225 Difference]: With dead ends: 898 [2024-11-27 19:50:57,578 INFO L226 Difference]: Without dead ends: 523 [2024-11-27 19:50:57,578 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-27 19:50:57,580 INFO L435 NwaCegarLoop]: 466 mSDtfsCounter, 7 mSDsluCounter, 2319 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2785 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 19:50:57,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2785 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:50:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-11-27 19:50:57,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 519. [2024-11-27 19:50:57,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 519 states, 518 states have (on average 1.4787644787644787) internal successors, (766), 518 states have internal predecessors, (766), 0 states have call successors, (0), 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 19:50:57,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 519 states to 519 states and 766 transitions. [2024-11-27 19:50:57,601 INFO L78 Accepts]: Start accepts. Automaton has 519 states and 766 transitions. Word has length 105 [2024-11-27 19:50:57,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:57,601 INFO L471 AbstractCegarLoop]: Abstraction has 519 states and 766 transitions. [2024-11-27 19:50:57,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 8 states have internal predecessors, (105), 0 states have call successors, (0), 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 19:50:57,601 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 766 transitions. [2024-11-27 19:50:57,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-27 19:50:57,603 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:57,603 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] [2024-11-27 19:50:57,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 19:50:57,603 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:57,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:57,604 INFO L85 PathProgramCache]: Analyzing trace with hash -720329080, now seen corresponding path program 1 times [2024-11-27 19:50:57,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:57,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174726121] [2024-11-27 19:50:57,604 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:57,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:58,165 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 19:50:58,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:58,165 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174726121] [2024-11-27 19:50:58,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174726121] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:58,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:58,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:50:58,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483237618] [2024-11-27 19:50:58,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:58,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:50:58,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:58,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:50:58,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:50:58,169 INFO L87 Difference]: Start difference. First operand 519 states and 766 transitions. Second operand has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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 19:50:58,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:58,474 INFO L93 Difference]: Finished difference Result 935 states and 1379 transitions. [2024-11-27 19:50:58,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:50:58,475 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-11-27 19:50:58,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:58,478 INFO L225 Difference]: With dead ends: 935 [2024-11-27 19:50:58,478 INFO L226 Difference]: Without dead ends: 527 [2024-11-27 19:50:58,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 19:50:58,482 INFO L435 NwaCegarLoop]: 400 mSDtfsCounter, 438 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:58,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 1193 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 19:50:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2024-11-27 19:50:58,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 525. [2024-11-27 19:50:58,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 525 states, 524 states have (on average 1.4770992366412214) internal successors, (774), 524 states have internal predecessors, (774), 0 states have call successors, (0), 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 19:50:58,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 525 states to 525 states and 774 transitions. [2024-11-27 19:50:58,506 INFO L78 Accepts]: Start accepts. Automaton has 525 states and 774 transitions. Word has length 105 [2024-11-27 19:50:58,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:58,507 INFO L471 AbstractCegarLoop]: Abstraction has 525 states and 774 transitions. [2024-11-27 19:50:58,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.0) internal successors, (105), 5 states have internal predecessors, (105), 0 states have call successors, (0), 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 19:50:58,507 INFO L276 IsEmpty]: Start isEmpty. Operand 525 states and 774 transitions. [2024-11-27 19:50:58,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-27 19:50:58,512 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:58,512 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] [2024-11-27 19:50:58,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 19:50:58,512 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:50:58,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:58,513 INFO L85 PathProgramCache]: Analyzing trace with hash -2136993919, now seen corresponding path program 1 times [2024-11-27 19:50:58,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:58,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186385003] [2024-11-27 19:50:58,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:58,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:00,231 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 19:51:00,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:00,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186385003] [2024-11-27 19:51:00,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186385003] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:00,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:00,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 19:51:00,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242062925] [2024-11-27 19:51:00,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:00,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 19:51:00,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:00,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 19:51:00,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-27 19:51:00,238 INFO L87 Difference]: Start difference. First operand 525 states and 774 transitions. Second operand has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 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 19:51:01,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:01,228 INFO L93 Difference]: Finished difference Result 1235 states and 1807 transitions. [2024-11-27 19:51:01,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 19:51:01,229 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2024-11-27 19:51:01,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:01,233 INFO L225 Difference]: With dead ends: 1235 [2024-11-27 19:51:01,234 INFO L226 Difference]: Without dead ends: 850 [2024-11-27 19:51:01,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-27 19:51:01,237 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 970 mSDsluCounter, 3017 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 970 SdHoareTripleChecker+Valid, 3633 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:01,237 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [970 Valid, 3633 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-27 19:51:01,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 850 states. [2024-11-27 19:51:01,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 850 to 570. [2024-11-27 19:51:01,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 570 states, 569 states have (on average 1.4745166959578206) internal successors, (839), 569 states have internal predecessors, (839), 0 states have call successors, (0), 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 19:51:01,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 839 transitions. [2024-11-27 19:51:01,262 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 839 transitions. Word has length 106 [2024-11-27 19:51:01,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:01,262 INFO L471 AbstractCegarLoop]: Abstraction has 570 states and 839 transitions. [2024-11-27 19:51:01,263 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.777777777777779) internal successors, (106), 9 states have internal predecessors, (106), 0 states have call successors, (0), 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 19:51:01,263 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 839 transitions. [2024-11-27 19:51:01,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-27 19:51:01,265 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:01,265 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] [2024-11-27 19:51:01,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 19:51:01,265 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:01,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:01,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1738447973, now seen corresponding path program 1 times [2024-11-27 19:51:01,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:01,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273267024] [2024-11-27 19:51:01,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:01,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:02,567 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 19:51:02,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:02,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273267024] [2024-11-27 19:51:02,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273267024] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:02,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:02,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-27 19:51:02,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364831483] [2024-11-27 19:51:02,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:02,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-27 19:51:02,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:02,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-27 19:51:02,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-11-27 19:51:02,569 INFO L87 Difference]: Start difference. First operand 570 states and 839 transitions. Second operand has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 0 states have call successors, (0), 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 19:51:03,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:03,897 INFO L93 Difference]: Finished difference Result 1228 states and 1802 transitions. [2024-11-27 19:51:03,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 19:51:03,898 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2024-11-27 19:51:03,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:03,901 INFO L225 Difference]: With dead ends: 1228 [2024-11-27 19:51:03,902 INFO L226 Difference]: Without dead ends: 711 [2024-11-27 19:51:03,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2024-11-27 19:51:03,904 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 1138 mSDsluCounter, 5072 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 5497 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:03,905 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 5497 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-27 19:51:03,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2024-11-27 19:51:03,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 597. [2024-11-27 19:51:03,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.471476510067114) internal successors, (877), 596 states have internal predecessors, (877), 0 states have call successors, (0), 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 19:51:03,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 877 transitions. [2024-11-27 19:51:03,925 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 877 transitions. Word has length 106 [2024-11-27 19:51:03,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:03,925 INFO L471 AbstractCegarLoop]: Abstraction has 597 states and 877 transitions. [2024-11-27 19:51:03,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 7.066666666666666) internal successors, (106), 15 states have internal predecessors, (106), 0 states have call successors, (0), 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 19:51:03,926 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 877 transitions. [2024-11-27 19:51:03,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-27 19:51:03,927 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:03,927 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] [2024-11-27 19:51:03,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 19:51:03,928 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:03,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:03,928 INFO L85 PathProgramCache]: Analyzing trace with hash -649953321, now seen corresponding path program 1 times [2024-11-27 19:51:03,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:03,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564533975] [2024-11-27 19:51:03,929 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:03,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:04,445 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 19:51:04,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:04,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564533975] [2024-11-27 19:51:04,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564533975] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:04,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:04,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 19:51:04,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461355868] [2024-11-27 19:51:04,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:04,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 19:51:04,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:04,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 19:51:04,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:51:04,447 INFO L87 Difference]: Start difference. First operand 597 states and 877 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 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 19:51:04,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:04,677 INFO L93 Difference]: Finished difference Result 1138 states and 1672 transitions. [2024-11-27 19:51:04,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 19:51:04,677 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-11-27 19:51:04,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:04,680 INFO L225 Difference]: With dead ends: 1138 [2024-11-27 19:51:04,680 INFO L226 Difference]: Without dead ends: 600 [2024-11-27 19:51:04,688 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 19:51:04,688 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 454 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1768 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:04,688 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1768 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 19:51:04,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-27 19:51:04,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2024-11-27 19:51:04,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.4641068447412353) internal successors, (877), 599 states have internal predecessors, (877), 0 states have call successors, (0), 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 19:51:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 877 transitions. [2024-11-27 19:51:04,715 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 877 transitions. Word has length 107 [2024-11-27 19:51:04,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:04,716 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 877 transitions. [2024-11-27 19:51:04,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 0 states have call successors, (0), 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 19:51:04,716 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 877 transitions. [2024-11-27 19:51:04,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-27 19:51:04,718 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:04,719 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] [2024-11-27 19:51:04,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 19:51:04,719 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:04,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:04,720 INFO L85 PathProgramCache]: Analyzing trace with hash -421717905, now seen corresponding path program 1 times [2024-11-27 19:51:04,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:04,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603100994] [2024-11-27 19:51:04,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:04,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:05,192 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 19:51:05,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:05,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603100994] [2024-11-27 19:51:05,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [603100994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:05,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:05,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:51:05,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661401577] [2024-11-27 19:51:05,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:05,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:51:05,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:05,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:51:05,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:51:05,195 INFO L87 Difference]: Start difference. First operand 600 states and 877 transitions. Second operand has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 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 19:51:05,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:05,260 INFO L93 Difference]: Finished difference Result 994 states and 1455 transitions. [2024-11-27 19:51:05,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:51:05,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-11-27 19:51:05,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:05,264 INFO L225 Difference]: With dead ends: 994 [2024-11-27 19:51:05,264 INFO L226 Difference]: Without dead ends: 608 [2024-11-27 19:51:05,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 19:51:05,267 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 3 mSDsluCounter, 1400 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1869 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:05,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1869 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:51:05,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-11-27 19:51:05,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 605. [2024-11-27 19:51:05,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 605 states, 604 states have (on average 1.4602649006622517) internal successors, (882), 604 states have internal predecessors, (882), 0 states have call successors, (0), 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 19:51:05,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 882 transitions. [2024-11-27 19:51:05,284 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 882 transitions. Word has length 107 [2024-11-27 19:51:05,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:05,285 INFO L471 AbstractCegarLoop]: Abstraction has 605 states and 882 transitions. [2024-11-27 19:51:05,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.4) internal successors, (107), 5 states have internal predecessors, (107), 0 states have call successors, (0), 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 19:51:05,287 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 882 transitions. [2024-11-27 19:51:05,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-27 19:51:05,288 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:05,288 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] [2024-11-27 19:51:05,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 19:51:05,289 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:05,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:05,289 INFO L85 PathProgramCache]: Analyzing trace with hash -666926079, now seen corresponding path program 1 times [2024-11-27 19:51:05,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:05,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710049491] [2024-11-27 19:51:05,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:05,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:05,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:05,742 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 19:51:05,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:05,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710049491] [2024-11-27 19:51:05,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710049491] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:05,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:05,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:51:05,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403075976] [2024-11-27 19:51:05,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:05,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:51:05,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:05,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:51:05,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:51:05,745 INFO L87 Difference]: Start difference. First operand 605 states and 882 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 19:51:05,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:05,810 INFO L93 Difference]: Finished difference Result 1093 states and 1595 transitions. [2024-11-27 19:51:05,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:51:05,811 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-11-27 19:51:05,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:05,814 INFO L225 Difference]: With dead ends: 1093 [2024-11-27 19:51:05,815 INFO L226 Difference]: Without dead ends: 600 [2024-11-27 19:51:05,815 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 19:51:05,817 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 432 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:05,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 921 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:51:05,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-27 19:51:05,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2024-11-27 19:51:05,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.4557595993322203) internal successors, (872), 599 states have internal predecessors, (872), 0 states have call successors, (0), 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 19:51:05,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 872 transitions. [2024-11-27 19:51:05,835 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 872 transitions. Word has length 107 [2024-11-27 19:51:05,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:05,835 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 872 transitions. [2024-11-27 19:51:05,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 19:51:05,836 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 872 transitions. [2024-11-27 19:51:05,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-27 19:51:05,837 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:05,837 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] [2024-11-27 19:51:05,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 19:51:05,838 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:05,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:05,838 INFO L85 PathProgramCache]: Analyzing trace with hash -298937446, now seen corresponding path program 1 times [2024-11-27 19:51:05,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:05,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583959794] [2024-11-27 19:51:05,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:05,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:06,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:06,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 19:51:06,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:06,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583959794] [2024-11-27 19:51:06,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583959794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:06,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:06,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 19:51:06,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925347905] [2024-11-27 19:51:06,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:06,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 19:51:06,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:06,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 19:51:06,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:51:06,250 INFO L87 Difference]: Start difference. First operand 600 states and 872 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 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 19:51:06,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:06,433 INFO L93 Difference]: Finished difference Result 1117 states and 1625 transitions. [2024-11-27 19:51:06,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:51:06,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-11-27 19:51:06,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:06,436 INFO L225 Difference]: With dead ends: 1117 [2024-11-27 19:51:06,436 INFO L226 Difference]: Without dead ends: 615 [2024-11-27 19:51:06,437 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-27 19:51:06,438 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 441 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 441 SdHoareTripleChecker+Valid, 2234 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:06,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [441 Valid, 2234 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:51:06,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 615 states. [2024-11-27 19:51:06,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 615 to 615. [2024-11-27 19:51:06,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 615 states, 614 states have (on average 1.4495114006514658) internal successors, (890), 614 states have internal predecessors, (890), 0 states have call successors, (0), 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 19:51:06,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 615 states to 615 states and 890 transitions. [2024-11-27 19:51:06,458 INFO L78 Accepts]: Start accepts. Automaton has 615 states and 890 transitions. Word has length 107 [2024-11-27 19:51:06,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:06,458 INFO L471 AbstractCegarLoop]: Abstraction has 615 states and 890 transitions. [2024-11-27 19:51:06,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 0 states have call successors, (0), 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 19:51:06,459 INFO L276 IsEmpty]: Start isEmpty. Operand 615 states and 890 transitions. [2024-11-27 19:51:06,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-27 19:51:06,460 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:06,460 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] [2024-11-27 19:51:06,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 19:51:06,461 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:06,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:06,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1091871874, now seen corresponding path program 1 times [2024-11-27 19:51:06,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:06,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714210679] [2024-11-27 19:51:06,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:06,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:06,725 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 19:51:06,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:06,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714210679] [2024-11-27 19:51:06,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714210679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:06,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:06,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:51:06,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10992806] [2024-11-27 19:51:06,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:06,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:51:06,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:06,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:51:06,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:51:06,728 INFO L87 Difference]: Start difference. First operand 615 states and 890 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 19:51:06,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:06,795 INFO L93 Difference]: Finished difference Result 1129 states and 1637 transitions. [2024-11-27 19:51:06,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:51:06,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-11-27 19:51:06,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:06,798 INFO L225 Difference]: With dead ends: 1129 [2024-11-27 19:51:06,798 INFO L226 Difference]: Without dead ends: 610 [2024-11-27 19:51:06,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 19:51:06,801 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 438 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 438 SdHoareTripleChecker+Valid, 913 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:06,802 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [438 Valid, 913 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:51:06,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2024-11-27 19:51:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2024-11-27 19:51:06,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 609 states have (on average 1.444991789819376) internal successors, (880), 609 states have internal predecessors, (880), 0 states have call successors, (0), 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 19:51:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 880 transitions. [2024-11-27 19:51:06,821 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 880 transitions. Word has length 107 [2024-11-27 19:51:06,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:06,822 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 880 transitions. [2024-11-27 19:51:06,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 19:51:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 880 transitions. [2024-11-27 19:51:06,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-27 19:51:06,823 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:06,823 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] [2024-11-27 19:51:06,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 19:51:06,823 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:06,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:06,824 INFO L85 PathProgramCache]: Analyzing trace with hash -781368887, now seen corresponding path program 1 times [2024-11-27 19:51:06,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:06,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106069756] [2024-11-27 19:51:06,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:06,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:06,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:07,201 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 19:51:07,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:07,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106069756] [2024-11-27 19:51:07,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106069756] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:07,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:07,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:51:07,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003020496] [2024-11-27 19:51:07,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:07,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:51:07,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:07,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:51:07,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:51:07,202 INFO L87 Difference]: Start difference. First operand 610 states and 880 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 19:51:07,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:07,279 INFO L93 Difference]: Finished difference Result 1126 states and 1628 transitions. [2024-11-27 19:51:07,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:51:07,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-11-27 19:51:07,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:07,282 INFO L225 Difference]: With dead ends: 1126 [2024-11-27 19:51:07,283 INFO L226 Difference]: Without dead ends: 600 [2024-11-27 19:51:07,283 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 19:51:07,285 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 440 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 440 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:07,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [440 Valid, 905 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:51:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-27 19:51:07,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2024-11-27 19:51:07,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.4440734557595993) internal successors, (865), 599 states have internal predecessors, (865), 0 states have call successors, (0), 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 19:51:07,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 865 transitions. [2024-11-27 19:51:07,303 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 865 transitions. Word has length 107 [2024-11-27 19:51:07,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:07,303 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 865 transitions. [2024-11-27 19:51:07,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 0 states have call successors, (0), 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 19:51:07,304 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 865 transitions. [2024-11-27 19:51:07,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-27 19:51:07,305 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:07,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] [2024-11-27 19:51:07,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-27 19:51:07,306 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:07,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:07,307 INFO L85 PathProgramCache]: Analyzing trace with hash 404976836, now seen corresponding path program 1 times [2024-11-27 19:51:07,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:07,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897973092] [2024-11-27 19:51:07,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:07,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:07,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:08,714 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 19:51:08,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:08,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897973092] [2024-11-27 19:51:08,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897973092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:08,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:08,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:51:08,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407965541] [2024-11-27 19:51:08,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:08,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:51:08,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:08,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:51:08,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:51:08,719 INFO L87 Difference]: Start difference. First operand 600 states and 865 transitions. Second operand has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 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 19:51:08,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:08,913 INFO L93 Difference]: Finished difference Result 1056 states and 1521 transitions. [2024-11-27 19:51:08,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:51:08,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 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 108 [2024-11-27 19:51:08,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:08,917 INFO L225 Difference]: With dead ends: 1056 [2024-11-27 19:51:08,917 INFO L226 Difference]: Without dead ends: 700 [2024-11-27 19:51:08,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:51:08,918 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 839 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:08,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 1330 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:51:08,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-27 19:51:08,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 600. [2024-11-27 19:51:08,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.4424040066777963) internal successors, (864), 599 states have internal predecessors, (864), 0 states have call successors, (0), 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 19:51:08,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 864 transitions. [2024-11-27 19:51:08,936 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 864 transitions. Word has length 108 [2024-11-27 19:51:08,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:08,938 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 864 transitions. [2024-11-27 19:51:08,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.6) internal successors, (108), 5 states have internal predecessors, (108), 0 states have call successors, (0), 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 19:51:08,938 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 864 transitions. [2024-11-27 19:51:08,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-27 19:51:08,939 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:08,940 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] [2024-11-27 19:51:08,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-27 19:51:08,940 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:08,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:08,941 INFO L85 PathProgramCache]: Analyzing trace with hash -2144833123, now seen corresponding path program 1 times [2024-11-27 19:51:08,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:08,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257588150] [2024-11-27 19:51:08,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:08,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:09,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:10,267 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 19:51:10,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:10,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257588150] [2024-11-27 19:51:10,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257588150] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:10,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:10,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:51:10,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194062535] [2024-11-27 19:51:10,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:10,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:51:10,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:10,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:51:10,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:51:10,269 INFO L87 Difference]: Start difference. First operand 600 states and 864 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 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 19:51:10,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:10,567 INFO L93 Difference]: Finished difference Result 1068 states and 1537 transitions. [2024-11-27 19:51:10,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:51:10,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 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 109 [2024-11-27 19:51:10,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:10,571 INFO L225 Difference]: With dead ends: 1068 [2024-11-27 19:51:10,571 INFO L226 Difference]: Without dead ends: 700 [2024-11-27 19:51:10,572 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:51:10,573 INFO L435 NwaCegarLoop]: 442 mSDtfsCounter, 650 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1326 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:10,573 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1326 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 19:51:10,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2024-11-27 19:51:10,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 600. [2024-11-27 19:51:10,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.4407345575959933) internal successors, (863), 599 states have internal predecessors, (863), 0 states have call successors, (0), 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 19:51:10,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 863 transitions. [2024-11-27 19:51:10,589 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 863 transitions. Word has length 109 [2024-11-27 19:51:10,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:10,590 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 863 transitions. [2024-11-27 19:51:10,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 0 states have call successors, (0), 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 19:51:10,590 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 863 transitions. [2024-11-27 19:51:10,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-27 19:51:10,591 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:10,592 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] [2024-11-27 19:51:10,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-27 19:51:10,592 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:10,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:10,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1221094713, now seen corresponding path program 1 times [2024-11-27 19:51:10,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:10,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853325819] [2024-11-27 19:51:10,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:10,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:10,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:12,426 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 19:51:12,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:12,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853325819] [2024-11-27 19:51:12,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853325819] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:12,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:12,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-27 19:51:12,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020868965] [2024-11-27 19:51:12,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:12,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-27 19:51:12,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:12,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-27 19:51:12,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-11-27 19:51:12,429 INFO L87 Difference]: Start difference. First operand 600 states and 863 transitions. Second operand has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 12 states have internal predecessors, (110), 0 states have call successors, (0), 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 19:51:12,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:12,872 INFO L93 Difference]: Finished difference Result 1068 states and 1535 transitions. [2024-11-27 19:51:12,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-27 19:51:12,873 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 12 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-11-27 19:51:12,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:12,876 INFO L225 Difference]: With dead ends: 1068 [2024-11-27 19:51:12,876 INFO L226 Difference]: Without dead ends: 694 [2024-11-27 19:51:12,877 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-11-27 19:51:12,878 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 490 mSDsluCounter, 3612 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 4062 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:12,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 4062 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-27 19:51:12,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-11-27 19:51:12,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 682. [2024-11-27 19:51:12,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 1.4317180616740088) internal successors, (975), 681 states have internal predecessors, (975), 0 states have call successors, (0), 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 19:51:12,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 975 transitions. [2024-11-27 19:51:12,895 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 975 transitions. Word has length 110 [2024-11-27 19:51:12,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:12,896 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 975 transitions. [2024-11-27 19:51:12,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.166666666666666) internal successors, (110), 12 states have internal predecessors, (110), 0 states have call successors, (0), 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 19:51:12,896 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 975 transitions. [2024-11-27 19:51:12,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-27 19:51:12,898 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:12,898 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] [2024-11-27 19:51:12,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-27 19:51:12,898 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:12,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:12,899 INFO L85 PathProgramCache]: Analyzing trace with hash -184897447, now seen corresponding path program 1 times [2024-11-27 19:51:12,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:12,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984719532] [2024-11-27 19:51:12,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:12,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:13,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:13,377 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 19:51:13,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:13,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984719532] [2024-11-27 19:51:13,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984719532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:13,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:13,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:51:13,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946858462] [2024-11-27 19:51:13,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:13,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:51:13,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:13,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:51:13,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:51:13,379 INFO L87 Difference]: Start difference. First operand 682 states and 975 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 19:51:13,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:13,420 INFO L93 Difference]: Finished difference Result 1106 states and 1585 transitions. [2024-11-27 19:51:13,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:51:13,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-11-27 19:51:13,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:13,423 INFO L225 Difference]: With dead ends: 1106 [2024-11-27 19:51:13,424 INFO L226 Difference]: Without dead ends: 653 [2024-11-27 19:51:13,424 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 19:51:13,425 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 0 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1380 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:13,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1380 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:51:13,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 653 states. [2024-11-27 19:51:13,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 653 to 653. [2024-11-27 19:51:13,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 653 states, 652 states have (on average 1.4294478527607362) internal successors, (932), 652 states have internal predecessors, (932), 0 states have call successors, (0), 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 19:51:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 932 transitions. [2024-11-27 19:51:13,448 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 932 transitions. Word has length 110 [2024-11-27 19:51:13,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:13,448 INFO L471 AbstractCegarLoop]: Abstraction has 653 states and 932 transitions. [2024-11-27 19:51:13,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 0 states have call successors, (0), 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 19:51:13,448 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 932 transitions. [2024-11-27 19:51:13,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-27 19:51:13,450 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:13,450 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] [2024-11-27 19:51:13,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-27 19:51:13,450 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:13,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:13,451 INFO L85 PathProgramCache]: Analyzing trace with hash -651184319, now seen corresponding path program 1 times [2024-11-27 19:51:13,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:13,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360421722] [2024-11-27 19:51:13,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:13,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:13,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:13,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 19:51:13,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:13,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360421722] [2024-11-27 19:51:13,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360421722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:13,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:13,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:51:13,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313609315] [2024-11-27 19:51:13,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:13,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:51:13,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:13,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:51:13,908 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:51:13,908 INFO L87 Difference]: Start difference. First operand 653 states and 932 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 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 19:51:14,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:14,057 INFO L93 Difference]: Finished difference Result 1347 states and 1925 transitions. [2024-11-27 19:51:14,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:51:14,057 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-11-27 19:51:14,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:14,060 INFO L225 Difference]: With dead ends: 1347 [2024-11-27 19:51:14,060 INFO L226 Difference]: Without dead ends: 787 [2024-11-27 19:51:14,061 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 19:51:14,062 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 1044 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1044 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:14,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1044 Valid, 1348 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:51:14,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2024-11-27 19:51:14,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 647. [2024-11-27 19:51:14,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 647 states, 646 states have (on average 1.4241486068111455) internal successors, (920), 646 states have internal predecessors, (920), 0 states have call successors, (0), 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 19:51:14,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 647 states to 647 states and 920 transitions. [2024-11-27 19:51:14,082 INFO L78 Accepts]: Start accepts. Automaton has 647 states and 920 transitions. Word has length 110 [2024-11-27 19:51:14,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:14,082 INFO L471 AbstractCegarLoop]: Abstraction has 647 states and 920 transitions. [2024-11-27 19:51:14,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 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 19:51:14,083 INFO L276 IsEmpty]: Start isEmpty. Operand 647 states and 920 transitions. [2024-11-27 19:51:14,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-27 19:51:14,084 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:14,084 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] [2024-11-27 19:51:14,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-27 19:51:14,085 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:14,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:14,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1335204232, now seen corresponding path program 1 times [2024-11-27 19:51:14,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:14,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2459794] [2024-11-27 19:51:14,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:14,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:14,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:14,620 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 19:51:14,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:14,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2459794] [2024-11-27 19:51:14,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2459794] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:14,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:14,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 19:51:14,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361721034] [2024-11-27 19:51:14,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:14,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 19:51:14,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:14,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 19:51:14,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:51:14,623 INFO L87 Difference]: Start difference. First operand 647 states and 920 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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 19:51:15,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:15,195 INFO L93 Difference]: Finished difference Result 1365 states and 1943 transitions. [2024-11-27 19:51:15,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:51:15,196 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-11-27 19:51:15,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:15,199 INFO L225 Difference]: With dead ends: 1365 [2024-11-27 19:51:15,199 INFO L226 Difference]: Without dead ends: 789 [2024-11-27 19:51:15,201 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-27 19:51:15,203 INFO L435 NwaCegarLoop]: 378 mSDtfsCounter, 1049 mSDsluCounter, 1507 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1049 SdHoareTripleChecker+Valid, 1885 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:15,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1049 Valid, 1885 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-27 19:51:15,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-11-27 19:51:15,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 649. [2024-11-27 19:51:15,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 649 states, 648 states have (on average 1.4197530864197532) internal successors, (920), 648 states have internal predecessors, (920), 0 states have call successors, (0), 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 19:51:15,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 920 transitions. [2024-11-27 19:51:15,221 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 920 transitions. Word has length 110 [2024-11-27 19:51:15,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:15,221 INFO L471 AbstractCegarLoop]: Abstraction has 649 states and 920 transitions. [2024-11-27 19:51:15,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 0 states have call successors, (0), 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 19:51:15,222 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 920 transitions. [2024-11-27 19:51:15,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-27 19:51:15,224 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:15,224 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] [2024-11-27 19:51:15,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-27 19:51:15,224 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:15,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:15,225 INFO L85 PathProgramCache]: Analyzing trace with hash 2005973537, now seen corresponding path program 1 times [2024-11-27 19:51:15,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:15,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81446813] [2024-11-27 19:51:15,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:15,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:15,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:15,519 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 19:51:15,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:15,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81446813] [2024-11-27 19:51:15,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81446813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:15,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:15,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:51:15,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024106227] [2024-11-27 19:51:15,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:15,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:51:15,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:15,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:51:15,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:51:15,525 INFO L87 Difference]: Start difference. First operand 649 states and 920 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 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 19:51:15,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:15,983 INFO L93 Difference]: Finished difference Result 1338 states and 1900 transitions. [2024-11-27 19:51:15,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:51:15,984 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 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 110 [2024-11-27 19:51:15,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:15,987 INFO L225 Difference]: With dead ends: 1338 [2024-11-27 19:51:15,987 INFO L226 Difference]: Without dead ends: 745 [2024-11-27 19:51:15,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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 19:51:15,988 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 978 mSDsluCounter, 892 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 978 SdHoareTripleChecker+Valid, 1340 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:15,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [978 Valid, 1340 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-27 19:51:15,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 745 states. [2024-11-27 19:51:16,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 745 to 625. [2024-11-27 19:51:16,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 625 states, 624 states have (on average 1.4246794871794872) internal successors, (889), 624 states have internal predecessors, (889), 0 states have call successors, (0), 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 19:51:16,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 889 transitions. [2024-11-27 19:51:16,005 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 889 transitions. Word has length 110 [2024-11-27 19:51:16,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:16,005 INFO L471 AbstractCegarLoop]: Abstraction has 625 states and 889 transitions. [2024-11-27 19:51:16,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 0 states have call successors, (0), 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 19:51:16,005 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 889 transitions. [2024-11-27 19:51:16,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-27 19:51:16,007 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:16,007 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] [2024-11-27 19:51:16,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-27 19:51:16,007 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:16,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:16,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1789769743, now seen corresponding path program 1 times [2024-11-27 19:51:16,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:16,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186166473] [2024-11-27 19:51:16,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:16,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:16,498 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 19:51:16,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:16,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186166473] [2024-11-27 19:51:16,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186166473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:16,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:16,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 19:51:16,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290226692] [2024-11-27 19:51:16,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:16,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 19:51:16,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:16,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 19:51:16,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:51:16,500 INFO L87 Difference]: Start difference. First operand 625 states and 889 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 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 19:51:16,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:16,630 INFO L93 Difference]: Finished difference Result 1308 states and 1867 transitions. [2024-11-27 19:51:16,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 19:51:16,631 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-11-27 19:51:16,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:16,634 INFO L225 Difference]: With dead ends: 1308 [2024-11-27 19:51:16,634 INFO L226 Difference]: Without dead ends: 897 [2024-11-27 19:51:16,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:51:16,636 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 674 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 1803 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:16,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 1803 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:51:16,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 897 states. [2024-11-27 19:51:16,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 897 to 682. [2024-11-27 19:51:16,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 682 states, 681 states have (on average 1.42143906020558) internal successors, (968), 681 states have internal predecessors, (968), 0 states have call successors, (0), 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 19:51:16,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 682 states to 682 states and 968 transitions. [2024-11-27 19:51:16,653 INFO L78 Accepts]: Start accepts. Automaton has 682 states and 968 transitions. Word has length 111 [2024-11-27 19:51:16,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:16,653 INFO L471 AbstractCegarLoop]: Abstraction has 682 states and 968 transitions. [2024-11-27 19:51:16,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 6 states have internal predecessors, (111), 0 states have call successors, (0), 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 19:51:16,653 INFO L276 IsEmpty]: Start isEmpty. Operand 682 states and 968 transitions. [2024-11-27 19:51:16,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-27 19:51:16,655 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:16,655 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] [2024-11-27 19:51:16,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-27 19:51:16,656 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:16,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:16,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1205880070, now seen corresponding path program 1 times [2024-11-27 19:51:16,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:16,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740453001] [2024-11-27 19:51:16,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:16,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:17,574 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 19:51:17,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:17,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740453001] [2024-11-27 19:51:17,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740453001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:17,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:17,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:51:17,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363388981] [2024-11-27 19:51:17,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:17,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:51:17,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:17,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:51:17,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:51:17,577 INFO L87 Difference]: Start difference. First operand 682 states and 968 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 19:51:17,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:17,607 INFO L93 Difference]: Finished difference Result 1126 states and 1606 transitions. [2024-11-27 19:51:17,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:51:17,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-11-27 19:51:17,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:17,614 INFO L225 Difference]: With dead ends: 1126 [2024-11-27 19:51:17,614 INFO L226 Difference]: Without dead ends: 680 [2024-11-27 19:51:17,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:51:17,615 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 0 mSDsluCounter, 916 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1377 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:17,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1377 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:51:17,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-11-27 19:51:17,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2024-11-27 19:51:17,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 679 states have (on average 1.4167893961708395) internal successors, (962), 679 states have internal predecessors, (962), 0 states have call successors, (0), 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 19:51:17,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 962 transitions. [2024-11-27 19:51:17,634 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 962 transitions. Word has length 111 [2024-11-27 19:51:17,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:17,635 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 962 transitions. [2024-11-27 19:51:17,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 19:51:17,635 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 962 transitions. [2024-11-27 19:51:17,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-27 19:51:17,636 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:17,637 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] [2024-11-27 19:51:17,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-27 19:51:17,637 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:17,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:17,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1874444010, now seen corresponding path program 1 times [2024-11-27 19:51:17,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:17,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535433315] [2024-11-27 19:51:17,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:17,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:17,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:18,132 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 19:51:18,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:18,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535433315] [2024-11-27 19:51:18,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535433315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:18,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:18,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:51:18,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014608156] [2024-11-27 19:51:18,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:18,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:51:18,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:18,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:51:18,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:51:18,135 INFO L87 Difference]: Start difference. First operand 680 states and 962 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 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 19:51:18,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:18,178 INFO L93 Difference]: Finished difference Result 1120 states and 1592 transitions. [2024-11-27 19:51:18,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:51:18,179 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-11-27 19:51:18,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:18,181 INFO L225 Difference]: With dead ends: 1120 [2024-11-27 19:51:18,181 INFO L226 Difference]: Without dead ends: 680 [2024-11-27 19:51:18,182 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 19:51:18,182 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 1 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:18,182 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1814 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:51:18,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2024-11-27 19:51:18,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 680. [2024-11-27 19:51:18,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 680 states, 679 states have (on average 1.4138438880706923) internal successors, (960), 679 states have internal predecessors, (960), 0 states have call successors, (0), 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 19:51:18,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 680 states to 680 states and 960 transitions. [2024-11-27 19:51:18,196 INFO L78 Accepts]: Start accepts. Automaton has 680 states and 960 transitions. Word has length 111 [2024-11-27 19:51:18,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:18,196 INFO L471 AbstractCegarLoop]: Abstraction has 680 states and 960 transitions. [2024-11-27 19:51:18,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 0 states have call successors, (0), 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 19:51:18,197 INFO L276 IsEmpty]: Start isEmpty. Operand 680 states and 960 transitions. [2024-11-27 19:51:18,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-27 19:51:18,198 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:18,198 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] [2024-11-27 19:51:18,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-27 19:51:18,198 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:18,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:18,198 INFO L85 PathProgramCache]: Analyzing trace with hash -995380728, now seen corresponding path program 1 times [2024-11-27 19:51:18,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:18,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637204997] [2024-11-27 19:51:18,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:18,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:18,471 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 19:51:18,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:18,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637204997] [2024-11-27 19:51:18,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637204997] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:18,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:18,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:51:18,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541132597] [2024-11-27 19:51:18,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:18,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:51:18,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:18,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:51:18,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:51:18,473 INFO L87 Difference]: Start difference. First operand 680 states and 960 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 19:51:18,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:18,559 INFO L93 Difference]: Finished difference Result 1181 states and 1666 transitions. [2024-11-27 19:51:18,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:51:18,560 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-11-27 19:51:18,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:18,562 INFO L225 Difference]: With dead ends: 1181 [2024-11-27 19:51:18,562 INFO L226 Difference]: Without dead ends: 563 [2024-11-27 19:51:18,563 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 19:51:18,564 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 425 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 425 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:18,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [425 Valid, 891 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:51:18,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-11-27 19:51:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 563. [2024-11-27 19:51:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 562 states have (on average 1.407473309608541) internal successors, (791), 562 states have internal predecessors, (791), 0 states have call successors, (0), 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 19:51:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 791 transitions. [2024-11-27 19:51:18,580 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 791 transitions. Word has length 111 [2024-11-27 19:51:18,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:18,580 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 791 transitions. [2024-11-27 19:51:18,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 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 19:51:18,581 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 791 transitions. [2024-11-27 19:51:18,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-27 19:51:18,582 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:18,582 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] [2024-11-27 19:51:18,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-27 19:51:18,582 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:18,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:18,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1790930442, now seen corresponding path program 1 times [2024-11-27 19:51:18,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:18,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825163043] [2024-11-27 19:51:18,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:18,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:18,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:19,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 19:51:19,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:19,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825163043] [2024-11-27 19:51:19,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825163043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:19,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:19,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-27 19:51:19,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967268082] [2024-11-27 19:51:19,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:19,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-27 19:51:19,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:19,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-27 19:51:19,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-27 19:51:19,861 INFO L87 Difference]: Start difference. First operand 563 states and 791 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 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 19:51:20,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:20,052 INFO L93 Difference]: Finished difference Result 1159 states and 1645 transitions. [2024-11-27 19:51:20,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-27 19:51:20,053 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-11-27 19:51:20,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:20,055 INFO L225 Difference]: With dead ends: 1159 [2024-11-27 19:51:20,055 INFO L226 Difference]: Without dead ends: 731 [2024-11-27 19:51:20,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-11-27 19:51:20,056 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 939 mSDsluCounter, 1775 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 939 SdHoareTripleChecker+Valid, 2221 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:20,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [939 Valid, 2221 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:51:20,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 731 states. [2024-11-27 19:51:20,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 731 to 565. [2024-11-27 19:51:20,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 1.4060283687943262) internal successors, (793), 564 states have internal predecessors, (793), 0 states have call successors, (0), 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 19:51:20,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 793 transitions. [2024-11-27 19:51:20,069 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 793 transitions. Word has length 112 [2024-11-27 19:51:20,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:20,069 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 793 transitions. [2024-11-27 19:51:20,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 0 states have call successors, (0), 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 19:51:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 793 transitions. [2024-11-27 19:51:20,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-27 19:51:20,071 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:20,071 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] [2024-11-27 19:51:20,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-27 19:51:20,071 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:20,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:20,072 INFO L85 PathProgramCache]: Analyzing trace with hash 200753853, now seen corresponding path program 1 times [2024-11-27 19:51:20,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:20,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669977086] [2024-11-27 19:51:20,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:20,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:20,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:21,102 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 19:51:21,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:21,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669977086] [2024-11-27 19:51:21,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669977086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:21,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:21,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 19:51:21,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147704019] [2024-11-27 19:51:21,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:21,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 19:51:21,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:21,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 19:51:21,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-27 19:51:21,105 INFO L87 Difference]: Start difference. First operand 565 states and 793 transitions. Second operand has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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 19:51:22,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:22,078 INFO L93 Difference]: Finished difference Result 1194 states and 1698 transitions. [2024-11-27 19:51:22,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 19:51:22,079 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-11-27 19:51:22,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:22,081 INFO L225 Difference]: With dead ends: 1194 [2024-11-27 19:51:22,081 INFO L226 Difference]: Without dead ends: 769 [2024-11-27 19:51:22,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2024-11-27 19:51:22,083 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 1114 mSDsluCounter, 2503 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1114 SdHoareTripleChecker+Valid, 2920 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:22,083 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1114 Valid, 2920 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-27 19:51:22,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769 states. [2024-11-27 19:51:22,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769 to 569. [2024-11-27 19:51:22,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 569 states, 568 states have (on average 1.4049295774647887) internal successors, (798), 568 states have internal predecessors, (798), 0 states have call successors, (0), 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 19:51:22,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 798 transitions. [2024-11-27 19:51:22,094 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 798 transitions. Word has length 112 [2024-11-27 19:51:22,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:22,095 INFO L471 AbstractCegarLoop]: Abstraction has 569 states and 798 transitions. [2024-11-27 19:51:22,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.444444444444445) internal successors, (112), 9 states have internal predecessors, (112), 0 states have call successors, (0), 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 19:51:22,095 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 798 transitions. [2024-11-27 19:51:22,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-27 19:51:22,096 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:22,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] [2024-11-27 19:51:22,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-27 19:51:22,097 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:22,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:22,097 INFO L85 PathProgramCache]: Analyzing trace with hash -792120110, now seen corresponding path program 1 times [2024-11-27 19:51:22,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:22,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659306815] [2024-11-27 19:51:22,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:22,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:22,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:22,424 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 19:51:22,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:22,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659306815] [2024-11-27 19:51:22,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659306815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:22,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:22,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:51:22,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148873881] [2024-11-27 19:51:22,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:22,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:51:22,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:22,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:51:22,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:51:22,428 INFO L87 Difference]: Start difference. First operand 569 states and 798 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 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 19:51:22,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:22,478 INFO L93 Difference]: Finished difference Result 1000 states and 1414 transitions. [2024-11-27 19:51:22,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:51:22,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-11-27 19:51:22,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:22,480 INFO L225 Difference]: With dead ends: 1000 [2024-11-27 19:51:22,480 INFO L226 Difference]: Without dead ends: 575 [2024-11-27 19:51:22,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 19:51:22,482 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 2 mSDsluCounter, 1345 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1797 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 19:51:22,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1797 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:51:22,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 575 states. [2024-11-27 19:51:22,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 575 to 574. [2024-11-27 19:51:22,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 574 states, 573 states have (on average 1.4031413612565444) internal successors, (804), 573 states have internal predecessors, (804), 0 states have call successors, (0), 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 19:51:22,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 804 transitions. [2024-11-27 19:51:22,493 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 804 transitions. Word has length 113 [2024-11-27 19:51:22,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:22,493 INFO L471 AbstractCegarLoop]: Abstraction has 574 states and 804 transitions. [2024-11-27 19:51:22,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 0 states have call successors, (0), 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 19:51:22,494 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 804 transitions. [2024-11-27 19:51:22,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-27 19:51:22,495 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:22,495 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] [2024-11-27 19:51:22,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-27 19:51:22,495 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:22,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:22,496 INFO L85 PathProgramCache]: Analyzing trace with hash -446082194, now seen corresponding path program 1 times [2024-11-27 19:51:22,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:22,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571113454] [2024-11-27 19:51:22,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:22,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:23,444 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 19:51:23,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:23,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571113454] [2024-11-27 19:51:23,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571113454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:23,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:23,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:51:23,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821552984] [2024-11-27 19:51:23,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:23,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:51:23,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:23,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:51:23,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:51:23,447 INFO L87 Difference]: Start difference. First operand 574 states and 804 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 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 19:51:23,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:23,477 INFO L93 Difference]: Finished difference Result 1007 states and 1422 transitions. [2024-11-27 19:51:23,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:51:23,478 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 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 113 [2024-11-27 19:51:23,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:23,479 INFO L225 Difference]: With dead ends: 1007 [2024-11-27 19:51:23,479 INFO L226 Difference]: Without dead ends: 567 [2024-11-27 19:51:23,480 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:51:23,484 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 0 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1356 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:23,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1356 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:51:23,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2024-11-27 19:51:23,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 567. [2024-11-27 19:51:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 566 states have (on average 1.4028268551236749) internal successors, (794), 566 states have internal predecessors, (794), 0 states have call successors, (0), 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 19:51:23,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 794 transitions. [2024-11-27 19:51:23,494 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 794 transitions. Word has length 113 [2024-11-27 19:51:23,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:23,496 INFO L471 AbstractCegarLoop]: Abstraction has 567 states and 794 transitions. [2024-11-27 19:51:23,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 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 19:51:23,497 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 794 transitions. [2024-11-27 19:51:23,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-27 19:51:23,498 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:23,498 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] [2024-11-27 19:51:23,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-27 19:51:23,498 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:23,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:23,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1413382470, now seen corresponding path program 1 times [2024-11-27 19:51:23,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:23,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660638485] [2024-11-27 19:51:23,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:23,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:23,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 19:51:23,693 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 19:51:23,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 19:51:24,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 19:51:24,001 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 19:51:24,002 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-27 19:51:24,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-11-27 19:51:24,015 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] [2024-11-27 19:51:24,198 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 19:51:24,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 07:51:24 BoogieIcfgContainer [2024-11-27 19:51:24,203 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 19:51:24,204 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 19:51:24,204 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 19:51:24,204 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 19:51:24,205 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:50:45" (3/4) ... [2024-11-27 19:51:24,208 INFO L149 WitnessPrinter]: No result that supports witness generation found [2024-11-27 19:51:24,209 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 19:51:24,209 INFO L158 Benchmark]: Toolchain (without parser) took 43018.86ms. Allocated memory was 117.4MB in the beginning and 251.7MB in the end (delta: 134.2MB). Free memory was 91.1MB in the beginning and 162.8MB in the end (delta: -71.7MB). Peak memory consumption was 60.6MB. Max. memory is 16.1GB. [2024-11-27 19:51:24,210 INFO L158 Benchmark]: CDTParser took 0.79ms. Allocated memory is still 117.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 19:51:24,210 INFO L158 Benchmark]: CACSL2BoogieTranslator took 917.32ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 39.4MB in the end (delta: 51.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-27 19:51:24,211 INFO L158 Benchmark]: Boogie Procedure Inliner took 270.88ms. Allocated memory is still 117.4MB. Free memory was 39.4MB in the beginning and 50.3MB in the end (delta: -10.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 19:51:24,211 INFO L158 Benchmark]: Boogie Preprocessor took 370.83ms. Allocated memory is still 117.4MB. Free memory was 50.3MB in the beginning and 55.8MB in the end (delta: -5.4MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2024-11-27 19:51:24,212 INFO L158 Benchmark]: RCFGBuilder took 3168.36ms. Allocated memory was 117.4MB in the beginning and 251.7MB in the end (delta: 134.2MB). Free memory was 55.8MB in the beginning and 117.7MB in the end (delta: -62.0MB). Peak memory consumption was 123.2MB. Max. memory is 16.1GB. [2024-11-27 19:51:24,213 INFO L158 Benchmark]: TraceAbstraction took 38278.79ms. Allocated memory is still 251.7MB. Free memory was 115.7MB in the beginning and 162.8MB in the end (delta: -47.1MB). Peak memory consumption was 87.3MB. Max. memory is 16.1GB. [2024-11-27 19:51:24,213 INFO L158 Benchmark]: Witness Printer took 5.01ms. Allocated memory is still 251.7MB. Free memory was 162.8MB in the beginning and 162.8MB in the end (delta: 20.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 19:51:24,214 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.79ms. Allocated memory is still 117.4MB. Free memory is still 73.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 917.32ms. Allocated memory is still 117.4MB. Free memory was 90.9MB in the beginning and 39.4MB in the end (delta: 51.4MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 270.88ms. Allocated memory is still 117.4MB. Free memory was 39.4MB in the beginning and 50.3MB in the end (delta: -10.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 370.83ms. Allocated memory is still 117.4MB. Free memory was 50.3MB in the beginning and 55.8MB in the end (delta: -5.4MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. * RCFGBuilder took 3168.36ms. Allocated memory was 117.4MB in the beginning and 251.7MB in the end (delta: 134.2MB). Free memory was 55.8MB in the beginning and 117.7MB in the end (delta: -62.0MB). Peak memory consumption was 123.2MB. Max. memory is 16.1GB. * TraceAbstraction took 38278.79ms. Allocated memory is still 251.7MB. Free memory was 115.7MB in the beginning and 162.8MB in the end (delta: -47.1MB). Peak memory consumption was 87.3MB. Max. memory is 16.1GB. * Witness Printer took 5.01ms. Allocated memory is still 251.7MB. Free memory was 162.8MB in the beginning and 162.8MB in the end (delta: 20.4kB). 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 bitwiseOr at line 337, overapproximation of bitwiseOr at line 313, overapproximation of bitwiseOr at line 371, overapproximation of bitwiseOr at line 397, overapproximation of bitwiseAnd at line 437. 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_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 2); [L30] const SORT_4 msb_SORT_4 = (SORT_4)1 << (2 - 1); [L32] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 4); [L33] const SORT_9 msb_SORT_9 = (SORT_9)1 << (4 - 1); [L35] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 3); [L36] const SORT_10 msb_SORT_10 = (SORT_10)1 << (3 - 1); [L38] const SORT_10 var_11 = 0; [L39] const SORT_1 var_14 = 0; [L40] const SORT_4 var_16 = 0; [L41] const SORT_9 var_33 = 8; [L42] const SORT_9 var_40 = 7; [L43] const SORT_4 var_52 = 1; [L44] const SORT_1 var_56 = 1; [L45] const SORT_4 var_66 = 2; [L46] const SORT_9 var_72 = 0; [L47] const SORT_4 var_79 = 3; [L48] const SORT_9 var_98 = 5; [L49] const SORT_10 var_120 = 1; [L50] const SORT_9 var_122 = 15; [L51] const SORT_9 var_150 = 6; [L52] const SORT_9 var_315 = 1; [L54] SORT_1 input_2; [L55] SORT_1 input_3; [L56] SORT_4 input_5; [L57] SORT_1 input_6; [L58] SORT_1 input_7; [L59] SORT_1 input_8; [L60] SORT_4 input_103; [L61] SORT_10 input_116; [L62] SORT_10 input_117; [L63] SORT_10 input_118; [L64] SORT_10 input_119; [L65] SORT_10 input_128; [L66] SORT_10 input_135; [L67] SORT_10 input_142; [L68] SORT_10 input_143; [L69] SORT_10 input_144; [L70] SORT_10 input_149; [L71] SORT_10 input_153; [L72] SORT_10 input_159; [L73] SORT_4 input_174; [L74] SORT_4 input_175; [L75] SORT_4 input_176; [L76] SORT_4 input_177; [L77] SORT_4 input_184; [L78] SORT_4 input_187; [L79] SORT_4 input_195; [L80] SORT_4 input_202; [L81] SORT_4 input_203; [L82] SORT_4 input_204; [L83] SORT_4 input_207; [L84] SORT_4 input_209; [L85] SORT_4 input_214; [L86] SORT_4 input_223; [L87] SORT_1 input_235; [L88] SORT_1 input_236; [L89] SORT_1 input_237; [L90] SORT_1 input_238; [L91] SORT_1 input_245; [L92] SORT_1 input_248; [L93] SORT_1 input_251; [L94] SORT_1 input_261; [L95] SORT_4 input_276; [L96] SORT_4 input_280; [L97] SORT_4 input_281; [L98] SORT_4 input_282; [L99] SORT_4 input_283; [L100] SORT_4 input_287; [L101] SORT_4 input_292; [L102] SORT_4 input_301; [L103] SORT_9 input_311; [L104] SORT_9 input_312; [L105] SORT_9 input_313; [L106] SORT_9 input_314; [L107] SORT_9 input_320; [L108] SORT_9 input_326; [L109] SORT_9 input_333; [L110] SORT_9 input_334; [L111] SORT_9 input_335; [L112] SORT_9 input_338; [L113] SORT_9 input_340; [L114] SORT_9 input_344; [L115] SORT_9 input_345; [L116] SORT_9 input_349; [L117] SORT_9 input_354; [L118] SORT_9 input_372; [L119] SORT_9 input_373; [L120] SORT_9 input_374; [L121] SORT_9 input_375; [L122] SORT_9 input_380; [L123] SORT_9 input_383; [L124] SORT_9 input_391; [L125] SORT_9 input_398; [L126] SORT_9 input_399; [L127] SORT_9 input_400; [L128] SORT_9 input_403; [L129] SORT_9 input_405; [L130] SORT_9 input_410; [L131] SORT_9 input_419; [L132] SORT_9 input_430; [L133] SORT_9 input_431; [L134] SORT_9 input_432; [L135] SORT_9 input_433; [L136] SORT_9 input_438; [L137] SORT_9 input_441; [L138] SORT_9 input_444; [L139] SORT_9 input_454; [L141] EXPR __VERIFIER_nondet_uchar() & mask_SORT_10 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L141] SORT_10 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_10; [L142] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L142] SORT_4 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L143] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L143] SORT_1 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L144] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L144] SORT_4 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L145] EXPR __VERIFIER_nondet_uchar() & mask_SORT_9 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L145] SORT_9 state_73 = __VERIFIER_nondet_uchar() & mask_SORT_9; [L146] EXPR __VERIFIER_nondet_uchar() & mask_SORT_4 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L146] SORT_4 state_96 = __VERIFIER_nondet_uchar() & mask_SORT_4; [L147] EXPR __VERIFIER_nondet_uchar() & mask_SORT_9 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L147] SORT_9 state_111 = __VERIFIER_nondet_uchar() & mask_SORT_9; [L148] EXPR __VERIFIER_nondet_uchar() & mask_SORT_9 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L148] SORT_9 state_113 = __VERIFIER_nondet_uchar() & mask_SORT_9; [L150] SORT_10 init_13_arg_1 = var_11; [L151] state_12 = init_13_arg_1 [L152] SORT_4 init_18_arg_1 = var_16; [L153] state_17 = init_18_arg_1 [L154] SORT_1 init_23_arg_1 = var_14; [L155] state_22 = init_23_arg_1 [L156] SORT_4 init_51_arg_1 = var_16; [L157] state_50 = init_51_arg_1 [L158] SORT_9 init_74_arg_1 = var_72; [L159] state_73 = init_74_arg_1 [L160] SORT_9 init_112_arg_1 = var_72; [L161] state_111 = init_112_arg_1 [L162] SORT_9 init_114_arg_1 = var_72; [L163] state_113 = init_114_arg_1 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L166] input_2 = __VERIFIER_nondet_uchar() [L167] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L167] input_2 = input_2 & mask_SORT_1 [L168] input_3 = __VERIFIER_nondet_uchar() [L169] input_5 = __VERIFIER_nondet_uchar() [L170] input_6 = __VERIFIER_nondet_uchar() [L171] EXPR input_6 & mask_SORT_1 VAL [input_2=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L171] input_6 = input_6 & mask_SORT_1 [L172] input_7 = __VERIFIER_nondet_uchar() [L173] EXPR input_7 & mask_SORT_1 VAL [input_2=0, input_6=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L173] input_7 = input_7 & mask_SORT_1 [L174] input_8 = __VERIFIER_nondet_uchar() [L175] EXPR input_8 & mask_SORT_1 VAL [input_2=0, input_6=0, input_7=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L175] input_8 = input_8 & mask_SORT_1 [L176] input_103 = __VERIFIER_nondet_uchar() [L177] input_116 = __VERIFIER_nondet_uchar() [L178] input_117 = __VERIFIER_nondet_uchar() [L179] input_118 = __VERIFIER_nondet_uchar() [L180] input_119 = __VERIFIER_nondet_uchar() [L181] input_128 = __VERIFIER_nondet_uchar() [L182] input_135 = __VERIFIER_nondet_uchar() [L183] input_142 = __VERIFIER_nondet_uchar() [L184] input_143 = __VERIFIER_nondet_uchar() [L185] input_144 = __VERIFIER_nondet_uchar() [L186] input_149 = __VERIFIER_nondet_uchar() [L187] input_153 = __VERIFIER_nondet_uchar() [L188] input_159 = __VERIFIER_nondet_uchar() [L189] input_174 = __VERIFIER_nondet_uchar() [L190] input_175 = __VERIFIER_nondet_uchar() [L191] input_176 = __VERIFIER_nondet_uchar() [L192] input_177 = __VERIFIER_nondet_uchar() [L193] input_184 = __VERIFIER_nondet_uchar() [L194] input_187 = __VERIFIER_nondet_uchar() [L195] input_195 = __VERIFIER_nondet_uchar() [L196] input_202 = __VERIFIER_nondet_uchar() [L197] input_203 = __VERIFIER_nondet_uchar() [L198] input_204 = __VERIFIER_nondet_uchar() [L199] input_207 = __VERIFIER_nondet_uchar() [L200] input_209 = __VERIFIER_nondet_uchar() [L201] input_214 = __VERIFIER_nondet_uchar() [L202] input_223 = __VERIFIER_nondet_uchar() [L203] input_235 = __VERIFIER_nondet_uchar() [L204] input_236 = __VERIFIER_nondet_uchar() [L205] input_237 = __VERIFIER_nondet_uchar() [L206] input_238 = __VERIFIER_nondet_uchar() [L207] input_245 = __VERIFIER_nondet_uchar() [L208] input_248 = __VERIFIER_nondet_uchar() [L209] input_251 = __VERIFIER_nondet_uchar() [L210] input_261 = __VERIFIER_nondet_uchar() [L211] input_276 = __VERIFIER_nondet_uchar() [L212] input_280 = __VERIFIER_nondet_uchar() [L213] input_281 = __VERIFIER_nondet_uchar() [L214] input_282 = __VERIFIER_nondet_uchar() [L215] input_283 = __VERIFIER_nondet_uchar() [L216] input_287 = __VERIFIER_nondet_uchar() [L217] input_292 = __VERIFIER_nondet_uchar() [L218] input_301 = __VERIFIER_nondet_uchar() [L219] input_311 = __VERIFIER_nondet_uchar() [L220] input_312 = __VERIFIER_nondet_uchar() [L221] input_313 = __VERIFIER_nondet_uchar() [L222] input_314 = __VERIFIER_nondet_uchar() [L223] input_320 = __VERIFIER_nondet_uchar() [L224] input_326 = __VERIFIER_nondet_uchar() [L225] input_333 = __VERIFIER_nondet_uchar() [L226] input_334 = __VERIFIER_nondet_uchar() [L227] input_335 = __VERIFIER_nondet_uchar() [L228] input_338 = __VERIFIER_nondet_uchar() [L229] input_340 = __VERIFIER_nondet_uchar() [L230] input_344 = __VERIFIER_nondet_uchar() [L231] input_345 = __VERIFIER_nondet_uchar() [L232] input_349 = __VERIFIER_nondet_uchar() [L233] input_354 = __VERIFIER_nondet_uchar() [L234] input_372 = __VERIFIER_nondet_uchar() [L235] input_373 = __VERIFIER_nondet_uchar() [L236] input_374 = __VERIFIER_nondet_uchar() [L237] input_375 = __VERIFIER_nondet_uchar() [L238] input_380 = __VERIFIER_nondet_uchar() [L239] input_383 = __VERIFIER_nondet_uchar() [L240] input_391 = __VERIFIER_nondet_uchar() [L241] input_398 = __VERIFIER_nondet_uchar() [L242] input_399 = __VERIFIER_nondet_uchar() [L243] input_400 = __VERIFIER_nondet_uchar() [L244] input_403 = __VERIFIER_nondet_uchar() [L245] input_405 = __VERIFIER_nondet_uchar() [L246] input_410 = __VERIFIER_nondet_uchar() [L247] input_419 = __VERIFIER_nondet_uchar() [L248] input_430 = __VERIFIER_nondet_uchar() [L249] input_431 = __VERIFIER_nondet_uchar() [L250] input_432 = __VERIFIER_nondet_uchar() [L251] input_433 = __VERIFIER_nondet_uchar() [L252] input_438 = __VERIFIER_nondet_uchar() [L253] input_441 = __VERIFIER_nondet_uchar() [L254] input_444 = __VERIFIER_nondet_uchar() [L255] input_454 = __VERIFIER_nondet_uchar() [L258] SORT_1 var_15_arg_0 = var_14; [L259] SORT_10 var_15_arg_1 = state_12; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_15_arg_0=0, var_15_arg_1=0, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L260] EXPR ((SORT_9)var_15_arg_0 << 3) | var_15_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L260] SORT_9 var_15 = ((SORT_9)var_15_arg_0 << 3) | var_15_arg_1; [L261] SORT_4 var_19_arg_0 = state_17; [L262] SORT_1 var_19_arg_1 = var_14; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_15=0, var_16=0, var_19_arg_0=0, var_19_arg_1=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L263] EXPR ((SORT_10)var_19_arg_0 << 1) | var_19_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_15=0, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L263] SORT_10 var_19 = ((SORT_10)var_19_arg_0 << 1) | var_19_arg_1; [L264] EXPR var_19 & mask_SORT_10 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_15=0, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L264] var_19 = var_19 & mask_SORT_10 [L265] SORT_1 var_20_arg_0 = var_14; [L266] SORT_10 var_20_arg_1 = var_19; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_15=0, var_16=0, var_20_arg_0=0, var_20_arg_1=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L267] EXPR ((SORT_9)var_20_arg_0 << 3) | var_20_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_15=0, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L267] SORT_9 var_20 = ((SORT_9)var_20_arg_0 << 3) | var_20_arg_1; [L268] SORT_9 var_21_arg_0 = var_15; [L269] SORT_9 var_21_arg_1 = var_20; [L270] SORT_9 var_21 = var_21_arg_0 + var_21_arg_1; [L271] SORT_1 var_24_arg_0 = var_14; [L272] SORT_1 var_24_arg_1 = state_22; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_24_arg_0=0, var_24_arg_1=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L273] EXPR ((SORT_4)var_24_arg_0 << 1) | var_24_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L273] SORT_4 var_24 = ((SORT_4)var_24_arg_0 << 1) | var_24_arg_1; [L274] EXPR var_24 & mask_SORT_4 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L274] var_24 = var_24 & mask_SORT_4 [L275] SORT_1 var_25_arg_0 = state_22; [L276] SORT_4 var_25_arg_1 = var_24; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_25_arg_0=0, var_25_arg_1=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L277] EXPR ((SORT_10)var_25_arg_0 << 2) | var_25_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L277] SORT_10 var_25 = ((SORT_10)var_25_arg_0 << 2) | var_25_arg_1; [L278] EXPR var_25 & mask_SORT_10 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L278] var_25 = var_25 & mask_SORT_10 [L279] SORT_1 var_26_arg_0 = var_14; [L280] SORT_10 var_26_arg_1 = var_25; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_26_arg_0=0, var_26_arg_1=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L281] EXPR ((SORT_9)var_26_arg_0 << 3) | var_26_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_21=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L281] SORT_9 var_26 = ((SORT_9)var_26_arg_0 << 3) | var_26_arg_1; [L282] SORT_9 var_27_arg_0 = var_21; [L283] SORT_9 var_27_arg_1 = var_26; [L284] SORT_9 var_27 = var_27_arg_0 + var_27_arg_1; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L285] EXPR var_27 & mask_SORT_9 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L285] var_27 = var_27 & mask_SORT_9 [L286] SORT_9 var_28_arg_0 = var_27; [L287] SORT_1 var_28 = var_28_arg_0 >> 3; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L288] EXPR var_28 & mask_SORT_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L288] var_28 = var_28 & mask_SORT_1 [L289] SORT_1 var_29_arg_0 = var_28; [L290] SORT_1 var_29_arg_1 = var_14; [L291] SORT_1 var_29 = var_29_arg_0 == var_29_arg_1; [L292] SORT_9 var_30_arg_0 = var_27; [L293] SORT_4 var_30 = var_30_arg_0 >> 1; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_29=1, var_30=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L294] EXPR var_30 & mask_SORT_4 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_29=1, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L294] var_30 = var_30 & mask_SORT_4 [L295] SORT_4 var_31_arg_0 = var_30; [L296] SORT_4 var_31_arg_1 = var_16; [L297] SORT_1 var_31 = var_31_arg_0 == var_31_arg_1; [L298] SORT_1 var_32_arg_0 = var_29; [L299] SORT_1 var_32_arg_1 = var_31; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_32_arg_0=1, var_32_arg_1=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L300] EXPR var_32_arg_0 | var_32_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L300] SORT_1 var_32 = var_32_arg_0 | var_32_arg_1; [L301] SORT_9 var_34_arg_0 = var_27; [L302] SORT_9 var_34_arg_1 = var_33; [L303] SORT_1 var_34 = var_34_arg_0 == var_34_arg_1; [L304] SORT_1 var_35_arg_0 = var_34; [L305] SORT_1 var_35 = ~var_35_arg_0; [L306] SORT_10 var_36_arg_0 = state_12; [L307] SORT_10 var_36_arg_1 = var_11; [L308] SORT_1 var_36 = var_36_arg_0 == var_36_arg_1; [L309] SORT_1 var_37_arg_0 = var_36; [L310] SORT_1 var_37 = ~var_37_arg_0; [L311] SORT_1 var_38_arg_0 = var_35; [L312] SORT_1 var_38_arg_1 = var_37; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_32=1, var_33=8, var_38_arg_0=-1, var_38_arg_1=-2, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L313] EXPR var_38_arg_0 | var_38_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_32=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L313] SORT_1 var_38 = var_38_arg_0 | var_38_arg_1; [L314] SORT_1 var_39_arg_0 = var_32; [L315] SORT_1 var_39_arg_1 = var_38; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_39_arg_0=1, var_39_arg_1=256, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L316] EXPR var_39_arg_0 & var_39_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L316] SORT_1 var_39 = var_39_arg_0 & var_39_arg_1; [L317] SORT_9 var_41_arg_0 = var_27; [L318] SORT_9 var_41_arg_1 = var_40; [L319] SORT_1 var_41 = var_41_arg_0 == var_41_arg_1; [L320] SORT_1 var_42_arg_0 = var_41; [L321] SORT_1 var_42 = ~var_42_arg_0; [L322] SORT_10 var_43_arg_0 = state_12; [L323] SORT_10 var_43_arg_1 = var_11; [L324] SORT_1 var_43 = var_43_arg_0 == var_43_arg_1; [L325] SORT_1 var_44_arg_0 = var_43; [L326] SORT_1 var_44 = ~var_44_arg_0; [L327] SORT_4 var_45_arg_0 = state_17; [L328] SORT_4 var_45_arg_1 = var_16; [L329] SORT_1 var_45 = var_45_arg_0 == var_45_arg_1; [L330] SORT_1 var_46_arg_0 = var_45; [L331] SORT_1 var_46 = ~var_46_arg_0; [L332] SORT_1 var_47_arg_0 = var_44; [L333] SORT_1 var_47_arg_1 = var_46; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_39=0, var_40=7, var_42=-1, var_47_arg_0=-2, var_47_arg_1=-2, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L334] EXPR var_47_arg_0 | var_47_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_39=0, var_40=7, var_42=-1, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L334] SORT_1 var_47 = var_47_arg_0 | var_47_arg_1; [L335] SORT_1 var_48_arg_0 = var_42; [L336] SORT_1 var_48_arg_1 = var_47; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_39=0, var_40=7, var_48_arg_0=-1, var_48_arg_1=254, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L337] EXPR var_48_arg_0 | var_48_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_39=0, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L337] SORT_1 var_48 = var_48_arg_0 | var_48_arg_1; [L338] SORT_1 var_49_arg_0 = var_39; [L339] SORT_1 var_49_arg_1 = var_48; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_40=7, var_49_arg_0=0, var_49_arg_1=256, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L340] EXPR var_49_arg_0 & var_49_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L340] SORT_1 var_49 = var_49_arg_0 & var_49_arg_1; [L341] SORT_4 var_53_arg_0 = state_50; [L342] SORT_4 var_53_arg_1 = var_52; [L343] SORT_1 var_53 = var_53_arg_0 == var_53_arg_1; [L344] SORT_9 var_54_arg_0 = var_27; [L345] SORT_9 var_54_arg_1 = var_40; [L346] SORT_1 var_54 = var_54_arg_0 == var_54_arg_1; [L347] SORT_1 var_55_arg_0 = var_53; [L348] SORT_1 var_55_arg_1 = var_54; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_55_arg_0=0, var_55_arg_1=0, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L349] EXPR var_55_arg_0 & var_55_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_28=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L349] SORT_1 var_55 = var_55_arg_0 & var_55_arg_1; [L350] SORT_1 var_57_arg_0 = var_28; [L351] SORT_1 var_57_arg_1 = var_56; [L352] SORT_1 var_57 = var_57_arg_0 == var_57_arg_1; [L353] SORT_1 var_58_arg_0 = var_55; [L354] SORT_1 var_58_arg_1 = var_57; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_56=1, var_58_arg_0=0, var_58_arg_1=0, var_66=2, var_72=0, var_79=3, var_98=5] [L355] EXPR var_58_arg_0 | var_58_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L355] SORT_1 var_58 = var_58_arg_0 | var_58_arg_1; [L356] SORT_1 var_59_arg_0 = var_58; [L357] SORT_1 var_59 = ~var_59_arg_0; [L358] SORT_10 var_60_arg_0 = state_12; [L359] SORT_10 var_60_arg_1 = var_11; [L360] SORT_1 var_60 = var_60_arg_0 == var_60_arg_1; [L361] SORT_4 var_61_arg_0 = state_17; [L362] SORT_4 var_61_arg_1 = var_16; [L363] SORT_1 var_61 = var_61_arg_0 == var_61_arg_1; [L364] SORT_1 var_62_arg_0 = var_60; [L365] SORT_1 var_62_arg_1 = var_61; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_56=1, var_59=-1, var_62_arg_0=1, var_62_arg_1=1, var_66=2, var_72=0, var_79=3, var_98=5] [L366] EXPR var_62_arg_0 & var_62_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_56=1, var_59=-1, var_66=2, var_72=0, var_79=3, var_98=5] [L366] SORT_1 var_62 = var_62_arg_0 & var_62_arg_1; [L367] SORT_1 var_63_arg_0 = var_62; [L368] SORT_1 var_63 = ~var_63_arg_0; [L369] SORT_1 var_64_arg_0 = var_59; [L370] SORT_1 var_64_arg_1 = var_63; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_56=1, var_64_arg_0=-1, var_64_arg_1=-2, var_66=2, var_72=0, var_79=3, var_98=5] [L371] EXPR var_64_arg_0 | var_64_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_49=0, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L371] SORT_1 var_64 = var_64_arg_0 | var_64_arg_1; [L372] SORT_1 var_65_arg_0 = var_49; [L373] SORT_1 var_65_arg_1 = var_64; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_65_arg_0=0, var_65_arg_1=256, var_66=2, var_72=0, var_79=3, var_98=5] [L374] EXPR var_65_arg_0 & var_65_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L374] SORT_1 var_65 = var_65_arg_0 & var_65_arg_1; [L375] SORT_4 var_67_arg_0 = state_50; [L376] SORT_4 var_67_arg_1 = var_66; [L377] SORT_1 var_67 = var_67_arg_0 == var_67_arg_1; [L378] SORT_1 var_68_arg_0 = var_67; [L379] SORT_1 var_68 = ~var_68_arg_0; [L380] SORT_1 var_69_arg_0 = state_22; [L381] SORT_1 var_69_arg_1 = var_14; [L382] SORT_1 var_69 = var_69_arg_0 == var_69_arg_1; [L383] SORT_10 var_70_arg_0 = state_12; [L384] SORT_10 var_70_arg_1 = var_11; [L385] SORT_1 var_70 = var_70_arg_0 == var_70_arg_1; [L386] SORT_1 var_71_arg_0 = var_69; [L387] SORT_1 var_71_arg_1 = var_70; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_65=0, var_66=2, var_68=-1, var_71_arg_0=1, var_71_arg_1=1, var_72=0, var_79=3, var_98=5] [L388] EXPR var_71_arg_0 & var_71_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_65=0, var_66=2, var_68=-1, var_72=0, var_79=3, var_98=5] [L388] SORT_1 var_71 = var_71_arg_0 & var_71_arg_1; [L389] SORT_9 var_75_arg_0 = state_73; [L390] SORT_9 var_75_arg_1 = var_72; [L391] SORT_1 var_75 = var_75_arg_0 == var_75_arg_1; [L392] SORT_1 var_76_arg_0 = var_71; [L393] SORT_1 var_76_arg_1 = var_75; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_65=0, var_66=2, var_68=-1, var_72=0, var_76_arg_0=1, var_76_arg_1=1, var_79=3, var_98=5] [L394] EXPR var_76_arg_0 & var_76_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_65=0, var_66=2, var_68=-1, var_72=0, var_79=3, var_98=5] [L394] SORT_1 var_76 = var_76_arg_0 & var_76_arg_1; [L395] SORT_1 var_77_arg_0 = var_68; [L396] SORT_1 var_77_arg_1 = var_76; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_65=0, var_66=2, var_72=0, var_77_arg_0=-1, var_77_arg_1=1, var_79=3, var_98=5] [L397] EXPR var_77_arg_0 | var_77_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_65=0, var_66=2, var_72=0, var_79=3, var_98=5] [L397] SORT_1 var_77 = var_77_arg_0 | var_77_arg_1; [L398] SORT_1 var_78_arg_0 = var_65; [L399] SORT_1 var_78_arg_1 = var_77; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78_arg_0=0, var_78_arg_1=256, var_79=3, var_98=5] [L400] EXPR var_78_arg_0 & var_78_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L400] SORT_1 var_78 = var_78_arg_0 & var_78_arg_1; [L401] SORT_4 var_80_arg_0 = state_50; [L402] SORT_4 var_80_arg_1 = var_79; [L403] SORT_1 var_80 = var_80_arg_0 == var_80_arg_1; [L404] SORT_1 var_81_arg_0 = var_80; [L405] SORT_1 var_81 = ~var_81_arg_0; [L406] SORT_9 var_82_arg_0 = var_27; [L407] SORT_4 var_82 = var_82_arg_0 >> 2; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_82=0, var_98=5] [L408] EXPR var_82 & mask_SORT_4 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_98=5] [L408] var_82 = var_82 & mask_SORT_4 [L409] SORT_4 var_83_arg_0 = var_82; [L410] SORT_4 var_83_arg_1 = var_52; [L411] SORT_1 var_83 = var_83_arg_0 == var_83_arg_1; [L412] SORT_9 var_84_arg_0 = var_27; [L413] SORT_4 var_84 = var_84_arg_0 >> 0; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_83=0, var_84=0, var_98=5] [L414] EXPR var_84 & mask_SORT_4 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_83=0, var_98=5] [L414] var_84 = var_84 & mask_SORT_4 [L415] SORT_4 var_85_arg_0 = var_84; [L416] SORT_4 var_85_arg_1 = var_52; [L417] SORT_1 var_85 = var_85_arg_0 == var_85_arg_1; [L418] SORT_4 var_86_arg_0 = var_84; [L419] SORT_4 var_86_arg_1 = var_66; [L420] SORT_1 var_86 = var_86_arg_0 == var_86_arg_1; [L421] SORT_1 var_87_arg_0 = var_85; [L422] SORT_1 var_87_arg_1 = var_86; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_83=0, var_87_arg_0=0, var_87_arg_1=0, var_98=5] [L423] EXPR var_87_arg_0 | var_87_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_83=0, var_98=5] [L423] SORT_1 var_87 = var_87_arg_0 | var_87_arg_1; [L424] SORT_1 var_88_arg_0 = var_83; [L425] SORT_1 var_88_arg_1 = var_87; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_88_arg_0=0, var_88_arg_1=0, var_98=5] [L426] EXPR var_88_arg_0 & var_88_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_81=-1, var_98=5] [L426] SORT_1 var_88 = var_88_arg_0 & var_88_arg_1; [L427] SORT_1 var_89_arg_0 = var_81; [L428] SORT_1 var_89_arg_1 = var_88; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_89_arg_0=-1, var_89_arg_1=0, var_98=5] [L429] EXPR var_89_arg_0 | var_89_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_78=0, var_79=3, var_98=5] [L429] SORT_1 var_89 = var_89_arg_0 | var_89_arg_1; [L430] SORT_1 var_90_arg_0 = var_78; [L431] SORT_1 var_90_arg_1 = var_89; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_90_arg_0=0, var_90_arg_1=255, var_98=5] [L432] EXPR var_90_arg_0 & var_90_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L432] SORT_1 var_90 = var_90_arg_0 & var_90_arg_1; [L433] SORT_1 var_93_arg_0 = var_90; [L434] SORT_1 var_93 = ~var_93_arg_0; [L435] SORT_1 var_94_arg_0 = var_56; [L436] SORT_1 var_94_arg_1 = var_93; VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_94_arg_0=1, var_94_arg_1=-1, var_98=5] [L437] EXPR var_94_arg_0 & var_94_arg_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L437] SORT_1 var_94 = var_94_arg_0 & var_94_arg_1; [L438] EXPR var_94 & mask_SORT_1 VAL [input_2=0, input_6=0, input_7=0, input_8=0, mask_SORT_10=7, mask_SORT_1=1, mask_SORT_4=3, mask_SORT_9=15, state_111=0, state_113=0, state_12=0, state_17=0, state_22=0, state_50=0, state_73=0, state_96=0, var_11=0, var_120=1, var_122=15, var_14=0, var_150=6, var_16=0, var_27=0, var_315=1, var_33=8, var_40=7, var_52=1, var_56=1, var_66=2, var_72=0, var_79=3, var_98=5] [L438] var_94 = var_94 & mask_SORT_1 [L439] SORT_1 bad_95_arg_0 = var_94; [L440] CALL __VERIFIER_assert(!(bad_95_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 326 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 38.0s, OverallIterations: 32, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 15138 SdHoareTripleChecker+Valid, 6.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 15138 mSDsluCounter, 60636 SdHoareTripleChecker+Invalid, 5.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 46519 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3647 IncrementalHoareTripleChecker+Invalid, 3671 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 14117 mSDtfsCounter, 3647 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 267 GetRequests, 75 SyntacticMatches, 2 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=682occurred in iteration=19, InterpolantAutomatonStates: 190, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 1804 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 4.4s SatisfiabilityAnalysisTime, 21.6s InterpolantComputationTime, 3448 NumberOfCodeBlocks, 3448 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 3303 ConstructedInterpolants, 0 QuantifiedInterpolants, 9705 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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 19:51:24,266 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/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_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/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_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/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 6b894aafaf217d6baa0c5f761ec3f51539bf2a720cb529b8ece9095e2a660f16 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 19:51:26,778 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 19:51:26,881 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-27 19:51:26,886 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 19:51:26,887 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 19:51:26,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 19:51:26,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 19:51:26,912 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 19:51:26,912 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 19:51:26,912 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 19:51:26,912 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 19:51:26,913 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 19:51:26,913 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 19:51:26,913 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 19:51:26,913 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 19:51:26,913 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 19:51:26,914 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 19:51:26,914 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 19:51:26,914 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 19:51:26,914 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 19:51:26,914 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 19:51:26,914 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 19:51:26,914 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-27 19:51:26,914 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-27 19:51:26,914 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 19:51:26,915 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 19:51:26,915 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 19:51:26,915 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 19:51:26,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:51:26,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:51:26,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:51:26,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:51:26,915 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 19:51:26,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:51:26,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:51:26,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:51:26,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:51:26,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 19:51:26,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 19:51:26,916 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 19:51:26,916 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 19:51:26,916 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2024-11-27 19:51:26,916 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-27 19:51:26,916 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 19:51:26,916 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 19:51:26,916 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 19:51:26,916 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 19:51:26,916 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_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/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 -> 6b894aafaf217d6baa0c5f761ec3f51539bf2a720cb529b8ece9095e2a660f16 [2024-11-27 19:51:27,245 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 19:51:27,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 19:51:27,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 19:51:27,258 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 19:51:27,258 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 19:51:27,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c [2024-11-27 19:51:30,361 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/data/60b9189dd/4b0ac9f4afc74b2aa2f7db9502d97283/FLAG1760e1c2a [2024-11-27 19:51:30,725 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 19:51:30,725 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c [2024-11-27 19:51:30,748 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/data/60b9189dd/4b0ac9f4afc74b2aa2f7db9502d97283/FLAG1760e1c2a [2024-11-27 19:51:30,940 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/data/60b9189dd/4b0ac9f4afc74b2aa2f7db9502d97283 [2024-11-27 19:51:30,944 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 19:51:30,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 19:51:30,947 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 19:51:30,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 19:51:30,953 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 19:51:30,957 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:51:30" (1/1) ... [2024-11-27 19:51:30,958 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ec8aade and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:30, skipping insertion in model container [2024-11-27 19:51:30,958 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:51:30" (1/1) ... [2024-11-27 19:51:31,023 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 19:51:31,228 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_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c[1249,1262] [2024-11-27 19:51:31,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:51:31,595 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 19:51:31,609 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_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_Vending.c[1249,1262] [2024-11-27 19:51:31,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:51:31,819 INFO L204 MainTranslator]: Completed translation [2024-11-27 19:51:31,820 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:31 WrapperNode [2024-11-27 19:51:31,820 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 19:51:31,821 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 19:51:31,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 19:51:31,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 19:51:31,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:31" (1/1) ... [2024-11-27 19:51:31,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:31" (1/1) ... [2024-11-27 19:51:31,991 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1585 [2024-11-27 19:51:31,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 19:51:31,991 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 19:51:31,991 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 19:51:31,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 19:51:32,003 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:31" (1/1) ... [2024-11-27 19:51:32,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:31" (1/1) ... [2024-11-27 19:51:32,013 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:31" (1/1) ... [2024-11-27 19:51:32,062 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 19:51:32,062 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:31" (1/1) ... [2024-11-27 19:51:32,063 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:31" (1/1) ... [2024-11-27 19:51:32,102 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:31" (1/1) ... [2024-11-27 19:51:32,105 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:31" (1/1) ... [2024-11-27 19:51:32,109 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:31" (1/1) ... [2024-11-27 19:51:32,114 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:31" (1/1) ... [2024-11-27 19:51:32,120 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:31" (1/1) ... [2024-11-27 19:51:32,131 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 19:51:32,131 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 19:51:32,132 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 19:51:32,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 19:51:32,133 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:31" (1/1) ... [2024-11-27 19:51:32,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:51:32,159 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:51:32,177 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 19:51:32,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 19:51:32,206 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 19:51:32,206 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-27 19:51:32,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 19:51:32,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 19:51:32,617 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 19:51:32,619 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 19:51:33,996 INFO L? ?]: Removed 272 outVars from TransFormulas that were not future-live. [2024-11-27 19:51:33,996 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 19:51:34,006 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 19:51:34,006 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-27 19:51:34,007 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:51:34 BoogieIcfgContainer [2024-11-27 19:51:34,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 19:51:34,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 19:51:34,011 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 19:51:34,017 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 19:51:34,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 07:51:30" (1/3) ... [2024-11-27 19:51:34,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301720ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:51:34, skipping insertion in model container [2024-11-27 19:51:34,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:51:31" (2/3) ... [2024-11-27 19:51:34,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301720ba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:51:34, skipping insertion in model container [2024-11-27 19:51:34,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:51:34" (3/3) ... [2024-11-27 19:51:34,022 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_Vending.c [2024-11-27 19:51:34,039 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 19:51:34,040 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.h_Vending.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2024-11-27 19:51:34,100 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 19:51:34,116 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;@49196797, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 19:51:34,117 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-27 19:51:34,121 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 19:51:34,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-27 19:51:34,126 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:34,127 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-27 19:51:34,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:34,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:34,135 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-27 19:51:34,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:51:34,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1185307013] [2024-11-27 19:51:34,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:34,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:51:34,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:51:34,157 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:51:34,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 19:51:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:34,705 WARN L254 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 131 conjuncts are in the unsatisfiable core [2024-11-27 19:51:34,739 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:51:37,385 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 19:51:37,387 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-27 19:51:37,388 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2024-11-27 19:51:37,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1185307013] [2024-11-27 19:51:37,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1185307013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:51:37,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:51:37,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:51:37,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183810622] [2024-11-27 19:51:37,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:51:37,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:51:37,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2024-11-27 19:51:37,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:51:37,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:51:37,422 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 19:51:37,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:37,606 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-27 19:51:37,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:51:37,608 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 19:51:37,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:37,614 INFO L225 Difference]: With dead ends: 18 [2024-11-27 19:51:37,614 INFO L226 Difference]: Without dead ends: 10 [2024-11-27 19:51:37,617 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 19:51:37,620 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:37,620 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.1s Time] [2024-11-27 19:51:37,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-27 19:51:37,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-27 19:51:37,643 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 19:51:37,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-27 19:51:37,648 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-27 19:51:37,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:37,648 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-27 19:51:37,648 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 19:51:37,648 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-27 19:51:37,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-27 19:51:37,649 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:37,649 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:37,660 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-27 19:51:37,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:51:37,853 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-27 19:51:37,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:37,854 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-27 19:51:37,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2024-11-27 19:51:37,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046119840] [2024-11-27 19:51:37,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:37,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:51:37,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:51:37,858 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:51:37,860 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fe8271eb-6b63-46a2-8b4e-c6d81d3df558/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 19:51:38,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:38,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 419 conjuncts, 180 conjuncts are in the unsatisfiable core [2024-11-27 19:51:38,596 INFO L279 TraceCheckSpWp]: Computing forward predicates...