./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-31.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-31.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU --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 bf188cc293474c9f6aa32f358cba173af59946707dd6a06eac63218abddc632b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 21:59:48,136 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 21:59:48,234 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-31 21:59:48,239 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 21:59:48,240 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 21:59:48,264 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 21:59:48,265 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 21:59:48,265 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 21:59:48,266 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 21:59:48,267 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 21:59:48,267 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 21:59:48,268 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 21:59:48,268 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 21:59:48,269 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 21:59:48,269 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 21:59:48,270 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 21:59:48,270 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 21:59:48,271 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 21:59:48,271 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 21:59:48,271 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 21:59:48,272 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 21:59:48,276 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 21:59:48,277 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 21:59:48,277 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 21:59:48,277 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 21:59:48,278 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 21:59:48,278 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 21:59:48,278 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 21:59:48,278 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 21:59:48,279 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 21:59:48,279 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 21:59:48,279 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 21:59:48,279 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:59:48,280 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 21:59:48,280 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 21:59:48,281 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 21:59:48,281 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 21:59:48,281 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 21:59:48,282 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 21:59:48,282 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 21:59:48,282 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 21:59:48,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 21:59:48,283 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_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/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_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU 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 -> bf188cc293474c9f6aa32f358cba173af59946707dd6a06eac63218abddc632b [2024-10-31 21:59:48,601 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 21:59:48,633 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 21:59:48,636 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 21:59:48,638 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 21:59:48,638 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 21:59:48,640 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-31.i Unable to find full path for "g++" [2024-10-31 21:59:50,799 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 21:59:51,088 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 21:59:51,089 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-31.i [2024-10-31 21:59:51,100 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/data/e99956bac/2728e01fdb0c4deea11e4e9cca135b7a/FLAGf4320fbb9 [2024-10-31 21:59:51,115 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/data/e99956bac/2728e01fdb0c4deea11e4e9cca135b7a [2024-10-31 21:59:51,120 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 21:59:51,121 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 21:59:51,124 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 21:59:51,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 21:59:51,134 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 21:59:51,135 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:59:51" (1/1) ... [2024-10-31 21:59:51,136 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@81436d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:51, skipping insertion in model container [2024-10-31 21:59:51,138 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 09:59:51" (1/1) ... [2024-10-31 21:59:51,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 21:59:51,394 WARN L251 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_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-31.i[915,928] [2024-10-31 21:59:51,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:59:51,457 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 21:59:51,467 WARN L251 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_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-31.i[915,928] [2024-10-31 21:59:51,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 21:59:51,506 INFO L204 MainTranslator]: Completed translation [2024-10-31 21:59:51,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:51 WrapperNode [2024-10-31 21:59:51,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 21:59:51,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 21:59:51,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 21:59:51,508 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 21:59:51,520 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:51" (1/1) ... [2024-10-31 21:59:51,534 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:51" (1/1) ... [2024-10-31 21:59:51,581 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 127 [2024-10-31 21:59:51,583 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 21:59:51,584 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 21:59:51,584 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 21:59:51,584 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 21:59:51,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:51" (1/1) ... [2024-10-31 21:59:51,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:51" (1/1) ... [2024-10-31 21:59:51,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:51" (1/1) ... [2024-10-31 21:59:51,620 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-10-31 21:59:51,620 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:51" (1/1) ... [2024-10-31 21:59:51,620 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:51" (1/1) ... [2024-10-31 21:59:51,627 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:51" (1/1) ... [2024-10-31 21:59:51,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:51" (1/1) ... [2024-10-31 21:59:51,632 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:51" (1/1) ... [2024-10-31 21:59:51,634 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:51" (1/1) ... [2024-10-31 21:59:51,637 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 21:59:51,638 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 21:59:51,638 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 21:59:51,638 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 21:59:51,639 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:51" (1/1) ... [2024-10-31 21:59:51,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 21:59:51,659 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:59:51,673 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 21:59:51,683 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 21:59:51,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 21:59:51,712 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 21:59:51,714 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 21:59:51,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 21:59:51,714 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 21:59:51,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 21:59:51,823 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 21:59:51,828 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 21:59:52,212 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-10-31 21:59:52,212 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 21:59:52,237 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 21:59:52,238 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 21:59:52,238 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:59:52 BoogieIcfgContainer [2024-10-31 21:59:52,238 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 21:59:52,242 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 21:59:52,242 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 21:59:52,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 21:59:52,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 09:59:51" (1/3) ... [2024-10-31 21:59:52,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@160f3ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:59:52, skipping insertion in model container [2024-10-31 21:59:52,248 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 09:59:51" (2/3) ... [2024-10-31 21:59:52,248 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@160f3ad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 09:59:52, skipping insertion in model container [2024-10-31 21:59:52,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:59:52" (3/3) ... [2024-10-31 21:59:52,250 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-31.i [2024-10-31 21:59:52,270 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 21:59:52,270 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 21:59:52,343 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 21:59:52,364 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;@e4d87db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 21:59:52,364 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 21:59:52,368 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 21:59:52,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-31 21:59:52,379 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:52,380 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:59:52,381 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:59:52,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:52,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1120964836, now seen corresponding path program 1 times [2024-10-31 21:59:52,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:52,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53171930] [2024-10-31 21:59:52,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:52,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:52,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:52,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:59:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:52,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:59:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:52,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:59:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:52,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:59:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:52,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:59:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:52,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:59:52,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:52,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:59:52,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:52,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:59:52,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:52,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:59:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:52,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:59:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:52,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:59:52,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:52,770 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 21:59:52,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:52,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53171930] [2024-10-31 21:59:52,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53171930] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:52,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:52,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 21:59:52,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943776826] [2024-10-31 21:59:52,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:52,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 21:59:52,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:52,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 21:59:52,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 21:59:52,809 INFO L87 Difference]: Start difference. First operand has 56 states, 42 states have (on average 1.4285714285714286) internal successors, (60), 43 states have internal predecessors, (60), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-31 21:59:52,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:52,844 INFO L93 Difference]: Finished difference Result 105 states and 169 transitions. [2024-10-31 21:59:52,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 21:59:52,848 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2024-10-31 21:59:52,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:52,861 INFO L225 Difference]: With dead ends: 105 [2024-10-31 21:59:52,862 INFO L226 Difference]: Without dead ends: 52 [2024-10-31 21:59:52,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 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-10-31 21:59:52,870 INFO L432 NwaCegarLoop]: 75 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, 75 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-10-31 21:59:52,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 21:59:52,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-31 21:59:52,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-31 21:59:52,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.358974358974359) internal successors, (53), 39 states have internal predecessors, (53), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 21:59:52,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 75 transitions. [2024-10-31 21:59:52,945 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 75 transitions. Word has length 77 [2024-10-31 21:59:52,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:52,946 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 75 transitions. [2024-10-31 21:59:52,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.5) internal successors, (25), 2 states have internal predecessors, (25), 2 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-31 21:59:52,946 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 75 transitions. [2024-10-31 21:59:52,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-31 21:59:52,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:52,950 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:59:52,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 21:59:52,951 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:59:52,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:52,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1718969566, now seen corresponding path program 1 times [2024-10-31 21:59:52,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:52,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598178435] [2024-10-31 21:59:52,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:52,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:54,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:59:54,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:54,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:59:54,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:54,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:59:54,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:54,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:59:54,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:54,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:59:54,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:54,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:59:54,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:54,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:59:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:54,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:59:54,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:54,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:59:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:54,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:59:54,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:54,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:59:54,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:54,489 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 21:59:54,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:54,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598178435] [2024-10-31 21:59:54,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598178435] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:54,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:54,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 21:59:54,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42993828] [2024-10-31 21:59:54,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:54,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 21:59:54,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:54,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 21:59:54,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-31 21:59:54,497 INFO L87 Difference]: Start difference. First operand 52 states and 75 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 21:59:54,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:54,871 INFO L93 Difference]: Finished difference Result 155 states and 220 transitions. [2024-10-31 21:59:54,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 21:59:54,872 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 77 [2024-10-31 21:59:54,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:54,876 INFO L225 Difference]: With dead ends: 155 [2024-10-31 21:59:54,876 INFO L226 Difference]: Without dead ends: 106 [2024-10-31 21:59:54,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:59:54,878 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 71 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:54,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 267 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 21:59:54,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-31 21:59:54,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2024-10-31 21:59:54,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 67 states have internal predecessors, (88), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-31 21:59:54,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 126 transitions. [2024-10-31 21:59:54,899 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 126 transitions. Word has length 77 [2024-10-31 21:59:54,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:54,900 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 126 transitions. [2024-10-31 21:59:54,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 21:59:54,900 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 126 transitions. [2024-10-31 21:59:54,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-31 21:59:54,903 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:54,903 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:59:54,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 21:59:54,904 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:59:54,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:54,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1895939360, now seen corresponding path program 1 times [2024-10-31 21:59:54,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:54,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674469974] [2024-10-31 21:59:54,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:54,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:55,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:59:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:55,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:59:55,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:55,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:59:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:55,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:59:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:55,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:59:55,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:55,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:59:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:55,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:59:55,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:55,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:59:55,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:55,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:59:55,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:55,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:59:55,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:55,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:59:55,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:55,476 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 21:59:55,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:55,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674469974] [2024-10-31 21:59:55,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674469974] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:55,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:55,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:59:55,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462161660] [2024-10-31 21:59:55,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:55,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:59:55,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:55,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:59:55,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:59:55,480 INFO L87 Difference]: Start difference. First operand 88 states and 126 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 21:59:55,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:55,723 INFO L93 Difference]: Finished difference Result 193 states and 273 transitions. [2024-10-31 21:59:55,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 21:59:55,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 77 [2024-10-31 21:59:55,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:55,728 INFO L225 Difference]: With dead ends: 193 [2024-10-31 21:59:55,728 INFO L226 Difference]: Without dead ends: 108 [2024-10-31 21:59:55,729 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:59:55,730 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 60 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:55,731 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 346 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:59:55,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-10-31 21:59:55,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 91. [2024-10-31 21:59:55,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 69 states have (on average 1.318840579710145) internal successors, (91), 70 states have internal predecessors, (91), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-31 21:59:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 129 transitions. [2024-10-31 21:59:55,757 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 129 transitions. Word has length 77 [2024-10-31 21:59:55,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:55,758 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 129 transitions. [2024-10-31 21:59:55,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 21:59:55,758 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 129 transitions. [2024-10-31 21:59:55,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-31 21:59:55,763 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:55,763 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:59:55,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 21:59:55,764 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:59:55,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:55,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1411409276, now seen corresponding path program 1 times [2024-10-31 21:59:55,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:55,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312151025] [2024-10-31 21:59:55,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:55,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:55,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:56,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:59:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:56,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:59:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:56,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:59:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:56,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:59:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:56,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:59:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:56,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:59:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:56,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:59:56,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:56,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:59:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:56,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:59:56,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:56,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:59:56,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:56,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:59:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:56,579 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 21:59:56,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:56,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312151025] [2024-10-31 21:59:56,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312151025] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:56,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:56,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 21:59:56,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3101413] [2024-10-31 21:59:56,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:56,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 21:59:56,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:56,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 21:59:56,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 21:59:56,583 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 21:59:56,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:56,863 INFO L93 Difference]: Finished difference Result 197 states and 276 transitions. [2024-10-31 21:59:56,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 21:59:56,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 78 [2024-10-31 21:59:56,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:56,865 INFO L225 Difference]: With dead ends: 197 [2024-10-31 21:59:56,866 INFO L226 Difference]: Without dead ends: 109 [2024-10-31 21:59:56,866 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2024-10-31 21:59:56,868 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 93 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:56,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 284 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:59:56,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-31 21:59:56,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 88. [2024-10-31 21:59:56,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 67 states have internal predecessors, (87), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-31 21:59:56,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 125 transitions. [2024-10-31 21:59:56,881 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 125 transitions. Word has length 78 [2024-10-31 21:59:56,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:56,884 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 125 transitions. [2024-10-31 21:59:56,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 21:59:56,885 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 125 transitions. [2024-10-31 21:59:56,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-10-31 21:59:56,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:56,889 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:59:56,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 21:59:56,890 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:59:56,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:56,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1018382266, now seen corresponding path program 1 times [2024-10-31 21:59:56,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:56,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781739362] [2024-10-31 21:59:56,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:56,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:57,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-10-31 21:59:57,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:57,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-10-31 21:59:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:57,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-31 21:59:57,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:57,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-31 21:59:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:57,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-31 21:59:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:57,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-31 21:59:57,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:57,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-31 21:59:57,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:57,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-31 21:59:57,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:57,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-31 21:59:57,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:57,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-31 21:59:57,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:57,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-31 21:59:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:57,419 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-31 21:59:57,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:57,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781739362] [2024-10-31 21:59:57,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781739362] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 21:59:57,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 21:59:57,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 21:59:57,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220017282] [2024-10-31 21:59:57,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 21:59:57,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 21:59:57,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:57,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 21:59:57,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-31 21:59:57,423 INFO L87 Difference]: Start difference. First operand 88 states and 125 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 21:59:57,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:57,788 INFO L93 Difference]: Finished difference Result 190 states and 267 transitions. [2024-10-31 21:59:57,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 21:59:57,790 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 78 [2024-10-31 21:59:57,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:57,792 INFO L225 Difference]: With dead ends: 190 [2024-10-31 21:59:57,792 INFO L226 Difference]: Without dead ends: 105 [2024-10-31 21:59:57,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-31 21:59:57,794 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 68 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:57,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 365 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:59:57,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-31 21:59:57,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 85. [2024-10-31 21:59:57,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 63 states have (on average 1.3174603174603174) internal successors, (83), 64 states have internal predecessors, (83), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-31 21:59:57,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2024-10-31 21:59:57,810 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 78 [2024-10-31 21:59:57,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:57,811 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2024-10-31 21:59:57,811 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-31 21:59:57,811 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2024-10-31 21:59:57,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-31 21:59:57,813 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:57,813 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:59:57,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 21:59:57,814 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:59:57,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:57,815 INFO L85 PathProgramCache]: Analyzing trace with hash -575500647, now seen corresponding path program 1 times [2024-10-31 21:59:57,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:57,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934960905] [2024-10-31 21:59:57,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:57,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-31 21:59:57,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1912943979] [2024-10-31 21:59:57,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:57,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:59:57,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:59:57,857 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:59:57,874 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-31 21:59:58,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 21:59:58,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-31 21:59:58,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 21:59:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-31 21:59:58,698 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 21:59:58,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 21:59:58,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934960905] [2024-10-31 21:59:58,966 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-31 21:59:58,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912943979] [2024-10-31 21:59:58,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912943979] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 21:59:58,967 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-31 21:59:58,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2024-10-31 21:59:58,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393789232] [2024-10-31 21:59:58,967 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-31 21:59:58,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 21:59:58,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 21:59:58,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 21:59:58,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=79, Unknown=1, NotChecked=0, Total=110 [2024-10-31 21:59:58,969 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-31 21:59:59,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 21:59:59,390 INFO L93 Difference]: Finished difference Result 229 states and 321 transitions. [2024-10-31 21:59:59,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-31 21:59:59,391 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 79 [2024-10-31 21:59:59,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 21:59:59,393 INFO L225 Difference]: With dead ends: 229 [2024-10-31 21:59:59,394 INFO L226 Difference]: Without dead ends: 147 [2024-10-31 21:59:59,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=239, Unknown=1, NotChecked=0, Total=342 [2024-10-31 21:59:59,396 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 101 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 33 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 21:59:59,399 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 299 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 133 Invalid, 2 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 21:59:59,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-10-31 21:59:59,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 124. [2024-10-31 21:59:59,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 89 states have internal predecessors, (113), 30 states have call successors, (30), 5 states have call predecessors, (30), 5 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-31 21:59:59,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 173 transitions. [2024-10-31 21:59:59,441 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 173 transitions. Word has length 79 [2024-10-31 21:59:59,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 21:59:59,445 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 173 transitions. [2024-10-31 21:59:59,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 2 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-31 21:59:59,446 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 173 transitions. [2024-10-31 21:59:59,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-31 21:59:59,447 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 21:59:59,447 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 21:59:59,475 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-31 21:59:59,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:59:59,649 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 21:59:59,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 21:59:59,650 INFO L85 PathProgramCache]: Analyzing trace with hash 125563931, now seen corresponding path program 1 times [2024-10-31 21:59:59,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 21:59:59,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042654806] [2024-10-31 21:59:59,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:59,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 21:59:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-31 21:59:59,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [771625628] [2024-10-31 21:59:59,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 21:59:59,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-31 21:59:59,706 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 21:59:59,708 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-31 21:59:59,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-31 21:59:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:59:59,806 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 21:59:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 21:59:59,994 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 21:59:59,995 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 21:59:59,996 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-31 22:00:00,019 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-31 22:00:00,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-10-31 22:00:00,209 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:00:00,312 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:00:00,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:00:00 BoogieIcfgContainer [2024-10-31 22:00:00,316 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:00:00,317 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:00:00,317 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:00:00,321 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:00:00,322 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 09:59:52" (3/4) ... [2024-10-31 22:00:00,325 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:00:00,329 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:00:00,334 INFO L158 Benchmark]: Toolchain (without parser) took 9212.51ms. Allocated memory was 138.4MB in the beginning and 218.1MB in the end (delta: 79.7MB). Free memory was 104.1MB in the beginning and 139.4MB in the end (delta: -35.4MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2024-10-31 22:00:00,334 INFO L158 Benchmark]: CDTParser took 0.35ms. Allocated memory is still 138.4MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:00:00,334 INFO L158 Benchmark]: CACSL2BoogieTranslator took 383.73ms. Allocated memory is still 138.4MB. Free memory was 104.1MB in the beginning and 90.1MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-31 22:00:00,335 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.83ms. Allocated memory is still 138.4MB. Free memory was 90.1MB in the beginning and 87.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:00:00,335 INFO L158 Benchmark]: Boogie Preprocessor took 53.74ms. Allocated memory is still 138.4MB. Free memory was 87.1MB in the beginning and 83.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-31 22:00:00,336 INFO L158 Benchmark]: RCFGBuilder took 600.55ms. Allocated memory is still 138.4MB. Free memory was 83.8MB in the beginning and 65.6MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-31 22:00:00,336 INFO L158 Benchmark]: TraceAbstraction took 8073.81ms. Allocated memory was 138.4MB in the beginning and 218.1MB in the end (delta: 79.7MB). Free memory was 64.4MB in the beginning and 139.4MB in the end (delta: -75.0MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-10-31 22:00:00,340 INFO L158 Benchmark]: Witness Printer took 16.32ms. Allocated memory is still 218.1MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:00:00,342 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.35ms. Allocated memory is still 138.4MB. Free memory is still 84.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 383.73ms. Allocated memory is still 138.4MB. Free memory was 104.1MB in the beginning and 90.1MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.83ms. Allocated memory is still 138.4MB. Free memory was 90.1MB in the beginning and 87.1MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.74ms. Allocated memory is still 138.4MB. Free memory was 87.1MB in the beginning and 83.8MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 600.55ms. Allocated memory is still 138.4MB. Free memory was 83.8MB in the beginning and 65.6MB in the end (delta: 18.3MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8073.81ms. Allocated memory was 138.4MB in the beginning and 218.1MB in the end (delta: 79.7MB). Free memory was 64.4MB in the beginning and 139.4MB in the end (delta: -75.0MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Witness Printer took 16.32ms. Allocated memory is still 218.1MB. Free memory is still 139.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 87. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = 200; [L23] unsigned char var_1_2 = 0; [L24] signed long int var_1_3 = 1107940323; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] unsigned char var_1_8 = 16; [L28] unsigned char var_1_9 = 16; [L29] unsigned short int var_1_10 = 4; [L30] double var_1_11 = 1000000.5; [L31] double var_1_12 = 1.25; [L32] signed long int last_1_var_1_1 = 200; [L33] unsigned char last_1_var_1_8 = 16; [L34] unsigned short int last_1_var_1_10 = 4; VAL [isInitial=0, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=0, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L91] isInitial = 1 [L92] FCALL initially() [L93] COND TRUE 1 [L94] CALL updateLastVariables() [L82] last_1_var_1_1 = var_1_1 [L83] last_1_var_1_8 = var_1_8 [L84] last_1_var_1_10 = var_1_10 VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=0, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L94] RET updateLastVariables() [L95] CALL updateVariables() [L63] var_1_2 = __VERIFIER_nondet_uchar() [L64] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L64] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L65] CALL assume_abort_if_not(var_1_2 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L65] RET assume_abort_if_not(var_1_2 <= 1) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1107940323, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L66] var_1_3 = __VERIFIER_nondet_long() [L67] CALL assume_abort_if_not(var_1_3 >= 1073741822) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L67] RET assume_abort_if_not(var_1_3 >= 1073741822) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L68] CALL assume_abort_if_not(var_1_3 <= 2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L68] RET assume_abort_if_not(var_1_3 <= 2147483646) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=0, var_1_7=0, var_1_8=16, var_1_9=16] [L69] var_1_6 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_7=0, var_1_8=16, var_1_9=16] [L70] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_7=0, var_1_8=16, var_1_9=16] [L71] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=0, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=0, var_1_8=16, var_1_9=16] [L71] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=0, var_1_8=16, var_1_9=16] [L72] var_1_7 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_8=16, var_1_9=16] [L73] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_8=16, var_1_9=16] [L74] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=16] [L74] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=16] [L75] var_1_9 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16] [L76] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16] [L77] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L77] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_12=5/4, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L78] var_1_12 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L79] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=4, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L95] RET updateVariables() [L96] CALL step() [L38] signed long int stepLocal_2 = last_1_var_1_8; [L39] signed long int stepLocal_1 = var_1_3 * last_1_var_1_8; VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_1=17179869152, stepLocal_2=16, var_1_10=4, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L40] COND TRUE stepLocal_1 >= last_1_var_1_1 [L41] var_1_10 = (2 + var_1_9) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_2=16, var_1_10=2, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L49] signed long int stepLocal_0 = last_1_var_1_10 / var_1_3; VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_0=0, stepLocal_2=16, var_1_10=2, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L50] COND FALSE !(stepLocal_0 >= (500 - last_1_var_1_10)) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_2=16, var_1_10=2, var_1_11=2000001/2, var_1_1=200, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L53] COND TRUE \read(var_1_2) [L54] var_1_1 = ((var_1_3 - var_1_10) - var_1_8) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_2=16, var_1_10=2, var_1_11=2000001/2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L60] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, stepLocal_2=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L96] RET step() [L97] CALL, EXPR property() [L87] EXPR ((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_10) - var_1_8))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((signed long int) var_1_10)) : 1)) && (((last_1_var_1_10 / var_1_3) >= (500 - last_1_var_1_10)) ? (var_1_8 == ((unsigned char) var_1_9)) : 1)) && (((var_1_3 * last_1_var_1_8) >= last_1_var_1_1) ? (var_1_10 == ((unsigned short int) (2 + var_1_9))) : ((last_1_var_1_8 == (last_1_var_1_8 ^ last_1_var_1_1)) ? (var_1_10 == ((unsigned short int) (var_1_9 + ((((last_1_var_1_1) < (4)) ? (last_1_var_1_1) : (4)))))) : (var_1_10 == ((unsigned short int) last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L87] EXPR ((var_1_3 * last_1_var_1_8) >= last_1_var_1_1) ? (var_1_10 == ((unsigned short int) (2 + var_1_9))) : ((last_1_var_1_8 == (last_1_var_1_8 ^ last_1_var_1_1)) ? (var_1_10 == ((unsigned short int) (var_1_9 + ((((last_1_var_1_1) < (4)) ? (last_1_var_1_1) : (4)))))) : (var_1_10 == ((unsigned short int) last_1_var_1_1))) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L87] EXPR ((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_10) - var_1_8))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((signed long int) var_1_10)) : 1)) && (((last_1_var_1_10 / var_1_3) >= (500 - last_1_var_1_10)) ? (var_1_8 == ((unsigned char) var_1_9)) : 1)) && (((var_1_3 * last_1_var_1_8) >= last_1_var_1_1) ? (var_1_10 == ((unsigned short int) (2 + var_1_9))) : ((last_1_var_1_8 == (last_1_var_1_8 ^ last_1_var_1_1)) ? (var_1_10 == ((unsigned short int) (var_1_9 + ((((last_1_var_1_1) < (4)) ? (last_1_var_1_1) : (4)))))) : (var_1_10 == ((unsigned short int) last_1_var_1_1)))) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L87-L88] return (((var_1_2 ? (var_1_1 == ((signed long int) ((var_1_3 - var_1_10) - var_1_8))) : ((var_1_6 && var_1_7) ? (var_1_1 == ((signed long int) var_1_10)) : 1)) && (((last_1_var_1_10 / var_1_3) >= (500 - last_1_var_1_10)) ? (var_1_8 == ((unsigned char) var_1_9)) : 1)) && (((var_1_3 * last_1_var_1_8) >= last_1_var_1_1) ? (var_1_10 == ((unsigned short int) (2 + var_1_9))) : ((last_1_var_1_8 == (last_1_var_1_8 ^ last_1_var_1_1)) ? (var_1_10 == ((unsigned short int) (var_1_9 + ((((last_1_var_1_1) < (4)) ? (last_1_var_1_1) : (4)))))) : (var_1_10 == ((unsigned short int) last_1_var_1_1))))) && (var_1_11 == ((double) var_1_12)) ; [L97] RET, EXPR property() [L97] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=4, last_1_var_1_1=200, last_1_var_1_8=16, var_1_10=2, var_1_11=2, var_1_12=2, var_1_1=1073741804, var_1_2=1, var_1_3=1073741822, var_1_6=1, var_1_7=1, var_1_8=16, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 56 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.9s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 393 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 393 mSDsluCounter, 1636 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1136 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 447 IncrementalHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 500 mSDtfsCounter, 447 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 304 GetRequests, 263 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=124occurred in iteration=6, InterpolantAutomatonStates: 41, 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, 6 MinimizatonAttempts, 99 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 703 NumberOfCodeBlocks, 703 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 460 ConstructedInterpolants, 1 QuantifiedInterpolants, 1305 SizeOfPredicates, 3 NumberOfNonLiveVariables, 200 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 6 InterpolantComputations, 5 PerfectInterpolantSequences, 1296/1320 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-31 22:00:00,416 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-31.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU --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 bf188cc293474c9f6aa32f358cba173af59946707dd6a06eac63218abddc632b --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:00:02,927 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:00:03,040 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-31 22:00:03,048 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:00:03,049 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:00:03,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:00:03,105 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:00:03,106 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:00:03,107 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:00:03,108 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:00:03,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:00:03,110 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:00:03,111 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:00:03,111 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:00:03,113 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:00:03,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:00:03,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-31 22:00:03,114 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:00:03,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:00:03,115 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:00:03,115 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-31 22:00:03,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:00:03,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-31 22:00:03,117 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:00:03,117 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:00:03,118 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:00:03,118 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:00:03,119 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:00:03,121 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-31 22:00:03,121 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:00:03,121 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:00:03,122 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:00:03,122 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:00:03,122 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:00:03,123 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:00:03,123 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:00:03,123 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:00:03,123 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-31 22:00:03,124 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:00:03,127 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:00:03,127 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:00:03,128 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:00:03,128 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:00:03,128 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:00:03,129 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:00:03,130 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_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/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_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU 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 -> bf188cc293474c9f6aa32f358cba173af59946707dd6a06eac63218abddc632b [2024-10-31 22:00:03,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:00:03,655 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:00:03,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:00:03,663 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:00:03,664 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:00:03,667 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-31.i Unable to find full path for "g++" [2024-10-31 22:00:05,872 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:00:06,088 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:00:06,089 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-31.i [2024-10-31 22:00:06,101 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/data/c7d1e2e7e/40f6470dc7f24432908cd73760491e2a/FLAG709194a04 [2024-10-31 22:00:06,453 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/data/c7d1e2e7e/40f6470dc7f24432908cd73760491e2a [2024-10-31 22:00:06,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:00:06,464 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:00:06,466 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:00:06,466 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:00:06,473 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:00:06,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:06,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@279eafaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06, skipping insertion in model container [2024-10-31 22:00:06,476 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:06,516 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:00:06,761 WARN L251 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_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-31.i[915,928] [2024-10-31 22:00:06,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:00:06,826 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:00:06,839 WARN L251 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_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-31.i[915,928] [2024-10-31 22:00:06,877 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:00:06,936 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:00:06,936 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06 WrapperNode [2024-10-31 22:00:06,936 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:00:06,937 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:00:06,937 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:00:06,938 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:00:06,944 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:06,956 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:06,984 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 94 [2024-10-31 22:00:06,984 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:00:06,985 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:00:06,985 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:00:06,986 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:00:07,002 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:07,002 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:07,011 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:07,036 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-10-31 22:00:07,037 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:07,037 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:07,046 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:07,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:07,052 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:07,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:07,057 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:00:07,058 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:00:07,058 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:00:07,058 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:00:07,059 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (1/1) ... [2024-10-31 22:00:07,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:00:07,084 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:00:07,101 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:00:07,105 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:00:07,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:00:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 22:00:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-31 22:00:07,142 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-31 22:00:07,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:00:07,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:00:07,271 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:00:07,274 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:00:07,773 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-31 22:00:07,776 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:00:07,798 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:00:07,799 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-31 22:00:07,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:00:07 BoogieIcfgContainer [2024-10-31 22:00:07,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:00:07,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:00:07,803 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:00:07,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:00:07,825 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:00:06" (1/3) ... [2024-10-31 22:00:07,826 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6420e001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:00:07, skipping insertion in model container [2024-10-31 22:00:07,827 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:00:06" (2/3) ... [2024-10-31 22:00:07,827 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6420e001 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:00:07, skipping insertion in model container [2024-10-31 22:00:07,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:00:07" (3/3) ... [2024-10-31 22:00:07,830 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-31.i [2024-10-31 22:00:07,854 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:00:07,855 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-31 22:00:07,958 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:00:07,968 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;@3d88ffe0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:00:07,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-31 22:00:07,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:00:07,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-31 22:00:07,990 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:07,991 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:00:07,992 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:07,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:08,000 INFO L85 PathProgramCache]: Analyzing trace with hash 172654701, now seen corresponding path program 1 times [2024-10-31 22:00:08,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:00:08,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [379334915] [2024-10-31 22:00:08,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:08,023 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:00:08,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:00:08,028 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:00:08,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-31 22:00:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:08,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-31 22:00:08,341 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:00:08,405 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 164 trivial. 0 not checked. [2024-10-31 22:00:08,405 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:00:08,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:00:08,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [379334915] [2024-10-31 22:00:08,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [379334915] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:00:08,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:00:08,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:00:08,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28080723] [2024-10-31 22:00:08,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:00:08,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-31 22:00:08,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:00:08,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-31 22:00:08,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-31 22:00:08,458 INFO L87 Difference]: Start difference. First operand has 43 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 30 states have internal predecessors, (39), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-31 22:00:08,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:00:08,495 INFO L93 Difference]: Finished difference Result 79 states and 127 transitions. [2024-10-31 22:00:08,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-31 22:00:08,498 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 75 [2024-10-31 22:00:08,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:00:08,507 INFO L225 Difference]: With dead ends: 79 [2024-10-31 22:00:08,508 INFO L226 Difference]: Without dead ends: 39 [2024-10-31 22:00:08,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-10-31 22:00:08,519 INFO L432 NwaCegarLoop]: 54 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, 54 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-10-31 22:00:08,520 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-31 22:00:08,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-31 22:00:08,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-31 22:00:08,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-31 22:00:08,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2024-10-31 22:00:08,576 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 75 [2024-10-31 22:00:08,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:00:08,577 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2024-10-31 22:00:08,577 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, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-31 22:00:08,578 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2024-10-31 22:00:08,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-10-31 22:00:08,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:00:08,582 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-31 22:00:08,589 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-31 22:00:08,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:00:08,787 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-31 22:00:08,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:00:08,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1665728849, now seen corresponding path program 1 times [2024-10-31 22:00:08,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:00:08,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [871076870] [2024-10-31 22:00:08,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:08,789 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-31 22:00:08,789 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:00:08,797 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-31 22:00:08,799 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-31 22:00:09,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:09,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-31 22:00:09,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:00:11,545 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-31 22:00:11,545 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-31 22:00:16,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:00:16,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [871076870] [2024-10-31 22:00:16,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [871076870] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-31 22:00:16,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [90706423] [2024-10-31 22:00:16,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:00:16,280 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-31 22:00:16,280 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/cvc4 [2024-10-31 22:00:16,284 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-31 22:00:16,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_c3b433e3-b76b-495a-96ff-a3b1f2a4f979/bin/uautomizer-verify-4GaUIPS5ZU/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-31 22:00:16,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:00:16,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-31 22:00:16,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:00:18,918 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-10-31 22:00:18,918 INFO L311 TraceCheckSpWp]: Computing backward predicates...