./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-82.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_05955617-4550-4dfc-92e2-fe7c1dd21a30/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05955617-4550-4dfc-92e2-fe7c1dd21a30/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_05955617-4550-4dfc-92e2-fe7c1dd21a30/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05955617-4550-4dfc-92e2-fe7c1dd21a30/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-82.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05955617-4550-4dfc-92e2-fe7c1dd21a30/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_05955617-4550-4dfc-92e2-fe7c1dd21a30/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 c7551b88286b5ebcdb10ff8e818afcc3b44708e73b4c8644c034753d18f164a2 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:04:56,237 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:04:56,319 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05955617-4550-4dfc-92e2-fe7c1dd21a30/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:04:56,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:04:56,326 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:04:56,353 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:04:56,354 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:04:56,355 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:04:56,355 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:04:56,356 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:04:56,357 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:04:56,358 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:04:56,358 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:04:56,359 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:04:56,359 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:04:56,360 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:04:56,360 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:04:56,361 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:04:56,361 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:04:56,362 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:04:56,362 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:04:56,363 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:04:56,364 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:04:56,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:04:56,364 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:04:56,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:04:56,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:04:56,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:04:56,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:04:56,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:04:56,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:04:56,368 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:04:56,368 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:04:56,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:04:56,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:04:56,370 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:04:56,370 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:04:56,371 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:04:56,371 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:04:56,371 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_05955617-4550-4dfc-92e2-fe7c1dd21a30/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_05955617-4550-4dfc-92e2-fe7c1dd21a30/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 -> c7551b88286b5ebcdb10ff8e818afcc3b44708e73b4c8644c034753d18f164a2 [2023-11-06 22:04:56,605 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:04:56,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:04:56,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:04:56,645 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:04:56,646 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:04:56,647 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05955617-4550-4dfc-92e2-fe7c1dd21a30/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-82.i [2023-11-06 22:04:59,844 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:05:00,148 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:05:00,153 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05955617-4550-4dfc-92e2-fe7c1dd21a30/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-82.i [2023-11-06 22:05:00,164 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05955617-4550-4dfc-92e2-fe7c1dd21a30/bin/uautomizer-verify-WvqO1wxjHP/data/7bd81e443/3cfd14dd62444fb09452dc184b354b29/FLAG07f870829 [2023-11-06 22:05:00,179 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05955617-4550-4dfc-92e2-fe7c1dd21a30/bin/uautomizer-verify-WvqO1wxjHP/data/7bd81e443/3cfd14dd62444fb09452dc184b354b29 [2023-11-06 22:05:00,187 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:05:00,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:05:00,192 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:05:00,192 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:05:00,199 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:05:00,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:05:00" (1/1) ... [2023-11-06 22:05:00,203 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c727db5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00, skipping insertion in model container [2023-11-06 22:05:00,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:05:00" (1/1) ... [2023-11-06 22:05:00,245 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:05:00,410 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_05955617-4550-4dfc-92e2-fe7c1dd21a30/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-82.i[915,928] [2023-11-06 22:05:00,450 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:05:00,463 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:05:00,477 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_05955617-4550-4dfc-92e2-fe7c1dd21a30/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-82.i[915,928] [2023-11-06 22:05:00,500 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:05:00,517 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:05:00,518 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00 WrapperNode [2023-11-06 22:05:00,518 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:05:00,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:05:00,519 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:05:00,520 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:05:00,527 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:05:00" (1/1) ... [2023-11-06 22:05:00,536 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:05:00" (1/1) ... [2023-11-06 22:05:00,572 INFO L138 Inliner]: procedures = 26, calls = 19, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2023-11-06 22:05:00,573 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:05:00,574 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:05:00,574 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:05:00,574 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:05:00,584 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00" (1/1) ... [2023-11-06 22:05:00,585 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00" (1/1) ... [2023-11-06 22:05:00,587 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00" (1/1) ... [2023-11-06 22:05:00,588 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00" (1/1) ... [2023-11-06 22:05:00,596 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00" (1/1) ... [2023-11-06 22:05:00,600 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00" (1/1) ... [2023-11-06 22:05:00,602 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00" (1/1) ... [2023-11-06 22:05:00,604 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00" (1/1) ... [2023-11-06 22:05:00,607 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:05:00,608 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:05:00,608 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:05:00,608 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:05:00,609 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00" (1/1) ... [2023-11-06 22:05:00,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:05:00,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05955617-4550-4dfc-92e2-fe7c1dd21a30/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:05:00,655 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05955617-4550-4dfc-92e2-fe7c1dd21a30/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:05:00,659 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05955617-4550-4dfc-92e2-fe7c1dd21a30/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:05:00,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:05:00,686 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-06 22:05:00,687 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-06 22:05:00,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:05:00,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:05:00,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:05:00,759 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:05:00,761 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:05:01,030 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:05:01,037 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:05:01,037 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-06 22:05:01,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:05:01 BoogieIcfgContainer [2023-11-06 22:05:01,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:05:01,043 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:05:01,059 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:05:01,063 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:05:01,063 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:05:00" (1/3) ... [2023-11-06 22:05:01,064 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34953583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:05:01, skipping insertion in model container [2023-11-06 22:05:01,064 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:05:00" (2/3) ... [2023-11-06 22:05:01,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34953583 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:05:01, skipping insertion in model container [2023-11-06 22:05:01,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:05:01" (3/3) ... [2023-11-06 22:05:01,066 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-82.i [2023-11-06 22:05:01,095 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:05:01,097 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:05:01,165 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:05:01,173 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;@79aad4a6, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:05:01,173 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:05:01,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 states have internal predecessors, (50), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:05:01,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-06 22:05:01,188 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:01,189 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:01,190 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:01,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:01,196 INFO L85 PathProgramCache]: Analyzing trace with hash -865337059, now seen corresponding path program 1 times [2023-11-06 22:05:01,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:01,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220264388] [2023-11-06 22:05:01,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:01,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:01,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:01,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:05:01,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:01,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:05:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:01,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:05:01,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:01,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:05:01,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:01,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:05:01,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:01,459 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-06 22:05:01,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:01,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220264388] [2023-11-06 22:05:01,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220264388] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:01,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:01,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:05:01,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883136758] [2023-11-06 22:05:01,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:01,469 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 22:05:01,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:01,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 22:05:01,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 22:05:01,503 INFO L87 Difference]: Start difference. First operand has 43 states, 34 states have (on average 1.4705882352941178) internal successors, (50), 35 states have internal predecessors, (50), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:05:01,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:01,529 INFO L93 Difference]: Finished difference Result 77 states and 120 transitions. [2023-11-06 22:05:01,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 22:05:01,531 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 50 [2023-11-06 22:05:01,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:01,540 INFO L225 Difference]: With dead ends: 77 [2023-11-06 22:05:01,540 INFO L226 Difference]: Without dead ends: 37 [2023-11-06 22:05:01,544 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 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:05:01,548 INFO L413 NwaCegarLoop]: 49 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, 49 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:05:01,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:05:01,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2023-11-06 22:05:01,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2023-11-06 22:05:01,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:05:01,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2023-11-06 22:05:01,591 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 50 [2023-11-06 22:05:01,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:01,592 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2023-11-06 22:05:01,593 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:05:01,593 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2023-11-06 22:05:01,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2023-11-06 22:05:01,596 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:01,596 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:01,597 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:05:01,597 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:01,598 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:01,598 INFO L85 PathProgramCache]: Analyzing trace with hash -257835239, now seen corresponding path program 1 times [2023-11-06 22:05:01,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:01,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682732503] [2023-11-06 22:05:01,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:01,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:02,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:05:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:05:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:05:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:05:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:05:02,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,118 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-06 22:05:02,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:02,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682732503] [2023-11-06 22:05:02,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682732503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:02,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:02,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:05:02,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863610184] [2023-11-06 22:05:02,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:02,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:05:02,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:02,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:05:02,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:05:02,123 INFO L87 Difference]: Start difference. First operand 37 states and 49 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:05:02,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:02,216 INFO L93 Difference]: Finished difference Result 87 states and 115 transitions. [2023-11-06 22:05:02,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:05:02,217 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 50 [2023-11-06 22:05:02,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:02,219 INFO L225 Difference]: With dead ends: 87 [2023-11-06 22:05:02,219 INFO L226 Difference]: Without dead ends: 53 [2023-11-06 22:05:02,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:05:02,222 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 21 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:02,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 162 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:05:02,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2023-11-06 22:05:02,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 41. [2023-11-06 22:05:02,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-06 22:05:02,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 54 transitions. [2023-11-06 22:05:02,234 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 54 transitions. Word has length 50 [2023-11-06 22:05:02,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:02,236 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 54 transitions. [2023-11-06 22:05:02,237 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:05:02,237 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 54 transitions. [2023-11-06 22:05:02,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-06 22:05:02,239 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:02,239 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:02,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:05:02,240 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:02,241 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:02,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1410418132, now seen corresponding path program 1 times [2023-11-06 22:05:02,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:02,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314958639] [2023-11-06 22:05:02,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:02,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:02,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:02,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:05:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:05:02,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:02,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:05:02,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:05:03,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:05:03,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,021 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-06 22:05:03,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:03,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314958639] [2023-11-06 22:05:03,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314958639] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:03,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:03,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:05:03,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882286207] [2023-11-06 22:05:03,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:03,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:05:03,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:03,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:05:03,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:05:03,031 INFO L87 Difference]: Start difference. First operand 41 states and 54 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:05:03,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:03,442 INFO L93 Difference]: Finished difference Result 125 states and 168 transitions. [2023-11-06 22:05:03,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:05:03,443 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2023-11-06 22:05:03,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:03,451 INFO L225 Difference]: With dead ends: 125 [2023-11-06 22:05:03,451 INFO L226 Difference]: Without dead ends: 123 [2023-11-06 22:05:03,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:05:03,461 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 98 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:03,463 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 304 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:05:03,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-06 22:05:03,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 78. [2023-11-06 22:05:03,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 66 states have internal predecessors, (82), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-11-06 22:05:03,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2023-11-06 22:05:03,514 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 52 [2023-11-06 22:05:03,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:03,516 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2023-11-06 22:05:03,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:05:03,517 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2023-11-06 22:05:03,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-11-06 22:05:03,526 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:03,526 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:03,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:05:03,527 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:03,527 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:03,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1668583570, now seen corresponding path program 1 times [2023-11-06 22:05:03,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:03,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113823970] [2023-11-06 22:05:03,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:03,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:03,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:05:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:05:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:05:03,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:05:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:05:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:03,962 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-06 22:05:03,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:03,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113823970] [2023-11-06 22:05:03,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113823970] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:03,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:03,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:05:03,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421227261] [2023-11-06 22:05:03,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:03,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:05:03,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:03,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:05:03,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:05:03,967 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:05:04,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:04,200 INFO L93 Difference]: Finished difference Result 199 states and 260 transitions. [2023-11-06 22:05:04,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:05:04,201 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2023-11-06 22:05:04,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:04,206 INFO L225 Difference]: With dead ends: 199 [2023-11-06 22:05:04,206 INFO L226 Difference]: Without dead ends: 124 [2023-11-06 22:05:04,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2023-11-06 22:05:04,219 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 59 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:04,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 167 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:05:04,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-06 22:05:04,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 96. [2023-11-06 22:05:04,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 77 states have internal predecessors, (93), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2023-11-06 22:05:04,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 125 transitions. [2023-11-06 22:05:04,255 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 125 transitions. Word has length 52 [2023-11-06 22:05:04,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:04,257 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 125 transitions. [2023-11-06 22:05:04,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:05:04,258 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 125 transitions. [2023-11-06 22:05:04,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-11-06 22:05:04,261 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:04,261 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05:04,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:05:04,262 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:04,262 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:04,263 INFO L85 PathProgramCache]: Analyzing trace with hash -314811849, now seen corresponding path program 1 times [2023-11-06 22:05:04,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:04,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967681211] [2023-11-06 22:05:04,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:04,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:05:04,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:05:04,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:05:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:05:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:05:04,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:04,572 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-06 22:05:04,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:04,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967681211] [2023-11-06 22:05:04,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967681211] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:04,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:04,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:05:04,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761111050] [2023-11-06 22:05:04,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:04,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:05:04,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:04,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:05:04,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:05:04,575 INFO L87 Difference]: Start difference. First operand 96 states and 125 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:05:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:04,662 INFO L93 Difference]: Finished difference Result 170 states and 221 transitions. [2023-11-06 22:05:04,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:05:04,663 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 53 [2023-11-06 22:05:04,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:04,664 INFO L225 Difference]: With dead ends: 170 [2023-11-06 22:05:04,664 INFO L226 Difference]: Without dead ends: 95 [2023-11-06 22:05:04,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 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:05:04,666 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 38 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:04,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 105 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:05:04,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-06 22:05:04,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 90. [2023-11-06 22:05:04,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.164179104477612) internal successors, (78), 68 states have internal predecessors, (78), 18 states have call successors, (18), 4 states have call predecessors, (18), 4 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:05:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 114 transitions. [2023-11-06 22:05:04,687 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 114 transitions. Word has length 53 [2023-11-06 22:05:04,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:04,687 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 114 transitions. [2023-11-06 22:05:04,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:05:04,688 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2023-11-06 22:05:04,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2023-11-06 22:05:04,689 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:04,689 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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] [2023-11-06 22:05:04,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:05:04,690 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:04,690 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:04,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1837010626, now seen corresponding path program 1 times [2023-11-06 22:05:04,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:04,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121374228] [2023-11-06 22:05:04,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:04,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:05,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:05:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:05:05,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:05:05,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:05:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:05:05,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:05:05,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:05:05,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:05:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:05:05,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:05:05,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:05:05,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,254 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2023-11-06 22:05:05,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:05,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121374228] [2023-11-06 22:05:05,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121374228] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:05,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:05,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-06 22:05:05,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116452287] [2023-11-06 22:05:05,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:05,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:05:05,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:05,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:05:05,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:05:05,257 INFO L87 Difference]: Start difference. First operand 90 states and 114 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:05:05,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:05,507 INFO L93 Difference]: Finished difference Result 139 states and 177 transitions. [2023-11-06 22:05:05,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:05:05,507 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 101 [2023-11-06 22:05:05,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:05,510 INFO L225 Difference]: With dead ends: 139 [2023-11-06 22:05:05,510 INFO L226 Difference]: Without dead ends: 137 [2023-11-06 22:05:05,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:05:05,511 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 72 mSDsluCounter, 311 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:05,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 394 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:05:05,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2023-11-06 22:05:05,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 74. [2023-11-06 22:05:05,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 58 states have internal predecessors, (69), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-11-06 22:05:05,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2023-11-06 22:05:05,531 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 101 [2023-11-06 22:05:05,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:05,532 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2023-11-06 22:05:05,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:05:05,533 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2023-11-06 22:05:05,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-06 22:05:05,534 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:05:05,534 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 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] [2023-11-06 22:05:05,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:05:05,535 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:05:05,535 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:05,536 INFO L85 PathProgramCache]: Analyzing trace with hash 2094111757, now seen corresponding path program 1 times [2023-11-06 22:05:05,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:05,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802948608] [2023-11-06 22:05:05,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:05,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:05,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-06 22:05:05,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-06 22:05:05,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-06 22:05:05,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-06 22:05:05,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-06 22:05:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:05:05,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2023-11-06 22:05:05,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-06 22:05:05,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-06 22:05:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-06 22:05:05,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-06 22:05:05,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-06 22:05:05,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:05,921 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 278 trivial. 0 not checked. [2023-11-06 22:05:05,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:05,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802948608] [2023-11-06 22:05:05,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802948608] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:05:05,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:05:05,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:05:05,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392958733] [2023-11-06 22:05:05,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:05:05,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:05:05,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:05:05,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:05:05,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:05:05,924 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:05:05,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:05:05,988 INFO L93 Difference]: Finished difference Result 135 states and 168 transitions. [2023-11-06 22:05:05,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:05:05,989 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 102 [2023-11-06 22:05:05,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:05:05,990 INFO L225 Difference]: With dead ends: 135 [2023-11-06 22:05:05,990 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:05:05,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:05:05,992 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 27 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:05:05,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 145 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:05:05,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:05:05,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:05:05,994 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:05:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:05:05,994 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2023-11-06 22:05:05,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:05:05,994 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:05:05,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2023-11-06 22:05:05,995 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:05:05,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:05:05,998 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:05:05,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:05:06,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:05:06,315 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:05:06,316 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-06 22:05:06,317 INFO L895 garLoopResultBuilder]: At program point L19-3(line 19) the Hoare annotation is: (let ((.cse0 (not (= |ULTIMATE.start___VERIFIER_assert_~cond#1| 0)))) (or (and (= ~var_1_9~0 ~var_1_5~0) .cse0) (and .cse0 (<= ~var_1_5~0 255) (<= 0 ~var_1_5~0) (= (+ (* (div ~var_1_9~0 256) 256) ~var_1_5~0) (+ ~var_1_9~0 (* (div ~var_1_5~0 256) 256)))))) [2023-11-06 22:05:06,317 INFO L895 garLoopResultBuilder]: At program point main_returnLabel#1(lines 78 89) the Hoare annotation is: false [2023-11-06 22:05:06,317 INFO L899 garLoopResultBuilder]: For program point L69(lines 59 70) no Hoare annotation was computed. [2023-11-06 22:05:06,318 INFO L895 garLoopResultBuilder]: At program point L61(line 61) the Hoare annotation is: (let ((.cse0 (<= ~var_1_5~0 255)) (.cse1 (<= 0 ~var_1_5~0))) (or (= ~var_1_9~0 ~var_1_5~0) (and (<= (+ ~last_1_var_1_10~0 10) 0) (<= (+ ~var_1_10~0 10) 0) .cse0 .cse1) (and .cse0 .cse1 (= (+ (* (div ~var_1_9~0 256) 256) ~var_1_5~0) (+ ~var_1_9~0 (* (div ~var_1_5~0 256) 256)))))) [2023-11-06 22:05:06,318 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:05:06,318 INFO L895 garLoopResultBuilder]: At program point L61-1(line 61) the Hoare annotation is: (let ((.cse0 (<= ~var_1_5~0 255)) (.cse1 (<= 0 ~var_1_5~0))) (or (= ~var_1_9~0 ~var_1_5~0) (and (<= (+ ~last_1_var_1_10~0 10) 0) (<= (+ ~var_1_10~0 10) 0) .cse0 .cse1) (and .cse0 .cse1 (= (+ (* (div ~var_1_9~0 256) 256) ~var_1_5~0) (+ ~var_1_9~0 (* (div ~var_1_5~0 256) 256)))))) [2023-11-06 22:05:06,318 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 57) no Hoare annotation was computed. [2023-11-06 22:05:06,319 INFO L899 garLoopResultBuilder]: For program point L62(line 62) no Hoare annotation was computed. [2023-11-06 22:05:06,319 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 54) no Hoare annotation was computed. [2023-11-06 22:05:06,319 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:05:06,319 INFO L899 garLoopResultBuilder]: For program point L71(lines 71 73) no Hoare annotation was computed. [2023-11-06 22:05:06,319 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 31) no Hoare annotation was computed. [2023-11-06 22:05:06,319 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 43) no Hoare annotation was computed. [2023-11-06 22:05:06,320 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (let ((.cse0 (<= ~var_1_5~0 255)) (.cse1 (<= 0 ~var_1_5~0))) (or (= ~var_1_9~0 ~var_1_5~0) (and (<= (+ ~last_1_var_1_10~0 10) 0) (<= (+ ~var_1_10~0 10) 0) .cse0 .cse1) (and .cse0 .cse1 (= (+ (* (div ~var_1_9~0 256) 256) ~var_1_5~0) (+ ~var_1_9~0 (* (div ~var_1_5~0 256) 256)))))) [2023-11-06 22:05:06,320 INFO L899 garLoopResultBuilder]: For program point L64-1(line 64) no Hoare annotation was computed. [2023-11-06 22:05:06,320 INFO L895 garLoopResultBuilder]: At program point L81-2(lines 81 87) the Hoare annotation is: (let ((.cse0 (<= ~var_1_5~0 255)) (.cse1 (<= 0 ~var_1_5~0))) (or (= ~var_1_9~0 ~var_1_5~0) (and (<= (+ ~last_1_var_1_10~0 10) 0) (<= (+ ~var_1_10~0 10) 0) .cse0 .cse1) (and .cse0 .cse1 (= (+ (* (div ~var_1_9~0 256) 256) ~var_1_5~0) (+ ~var_1_9~0 (* (div ~var_1_5~0 256) 256)))))) [2023-11-06 22:05:06,320 INFO L899 garLoopResultBuilder]: For program point L81-3(lines 81 87) no Hoare annotation was computed. [2023-11-06 22:05:06,320 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2023-11-06 22:05:06,321 INFO L899 garLoopResultBuilder]: For program point L32(lines 32 58) no Hoare annotation was computed. [2023-11-06 22:05:06,321 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:05:06,321 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:05:06,321 INFO L899 garLoopResultBuilder]: For program point L49(lines 49 53) no Hoare annotation was computed. [2023-11-06 22:05:06,321 INFO L895 garLoopResultBuilder]: At program point property_returnLabel#1(lines 74 77) the Hoare annotation is: (let ((.cse2 (* (div ~var_1_9~0 256) 256))) (let ((.cse0 (<= 1 |ULTIMATE.start_property_#res#1|)) (.cse1 (= (+ .cse2 ~var_1_10~0) ~var_1_9~0))) (or (and (= ~var_1_9~0 ~var_1_5~0) .cse0 .cse1) (and .cse0 (<= ~var_1_5~0 255) (<= 0 ~var_1_5~0) (= (+ .cse2 ~var_1_5~0) (+ ~var_1_9~0 (* (div ~var_1_5~0 256) 256))) .cse1)))) [2023-11-06 22:05:06,322 INFO L895 garLoopResultBuilder]: At program point L66(line 66) the Hoare annotation is: (let ((.cse0 (<= ~var_1_5~0 255)) (.cse1 (<= 0 ~var_1_5~0))) (or (= ~var_1_9~0 ~var_1_5~0) (and (<= (+ ~last_1_var_1_10~0 10) 0) (<= (+ ~var_1_10~0 10) 0) .cse0 .cse1) (and .cse0 .cse1 (= (+ (* (div ~var_1_9~0 256) 256) ~var_1_5~0) (+ ~var_1_9~0 (* (div ~var_1_5~0 256) 256)))))) [2023-11-06 22:05:06,322 INFO L899 garLoopResultBuilder]: For program point L66-1(line 66) no Hoare annotation was computed. [2023-11-06 22:05:06,322 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:05:06,322 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-11-06 22:05:06,322 INFO L899 garLoopResultBuilder]: For program point L75-1(line 75) no Hoare annotation was computed. [2023-11-06 22:05:06,323 INFO L899 garLoopResultBuilder]: For program point L75-3(line 75) no Hoare annotation was computed. [2023-11-06 22:05:06,323 INFO L899 garLoopResultBuilder]: For program point L75-5(line 75) no Hoare annotation was computed. [2023-11-06 22:05:06,323 INFO L899 garLoopResultBuilder]: For program point L75-7(line 75) no Hoare annotation was computed. [2023-11-06 22:05:06,323 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2023-11-06 22:05:06,324 INFO L899 garLoopResultBuilder]: For program point L34-2(line 34) no Hoare annotation was computed. [2023-11-06 22:05:06,324 INFO L899 garLoopResultBuilder]: For program point L34-4(lines 34 38) no Hoare annotation was computed. [2023-11-06 22:05:06,325 INFO L899 garLoopResultBuilder]: For program point L34-6(lines 32 58) no Hoare annotation was computed. [2023-11-06 22:05:06,325 INFO L902 garLoopResultBuilder]: At program point L68(line 68) the Hoare annotation is: true [2023-11-06 22:05:06,325 INFO L902 garLoopResultBuilder]: At program point L68-1(line 68) the Hoare annotation is: true [2023-11-06 22:05:06,325 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-06 22:05:06,325 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-06 22:05:06,325 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-06 22:05:06,326 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-06 22:05:06,329 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:05:06,331 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:05:06,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:05:06 BoogieIcfgContainer [2023-11-06 22:05:06,364 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:05:06,365 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:05:06,365 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:05:06,366 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:05:06,366 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:05:01" (3/4) ... [2023-11-06 22:05:06,369 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:05:06,375 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-06 22:05:06,386 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2023-11-06 22:05:06,387 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:05:06,387 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:05:06,388 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:05:06,420 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((var_1_9 == var_1_5) && (1 <= \result)) && ((((var_1_9 / 256) * 256) + var_1_10) == var_1_9)) || (((((1 <= \result) && (var_1_5 <= 255)) && (0 <= var_1_5)) && ((((var_1_9 / 256) * 256) + var_1_5) == (var_1_9 + ((var_1_5 / 256) * 256)))) && ((((var_1_9 / 256) * 256) + var_1_10) == var_1_9))) [2023-11-06 22:05:06,445 WARN L115 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((var_1_9 == var_1_5) && (1 <= \result)) && ((((var_1_9 / 256) * 256) + var_1_10) == var_1_9)) || (((((1 <= \result) && (var_1_5 <= 255)) && (0 <= var_1_5)) && ((((var_1_9 / 256) * 256) + var_1_5) == (var_1_9 + ((var_1_5 / 256) * 256)))) && ((((var_1_9 / 256) * 256) + var_1_10) == var_1_9))) [2023-11-06 22:05:06,459 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05955617-4550-4dfc-92e2-fe7c1dd21a30/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:05:06,459 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05955617-4550-4dfc-92e2-fe7c1dd21a30/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:05:06,459 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:05:06,460 INFO L158 Benchmark]: Toolchain (without parser) took 6271.69ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 157.0MB in the beginning and 122.6MB in the end (delta: 34.4MB). Peak memory consumption was 74.1MB. Max. memory is 16.1GB. [2023-11-06 22:05:06,460 INFO L158 Benchmark]: CDTParser took 0.31ms. Allocated memory is still 130.0MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:05:06,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.50ms. Allocated memory is still 186.6MB. Free memory was 157.0MB in the beginning and 144.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:05:06,461 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.92ms. Allocated memory is still 186.6MB. Free memory was 144.8MB in the beginning and 142.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:05:06,461 INFO L158 Benchmark]: Boogie Preprocessor took 33.30ms. Allocated memory is still 186.6MB. Free memory was 142.4MB in the beginning and 140.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:05:06,462 INFO L158 Benchmark]: RCFGBuilder took 432.46ms. Allocated memory is still 186.6MB. Free memory was 140.8MB in the beginning and 126.1MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-06 22:05:06,462 INFO L158 Benchmark]: TraceAbstraction took 5321.50ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 125.4MB in the beginning and 126.7MB in the end (delta: -1.3MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. [2023-11-06 22:05:06,462 INFO L158 Benchmark]: Witness Printer took 94.06ms. Allocated memory is still 224.4MB. Free memory was 126.7MB in the beginning and 122.6MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:05:06,464 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.31ms. Allocated memory is still 130.0MB. Free memory is still 87.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.50ms. Allocated memory is still 186.6MB. Free memory was 157.0MB in the beginning and 144.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.92ms. Allocated memory is still 186.6MB. Free memory was 144.8MB in the beginning and 142.4MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.30ms. Allocated memory is still 186.6MB. Free memory was 142.4MB in the beginning and 140.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 432.46ms. Allocated memory is still 186.6MB. Free memory was 140.8MB in the beginning and 126.1MB in the end (delta: 14.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5321.50ms. Allocated memory was 186.6MB in the beginning and 224.4MB in the end (delta: 37.7MB). Free memory was 125.4MB in the beginning and 126.7MB in the end (delta: -1.3MB). Peak memory consumption was 40.5MB. Max. memory is 16.1GB. * Witness Printer took 94.06ms. Allocated memory is still 224.4MB. Free memory was 126.7MB in the beginning and 122.6MB in the end (delta: 4.2MB). Peak memory consumption was 2.1MB. 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, 43 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.2s, OverallIterations: 7, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 319 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 315 mSDsluCounter, 1326 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 930 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 441 IncrementalHoareTripleChecker+Invalid, 500 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 396 mSDtfsCounter, 441 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 177 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=4, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 153 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 64 PreInvPairs, 87 NumberOfFragments, 305 HoareAnnotationTreeSize, 64 FomulaSimplifications, 1804 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 302 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 460 NumberOfCodeBlocks, 460 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 453 ConstructedInterpolants, 0 QuantifiedInterpolants, 948 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 876/876 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: 81]: Loop Invariant Derived loop invariant: (((var_1_9 == var_1_5) || (((((last_1_var_1_10 + 10) <= 0) && ((var_1_10 + 10) <= 0)) && (var_1_5 <= 255)) && (0 <= var_1_5))) || (((var_1_5 <= 255) && (0 <= var_1_5)) && ((((var_1_9 / 256) * 256) + var_1_5) == (var_1_9 + ((var_1_5 / 256) * 256))))) - InvariantResult [Line: 78]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 74]: Loop Invariant Derived loop invariant: ((((var_1_9 == var_1_5) && (1 <= \result)) && ((((var_1_9 / 256) * 256) + var_1_10) == var_1_9)) || (((((1 <= \result) && (var_1_5 <= 255)) && (0 <= var_1_5)) && ((((var_1_9 / 256) * 256) + var_1_5) == (var_1_9 + ((var_1_5 / 256) * 256)))) && ((((var_1_9 / 256) * 256) + var_1_10) == var_1_9))) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (((var_1_9 == var_1_5) && !((cond == 0))) || (((!((cond == 0)) && (var_1_5 <= 255)) && (0 <= var_1_5)) && ((((var_1_9 / 256) * 256) + var_1_5) == (var_1_9 + ((var_1_5 / 256) * 256))))) RESULT: Ultimate proved your program to be correct! [2023-11-06 22:05:06,487 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_05955617-4550-4dfc-92e2-fe7c1dd21a30/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE