./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b 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_d419ef67-6d86-4c05-9b05-33b9f382ff6b/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d419ef67-6d86-4c05-9b05-33b9f382ff6b/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d419ef67-6d86-4c05-9b05-33b9f382ff6b/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d419ef67-6d86-4c05-9b05-33b9f382ff6b/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d419ef67-6d86-4c05-9b05-33b9f382ff6b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d419ef67-6d86-4c05-9b05-33b9f382ff6b/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 d5b4a8e209cf444024fa31a61bed3ce1f6da7fc096b1acbd25409a9975d7dc6c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:51:36,337 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:51:36,423 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d419ef67-6d86-4c05-9b05-33b9f382ff6b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:51:36,429 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:51:36,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:51:36,456 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:51:36,457 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:51:36,457 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:51:36,458 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:51:36,459 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:51:36,460 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:51:36,461 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:51:36,461 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:51:36,462 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:51:36,463 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:51:36,464 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:51:36,464 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:51:36,465 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:51:36,466 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:51:36,466 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:51:36,467 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:51:36,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:51:36,472 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:51:36,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:51:36,473 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:51:36,474 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:51:36,474 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:51:36,475 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:51:36,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:51:36,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:51:36,476 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:51:36,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:51:36,477 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:51:36,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:51:36,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:51:36,479 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:51:36,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:51:36,480 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:51:36,480 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:51:36,481 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_d419ef67-6d86-4c05-9b05-33b9f382ff6b/bin/uautomizer-verify-WvqO1wxjHP/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_d419ef67-6d86-4c05-9b05-33b9f382ff6b/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> d5b4a8e209cf444024fa31a61bed3ce1f6da7fc096b1acbd25409a9975d7dc6c [2023-11-06 22:51:36,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:51:36,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:51:36,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:51:36,859 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:51:36,859 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:51:36,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d419ef67-6d86-4c05-9b05-33b9f382ff6b/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i [2023-11-06 22:51:40,032 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:51:40,256 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:51:40,256 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d419ef67-6d86-4c05-9b05-33b9f382ff6b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i [2023-11-06 22:51:40,266 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d419ef67-6d86-4c05-9b05-33b9f382ff6b/bin/uautomizer-verify-WvqO1wxjHP/data/68d82c476/24c66b1bfe0d4c929eab8aebd48c1997/FLAG7f06d0b47 [2023-11-06 22:51:40,283 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d419ef67-6d86-4c05-9b05-33b9f382ff6b/bin/uautomizer-verify-WvqO1wxjHP/data/68d82c476/24c66b1bfe0d4c929eab8aebd48c1997 [2023-11-06 22:51:40,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:51:40,290 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:51:40,292 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:51:40,292 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:51:40,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:51:40,305 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:40" (1/1) ... [2023-11-06 22:51:40,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@da01b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:40, skipping insertion in model container [2023-11-06 22:51:40,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:51:40" (1/1) ... [2023-11-06 22:51:40,342 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:51:40,514 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d419ef67-6d86-4c05-9b05-33b9f382ff6b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i[915,928] [2023-11-06 22:51:40,546 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:51:40,562 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:51:40,578 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d419ef67-6d86-4c05-9b05-33b9f382ff6b/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i[915,928] [2023-11-06 22:51:40,597 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:51:40,614 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:51:40,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:40 WrapperNode [2023-11-06 22:51:40,615 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:51:40,616 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:51:40,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:51:40,617 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:51:40,625 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:40" (1/1) ... [2023-11-06 22:51:40,637 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:40" (1/1) ... [2023-11-06 22:51:40,669 INFO L138 Inliner]: procedures = 26, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 103 [2023-11-06 22:51:40,669 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:51:40,670 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:51:40,670 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:51:40,670 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:51:40,680 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:40" (1/1) ... [2023-11-06 22:51:40,681 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:40" (1/1) ... [2023-11-06 22:51:40,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:40" (1/1) ... [2023-11-06 22:51:40,686 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:40" (1/1) ... [2023-11-06 22:51:40,704 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:40" (1/1) ... [2023-11-06 22:51:40,707 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:40" (1/1) ... [2023-11-06 22:51:40,709 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:40" (1/1) ... [2023-11-06 22:51:40,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:40" (1/1) ... [2023-11-06 22:51:40,713 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:51:40,721 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:51:40,721 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:51:40,721 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:51:40,722 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:40" (1/1) ... [2023-11-06 22:51:40,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:51:40,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d419ef67-6d86-4c05-9b05-33b9f382ff6b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:51:40,758 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d419ef67-6d86-4c05-9b05-33b9f382ff6b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:51:40,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d419ef67-6d86-4c05-9b05-33b9f382ff6b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:51:40,794 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:51:40,795 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:51:40,795 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:51:40,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:51:40,796 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:51:40,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:51:40,894 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:51:40,896 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:51:41,233 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:51:41,240 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:51:41,240 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:51:41,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:41 BoogieIcfgContainer [2023-11-06 22:51:41,243 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:51:41,251 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:51:41,251 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:51:41,255 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:51:41,255 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:51:40" (1/3) ... [2023-11-06 22:51:41,256 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8f52b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:41, skipping insertion in model container [2023-11-06 22:51:41,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:51:40" (2/3) ... [2023-11-06 22:51:41,257 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8f52b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:51:41, skipping insertion in model container [2023-11-06 22:51:41,257 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:41" (3/3) ... [2023-11-06 22:51:41,259 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-41.i [2023-11-06 22:51:41,280 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:51:41,281 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:51:41,337 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:51:41,344 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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;@486e71ca, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:51:41,344 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:51:41,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:51:41,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-06 22:51:41,362 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:41,363 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:41,364 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:41,369 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:41,369 INFO L85 PathProgramCache]: Analyzing trace with hash 637968881, now seen corresponding path program 1 times [2023-11-06 22:51:41,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:41,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132559544] [2023-11-06 22:51:41,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:41,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:41,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:41,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:41,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:51:41,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:41,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:51:41,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:41,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:51:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:41,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:51:41,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:41,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:51:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:41,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:51:41,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:41,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:51:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:41,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:51:41,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:41,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:51:41,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:41,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:51:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:41,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:51:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:41,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:51:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:41,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:51:41,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:41,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:51:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:41,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:51:41,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:41,957 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:51:41,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:41,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132559544] [2023-11-06 22:51:41,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132559544] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:41,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:41,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:51:41,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60493340] [2023-11-06 22:51:41,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:41,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:51:41,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:41,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:51:42,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:51:42,003 INFO L87 Difference]: Start difference. First operand has 51 states, 32 states have (on average 1.34375) internal successors, (43), 33 states have internal predecessors, (43), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 22:51:42,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:42,033 INFO L93 Difference]: Finished difference Result 94 states and 158 transitions. [2023-11-06 22:51:42,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:51:42,036 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 103 [2023-11-06 22:51:42,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:42,044 INFO L225 Difference]: With dead ends: 94 [2023-11-06 22:51:42,044 INFO L226 Difference]: Without dead ends: 46 [2023-11-06 22:51:42,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:51:42,052 INFO L413 NwaCegarLoop]: 65 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, 65 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:42,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:51:42,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-11-06 22:51:42,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-11-06 22:51:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:51:42,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 65 transitions. [2023-11-06 22:51:42,102 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 65 transitions. Word has length 103 [2023-11-06 22:51:42,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:42,103 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 65 transitions. [2023-11-06 22:51:42,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-06 22:51:42,104 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 65 transitions. [2023-11-06 22:51:42,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-06 22:51:42,107 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:42,108 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:42,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:51:42,108 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:42,109 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:42,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1758183921, now seen corresponding path program 1 times [2023-11-06 22:51:42,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:42,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426036106] [2023-11-06 22:51:42,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:42,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:42,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:44,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:51:44,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:51:44,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:51:44,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:51:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:51:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:51:44,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:51:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:51:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:51:44,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:51:44,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:51:44,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:51:44,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:51:44,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:51:44,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:51:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:44,423 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:51:44,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:44,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426036106] [2023-11-06 22:51:44,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426036106] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:44,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:44,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:51:44,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290134656] [2023-11-06 22:51:44,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:44,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:51:44,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:44,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:51:44,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:51:44,437 INFO L87 Difference]: Start difference. First operand 46 states and 65 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:51:45,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:45,494 INFO L93 Difference]: Finished difference Result 152 states and 208 transitions. [2023-11-06 22:51:45,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 22:51:45,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2023-11-06 22:51:45,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:45,499 INFO L225 Difference]: With dead ends: 152 [2023-11-06 22:51:45,499 INFO L226 Difference]: Without dead ends: 150 [2023-11-06 22:51:45,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:51:45,502 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 124 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 548 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:45,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 548 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-06 22:51:45,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-06 22:51:45,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 92. [2023-11-06 22:51:45,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 64 states have internal predecessors, (74), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-06 22:51:45,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 126 transitions. [2023-11-06 22:51:45,554 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 126 transitions. Word has length 103 [2023-11-06 22:51:45,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:45,557 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 126 transitions. [2023-11-06 22:51:45,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:51:45,557 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 126 transitions. [2023-11-06 22:51:45,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-06 22:51:45,566 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:45,567 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:45,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:51:45,567 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:45,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:45,568 INFO L85 PathProgramCache]: Analyzing trace with hash 948837295, now seen corresponding path program 1 times [2023-11-06 22:51:45,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:45,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164573153] [2023-11-06 22:51:45,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:45,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:45,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:51:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:51:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:51:46,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:51:46,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:51:46,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:51:46,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:51:46,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:51:46,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:51:46,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:51:46,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:51:46,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:51:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:51:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:51:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:51:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:46,816 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:51:46,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:46,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164573153] [2023-11-06 22:51:46,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164573153] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:46,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:46,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:51:46,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359649058] [2023-11-06 22:51:46,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:46,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:51:46,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:46,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:51:46,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:51:46,823 INFO L87 Difference]: Start difference. First operand 92 states and 126 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:51:47,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:47,494 INFO L93 Difference]: Finished difference Result 228 states and 315 transitions. [2023-11-06 22:51:47,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:51:47,495 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2023-11-06 22:51:47,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:47,500 INFO L225 Difference]: With dead ends: 228 [2023-11-06 22:51:47,502 INFO L226 Difference]: Without dead ends: 139 [2023-11-06 22:51:47,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:51:47,507 INFO L413 NwaCegarLoop]: 131 mSDtfsCounter, 92 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:47,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 623 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:51:47,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-06 22:51:47,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 81. [2023-11-06 22:51:47,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 56 states have internal predecessors, (65), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-06 22:51:47,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 109 transitions. [2023-11-06 22:51:47,549 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 109 transitions. Word has length 103 [2023-11-06 22:51:47,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:47,550 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 109 transitions. [2023-11-06 22:51:47,550 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:51:47,551 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 109 transitions. [2023-11-06 22:51:47,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-06 22:51:47,552 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:47,553 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:47,553 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:51:47,553 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:47,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:47,554 INFO L85 PathProgramCache]: Analyzing trace with hash 1365156911, now seen corresponding path program 1 times [2023-11-06 22:51:47,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:47,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116018522] [2023-11-06 22:51:47,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:47,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:47,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:48,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:51:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:51:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:51:48,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:51:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:51:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:51:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:51:48,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:51:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:51:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:51:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:51:48,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:51:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:51:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:51:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:51:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:48,736 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:51:48,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:48,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116018522] [2023-11-06 22:51:48,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116018522] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:48,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:48,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:51:48,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318195576] [2023-11-06 22:51:48,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:48,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:51:48,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:48,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:51:48,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:51:48,740 INFO L87 Difference]: Start difference. First operand 81 states and 109 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:51:49,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:49,621 INFO L93 Difference]: Finished difference Result 169 states and 231 transitions. [2023-11-06 22:51:49,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:51:49,622 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2023-11-06 22:51:49,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:49,626 INFO L225 Difference]: With dead ends: 169 [2023-11-06 22:51:49,626 INFO L226 Difference]: Without dead ends: 167 [2023-11-06 22:51:49,627 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2023-11-06 22:51:49,630 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 82 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:49,633 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 397 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:51:49,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-11-06 22:51:49,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 88. [2023-11-06 22:51:49,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 63 states have internal predecessors, (74), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-06 22:51:49,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 118 transitions. [2023-11-06 22:51:49,695 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 118 transitions. Word has length 103 [2023-11-06 22:51:49,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:49,697 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 118 transitions. [2023-11-06 22:51:49,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:51:49,697 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 118 transitions. [2023-11-06 22:51:49,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-11-06 22:51:49,699 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:49,699 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:49,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:51:49,700 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:49,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:49,700 INFO L85 PathProgramCache]: Analyzing trace with hash 555810285, now seen corresponding path program 1 times [2023-11-06 22:51:49,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:49,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844113448] [2023-11-06 22:51:49,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:49,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:49,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:50,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:51:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:51:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:51:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:51:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:51:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:51:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:51:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:51:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:51:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:51:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:51:50,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:51:50,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:51:50,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:51:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:51:50,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:50,999 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:51:51,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:51,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844113448] [2023-11-06 22:51:51,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844113448] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:51,000 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:51,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:51:51,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161894171] [2023-11-06 22:51:51,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:51,003 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:51:51,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:51,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:51:51,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:51:51,005 INFO L87 Difference]: Start difference. First operand 88 states and 118 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:51:51,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:51,909 INFO L93 Difference]: Finished difference Result 159 states and 221 transitions. [2023-11-06 22:51:51,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-06 22:51:51,910 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 103 [2023-11-06 22:51:51,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:51,912 INFO L225 Difference]: With dead ends: 159 [2023-11-06 22:51:51,912 INFO L226 Difference]: Without dead ends: 157 [2023-11-06 22:51:51,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2023-11-06 22:51:51,914 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 56 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:51,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 422 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:51:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-11-06 22:51:51,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 84. [2023-11-06 22:51:51,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 58 states have (on average 1.1724137931034482) internal successors, (68), 59 states have internal predecessors, (68), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (22), 21 states have call predecessors, (22), 22 states have call successors, (22) [2023-11-06 22:51:51,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 112 transitions. [2023-11-06 22:51:51,980 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 112 transitions. Word has length 103 [2023-11-06 22:51:51,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:51,982 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 112 transitions. [2023-11-06 22:51:51,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:51:51,982 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 112 transitions. [2023-11-06 22:51:51,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-06 22:51:51,983 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:51:51,984 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:51:51,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:51:51,984 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:51:51,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:51:51,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1566433593, now seen corresponding path program 1 times [2023-11-06 22:51:51,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:51:51,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861735314] [2023-11-06 22:51:51,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:51:51,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:51:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:51:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:51:52,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:51:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:51:52,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:51:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:51:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:51:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2023-11-06 22:51:52,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:51:52,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:51:52,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2023-11-06 22:51:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:51:52,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:51:52,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-06 22:51:52,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:51:52,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2023-11-06 22:51:52,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:51:52,163 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-11-06 22:51:52,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:51:52,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861735314] [2023-11-06 22:51:52,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861735314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:51:52,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:51:52,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:51:52,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608365974] [2023-11-06 22:51:52,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:51:52,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:51:52,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:51:52,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:51:52,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:52,167 INFO L87 Difference]: Start difference. First operand 84 states and 112 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:51:52,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:51:52,206 INFO L93 Difference]: Finished difference Result 154 states and 207 transitions. [2023-11-06 22:51:52,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:51:52,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 104 [2023-11-06 22:51:52,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:51:52,208 INFO L225 Difference]: With dead ends: 154 [2023-11-06 22:51:52,208 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:51:52,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:51:52,213 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:51:52,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 115 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:51:52,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:51:52,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:51:52,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:51:52,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:51:52,218 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 104 [2023-11-06 22:51:52,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:51:52,219 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:51:52,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-11-06 22:51:52,219 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:51:52,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:51:52,222 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:51:52,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:51:52,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:51:53,555 INFO L902 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: true [2023-11-06 22:51:53,555 INFO L902 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: true [2023-11-06 22:51:53,556 INFO L895 garLoopResultBuilder]: At program point L97-2(lines 97 103) the Hoare annotation is: (or (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) (let ((.cse2 (* (div ~var_1_8~0 256) 256))) (let ((.cse0 (= (+ .cse2 1) ~var_1_8~0)) (.cse1 (= (* (div ~var_1_9~0 256) 256) ~var_1_9~0))) (and (or .cse0 (and .cse1 (= .cse2 ~var_1_8~0))) (or (not .cse0) (not .cse1)))))) [2023-11-06 22:51:53,556 INFO L899 garLoopResultBuilder]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2023-11-06 22:51:53,556 INFO L902 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: true [2023-11-06 22:51:53,556 INFO L902 garLoopResultBuilder]: At program point L85-1(line 85) the Hoare annotation is: true [2023-11-06 22:51:53,556 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2023-11-06 22:51:53,556 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:51:53,556 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:51:53,557 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (let ((.cse5 (= (* (div ~var_1_9~0 256) 256) ~var_1_9~0))) (let ((.cse0 (not .cse5)) (.cse1 (= (+ 2 ~var_1_7~0) 0)) (.cse2 (* (div ~var_1_10~0 4294967296) 4294967296)) (.cse3 (* 4294967295 ~var_1_13~0))) (and (or .cse0 (not .cse1) (= (+ .cse2 .cse3 ~var_1_14~0) (+ ~var_1_10~0 (* 4294967296 (div (+ .cse3 ~var_1_14~0) 4294967296))))) (or (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) (let ((.cse6 (* (div ~var_1_8~0 256) 256))) (let ((.cse4 (= (+ .cse6 1) ~var_1_8~0))) (and (or .cse4 (and .cse5 (= .cse6 ~var_1_8~0))) (or (not .cse4) .cse0))))) (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0)) (or (and .cse1 .cse5) (= (+ .cse2 .cse3 ~var_1_12~0 ~var_1_11~0) (+ (* (div (+ .cse3 ~var_1_12~0 ~var_1_11~0) 4294967296) 4294967296) ~var_1_10~0)))))) [2023-11-06 22:51:53,557 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-11-06 22:51:53,558 INFO L902 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: true [2023-11-06 22:51:53,558 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 94 105) the Hoare annotation is: false [2023-11-06 22:51:53,558 INFO L902 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: true [2023-11-06 22:51:53,558 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 61) no Hoare annotation was computed. [2023-11-06 22:51:53,558 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-11-06 22:51:53,558 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:51:53,559 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:51:53,559 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:51:53,559 INFO L899 garLoopResultBuilder]: For program point L86(lines 62 87) no Hoare annotation was computed. [2023-11-06 22:51:53,559 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2023-11-06 22:51:53,559 INFO L902 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: true [2023-11-06 22:51:53,560 INFO L902 garLoopResultBuilder]: At program point L82-1(line 82) the Hoare annotation is: true [2023-11-06 22:51:53,562 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 90 93) the Hoare annotation is: (let ((.cse5 (= (* (div ~var_1_9~0 256) 256) ~var_1_9~0))) (let ((.cse0 (not .cse5)) (.cse1 (= (+ 2 ~var_1_7~0) 0)) (.cse2 (* (div ~var_1_10~0 4294967296) 4294967296)) (.cse3 (* 4294967295 ~var_1_13~0))) (and (= ~var_1_1~0 ~var_1_7~0) (or .cse0 (not .cse1) (= (+ .cse2 .cse3 ~var_1_14~0) (+ ~var_1_10~0 (* 4294967296 (div (+ .cse3 ~var_1_14~0) 4294967296))))) (<= 1 |ULTIMATE.start_property_#res#1|) (or (= ~var_1_5~0 (* (div ~var_1_5~0 256) 256)) (let ((.cse6 (* (div ~var_1_8~0 256) 256))) (let ((.cse4 (= (+ .cse6 1) ~var_1_8~0))) (and (or .cse4 (and .cse5 (= .cse6 ~var_1_8~0))) (or (not .cse4) .cse0))))) (or (and .cse1 .cse5) (= (+ .cse2 .cse3 ~var_1_12~0 ~var_1_11~0) (+ (* (div (+ .cse3 ~var_1_12~0 ~var_1_11~0) 4294967296) 4294967296) ~var_1_10~0)))))) [2023-11-06 22:51:53,562 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-11-06 22:51:53,563 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 45) no Hoare annotation was computed. [2023-11-06 22:51:53,563 INFO L899 garLoopResultBuilder]: For program point L41-2(lines 36 61) no Hoare annotation was computed. [2023-11-06 22:51:53,563 INFO L902 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: true [2023-11-06 22:51:53,563 INFO L902 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: true [2023-11-06 22:51:53,563 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 39) no Hoare annotation was computed. [2023-11-06 22:51:53,563 INFO L899 garLoopResultBuilder]: For program point L37-2(lines 37 39) no Hoare annotation was computed. [2023-11-06 22:51:53,564 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:51:53,564 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2023-11-06 22:51:53,565 INFO L902 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: true [2023-11-06 22:51:53,565 INFO L902 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: true [2023-11-06 22:51:53,565 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 50) no Hoare annotation was computed. [2023-11-06 22:51:53,565 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:51:53,566 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-11-06 22:51:53,566 INFO L902 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: true [2023-11-06 22:51:53,566 INFO L899 garLoopResultBuilder]: For program point L34(lines 34 35) no Hoare annotation was computed. [2023-11-06 22:51:53,566 INFO L902 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: true [2023-11-06 22:51:53,566 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 89) no Hoare annotation was computed. [2023-11-06 22:51:53,567 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-11-06 22:51:53,567 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 49) no Hoare annotation was computed. [2023-11-06 22:51:53,567 INFO L902 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: true [2023-11-06 22:51:53,567 INFO L902 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: true [2023-11-06 22:51:53,568 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-11-06 22:51:53,568 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:51:53,568 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:51:53,568 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:51:53,568 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:51:53,572 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-06 22:51:53,574 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:51:53,606 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:51:53 BoogieIcfgContainer [2023-11-06 22:51:53,609 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:51:53,610 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:51:53,610 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:51:53,610 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:51:53,612 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:51:41" (3/4) ... [2023-11-06 22:51:53,615 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:51:53,622 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:51:53,631 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2023-11-06 22:51:53,631 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:51:53,631 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:51:53,632 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:51:53,669 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((var_1_1 == var_1_7) && ((!((((var_1_9 / 256) * 256) == var_1_9)) || !(((2 + var_1_7) == 0))) || (((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_14) == (var_1_10 + (4294967296 * (((4294967295 * var_1_13) + var_1_14) / 4294967296)))))) && (1 <= \result)) && ((var_1_5 == ((var_1_5 / 256) * 256)) || ((((((var_1_8 / 256) * 256) + 1) == var_1_8) || ((((var_1_9 / 256) * 256) == var_1_9) && (((var_1_8 / 256) * 256) == var_1_8))) && (!(((((var_1_8 / 256) * 256) + 1) == var_1_8)) || !((((var_1_9 / 256) * 256) == var_1_9)))))) && ((((2 + var_1_7) == 0) && (((var_1_9 / 256) * 256) == var_1_9)) || ((((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_12) + var_1_11) == ((((((4294967295 * var_1_13) + var_1_12) + var_1_11) / 4294967296) * 4294967296) + var_1_10)))) [2023-11-06 22:51:53,710 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((var_1_1 == var_1_7) && ((!((((var_1_9 / 256) * 256) == var_1_9)) || !(((2 + var_1_7) == 0))) || (((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_14) == (var_1_10 + (4294967296 * (((4294967295 * var_1_13) + var_1_14) / 4294967296)))))) && (1 <= \result)) && ((var_1_5 == ((var_1_5 / 256) * 256)) || ((((((var_1_8 / 256) * 256) + 1) == var_1_8) || ((((var_1_9 / 256) * 256) == var_1_9) && (((var_1_8 / 256) * 256) == var_1_8))) && (!(((((var_1_8 / 256) * 256) + 1) == var_1_8)) || !((((var_1_9 / 256) * 256) == var_1_9)))))) && ((((2 + var_1_7) == 0) && (((var_1_9 / 256) * 256) == var_1_9)) || ((((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_12) + var_1_11) == ((((((4294967295 * var_1_13) + var_1_12) + var_1_11) / 4294967296) * 4294967296) + var_1_10)))) [2023-11-06 22:51:53,728 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d419ef67-6d86-4c05-9b05-33b9f382ff6b/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:51:53,728 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d419ef67-6d86-4c05-9b05-33b9f382ff6b/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:51:53,728 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:51:53,729 INFO L158 Benchmark]: Toolchain (without parser) took 13439.31ms. Allocated memory was 155.2MB in the beginning and 276.8MB in the end (delta: 121.6MB). Free memory was 110.2MB in the beginning and 210.1MB in the end (delta: -100.0MB). Peak memory consumption was 24.8MB. Max. memory is 16.1GB. [2023-11-06 22:51:53,730 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 109.1MB. Free memory was 59.6MB in the beginning and 59.4MB in the end (delta: 188.9kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:51:53,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 323.90ms. Allocated memory is still 155.2MB. Free memory was 109.8MB in the beginning and 97.8MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:51:53,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.06ms. Allocated memory is still 155.2MB. Free memory was 97.8MB in the beginning and 96.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:51:53,731 INFO L158 Benchmark]: Boogie Preprocessor took 50.20ms. Allocated memory is still 155.2MB. Free memory was 96.1MB in the beginning and 94.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:51:53,731 INFO L158 Benchmark]: RCFGBuilder took 522.16ms. Allocated memory is still 155.2MB. Free memory was 94.7MB in the beginning and 81.0MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:51:53,732 INFO L158 Benchmark]: TraceAbstraction took 12358.22ms. Allocated memory was 155.2MB in the beginning and 276.8MB in the end (delta: 121.6MB). Free memory was 80.4MB in the beginning and 215.4MB in the end (delta: -134.9MB). Peak memory consumption was 121.3MB. Max. memory is 16.1GB. [2023-11-06 22:51:53,732 INFO L158 Benchmark]: Witness Printer took 118.88ms. Allocated memory is still 276.8MB. Free memory was 215.4MB in the beginning and 210.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2023-11-06 22:51:53,738 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.25ms. Allocated memory is still 109.1MB. Free memory was 59.6MB in the beginning and 59.4MB in the end (delta: 188.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 323.90ms. Allocated memory is still 155.2MB. Free memory was 109.8MB in the beginning and 97.8MB in the end (delta: 12.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.06ms. Allocated memory is still 155.2MB. Free memory was 97.8MB in the beginning and 96.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.20ms. Allocated memory is still 155.2MB. Free memory was 96.1MB in the beginning and 94.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 522.16ms. Allocated memory is still 155.2MB. Free memory was 94.7MB in the beginning and 81.0MB in the end (delta: 13.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 12358.22ms. Allocated memory was 155.2MB in the beginning and 276.8MB in the end (delta: 121.6MB). Free memory was 80.4MB in the beginning and 215.4MB in the end (delta: -134.9MB). Peak memory consumption was 121.3MB. Max. memory is 16.1GB. * Witness Printer took 118.88ms. Allocated memory is still 276.8MB. Free memory was 215.4MB in the beginning and 210.1MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 12.3s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 407 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 355 mSDsluCounter, 2170 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1609 mSDsCounter, 46 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 639 IncrementalHoareTripleChecker+Invalid, 685 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 46 mSolverCounterUnsat, 561 mSDtfsCounter, 639 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 293 GetRequests, 230 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=2, InterpolantAutomatonStates: 70, 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, 268 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 106 PreInvPairs, 134 NumberOfFragments, 339 HoareAnnotationTreeSize, 106 FomulaSimplifications, 3641 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 21 FomulaSimplificationsInter, 5012 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 619 NumberOfCodeBlocks, 619 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 613 ConstructedInterpolants, 0 QuantifiedInterpolants, 2404 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 2880/2880 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 90]: Loop Invariant Derived loop invariant: (((((var_1_1 == var_1_7) && ((!((((var_1_9 / 256) * 256) == var_1_9)) || !(((2 + var_1_7) == 0))) || (((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_14) == (var_1_10 + (4294967296 * (((4294967295 * var_1_13) + var_1_14) / 4294967296)))))) && (1 <= \result)) && ((var_1_5 == ((var_1_5 / 256) * 256)) || ((((((var_1_8 / 256) * 256) + 1) == var_1_8) || ((((var_1_9 / 256) * 256) == var_1_9) && (((var_1_8 / 256) * 256) == var_1_8))) && (!(((((var_1_8 / 256) * 256) + 1) == var_1_8)) || !((((var_1_9 / 256) * 256) == var_1_9)))))) && ((((2 + var_1_7) == 0) && (((var_1_9 / 256) * 256) == var_1_9)) || ((((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_12) + var_1_11) == ((((((4294967295 * var_1_13) + var_1_12) + var_1_11) / 4294967296) * 4294967296) + var_1_10)))) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((var_1_5 == ((var_1_5 / 256) * 256)) || ((((((var_1_8 / 256) * 256) + 1) == var_1_8) || ((((var_1_9 / 256) * 256) == var_1_9) && (((var_1_8 / 256) * 256) == var_1_8))) && (!(((((var_1_8 / 256) * 256) + 1) == var_1_8)) || !((((var_1_9 / 256) * 256) == var_1_9))))) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((((!((((var_1_9 / 256) * 256) == var_1_9)) || !(((2 + var_1_7) == 0))) || (((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_14) == (var_1_10 + (4294967296 * (((4294967295 * var_1_13) + var_1_14) / 4294967296))))) && ((var_1_5 == ((var_1_5 / 256) * 256)) || ((((((var_1_8 / 256) * 256) + 1) == var_1_8) || ((((var_1_9 / 256) * 256) == var_1_9) && (((var_1_8 / 256) * 256) == var_1_8))) && (!(((((var_1_8 / 256) * 256) + 1) == var_1_8)) || !((((var_1_9 / 256) * 256) == var_1_9)))))) && !((cond == 0))) && ((((2 + var_1_7) == 0) && (((var_1_9 / 256) * 256) == var_1_9)) || ((((((var_1_10 / 4294967296) * 4294967296) + (4294967295 * var_1_13)) + var_1_12) + var_1_11) == ((((((4294967295 * var_1_13) + var_1_12) + var_1_11) / 4294967296) * 4294967296) + var_1_10)))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:51:53,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d419ef67-6d86-4c05-9b05-33b9f382ff6b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE