./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.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_9f9f4311-0911-471b-a611-88b2cc684c17/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f9f4311-0911-471b-a611-88b2cc684c17/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_9f9f4311-0911-471b-a611-88b2cc684c17/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f9f4311-0911-471b-a611-88b2cc684c17/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f9f4311-0911-471b-a611-88b2cc684c17/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_9f9f4311-0911-471b-a611-88b2cc684c17/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 9851c0f9ab930af20c037ab1e499f4c9a2b58cea1e3329cd85ff2166a0e5d289 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:08:32,478 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:08:32,606 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f9f4311-0911-471b-a611-88b2cc684c17/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:08:32,618 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:08:32,618 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:08:32,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:08:32,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:08:32,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:08:32,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:08:32,672 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:08:32,673 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:08:32,673 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:08:32,674 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:08:32,676 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:08:32,676 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:08:32,676 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:08:32,677 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:08:32,677 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:08:32,678 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:08:32,678 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:08:32,679 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:08:32,679 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:08:32,680 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:08:32,680 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:08:32,680 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:08:32,681 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:08:32,682 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:08:32,682 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:08:32,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:08:32,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:08:32,685 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:08:32,685 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:08:32,685 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:08:32,685 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:08:32,686 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:08:32,686 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:08:32,686 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:08:32,686 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:08:32,687 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:08:32,687 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_9f9f4311-0911-471b-a611-88b2cc684c17/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_9f9f4311-0911-471b-a611-88b2cc684c17/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 -> 9851c0f9ab930af20c037ab1e499f4c9a2b58cea1e3329cd85ff2166a0e5d289 [2023-11-06 22:08:33,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:08:33,057 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:08:33,060 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:08:33,062 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:08:33,063 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:08:33,064 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f9f4311-0911-471b-a611-88b2cc684c17/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i [2023-11-06 22:08:36,299 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:08:36,567 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:08:36,568 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f9f4311-0911-471b-a611-88b2cc684c17/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i [2023-11-06 22:08:36,581 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f9f4311-0911-471b-a611-88b2cc684c17/bin/uautomizer-verify-WvqO1wxjHP/data/1a388b29f/d5012379007b4e82a4c2668dce48d11b/FLAG569b5cb9e [2023-11-06 22:08:36,602 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f9f4311-0911-471b-a611-88b2cc684c17/bin/uautomizer-verify-WvqO1wxjHP/data/1a388b29f/d5012379007b4e82a4c2668dce48d11b [2023-11-06 22:08:36,614 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:08:36,617 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:08:36,624 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:08:36,624 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:08:36,630 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:08:36,631 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:08:36" (1/1) ... [2023-11-06 22:08:36,633 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d91d2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:36, skipping insertion in model container [2023-11-06 22:08:36,633 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:08:36" (1/1) ... [2023-11-06 22:08:36,676 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:08:36,846 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_9f9f4311-0911-471b-a611-88b2cc684c17/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i[915,928] [2023-11-06 22:08:36,891 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:08:36,904 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:08:36,918 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_9f9f4311-0911-471b-a611-88b2cc684c17/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_25-1loop_file-22.i[915,928] [2023-11-06 22:08:36,943 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:08:36,964 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:08:36,966 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:36 WrapperNode [2023-11-06 22:08:36,967 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:08:36,969 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:08:36,969 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:08:36,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:08:36,981 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:08:36" (1/1) ... [2023-11-06 22:08:36,991 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:08:36" (1/1) ... [2023-11-06 22:08:37,030 INFO L138 Inliner]: procedures = 26, calls = 20, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 114 [2023-11-06 22:08:37,030 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:08:37,031 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:08:37,031 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:08:37,031 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:08:37,042 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:36" (1/1) ... [2023-11-06 22:08:37,042 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:36" (1/1) ... [2023-11-06 22:08:37,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:36" (1/1) ... [2023-11-06 22:08:37,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:36" (1/1) ... [2023-11-06 22:08:37,054 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:36" (1/1) ... [2023-11-06 22:08:37,058 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:36" (1/1) ... [2023-11-06 22:08:37,061 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:36" (1/1) ... [2023-11-06 22:08:37,062 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:36" (1/1) ... [2023-11-06 22:08:37,066 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:08:37,067 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:08:37,067 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:08:37,067 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:08:37,068 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:36" (1/1) ... [2023-11-06 22:08:37,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:08:37,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f9f4311-0911-471b-a611-88b2cc684c17/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:08:37,105 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f9f4311-0911-471b-a611-88b2cc684c17/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:08:37,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f9f4311-0911-471b-a611-88b2cc684c17/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:08:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:08:37,141 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:08:37,141 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:08:37,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:08:37,142 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:08:37,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:08:37,234 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:08:37,236 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:08:37,549 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:08:37,556 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:08:37,563 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:08:37,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:08:37 BoogieIcfgContainer [2023-11-06 22:08:37,566 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:08:37,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:08:37,571 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:08:37,575 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:08:37,575 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:08:36" (1/3) ... [2023-11-06 22:08:37,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a25f188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:08:37, skipping insertion in model container [2023-11-06 22:08:37,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:08:36" (2/3) ... [2023-11-06 22:08:37,578 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a25f188 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:08:37, skipping insertion in model container [2023-11-06 22:08:37,578 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:08:37" (3/3) ... [2023-11-06 22:08:37,580 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-1loop_file-22.i [2023-11-06 22:08:37,604 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:08:37,605 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:08:37,667 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:08:37,680 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;@69a8645c, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:08:37,681 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:08:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-06 22:08:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-06 22:08:37,695 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:37,696 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:37,696 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:37,702 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:37,703 INFO L85 PathProgramCache]: Analyzing trace with hash 159776338, now seen corresponding path program 1 times [2023-11-06 22:08:37,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:37,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254590227] [2023-11-06 22:08:37,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:37,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:38,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:08:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:38,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:08:38,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:38,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:08:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:38,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:08:38,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:38,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:08:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:38,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:08:38,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:38,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:08:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:38,159 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-06 22:08:38,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:38,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254590227] [2023-11-06 22:08:38,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254590227] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:38,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:38,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:08:38,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168278997] [2023-11-06 22:08:38,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:38,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:08:38,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:38,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:08:38,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:08:38,227 INFO L87 Difference]: Start difference. First operand has 47 states, 37 states have (on average 1.4324324324324325) internal successors, (53), 38 states have internal predecessors, (53), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-06 22:08:38,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:38,272 INFO L93 Difference]: Finished difference Result 91 states and 138 transitions. [2023-11-06 22:08:38,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:08:38,274 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 58 [2023-11-06 22:08:38,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:38,283 INFO L225 Difference]: With dead ends: 91 [2023-11-06 22:08:38,284 INFO L226 Difference]: Without dead ends: 43 [2023-11-06 22:08:38,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 23 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:08:38,295 INFO L413 NwaCegarLoop]: 61 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, 61 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:08:38,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:08:38,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2023-11-06 22:08:38,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2023-11-06 22:08:38,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-06 22:08:38,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 57 transitions. [2023-11-06 22:08:38,350 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 57 transitions. Word has length 58 [2023-11-06 22:08:38,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:38,350 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 57 transitions. [2023-11-06 22:08:38,351 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2023-11-06 22:08:38,351 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2023-11-06 22:08:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2023-11-06 22:08:38,355 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:38,355 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:38,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:08:38,356 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:38,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:38,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1906041946, now seen corresponding path program 1 times [2023-11-06 22:08:38,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:38,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867495746] [2023-11-06 22:08:38,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:38,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:39,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:08:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:39,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:08:39,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:39,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:08:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:39,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:08:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:39,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:08:39,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:39,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:08:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:39,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:08:39,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:39,494 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-06 22:08:39,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:39,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867495746] [2023-11-06 22:08:39,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867495746] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:39,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:39,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:08:39,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031546940] [2023-11-06 22:08:39,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:39,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:08:39,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:39,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:08:39,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:08:39,499 INFO L87 Difference]: Start difference. First operand 43 states and 57 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:08:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:39,801 INFO L93 Difference]: Finished difference Result 145 states and 193 transitions. [2023-11-06 22:08:39,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:08:39,803 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 58 [2023-11-06 22:08:39,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:39,809 INFO L225 Difference]: With dead ends: 145 [2023-11-06 22:08:39,809 INFO L226 Difference]: Without dead ends: 105 [2023-11-06 22:08:39,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:08:39,816 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 86 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:39,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 191 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:08:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-11-06 22:08:39,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 73. [2023-11-06 22:08:39,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 56 states have (on average 1.25) internal successors, (70), 56 states have internal predecessors, (70), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2023-11-06 22:08:39,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 98 transitions. [2023-11-06 22:08:39,862 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 98 transitions. Word has length 58 [2023-11-06 22:08:39,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:39,863 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 98 transitions. [2023-11-06 22:08:39,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:08:39,865 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 98 transitions. [2023-11-06 22:08:39,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 22:08:39,867 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:39,867 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:39,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:08:39,868 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:39,869 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:39,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1991142381, now seen corresponding path program 1 times [2023-11-06 22:08:39,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:39,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363633872] [2023-11-06 22:08:39,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:39,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:40,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:08:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:40,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:08:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:40,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:08:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:40,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:08:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:40,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:08:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:40,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:08:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:40,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:08:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-06 22:08:40,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:40,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363633872] [2023-11-06 22:08:40,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363633872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:40,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:40,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:08:40,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258058763] [2023-11-06 22:08:40,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:40,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:08:40,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:40,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:08:40,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:08:40,561 INFO L87 Difference]: Start difference. First operand 73 states and 98 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:08:40,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:40,848 INFO L93 Difference]: Finished difference Result 218 states and 287 transitions. [2023-11-06 22:08:40,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:08:40,849 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2023-11-06 22:08:40,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:40,851 INFO L225 Difference]: With dead ends: 218 [2023-11-06 22:08:40,851 INFO L226 Difference]: Without dead ends: 178 [2023-11-06 22:08:40,852 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:08:40,853 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 92 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:40,854 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 230 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:08:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2023-11-06 22:08:40,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 119. [2023-11-06 22:08:40,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 94 states have internal predecessors, (119), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-06 22:08:40,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 161 transitions. [2023-11-06 22:08:40,891 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 161 transitions. Word has length 59 [2023-11-06 22:08:40,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:40,892 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 161 transitions. [2023-11-06 22:08:40,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:08:40,892 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 161 transitions. [2023-11-06 22:08:40,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 22:08:40,893 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:40,894 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:40,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:08:40,894 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:40,895 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:40,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1404336367, now seen corresponding path program 1 times [2023-11-06 22:08:40,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:40,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009373265] [2023-11-06 22:08:40,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:40,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:40,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:40,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:08:40,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:40,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:08:40,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:40,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:08:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:40,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:08:40,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:40,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:08:40,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:40,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:08:40,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:40,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:08:40,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:40,971 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-06 22:08:40,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:40,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009373265] [2023-11-06 22:08:40,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009373265] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:40,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:40,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:08:40,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227730263] [2023-11-06 22:08:40,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:40,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:08:40,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:40,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:08:40,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:08:40,979 INFO L87 Difference]: Start difference. First operand 119 states and 161 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:08:41,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:41,019 INFO L93 Difference]: Finished difference Result 190 states and 254 transitions. [2023-11-06 22:08:41,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:08:41,019 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2023-11-06 22:08:41,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:41,023 INFO L225 Difference]: With dead ends: 190 [2023-11-06 22:08:41,024 INFO L226 Difference]: Without dead ends: 150 [2023-11-06 22:08:41,027 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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:08:41,037 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 26 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:41,039 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 120 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:08:41,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-06 22:08:41,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 123. [2023-11-06 22:08:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 98 states have (on average 1.2551020408163265) internal successors, (123), 98 states have internal predecessors, (123), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-06 22:08:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 165 transitions. [2023-11-06 22:08:41,080 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 165 transitions. Word has length 59 [2023-11-06 22:08:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:41,080 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 165 transitions. [2023-11-06 22:08:41,081 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, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:08:41,081 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 165 transitions. [2023-11-06 22:08:41,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2023-11-06 22:08:41,087 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:41,087 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:41,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:08:41,088 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:41,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:41,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1793297465, now seen corresponding path program 1 times [2023-11-06 22:08:41,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:41,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872869520] [2023-11-06 22:08:41,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:41,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:41,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:41,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:08:41,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:41,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:08:41,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:41,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:08:41,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:41,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:08:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:41,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:08:41,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:41,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:08:41,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:41,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:08:41,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:41,370 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-06 22:08:41,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:41,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872869520] [2023-11-06 22:08:41,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1872869520] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:41,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:41,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:08:41,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170779091] [2023-11-06 22:08:41,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:41,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:08:41,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:41,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:08:41,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:08:41,374 INFO L87 Difference]: Start difference. First operand 123 states and 165 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:08:41,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:41,518 INFO L93 Difference]: Finished difference Result 281 states and 375 transitions. [2023-11-06 22:08:41,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:08:41,519 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 59 [2023-11-06 22:08:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:41,522 INFO L225 Difference]: With dead ends: 281 [2023-11-06 22:08:41,522 INFO L226 Difference]: Without dead ends: 180 [2023-11-06 22:08:41,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:08:41,524 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 55 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:41,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 149 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:08:41,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-11-06 22:08:41,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 123. [2023-11-06 22:08:41,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 98 states have (on average 1.2448979591836735) internal successors, (122), 98 states have internal predecessors, (122), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-06 22:08:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 164 transitions. [2023-11-06 22:08:41,564 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 164 transitions. Word has length 59 [2023-11-06 22:08:41,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:41,565 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 164 transitions. [2023-11-06 22:08:41,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:08:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 164 transitions. [2023-11-06 22:08:41,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-06 22:08:41,566 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:41,567 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:41,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:08:41,567 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:41,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:41,568 INFO L85 PathProgramCache]: Analyzing trace with hash 136443654, now seen corresponding path program 1 times [2023-11-06 22:08:41,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:41,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686700305] [2023-11-06 22:08:41,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:41,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:08:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:08:44,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:08:44,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:08:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:08:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:08:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:08:44,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,194 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-06 22:08:44,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:44,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686700305] [2023-11-06 22:08:44,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686700305] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:44,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:44,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:08:44,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057627478] [2023-11-06 22:08:44,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:44,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:08:44,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:44,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:08:44,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:08:44,197 INFO L87 Difference]: Start difference. First operand 123 states and 164 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:08:44,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:44,617 INFO L93 Difference]: Finished difference Result 349 states and 460 transitions. [2023-11-06 22:08:44,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-06 22:08:44,618 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2023-11-06 22:08:44,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:44,620 INFO L225 Difference]: With dead ends: 349 [2023-11-06 22:08:44,620 INFO L226 Difference]: Without dead ends: 248 [2023-11-06 22:08:44,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2023-11-06 22:08:44,622 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 201 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:44,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 274 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-06 22:08:44,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2023-11-06 22:08:44,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 114. [2023-11-06 22:08:44,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 89 states have (on average 1.2134831460674158) internal successors, (108), 89 states have internal predecessors, (108), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-06 22:08:44,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 150 transitions. [2023-11-06 22:08:44,649 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 150 transitions. Word has length 60 [2023-11-06 22:08:44,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:44,649 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 150 transitions. [2023-11-06 22:08:44,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:08:44,650 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 150 transitions. [2023-11-06 22:08:44,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-06 22:08:44,651 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:44,651 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:44,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:08:44,651 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:44,652 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:44,652 INFO L85 PathProgramCache]: Analyzing trace with hash 112332512, now seen corresponding path program 1 times [2023-11-06 22:08:44,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:44,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885841943] [2023-11-06 22:08:44,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:44,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:08:44,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:08:44,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:08:44,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:08:44,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:08:44,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:08:44,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:08:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-06 22:08:44,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:44,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885841943] [2023-11-06 22:08:44,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885841943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:44,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:44,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:08:44,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589928685] [2023-11-06 22:08:44,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:44,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:08:44,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:44,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:08:44,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:08:44,720 INFO L87 Difference]: Start difference. First operand 114 states and 150 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:08:44,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:44,770 INFO L93 Difference]: Finished difference Result 198 states and 260 transitions. [2023-11-06 22:08:44,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:08:44,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2023-11-06 22:08:44,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:44,773 INFO L225 Difference]: With dead ends: 198 [2023-11-06 22:08:44,773 INFO L226 Difference]: Without dead ends: 106 [2023-11-06 22:08:44,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 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:08:44,774 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 9 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:44,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 84 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:08:44,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-11-06 22:08:44,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 101. [2023-11-06 22:08:44,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.1578947368421053) internal successors, (88), 76 states have internal predecessors, (88), 21 states have call successors, (21), 3 states have call predecessors, (21), 3 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2023-11-06 22:08:44,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 130 transitions. [2023-11-06 22:08:44,798 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 130 transitions. Word has length 60 [2023-11-06 22:08:44,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:44,798 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 130 transitions. [2023-11-06 22:08:44,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:08:44,799 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 130 transitions. [2023-11-06 22:08:44,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-06 22:08:44,800 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:44,800 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:44,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:08:44,800 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:44,801 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:44,801 INFO L85 PathProgramCache]: Analyzing trace with hash -588732066, now seen corresponding path program 1 times [2023-11-06 22:08:44,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:44,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693360854] [2023-11-06 22:08:44,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:44,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:44,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:08:44,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:08:44,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:08:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:08:44,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:08:44,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:08:44,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:08:44,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:44,879 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-06 22:08:44,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:44,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693360854] [2023-11-06 22:08:44,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693360854] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:44,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:44,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:08:44,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133089017] [2023-11-06 22:08:44,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:44,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:08:44,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:44,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:08:44,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:08:44,883 INFO L87 Difference]: Start difference. First operand 101 states and 130 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:08:44,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:44,953 INFO L93 Difference]: Finished difference Result 184 states and 239 transitions. [2023-11-06 22:08:44,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:08:44,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 60 [2023-11-06 22:08:44,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:44,955 INFO L225 Difference]: With dead ends: 184 [2023-11-06 22:08:44,955 INFO L226 Difference]: Without dead ends: 142 [2023-11-06 22:08:44,956 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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:08:44,958 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 28 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:44,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 96 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:08:44,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2023-11-06 22:08:44,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2023-11-06 22:08:44,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 107 states have (on average 1.1682242990654206) internal successors, (125), 107 states have internal predecessors, (125), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 22:08:44,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 181 transitions. [2023-11-06 22:08:44,990 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 181 transitions. Word has length 60 [2023-11-06 22:08:44,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:44,992 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 181 transitions. [2023-11-06 22:08:44,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:08:44,992 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 181 transitions. [2023-11-06 22:08:44,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-11-06 22:08:44,993 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:44,993 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:44,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:08:44,994 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:44,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:44,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1764714421, now seen corresponding path program 1 times [2023-11-06 22:08:44,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:44,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711282410] [2023-11-06 22:08:44,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:44,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:45,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:46,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:08:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:46,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:08:46,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:46,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:08:46,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:46,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:08:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:46,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:08:46,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:46,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:08:46,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:46,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:08:46,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:46,171 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-06 22:08:46,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:46,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711282410] [2023-11-06 22:08:46,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711282410] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:46,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:46,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:08:46,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111971653] [2023-11-06 22:08:46,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:46,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:08:46,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:46,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:08:46,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:08:46,174 INFO L87 Difference]: Start difference. First operand 140 states and 181 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:08:46,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:46,490 INFO L93 Difference]: Finished difference Result 259 states and 333 transitions. [2023-11-06 22:08:46,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:08:46,491 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 61 [2023-11-06 22:08:46,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:46,493 INFO L225 Difference]: With dead ends: 259 [2023-11-06 22:08:46,493 INFO L226 Difference]: Without dead ends: 179 [2023-11-06 22:08:46,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:08:46,494 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 75 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:46,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 156 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:08:46,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2023-11-06 22:08:46,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 150. [2023-11-06 22:08:46,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 117 states have (on average 1.170940170940171) internal successors, (137), 117 states have internal predecessors, (137), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2023-11-06 22:08:46,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 193 transitions. [2023-11-06 22:08:46,525 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 193 transitions. Word has length 61 [2023-11-06 22:08:46,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:46,525 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 193 transitions. [2023-11-06 22:08:46,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:08:46,526 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 193 transitions. [2023-11-06 22:08:46,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-11-06 22:08:46,527 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:46,527 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:46,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:08:46,527 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:46,528 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:46,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1656971175, now seen corresponding path program 1 times [2023-11-06 22:08:46,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:46,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372139605] [2023-11-06 22:08:46,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:46,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:47,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:08:47,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:47,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:08:47,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:47,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:08:47,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:47,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:08:47,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:47,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:08:47,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:47,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:08:47,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:47,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:08:47,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:47,509 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-06 22:08:47,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:47,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372139605] [2023-11-06 22:08:47,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372139605] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:47,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:47,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-06 22:08:47,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332798574] [2023-11-06 22:08:47,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:47,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:08:47,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:47,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:08:47,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:08:47,512 INFO L87 Difference]: Start difference. First operand 150 states and 193 transitions. Second operand has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:08:48,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:48,920 INFO L93 Difference]: Finished difference Result 369 states and 482 transitions. [2023-11-06 22:08:48,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 22:08:48,921 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 63 [2023-11-06 22:08:48,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:48,924 INFO L225 Difference]: With dead ends: 369 [2023-11-06 22:08:48,924 INFO L226 Difference]: Without dead ends: 367 [2023-11-06 22:08:48,925 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2023-11-06 22:08:48,926 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 277 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 470 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:48,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 470 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-06 22:08:48,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2023-11-06 22:08:48,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 214. [2023-11-06 22:08:48,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 173 states have (on average 1.1907514450867052) internal successors, (206), 173 states have internal predecessors, (206), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-11-06 22:08:48,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 276 transitions. [2023-11-06 22:08:48,991 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 276 transitions. Word has length 63 [2023-11-06 22:08:48,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:48,992 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 276 transitions. [2023-11-06 22:08:48,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.1) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:08:48,992 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 276 transitions. [2023-11-06 22:08:48,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2023-11-06 22:08:48,993 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:48,993 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:48,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:08:48,994 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:48,994 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:48,994 INFO L85 PathProgramCache]: Analyzing trace with hash 2110749848, now seen corresponding path program 1 times [2023-11-06 22:08:48,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:48,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967564040] [2023-11-06 22:08:48,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:48,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:49,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:08:49,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:08:49,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:08:49,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:08:49,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:08:49,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:08:49,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:08:49,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:49,697 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2023-11-06 22:08:49,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:49,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967564040] [2023-11-06 22:08:49,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967564040] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:49,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:08:49,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-06 22:08:49,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815598432] [2023-11-06 22:08:49,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:49,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:08:49,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:49,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:08:49,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:08:49,700 INFO L87 Difference]: Start difference. First operand 214 states and 276 transitions. Second operand has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:08:50,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:50,066 INFO L93 Difference]: Finished difference Result 249 states and 319 transitions. [2023-11-06 22:08:50,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-06 22:08:50,067 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 64 [2023-11-06 22:08:50,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:50,069 INFO L225 Difference]: With dead ends: 249 [2023-11-06 22:08:50,069 INFO L226 Difference]: Without dead ends: 247 [2023-11-06 22:08:50,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-11-06 22:08:50,071 INFO L413 NwaCegarLoop]: 95 mSDtfsCounter, 78 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:50,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 418 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:08:50,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2023-11-06 22:08:50,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 214. [2023-11-06 22:08:50,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 173 states have (on average 1.1849710982658959) internal successors, (205), 173 states have internal predecessors, (205), 35 states have call successors, (35), 5 states have call predecessors, (35), 5 states have return successors, (35), 35 states have call predecessors, (35), 35 states have call successors, (35) [2023-11-06 22:08:50,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 275 transitions. [2023-11-06 22:08:50,114 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 275 transitions. Word has length 64 [2023-11-06 22:08:50,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:50,115 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 275 transitions. [2023-11-06 22:08:50,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.0) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2023-11-06 22:08:50,115 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 275 transitions. [2023-11-06 22:08:50,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2023-11-06 22:08:50,117 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:08:50,117 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:50,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 22:08:50,117 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:08:50,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:08:50,118 INFO L85 PathProgramCache]: Analyzing trace with hash -406066346, now seen corresponding path program 1 times [2023-11-06 22:08:50,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:08:50,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879315576] [2023-11-06 22:08:50,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:50,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:08:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:50,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:08:50,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:50,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:08:50,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:50,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:08:50,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:50,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:08:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:50,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2023-11-06 22:08:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:50,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:08:50,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:50,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-06 22:08:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:50,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-06 22:08:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:50,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:08:50,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:50,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:08:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:50,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:08:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:50,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2023-11-06 22:08:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:50,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-06 22:08:50,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:50,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2023-11-06 22:08:50,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:50,261 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 25 proven. 1 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2023-11-06 22:08:50,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:08:50,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879315576] [2023-11-06 22:08:50,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879315576] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:08:50,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907956410] [2023-11-06 22:08:50,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:08:50,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:50,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f9f4311-0911-471b-a611-88b2cc684c17/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:08:50,266 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f9f4311-0911-471b-a611-88b2cc684c17/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:08:50,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f9f4311-0911-471b-a611-88b2cc684c17/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:08:50,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:08:50,417 INFO L262 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:08:50,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:08:50,530 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2023-11-06 22:08:50,530 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:08:50,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1907956410] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:08:50,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:08:50,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2023-11-06 22:08:50,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954358297] [2023-11-06 22:08:50,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:08:50,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:08:50,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:08:50,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:08:50,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:08:50,533 INFO L87 Difference]: Start difference. First operand 214 states and 275 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 22:08:50,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:08:50,576 INFO L93 Difference]: Finished difference Result 251 states and 314 transitions. [2023-11-06 22:08:50,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:08:50,576 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2023-11-06 22:08:50,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:08:50,577 INFO L225 Difference]: With dead ends: 251 [2023-11-06 22:08:50,577 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:08:50,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:08:50,578 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:08:50,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 98 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:08:50,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:08:50,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:08:50,580 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:08:50,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:08:50,580 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 119 [2023-11-06 22:08:50,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:08:50,580 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:08:50,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2023-11-06 22:08:50,581 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:08:50,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:08:50,584 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:08:50,591 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f9f4311-0911-471b-a611-88b2cc684c17/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-06 22:08:50,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f9f4311-0911-471b-a611-88b2cc684c17/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:08:50,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:08:51,920 INFO L899 garLoopResultBuilder]: For program point L52(line 52) no Hoare annotation was computed. [2023-11-06 22:08:51,921 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:08:51,921 INFO L899 garLoopResultBuilder]: For program point L52-2(line 52) no Hoare annotation was computed. [2023-11-06 22:08:51,921 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:08:51,921 INFO L899 garLoopResultBuilder]: For program point L52-4(lines 52 56) no Hoare annotation was computed. [2023-11-06 22:08:51,922 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (let ((.cse1 (<= 1 |ULTIMATE.start_property_#res#1|)) (.cse2 (<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)) (.cse3 (<= 0 |ULTIMATE.start_main_~k_loop~0#1|)) (.cse0 (* 65536 (div ~last_1_var_1_5~0 65536)))) (or (and (= (+ .cse0 ~var_1_1~0) ~last_1_var_1_5~0) .cse1 .cse2 .cse3 (= 256 ~var_1_5~0) (= ~var_1_1~0 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) (and .cse1 .cse2 .cse3 (= (+ 5 ~var_1_11~0) 0) (= (+ 5 ~var_1_1~0) 0) (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0) (let ((.cse5 (+ .cse0 ~var_1_6~0)) (.cse4 (* (div ~var_1_6~0 65536) 65536))) (or (and (= (+ ~var_1_5~0 8 .cse4) ~var_1_6~0) (<= (+ 8 .cse4 ~last_1_var_1_5~0) .cse5)) (and (<= .cse5 (+ 7 .cse4 ~last_1_var_1_5~0)) (= (+ .cse0 ~var_1_5~0) ~last_1_var_1_5~0)))) (or (not (= (+ .cse0 ~last_1_var_1_11~0) (+ ~last_1_var_1_5~0 (* (div ~last_1_var_1_11~0 4294967296) 4294967296)))) (= (* 65536 (div (+ ~last_1_var_1_11~0 4294967280) 65536)) (+ 4294901749 ~last_1_var_1_11~0)))))) [2023-11-06 22:08:51,922 INFO L899 garLoopResultBuilder]: For program point L52-6(lines 35 60) no Hoare annotation was computed. [2023-11-06 22:08:51,923 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 50) no Hoare annotation was computed. [2023-11-06 22:08:51,923 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 83 95) the Hoare annotation is: true [2023-11-06 22:08:51,923 INFO L895 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-11-06 22:08:51,923 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-11-06 22:08:51,923 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 42) no Hoare annotation was computed. [2023-11-06 22:08:51,924 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:08:51,924 INFO L899 garLoopResultBuilder]: For program point L87-2(lines 87 93) no Hoare annotation was computed. [2023-11-06 22:08:51,924 INFO L895 garLoopResultBuilder]: At program point L87-3(lines 87 93) the Hoare annotation is: (let ((.cse3 (= 256 ~var_1_5~0)) (.cse4 (= 256 ~last_1_var_1_5~0)) (.cse6 (<= 1 |ULTIMATE.start_property_#res#1|)) (.cse7 (<= 1 |ULTIMATE.start_main_~k_loop~0#1|)) (.cse1 (= (+ 5 ~var_1_1~0) 0)) (.cse2 (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0)) (.cse5 (* 65536 (div ~last_1_var_1_5~0 65536))) (.cse0 (div ~last_1_var_1_11~0 4294967296))) (or (and (< ~last_1_var_1_11~0 9) (< 0 (+ .cse0 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) .cse1 .cse2 .cse3 (= 8 ~var_1_11~0) .cse4) (and (= (+ .cse5 ~var_1_1~0) ~last_1_var_1_5~0) .cse6 .cse7 .cse3 (= ~var_1_1~0 ~var_1_11~0) .cse4) (and .cse6 .cse7 (= (+ 5 ~var_1_11~0) 0) .cse1 .cse2 (let ((.cse9 (+ .cse5 ~var_1_6~0)) (.cse8 (* (div ~var_1_6~0 65536) 65536))) (or (and (= (+ ~var_1_5~0 8 .cse8) ~var_1_6~0) (<= (+ 8 .cse8 ~last_1_var_1_5~0) .cse9)) (and (<= .cse9 (+ 7 .cse8 ~last_1_var_1_5~0)) (= (+ .cse5 ~var_1_5~0) ~last_1_var_1_5~0)))) (or (not (= (+ .cse5 ~last_1_var_1_11~0) (+ ~last_1_var_1_5~0 (* .cse0 4294967296)))) (= (* 65536 (div (+ ~last_1_var_1_11~0 4294967280) 65536)) (+ 4294901749 ~last_1_var_1_11~0)))))) [2023-11-06 22:08:51,925 INFO L899 garLoopResultBuilder]: For program point L87-4(lines 87 93) no Hoare annotation was computed. [2023-11-06 22:08:51,925 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:08:51,925 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-11-06 22:08:51,925 INFO L899 garLoopResultBuilder]: For program point L71-1(line 71) no Hoare annotation was computed. [2023-11-06 22:08:51,925 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-11-06 22:08:51,926 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-11-06 22:08:51,926 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-11-06 22:08:51,926 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 49) no Hoare annotation was computed. [2023-11-06 22:08:51,926 INFO L899 garLoopResultBuilder]: For program point L80-1(line 80) no Hoare annotation was computed. [2023-11-06 22:08:51,926 INFO L899 garLoopResultBuilder]: For program point L47-2(lines 44 50) no Hoare annotation was computed. [2023-11-06 22:08:51,926 INFO L899 garLoopResultBuilder]: For program point L80-3(line 80) no Hoare annotation was computed. [2023-11-06 22:08:51,927 INFO L899 garLoopResultBuilder]: For program point L80-5(line 80) no Hoare annotation was computed. [2023-11-06 22:08:51,927 INFO L899 garLoopResultBuilder]: For program point L80-7(line 80) no Hoare annotation was computed. [2023-11-06 22:08:51,927 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 41) no Hoare annotation was computed. [2023-11-06 22:08:51,927 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 36 42) no Hoare annotation was computed. [2023-11-06 22:08:51,927 INFO L899 garLoopResultBuilder]: For program point L64(line 64) no Hoare annotation was computed. [2023-11-06 22:08:51,928 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-11-06 22:08:51,928 INFO L899 garLoopResultBuilder]: For program point L73-1(lines 61 74) no Hoare annotation was computed. [2023-11-06 22:08:51,928 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:08:51,928 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:08:51,928 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 79 82) the Hoare annotation is: (let ((.cse1 (<= 1 |ULTIMATE.start_property_#res#1|)) (.cse2 (<= 0 |ULTIMATE.start_main_~k_loop~0#1|)) (.cse0 (* 65536 (div ~last_1_var_1_5~0 65536)))) (or (and (= (+ .cse0 ~var_1_1~0) ~last_1_var_1_5~0) .cse1 .cse2 (= 256 ~var_1_5~0) (= ~var_1_1~0 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) (and .cse1 .cse2 (= (+ 5 ~var_1_11~0) 0) (= (+ 5 ~var_1_1~0) 0) (= (* 256 (div ~var_1_4~0 256)) ~var_1_4~0) (let ((.cse4 (+ .cse0 ~var_1_6~0)) (.cse3 (* (div ~var_1_6~0 65536) 65536))) (or (and (= (+ ~var_1_5~0 8 .cse3) ~var_1_6~0) (<= (+ 8 .cse3 ~last_1_var_1_5~0) .cse4)) (and (<= .cse4 (+ 7 .cse3 ~last_1_var_1_5~0)) (= (+ .cse0 ~var_1_5~0) ~last_1_var_1_5~0)))) (or (not (= (+ .cse0 ~last_1_var_1_11~0) (+ ~last_1_var_1_5~0 (* (div ~last_1_var_1_11~0 4294967296) 4294967296)))) (= (* 65536 (div (+ ~last_1_var_1_11~0 4294967280) 65536)) (+ 4294901749 ~last_1_var_1_11~0)))))) [2023-11-06 22:08:51,929 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-11-06 22:08:51,929 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 34) no Hoare annotation was computed. [2023-11-06 22:08:51,929 INFO L895 garLoopResultBuilder]: At program point L66-1(line 66) the Hoare annotation is: (and (< ~last_1_var_1_11~0 9) (< 0 (+ (div ~last_1_var_1_11~0 4294967296) 1)) (<= 0 |ULTIMATE.start_main_~k_loop~0#1|) (= (+ 5 ~var_1_1~0) 0) (= 256 ~var_1_5~0) (= 8 ~var_1_11~0) (= 256 ~last_1_var_1_5~0)) [2023-11-06 22:08:51,929 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:08:51,929 INFO L899 garLoopResultBuilder]: For program point L75(lines 75 78) no Hoare annotation was computed. [2023-11-06 22:08:51,930 INFO L899 garLoopResultBuilder]: For program point L67(line 67) no Hoare annotation was computed. [2023-11-06 22:08:51,930 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 60) no Hoare annotation was computed. [2023-11-06 22:08:51,930 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:08:51,930 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:08:51,930 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:08:51,930 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:08:51,934 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:08:51,936 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:08:51,969 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:08:51 BoogieIcfgContainer [2023-11-06 22:08:51,971 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:08:51,972 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:08:51,972 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:08:51,972 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:08:51,973 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:08:37" (3/4) ... [2023-11-06 22:08:51,975 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:08:51,979 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:08:51,987 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-06 22:08:51,988 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:08:51,989 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:08:51,989 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:08:52,021 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((last_1_var_1_11 < 9) && (0 < ((last_1_var_1_11 / 4294967296) + 1))) && (0 <= k_loop)) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (256 == var_1_5)) && (8 == var_1_11)) && (256 == last_1_var_1_5)) || ((((((((65536 * (last_1_var_1_5 / 65536)) + var_1_1) == last_1_var_1_5) && (1 <= \result)) && (1 <= k_loop)) && (256 == var_1_5)) && (var_1_1 == var_1_11)) && (256 == last_1_var_1_5))) || (((((((1 <= \result) && (1 <= k_loop)) && ((5 + var_1_11) == 0)) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (((((var_1_5 + 8) + ((var_1_6 / 65536) * 65536)) == var_1_6) && (((8 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5) <= ((65536 * (last_1_var_1_5 / 65536)) + var_1_6))) || ((((65536 * (last_1_var_1_5 / 65536)) + var_1_6) <= ((7 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5)) && (((65536 * (last_1_var_1_5 / 65536)) + var_1_5) == last_1_var_1_5)))) && (!((((65536 * (last_1_var_1_5 / 65536)) + last_1_var_1_11) == (last_1_var_1_5 + ((last_1_var_1_11 / 4294967296) * 4294967296)))) || ((65536 * ((last_1_var_1_11 + 4294967280) / 65536)) == (4294901749 + last_1_var_1_11))))) [2023-11-06 22:08:52,024 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((65536 * (last_1_var_1_5 / 65536)) + var_1_1) == last_1_var_1_5) && (1 <= \result)) && (0 <= k_loop)) && (256 == var_1_5)) && (var_1_1 == var_1_11)) && (256 == last_1_var_1_5)) || (((((((1 <= \result) && (0 <= k_loop)) && ((5 + var_1_11) == 0)) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (((((var_1_5 + 8) + ((var_1_6 / 65536) * 65536)) == var_1_6) && (((8 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5) <= ((65536 * (last_1_var_1_5 / 65536)) + var_1_6))) || ((((65536 * (last_1_var_1_5 / 65536)) + var_1_6) <= ((7 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5)) && (((65536 * (last_1_var_1_5 / 65536)) + var_1_5) == last_1_var_1_5)))) && (!((((65536 * (last_1_var_1_5 / 65536)) + last_1_var_1_11) == (last_1_var_1_5 + ((last_1_var_1_11 / 4294967296) * 4294967296)))) || ((65536 * ((last_1_var_1_11 + 4294967280) / 65536)) == (4294901749 + last_1_var_1_11))))) [2023-11-06 22:08:52,026 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((65536 * (last_1_var_1_5 / 65536)) + var_1_1) == last_1_var_1_5) && (1 <= \result)) && (1 <= cond)) && (0 <= k_loop)) && (256 == var_1_5)) && (var_1_1 == var_1_11)) && (256 == last_1_var_1_5)) || ((((((((1 <= \result) && (1 <= cond)) && (0 <= k_loop)) && ((5 + var_1_11) == 0)) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (((((var_1_5 + 8) + ((var_1_6 / 65536) * 65536)) == var_1_6) && (((8 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5) <= ((65536 * (last_1_var_1_5 / 65536)) + var_1_6))) || ((((65536 * (last_1_var_1_5 / 65536)) + var_1_6) <= ((7 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5)) && (((65536 * (last_1_var_1_5 / 65536)) + var_1_5) == last_1_var_1_5)))) && (!((((65536 * (last_1_var_1_5 / 65536)) + last_1_var_1_11) == (last_1_var_1_5 + ((last_1_var_1_11 / 4294967296) * 4294967296)))) || ((65536 * ((last_1_var_1_11 + 4294967280) / 65536)) == (4294901749 + last_1_var_1_11))))) [2023-11-06 22:08:52,056 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((last_1_var_1_11 < 9) && (0 < ((last_1_var_1_11 / 4294967296) + 1))) && (0 <= k_loop)) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (256 == var_1_5)) && (8 == var_1_11)) && (256 == last_1_var_1_5)) || ((((((((65536 * (last_1_var_1_5 / 65536)) + var_1_1) == last_1_var_1_5) && (1 <= \result)) && (1 <= k_loop)) && (256 == var_1_5)) && (var_1_1 == var_1_11)) && (256 == last_1_var_1_5))) || (((((((1 <= \result) && (1 <= k_loop)) && ((5 + var_1_11) == 0)) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (((((var_1_5 + 8) + ((var_1_6 / 65536) * 65536)) == var_1_6) && (((8 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5) <= ((65536 * (last_1_var_1_5 / 65536)) + var_1_6))) || ((((65536 * (last_1_var_1_5 / 65536)) + var_1_6) <= ((7 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5)) && (((65536 * (last_1_var_1_5 / 65536)) + var_1_5) == last_1_var_1_5)))) && (!((((65536 * (last_1_var_1_5 / 65536)) + last_1_var_1_11) == (last_1_var_1_5 + ((last_1_var_1_11 / 4294967296) * 4294967296)))) || ((65536 * ((last_1_var_1_11 + 4294967280) / 65536)) == (4294901749 + last_1_var_1_11))))) [2023-11-06 22:08:52,057 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((65536 * (last_1_var_1_5 / 65536)) + var_1_1) == last_1_var_1_5) && (1 <= \result)) && (0 <= k_loop)) && (256 == var_1_5)) && (var_1_1 == var_1_11)) && (256 == last_1_var_1_5)) || (((((((1 <= \result) && (0 <= k_loop)) && ((5 + var_1_11) == 0)) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (((((var_1_5 + 8) + ((var_1_6 / 65536) * 65536)) == var_1_6) && (((8 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5) <= ((65536 * (last_1_var_1_5 / 65536)) + var_1_6))) || ((((65536 * (last_1_var_1_5 / 65536)) + var_1_6) <= ((7 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5)) && (((65536 * (last_1_var_1_5 / 65536)) + var_1_5) == last_1_var_1_5)))) && (!((((65536 * (last_1_var_1_5 / 65536)) + last_1_var_1_11) == (last_1_var_1_5 + ((last_1_var_1_11 / 4294967296) * 4294967296)))) || ((65536 * ((last_1_var_1_11 + 4294967280) / 65536)) == (4294901749 + last_1_var_1_11))))) [2023-11-06 22:08:52,058 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((65536 * (last_1_var_1_5 / 65536)) + var_1_1) == last_1_var_1_5) && (1 <= \result)) && (1 <= cond)) && (0 <= k_loop)) && (256 == var_1_5)) && (var_1_1 == var_1_11)) && (256 == last_1_var_1_5)) || ((((((((1 <= \result) && (1 <= cond)) && (0 <= k_loop)) && ((5 + var_1_11) == 0)) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (((((var_1_5 + 8) + ((var_1_6 / 65536) * 65536)) == var_1_6) && (((8 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5) <= ((65536 * (last_1_var_1_5 / 65536)) + var_1_6))) || ((((65536 * (last_1_var_1_5 / 65536)) + var_1_6) <= ((7 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5)) && (((65536 * (last_1_var_1_5 / 65536)) + var_1_5) == last_1_var_1_5)))) && (!((((65536 * (last_1_var_1_5 / 65536)) + last_1_var_1_11) == (last_1_var_1_5 + ((last_1_var_1_11 / 4294967296) * 4294967296)))) || ((65536 * ((last_1_var_1_11 + 4294967280) / 65536)) == (4294901749 + last_1_var_1_11))))) [2023-11-06 22:08:52,067 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f9f4311-0911-471b-a611-88b2cc684c17/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:08:52,068 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f9f4311-0911-471b-a611-88b2cc684c17/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:08:52,068 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:08:52,069 INFO L158 Benchmark]: Toolchain (without parser) took 15452.14ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 117.7MB in the beginning and 62.2MB in the end (delta: 55.5MB). Peak memory consumption was 125.8MB. Max. memory is 16.1GB. [2023-11-06 22:08:52,069 INFO L158 Benchmark]: CDTParser took 0.33ms. Allocated memory is still 121.6MB. Free memory was 94.9MB in the beginning and 94.9MB in the end (delta: 82.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:08:52,070 INFO L158 Benchmark]: CACSL2BoogieTranslator took 344.22ms. Allocated memory is still 148.9MB. Free memory was 117.7MB in the beginning and 105.4MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:08:52,070 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.31ms. Allocated memory is still 148.9MB. Free memory was 105.4MB in the beginning and 103.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:08:52,071 INFO L158 Benchmark]: Boogie Preprocessor took 35.21ms. Allocated memory is still 148.9MB. Free memory was 103.4MB in the beginning and 101.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:08:52,072 INFO L158 Benchmark]: RCFGBuilder took 500.73ms. Allocated memory is still 148.9MB. Free memory was 101.9MB in the beginning and 109.4MB in the end (delta: -7.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:08:52,072 INFO L158 Benchmark]: TraceAbstraction took 14401.37ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 108.7MB in the beginning and 66.4MB in the end (delta: 42.3MB). Peak memory consumption was 113.2MB. Max. memory is 16.1GB. [2023-11-06 22:08:52,073 INFO L158 Benchmark]: Witness Printer took 96.56ms. Allocated memory is still 218.1MB. Free memory was 66.4MB in the beginning and 62.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:08:52,075 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.33ms. Allocated memory is still 121.6MB. Free memory was 94.9MB in the beginning and 94.9MB in the end (delta: 82.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 344.22ms. Allocated memory is still 148.9MB. Free memory was 117.7MB in the beginning and 105.4MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.31ms. Allocated memory is still 148.9MB. Free memory was 105.4MB in the beginning and 103.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.21ms. Allocated memory is still 148.9MB. Free memory was 103.4MB in the beginning and 101.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 500.73ms. Allocated memory is still 148.9MB. Free memory was 101.9MB in the beginning and 109.4MB in the end (delta: -7.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 14401.37ms. Allocated memory was 148.9MB in the beginning and 218.1MB in the end (delta: 69.2MB). Free memory was 108.7MB in the beginning and 66.4MB in the end (delta: 42.3MB). Peak memory consumption was 113.2MB. Max. memory is 16.1GB. * Witness Printer took 96.56ms. Allocated memory is still 218.1MB. Free memory was 66.4MB in the beginning and 62.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.3s, OverallIterations: 12, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 931 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 931 mSDsluCounter, 2347 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1578 mSDsCounter, 204 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1058 IncrementalHoareTripleChecker+Invalid, 1262 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 204 mSolverCounterUnsat, 769 mSDtfsCounter, 1058 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 410 GetRequests, 339 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=10, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 531 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 137 PreInvPairs, 152 NumberOfFragments, 635 HoareAnnotationTreeSize, 137 FomulaSimplifications, 1598 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 12 FomulaSimplificationsInter, 927 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 7.9s InterpolantComputationTime, 899 NumberOfCodeBlocks, 899 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 886 ConstructedInterpolants, 0 QuantifiedInterpolants, 4870 SizeOfPredicates, 0 NumberOfNonLiveVariables, 278 ConjunctsInSsa, 3 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1703/1704 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: 83]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: (((((((((65536 * (last_1_var_1_5 / 65536)) + var_1_1) == last_1_var_1_5) && (1 <= \result)) && (0 <= k_loop)) && (256 == var_1_5)) && (var_1_1 == var_1_11)) && (256 == last_1_var_1_5)) || (((((((1 <= \result) && (0 <= k_loop)) && ((5 + var_1_11) == 0)) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (((((var_1_5 + 8) + ((var_1_6 / 65536) * 65536)) == var_1_6) && (((8 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5) <= ((65536 * (last_1_var_1_5 / 65536)) + var_1_6))) || ((((65536 * (last_1_var_1_5 / 65536)) + var_1_6) <= ((7 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5)) && (((65536 * (last_1_var_1_5 / 65536)) + var_1_5) == last_1_var_1_5)))) && (!((((65536 * (last_1_var_1_5 / 65536)) + last_1_var_1_11) == (last_1_var_1_5 + ((last_1_var_1_11 / 4294967296) * 4294967296)))) || ((65536 * ((last_1_var_1_11 + 4294967280) / 65536)) == (4294901749 + last_1_var_1_11))))) - InvariantResult [Line: 87]: Loop Invariant Derived loop invariant: ((((((((((last_1_var_1_11 < 9) && (0 < ((last_1_var_1_11 / 4294967296) + 1))) && (0 <= k_loop)) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (256 == var_1_5)) && (8 == var_1_11)) && (256 == last_1_var_1_5)) || ((((((((65536 * (last_1_var_1_5 / 65536)) + var_1_1) == last_1_var_1_5) && (1 <= \result)) && (1 <= k_loop)) && (256 == var_1_5)) && (var_1_1 == var_1_11)) && (256 == last_1_var_1_5))) || (((((((1 <= \result) && (1 <= k_loop)) && ((5 + var_1_11) == 0)) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (((((var_1_5 + 8) + ((var_1_6 / 65536) * 65536)) == var_1_6) && (((8 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5) <= ((65536 * (last_1_var_1_5 / 65536)) + var_1_6))) || ((((65536 * (last_1_var_1_5 / 65536)) + var_1_6) <= ((7 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5)) && (((65536 * (last_1_var_1_5 / 65536)) + var_1_5) == last_1_var_1_5)))) && (!((((65536 * (last_1_var_1_5 / 65536)) + last_1_var_1_11) == (last_1_var_1_5 + ((last_1_var_1_11 / 4294967296) * 4294967296)))) || ((65536 * ((last_1_var_1_11 + 4294967280) / 65536)) == (4294901749 + last_1_var_1_11))))) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((((((((65536 * (last_1_var_1_5 / 65536)) + var_1_1) == last_1_var_1_5) && (1 <= \result)) && (1 <= cond)) && (0 <= k_loop)) && (256 == var_1_5)) && (var_1_1 == var_1_11)) && (256 == last_1_var_1_5)) || ((((((((1 <= \result) && (1 <= cond)) && (0 <= k_loop)) && ((5 + var_1_11) == 0)) && ((5 + var_1_1) == 0)) && ((256 * (var_1_4 / 256)) == var_1_4)) && (((((var_1_5 + 8) + ((var_1_6 / 65536) * 65536)) == var_1_6) && (((8 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5) <= ((65536 * (last_1_var_1_5 / 65536)) + var_1_6))) || ((((65536 * (last_1_var_1_5 / 65536)) + var_1_6) <= ((7 + ((var_1_6 / 65536) * 65536)) + last_1_var_1_5)) && (((65536 * (last_1_var_1_5 / 65536)) + var_1_5) == last_1_var_1_5)))) && (!((((65536 * (last_1_var_1_5 / 65536)) + last_1_var_1_11) == (last_1_var_1_5 + ((last_1_var_1_11 / 4294967296) * 4294967296)))) || ((65536 * ((last_1_var_1_11 + 4294967280) / 65536)) == (4294901749 + last_1_var_1_11))))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:08:52,136 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_9f9f4311-0911-471b-a611-88b2cc684c17/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE