./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-86.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a0165632 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-86.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0b1bd1257190961b4c1941dc1e9dfbe09ed3b9534a64219badf358449b7e869c --- Real Ultimate output --- This is Ultimate 0.2.5-dev-a016563 [2024-11-08 19:16:07,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 19:16:07,452 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 19:16:07,458 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 19:16:07,460 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 19:16:07,499 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 19:16:07,500 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 19:16:07,501 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 19:16:07,501 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 19:16:07,502 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 19:16:07,502 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 19:16:07,502 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 19:16:07,503 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 19:16:07,503 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 19:16:07,504 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 19:16:07,504 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 19:16:07,504 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 19:16:07,505 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 19:16:07,505 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 19:16:07,505 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 19:16:07,506 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 19:16:07,506 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 19:16:07,507 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 19:16:07,507 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 19:16:07,507 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 19:16:07,507 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 19:16:07,508 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 19:16:07,508 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 19:16:07,508 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 19:16:07,509 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 19:16:07,509 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 19:16:07,509 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 19:16:07,510 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:16:07,510 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 19:16:07,510 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 19:16:07,511 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 19:16:07,511 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 19:16:07,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 19:16:07,511 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 19:16:07,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 19:16:07,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 19:16:07,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 19:16:07,513 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0b1bd1257190961b4c1941dc1e9dfbe09ed3b9534a64219badf358449b7e869c [2024-11-08 19:16:07,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 19:16:07,769 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 19:16:07,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 19:16:07,776 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 19:16:07,777 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 19:16:07,779 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-86.i Unable to find full path for "g++" [2024-11-08 19:16:09,817 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 19:16:10,079 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 19:16:10,081 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-86.i [2024-11-08 19:16:10,094 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX/data/78f2062de/9ab5242af6ae452e87d1bb668fddba8c/FLAG757c57ded [2024-11-08 19:16:10,115 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX/data/78f2062de/9ab5242af6ae452e87d1bb668fddba8c [2024-11-08 19:16:10,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 19:16:10,119 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 19:16:10,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 19:16:10,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 19:16:10,128 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 19:16:10,131 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:16:10" (1/1) ... [2024-11-08 19:16:10,132 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5caffbc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:16:10, skipping insertion in model container [2024-11-08 19:16:10,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 07:16:10" (1/1) ... [2024-11-08 19:16:10,167 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 19:16:10,399 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_b521a11d-2d51-44d6-9c79-62481f2b6a82/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-86.i[915,928] [2024-11-08 19:16:10,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:16:10,458 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 19:16:10,470 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_b521a11d-2d51-44d6-9c79-62481f2b6a82/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-86.i[915,928] [2024-11-08 19:16:10,495 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 19:16:10,516 INFO L204 MainTranslator]: Completed translation [2024-11-08 19:16:10,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:16:10 WrapperNode [2024-11-08 19:16:10,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 19:16:10,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 19:16:10,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 19:16:10,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 19:16:10,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:16:10" (1/1) ... [2024-11-08 19:16:10,537 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:16:10" (1/1) ... [2024-11-08 19:16:10,592 INFO L138 Inliner]: procedures = 26, calls = 30, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2024-11-08 19:16:10,592 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 19:16:10,593 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 19:16:10,593 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 19:16:10,593 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 19:16:10,605 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:16:10" (1/1) ... [2024-11-08 19:16:10,606 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:16:10" (1/1) ... [2024-11-08 19:16:10,609 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:16:10" (1/1) ... [2024-11-08 19:16:10,633 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-08 19:16:10,634 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:16:10" (1/1) ... [2024-11-08 19:16:10,634 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:16:10" (1/1) ... [2024-11-08 19:16:10,640 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:16:10" (1/1) ... [2024-11-08 19:16:10,643 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:16:10" (1/1) ... [2024-11-08 19:16:10,645 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:16:10" (1/1) ... [2024-11-08 19:16:10,647 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:16:10" (1/1) ... [2024-11-08 19:16:10,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 19:16:10,652 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 19:16:10,652 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 19:16:10,652 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 19:16:10,653 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:16:10" (1/1) ... [2024-11-08 19:16:10,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 19:16:10,675 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:16:10,689 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 19:16:10,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 19:16:10,726 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 19:16:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 19:16:10,727 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 19:16:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 19:16:10,727 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 19:16:10,728 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 19:16:10,814 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 19:16:10,817 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 19:16:11,170 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-08 19:16:11,171 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 19:16:11,190 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 19:16:11,190 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-08 19:16:11,190 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:16:11 BoogieIcfgContainer [2024-11-08 19:16:11,190 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 19:16:11,192 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 19:16:11,193 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 19:16:11,195 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 19:16:11,196 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 07:16:10" (1/3) ... [2024-11-08 19:16:11,196 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4300f002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:16:11, skipping insertion in model container [2024-11-08 19:16:11,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 07:16:10" (2/3) ... [2024-11-08 19:16:11,197 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4300f002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 07:16:11, skipping insertion in model container [2024-11-08 19:16:11,197 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:16:11" (3/3) ... [2024-11-08 19:16:11,198 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-86.i [2024-11-08 19:16:11,213 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 19:16:11,214 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 19:16:11,289 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 19:16:11,295 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;@2ae70cdd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 19:16:11,295 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 19:16:11,300 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 19:16:11,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 19:16:11,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:16:11,312 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:16:11,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:16:11,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:16:11,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1050406110, now seen corresponding path program 1 times [2024-11-08 19:16:11,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:16:11,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16603356] [2024-11-08 19:16:11,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:16:11,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:16:11,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:11,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:16:11,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:11,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 19:16:11,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:11,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 19:16:11,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:11,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:16:11,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:11,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:16:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:11,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 19:16:11,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:11,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:16:11,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:11,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:16:11,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:11,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:16:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:11,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:16:11,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:11,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:16:11,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:11,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:16:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:11,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:16:11,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:11,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:16:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:11,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:16:11,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:11,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:16:11,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:11,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:16:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:11,835 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 19:16:11,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:16:11,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16603356] [2024-11-08 19:16:11,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [16603356] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:16:11,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:16:11,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 19:16:11,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649762358] [2024-11-08 19:16:11,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:16:11,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 19:16:11,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:16:11,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 19:16:11,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:16:11,871 INFO L87 Difference]: Start difference. First operand has 52 states, 32 states have (on average 1.3125) internal successors, (42), 33 states have internal predecessors, (42), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 19:16:11,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:16:11,900 INFO L93 Difference]: Finished difference Result 101 states and 166 transitions. [2024-11-08 19:16:11,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 19:16:11,903 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 109 [2024-11-08 19:16:11,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:16:11,910 INFO L225 Difference]: With dead ends: 101 [2024-11-08 19:16:11,911 INFO L226 Difference]: Without dead ends: 48 [2024-11-08 19:16:11,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 19:16:11,918 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:16:11,919 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:16:11,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2024-11-08 19:16:11,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2024-11-08 19:16:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 19:16:11,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 69 transitions. [2024-11-08 19:16:11,961 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 69 transitions. Word has length 109 [2024-11-08 19:16:11,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:16:11,962 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 69 transitions. [2024-11-08 19:16:11,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-08 19:16:11,963 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 69 transitions. [2024-11-08 19:16:11,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 19:16:11,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:16:11,966 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:16:11,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 19:16:11,967 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:16:11,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:16:11,967 INFO L85 PathProgramCache]: Analyzing trace with hash 386156700, now seen corresponding path program 1 times [2024-11-08 19:16:11,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:16:11,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753696322] [2024-11-08 19:16:11,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:16:11,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:16:12,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:17,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:16:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:17,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 19:16:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:17,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 19:16:17,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:17,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:16:17,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:17,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:16:17,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:17,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 19:16:17,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:17,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:16:17,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:17,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:16:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:17,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:16:17,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:17,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:16:17,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:17,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:16:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:17,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:16:17,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:17,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:16:17,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:17,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:16:17,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:17,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:16:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:17,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:16:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:17,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:16:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:17,276 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 19:16:17,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:16:17,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753696322] [2024-11-08 19:16:17,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753696322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:16:17,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:16:17,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 19:16:17,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236396549] [2024-11-08 19:16:17,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:16:17,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:16:17,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:16:17,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:16:17,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:16:17,281 INFO L87 Difference]: Start difference. First operand 48 states and 69 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:16:18,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:16:18,021 INFO L93 Difference]: Finished difference Result 75 states and 102 transitions. [2024-11-08 19:16:18,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:16:18,022 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-08 19:16:18,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:16:18,024 INFO L225 Difference]: With dead ends: 75 [2024-11-08 19:16:18,025 INFO L226 Difference]: Without dead ends: 73 [2024-11-08 19:16:18,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:16:18,027 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 34 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 19:16:18,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 256 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 19:16:18,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-11-08 19:16:18,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2024-11-08 19:16:18,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 37 states have internal predecessors, (46), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-08 19:16:18,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 80 transitions. [2024-11-08 19:16:18,044 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 80 transitions. Word has length 109 [2024-11-08 19:16:18,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:16:18,045 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 80 transitions. [2024-11-08 19:16:18,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:16:18,047 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 80 transitions. [2024-11-08 19:16:18,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 19:16:18,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:16:18,052 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:16:18,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 19:16:18,053 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:16:18,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:16:18,055 INFO L85 PathProgramCache]: Analyzing trace with hash -6870310, now seen corresponding path program 1 times [2024-11-08 19:16:18,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:16:18,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360684431] [2024-11-08 19:16:18,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:16:18,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:16:18,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:18,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:16:18,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:18,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 19:16:18,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:18,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 19:16:18,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:18,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:16:18,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:18,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:16:18,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:18,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 19:16:18,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:18,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:16:18,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:18,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:16:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:18,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:16:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:18,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:16:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:18,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:16:18,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:18,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:16:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:18,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:16:18,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:18,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:16:18,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:18,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:16:18,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:18,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:16:18,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:18,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:16:18,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:18,453 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 19:16:18,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:16:18,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360684431] [2024-11-08 19:16:18,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360684431] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:16:18,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:16:18,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:16:18,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839353462] [2024-11-08 19:16:18,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:16:18,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:16:18,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:16:18,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:16:18,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:16:18,456 INFO L87 Difference]: Start difference. First operand 56 states and 80 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:16:18,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:16:18,493 INFO L93 Difference]: Finished difference Result 154 states and 223 transitions. [2024-11-08 19:16:18,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:16:18,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-08 19:16:18,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:16:18,496 INFO L225 Difference]: With dead ends: 154 [2024-11-08 19:16:18,496 INFO L226 Difference]: Without dead ends: 101 [2024-11-08 19:16:18,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:16:18,498 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 32 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:16:18,499 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 138 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:16:18,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-08 19:16:18,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2024-11-08 19:16:18,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 62 states have (on average 1.2096774193548387) internal successors, (75), 62 states have internal predecessors, (75), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 19:16:18,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 143 transitions. [2024-11-08 19:16:18,535 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 143 transitions. Word has length 109 [2024-11-08 19:16:18,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:16:18,536 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 143 transitions. [2024-11-08 19:16:18,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:16:18,537 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 143 transitions. [2024-11-08 19:16:18,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-08 19:16:18,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:16:18,541 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:16:18,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 19:16:18,542 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:16:18,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:16:18,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1781877672, now seen corresponding path program 1 times [2024-11-08 19:16:18,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:16:18,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313518461] [2024-11-08 19:16:18,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:16:18,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:16:18,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:20,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:16:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:20,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 19:16:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:20,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 19:16:20,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:20,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:16:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:20,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:16:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:20,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 19:16:20,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:20,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:16:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:20,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:16:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:20,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:16:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:20,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:16:20,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:20,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:16:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:20,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:16:20,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:20,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:16:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:20,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:16:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:20,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:16:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:20,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:16:20,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:20,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:16:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:20,943 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 19:16:20,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:16:20,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313518461] [2024-11-08 19:16:20,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313518461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:16:20,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:16:20,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 19:16:20,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673306556] [2024-11-08 19:16:20,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:16:20,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:16:20,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:16:20,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:16:20,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:16:20,946 INFO L87 Difference]: Start difference. First operand 99 states and 143 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:16:21,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:16:21,572 INFO L93 Difference]: Finished difference Result 116 states and 162 transitions. [2024-11-08 19:16:21,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:16:21,577 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 109 [2024-11-08 19:16:21,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:16:21,579 INFO L225 Difference]: With dead ends: 116 [2024-11-08 19:16:21,579 INFO L226 Difference]: Without dead ends: 114 [2024-11-08 19:16:21,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:16:21,584 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 37 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 19:16:21,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 248 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 19:16:21,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-08 19:16:21,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 99. [2024-11-08 19:16:21,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 19:16:21,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 142 transitions. [2024-11-08 19:16:21,622 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 142 transitions. Word has length 109 [2024-11-08 19:16:21,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:16:21,623 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 142 transitions. [2024-11-08 19:16:21,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 9 states have internal predecessors, (27), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:16:21,624 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 142 transitions. [2024-11-08 19:16:21,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 19:16:21,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:16:21,626 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:16:21,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 19:16:21,630 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:16:21,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:16:21,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1099961078, now seen corresponding path program 1 times [2024-11-08 19:16:21,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:16:21,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094644771] [2024-11-08 19:16:21,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:16:21,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:16:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:23,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:16:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:23,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 19:16:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:23,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 19:16:23,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:23,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:16:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:23,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:16:23,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:23,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 19:16:23,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:23,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:16:23,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:23,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:16:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:23,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:16:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:23,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:16:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:23,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:16:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:23,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:16:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:23,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:16:23,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:23,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:16:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:23,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:16:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:23,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:16:23,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:23,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:16:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:23,468 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 19:16:23,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:16:23,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094644771] [2024-11-08 19:16:23,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094644771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:16:23,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:16:23,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-08 19:16:23,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023116704] [2024-11-08 19:16:23,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:16:23,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-08 19:16:23,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:16:23,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-08 19:16:23,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-08 19:16:23,472 INFO L87 Difference]: Start difference. First operand 99 states and 142 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:16:23,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:16:23,756 INFO L93 Difference]: Finished difference Result 185 states and 259 transitions. [2024-11-08 19:16:23,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 19:16:23,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2024-11-08 19:16:23,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:16:23,759 INFO L225 Difference]: With dead ends: 185 [2024-11-08 19:16:23,760 INFO L226 Difference]: Without dead ends: 132 [2024-11-08 19:16:23,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2024-11-08 19:16:23,762 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 25 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:16:23,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 312 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:16:23,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-08 19:16:23,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 105. [2024-11-08 19:16:23,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 68 states have (on average 1.2058823529411764) internal successors, (82), 68 states have internal predecessors, (82), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 19:16:23,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 150 transitions. [2024-11-08 19:16:23,784 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 150 transitions. Word has length 110 [2024-11-08 19:16:23,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:16:23,785 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 150 transitions. [2024-11-08 19:16:23,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:16:23,786 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 150 transitions. [2024-11-08 19:16:23,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 19:16:23,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:16:23,788 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:16:23,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 19:16:23,788 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:16:23,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:16:23,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1101808120, now seen corresponding path program 1 times [2024-11-08 19:16:23,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:16:23,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322101467] [2024-11-08 19:16:23,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:16:23,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:16:23,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:25,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:16:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:25,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 19:16:25,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:25,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 19:16:25,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:25,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:16:25,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:25,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:16:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:25,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 19:16:25,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:25,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:16:25,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:25,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:16:25,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:25,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:16:25,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:25,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:16:25,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:25,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:16:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:25,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:16:25,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:25,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:16:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:25,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:16:25,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:25,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:16:25,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:25,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:16:25,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:25,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:16:25,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:25,936 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 19:16:25,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:16:25,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322101467] [2024-11-08 19:16:25,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322101467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:16:25,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:16:25,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 19:16:25,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823518742] [2024-11-08 19:16:25,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:16:25,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 19:16:25,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:16:25,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 19:16:25,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 19:16:25,940 INFO L87 Difference]: Start difference. First operand 105 states and 150 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:16:26,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:16:26,362 INFO L93 Difference]: Finished difference Result 186 states and 261 transitions. [2024-11-08 19:16:26,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 19:16:26,363 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2024-11-08 19:16:26,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:16:26,365 INFO L225 Difference]: With dead ends: 186 [2024-11-08 19:16:26,365 INFO L226 Difference]: Without dead ends: 127 [2024-11-08 19:16:26,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-08 19:16:26,367 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 26 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 19:16:26,368 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 337 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 19:16:26,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-08 19:16:26,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 103. [2024-11-08 19:16:26,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.196969696969697) internal successors, (79), 66 states have internal predecessors, (79), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 19:16:26,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 147 transitions. [2024-11-08 19:16:26,386 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 147 transitions. Word has length 110 [2024-11-08 19:16:26,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:16:26,387 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 147 transitions. [2024-11-08 19:16:26,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:16:26,388 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 147 transitions. [2024-11-08 19:16:26,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-08 19:16:26,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:16:26,389 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 19:16:26,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 19:16:26,390 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:16:26,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:16:26,391 INFO L85 PathProgramCache]: Analyzing trace with hash 290614452, now seen corresponding path program 1 times [2024-11-08 19:16:26,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:16:26,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712843027] [2024-11-08 19:16:26,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:16:26,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:16:26,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:16:26,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 19:16:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 19:16:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:16:26,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:16:26,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 19:16:26,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:16:26,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:16:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:16:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:16:26,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:16:26,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:16:26,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:16:26,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:16:26,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:16:26,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:16:26,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:16:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,510 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-08 19:16:26,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:16:26,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712843027] [2024-11-08 19:16:26,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712843027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:16:26,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 19:16:26,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 19:16:26,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147657883] [2024-11-08 19:16:26,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:16:26,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 19:16:26,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:16:26,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 19:16:26,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:16:26,514 INFO L87 Difference]: Start difference. First operand 103 states and 147 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:16:26,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:16:26,560 INFO L93 Difference]: Finished difference Result 203 states and 293 transitions. [2024-11-08 19:16:26,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 19:16:26,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 110 [2024-11-08 19:16:26,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:16:26,563 INFO L225 Difference]: With dead ends: 203 [2024-11-08 19:16:26,563 INFO L226 Difference]: Without dead ends: 146 [2024-11-08 19:16:26,564 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 19:16:26,565 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 61 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 19:16:26,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 138 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 19:16:26,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-08 19:16:26,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 103. [2024-11-08 19:16:26,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 66 states have (on average 1.196969696969697) internal successors, (79), 66 states have internal predecessors, (79), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-08 19:16:26,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 147 transitions. [2024-11-08 19:16:26,599 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 147 transitions. Word has length 110 [2024-11-08 19:16:26,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:16:26,600 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 147 transitions. [2024-11-08 19:16:26,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-08 19:16:26,602 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 147 transitions. [2024-11-08 19:16:26,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-11-08 19:16:26,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 19:16:26,607 INFO L215 NwaCegarLoop]: trace histogram [34, 34, 34, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:16:26,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 19:16:26,608 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 19:16:26,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 19:16:26,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1407804298, now seen corresponding path program 1 times [2024-11-08 19:16:26,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 19:16:26,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907847255] [2024-11-08 19:16:26,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:16:26,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 19:16:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 19:16:26,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 19:16:26,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-08 19:16:26,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-08 19:16:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 19:16:26,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-08 19:16:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 19:16:26,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-08 19:16:26,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 19:16:26,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-08 19:16:26,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 19:16:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-08 19:16:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 19:16:26,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-08 19:16:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-08 19:16:26,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-08 19:16:26,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 19:16:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-08 19:16:26,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-08 19:16:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-08 19:16:26,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-08 19:16:26,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-08 19:16:26,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-08 19:16:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-08 19:16:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-08 19:16:26,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-08 19:16:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-08 19:16:26,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-08 19:16:26,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-08 19:16:26,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2024-11-08 19:16:26,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2024-11-08 19:16:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2024-11-08 19:16:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-11-08 19:16:26,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2024-11-08 19:16:26,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2281 backedges. 36 proven. 1 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-08 19:16:26,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 19:16:26,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907847255] [2024-11-08 19:16:26,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907847255] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 19:16:26,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057621462] [2024-11-08 19:16:26,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 19:16:26,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 19:16:26,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX/z3 [2024-11-08 19:16:26,922 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 19:16:26,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 19:16:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 19:16:27,098 INFO L255 TraceCheckSpWp]: Trace formula consists of 449 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 19:16:27,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 19:16:27,311 INFO L134 CoverageAnalysis]: Checked inductivity of 2281 backedges. 1193 proven. 0 refuted. 0 times theorem prover too weak. 1088 trivial. 0 not checked. [2024-11-08 19:16:27,313 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 19:16:27,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057621462] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 19:16:27,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 19:16:27,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2024-11-08 19:16:27,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476907529] [2024-11-08 19:16:27,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 19:16:27,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 19:16:27,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 19:16:27,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 19:16:27,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 19:16:27,318 INFO L87 Difference]: Start difference. First operand 103 states and 147 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-08 19:16:27,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 19:16:27,391 INFO L93 Difference]: Finished difference Result 161 states and 228 transitions. [2024-11-08 19:16:27,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 19:16:27,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 215 [2024-11-08 19:16:27,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 19:16:27,393 INFO L225 Difference]: With dead ends: 161 [2024-11-08 19:16:27,393 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 19:16:27,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 286 GetRequests, 283 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-08 19:16:27,394 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 6 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 19:16:27,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 130 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 19:16:27,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 19:16:27,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 19:16:27,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 19:16:27,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 19:16:27,402 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 215 [2024-11-08 19:16:27,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 19:16:27,403 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 19:16:27,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-08 19:16:27,404 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 19:16:27,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 19:16:27,406 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 19:16:27,434 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-08 19:16:27,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-08 19:16:27,612 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 19:16:27,615 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 19:16:27,975 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 19:16:28,011 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 07:16:28 BoogieIcfgContainer [2024-11-08 19:16:28,012 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 19:16:28,012 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 19:16:28,012 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 19:16:28,013 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 19:16:28,013 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 07:16:11" (3/4) ... [2024-11-08 19:16:28,016 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 19:16:28,022 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2024-11-08 19:16:28,031 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-08 19:16:28,031 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 19:16:28,032 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-08 19:16:28,032 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 19:16:28,154 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX/witness.graphml [2024-11-08 19:16:28,154 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX/witness.yml [2024-11-08 19:16:28,154 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 19:16:28,155 INFO L158 Benchmark]: Toolchain (without parser) took 18035.86ms. Allocated memory was 142.6MB in the beginning and 272.6MB in the end (delta: 130.0MB). Free memory was 110.9MB in the beginning and 216.5MB in the end (delta: -105.7MB). Peak memory consumption was 26.0MB. Max. memory is 16.1GB. [2024-11-08 19:16:28,156 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 104.9MB. Free memory is still 60.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 19:16:28,156 INFO L158 Benchmark]: CACSL2BoogieTranslator took 396.91ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 96.4MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-08 19:16:28,156 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.12ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 92.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:16:28,157 INFO L158 Benchmark]: Boogie Preprocessor took 57.88ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 87.8MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:16:28,157 INFO L158 Benchmark]: RCFGBuilder took 538.92ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 68.6MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 19:16:28,158 INFO L158 Benchmark]: TraceAbstraction took 16819.30ms. Allocated memory was 142.6MB in the beginning and 272.6MB in the end (delta: 130.0MB). Free memory was 68.0MB in the beginning and 222.8MB in the end (delta: -154.9MB). Peak memory consumption was 121.5MB. Max. memory is 16.1GB. [2024-11-08 19:16:28,158 INFO L158 Benchmark]: Witness Printer took 142.37ms. Allocated memory is still 272.6MB. Free memory was 221.8MB in the beginning and 216.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 19:16:28,160 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.31ms. Allocated memory is still 104.9MB. Free memory is still 60.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 396.91ms. Allocated memory is still 142.6MB. Free memory was 110.9MB in the beginning and 96.4MB in the end (delta: 14.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.12ms. Allocated memory is still 142.6MB. Free memory was 96.4MB in the beginning and 92.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.88ms. Allocated memory is still 142.6MB. Free memory was 92.7MB in the beginning and 87.8MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 538.92ms. Allocated memory is still 142.6MB. Free memory was 87.3MB in the beginning and 68.6MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 16819.30ms. Allocated memory was 142.6MB in the beginning and 272.6MB in the end (delta: 130.0MB). Free memory was 68.0MB in the beginning and 222.8MB in the end (delta: -154.9MB). Peak memory consumption was 121.5MB. Max. memory is 16.1GB. * Witness Printer took 142.37ms. Allocated memory is still 272.6MB. Free memory was 221.8MB in the beginning and 216.5MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 52 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 16.3s, OverallIterations: 8, TraceHistogramMax: 34, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 221 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 221 mSDsluCounter, 1633 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1082 mSDsCounter, 14 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 487 IncrementalHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 14 mSolverCounterUnsat, 551 mSDtfsCounter, 487 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 600 GetRequests, 562 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=105occurred in iteration=5, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 128 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 12.6s InterpolantComputationTime, 1196 NumberOfCodeBlocks, 1196 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1187 ConstructedInterpolants, 0 QuantifiedInterpolants, 3405 SizeOfPredicates, 0 NumberOfNonLiveVariables, 449 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 8369/8370 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 96]: Loop Invariant Derived loop invariant: (((((var_1_18 == 0) || (var_1_13 < (((((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) >= 0) ? (((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) % 4294967296) : ((((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) % 4294967296) + 4294967296)) + 1))) && (0 <= k_loop)) && (var_1_16 == 0)) || ((1 <= k_loop) && ((var_1_18 == var_1_16) || (var_1_13 < (((((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) >= 0) ? (((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) % 4294967296) : ((((((4294967295 * var_1_11) + (4294967295 * last_1_var_1_1)) + 4294967196) + var_1_17) % 4294967296) + 4294967296)) + 1))))) - ProcedureContractResult [Line: 20]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not. Requires: (var_1_16 == 0) Ensures: ((var_1_16 == 0) && ((((((((((((((isInitial == \old(isInitial)) && (var_1_1 == \old(var_1_1))) && (var_1_3 == \old(var_1_3))) && (var_1_7 == \old(var_1_7))) && (var_1_8 == \old(var_1_8))) && (var_1_9 == \old(var_1_9))) && (var_1_10 == \old(var_1_10))) && (var_1_11 == \old(var_1_11))) && (var_1_12 == \old(var_1_12))) && (var_1_13 == \old(var_1_13))) && (var_1_16 == \old(var_1_16))) && (var_1_17 == \old(var_1_17))) && (var_1_18 == \old(var_1_18))) && (last_1_var_1_1 == \old(last_1_var_1_1)))) RESULT: Ultimate proved your program to be correct! [2024-11-08 19:16:28,232 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b521a11d-2d51-44d6-9c79-62481f2b6a82/bin/uautomizer-verify-jihMAELWvX/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE