./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-39.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2775c82a-1b14-416d-b08d-cf1b125513b6/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2775c82a-1b14-416d-b08d-cf1b125513b6/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2775c82a-1b14-416d-b08d-cf1b125513b6/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2775c82a-1b14-416d-b08d-cf1b125513b6/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-39.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2775c82a-1b14-416d-b08d-cf1b125513b6/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2775c82a-1b14-416d-b08d-cf1b125513b6/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8b89c5a452639706785e6c59e59bc9495b7c670c1d520018d254073dacdf7a8c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:28:15,274 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:28:15,347 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2775c82a-1b14-416d-b08d-cf1b125513b6/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:28:15,353 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:28:15,354 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:28:15,381 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:28:15,382 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:28:15,382 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:28:15,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:28:15,384 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:28:15,385 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:28:15,386 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:28:15,386 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:28:15,387 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:28:15,388 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:28:15,388 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:28:15,389 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:28:15,389 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:28:15,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:28:15,391 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:28:15,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:28:15,392 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:28:15,393 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:28:15,393 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:28:15,394 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:28:15,394 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:28:15,395 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:28:15,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:28:15,396 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:28:15,397 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:28:15,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:28:15,398 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:28:15,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:28:15,402 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:28:15,402 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:28:15,403 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:28:15,403 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:28:15,403 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:28:15,403 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:28:15,404 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_2775c82a-1b14-416d-b08d-cf1b125513b6/bin/uautomizer-verify-uTZkv6EMXl/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_2775c82a-1b14-416d-b08d-cf1b125513b6/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8b89c5a452639706785e6c59e59bc9495b7c670c1d520018d254073dacdf7a8c [2023-11-12 02:28:15,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:28:15,748 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:28:15,751 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:28:15,753 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:28:15,754 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:28:15,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2775c82a-1b14-416d-b08d-cf1b125513b6/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-39.i [2023-11-12 02:28:18,988 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:28:19,218 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:28:19,219 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2775c82a-1b14-416d-b08d-cf1b125513b6/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-39.i [2023-11-12 02:28:19,229 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2775c82a-1b14-416d-b08d-cf1b125513b6/bin/uautomizer-verify-uTZkv6EMXl/data/5976c7f1b/1804a4af3a774b36bd07695ba7348c3a/FLAGfbb81b16e [2023-11-12 02:28:19,248 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2775c82a-1b14-416d-b08d-cf1b125513b6/bin/uautomizer-verify-uTZkv6EMXl/data/5976c7f1b/1804a4af3a774b36bd07695ba7348c3a [2023-11-12 02:28:19,256 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:28:19,260 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:28:19,263 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:28:19,263 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:28:19,269 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:28:19,271 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:28:19" (1/1) ... [2023-11-12 02:28:19,273 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ecc98c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:28:19, skipping insertion in model container [2023-11-12 02:28:19,273 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:28:19" (1/1) ... [2023-11-12 02:28:19,318 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:28:19,513 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_2775c82a-1b14-416d-b08d-cf1b125513b6/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-39.i[915,928] [2023-11-12 02:28:19,568 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:28:19,593 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:28:19,611 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_2775c82a-1b14-416d-b08d-cf1b125513b6/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount25_file-39.i[915,928] [2023-11-12 02:28:19,643 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:28:19,661 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:28:19,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:28:19 WrapperNode [2023-11-12 02:28:19,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:28:19,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:28:19,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:28:19,664 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:28:19,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:28:19" (1/1) ... [2023-11-12 02:28:19,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:28:19" (1/1) ... [2023-11-12 02:28:19,720 INFO L138 Inliner]: procedures = 26, calls = 26, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 102 [2023-11-12 02:28:19,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:28:19,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:28:19,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:28:19,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:28:19,732 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:28:19" (1/1) ... [2023-11-12 02:28:19,732 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:28:19" (1/1) ... [2023-11-12 02:28:19,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:28:19" (1/1) ... [2023-11-12 02:28:19,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:28:19" (1/1) ... [2023-11-12 02:28:19,745 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:28:19" (1/1) ... [2023-11-12 02:28:19,749 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:28:19" (1/1) ... [2023-11-12 02:28:19,752 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:28:19" (1/1) ... [2023-11-12 02:28:19,754 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:28:19" (1/1) ... [2023-11-12 02:28:19,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:28:19,759 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:28:19,760 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:28:19,760 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:28:19,761 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:28:19" (1/1) ... [2023-11-12 02:28:19,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:28:19,804 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2775c82a-1b14-416d-b08d-cf1b125513b6/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:28:19,825 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2775c82a-1b14-416d-b08d-cf1b125513b6/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:28:19,854 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2775c82a-1b14-416d-b08d-cf1b125513b6/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:28:19,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:28:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-11-12 02:28:19,876 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-11-12 02:28:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:28:19,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:28:19,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:28:19,960 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:28:19,963 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:28:20,271 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:28:20,278 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:28:20,278 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-12 02:28:20,281 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:28:20 BoogieIcfgContainer [2023-11-12 02:28:20,281 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:28:20,284 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:28:20,284 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:28:20,288 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:28:20,288 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:28:19" (1/3) ... [2023-11-12 02:28:20,289 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d87abaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:28:20, skipping insertion in model container [2023-11-12 02:28:20,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:28:19" (2/3) ... [2023-11-12 02:28:20,290 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d87abaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:28:20, skipping insertion in model container [2023-11-12 02:28:20,290 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:28:20" (3/3) ... [2023-11-12 02:28:20,292 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount25_file-39.i [2023-11-12 02:28:20,310 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:28:20,311 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:28:20,363 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:28:20,371 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@22678f63, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:28:20,371 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:28:20,376 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2023-11-12 02:28:20,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-11-12 02:28:20,388 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:28:20,388 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:28:20,389 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:28:20,394 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:28:20,395 INFO L85 PathProgramCache]: Analyzing trace with hash 705531536, now seen corresponding path program 1 times [2023-11-12 02:28:20,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:28:20,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516811703] [2023-11-12 02:28:20,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:28:20,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:28:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:21,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:28:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:21,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:28:21,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:21,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:28:21,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:21,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:28:21,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:21,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:28:21,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:21,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-12 02:28:21,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:21,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-12 02:28:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:21,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:28:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:21,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:28:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:22,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:28:22,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:22,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-12 02:28:22,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:22,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:28:22,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:22,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:28:22,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-12 02:28:22,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:28:22,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516811703] [2023-11-12 02:28:22,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516811703] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:28:22,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:28:22,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:28:22,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592363201] [2023-11-12 02:28:22,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:28:22,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:28:22,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:28:22,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:28:22,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:28:22,141 INFO L87 Difference]: Start difference. First operand has 47 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 32 states have internal predecessors, (41), 13 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-12 02:28:22,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:28:22,459 INFO L93 Difference]: Finished difference Result 157 states and 275 transitions. [2023-11-12 02:28:22,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:28:22,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 87 [2023-11-12 02:28:22,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:28:22,476 INFO L225 Difference]: With dead ends: 157 [2023-11-12 02:28:22,476 INFO L226 Difference]: Without dead ends: 113 [2023-11-12 02:28:22,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 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-12 02:28:22,488 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 72 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-12 02:28:22,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 168 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-12 02:28:22,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-12 02:28:22,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 81. [2023-11-12 02:28:22,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 52 states have internal predecessors, (63), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-12 02:28:22,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 115 transitions. [2023-11-12 02:28:22,578 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 115 transitions. Word has length 87 [2023-11-12 02:28:22,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:28:22,579 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 115 transitions. [2023-11-12 02:28:22,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-12 02:28:22,580 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 115 transitions. [2023-11-12 02:28:22,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-12 02:28:22,584 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:28:22,585 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:28:22,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:28:22,585 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:28:22,586 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:28:22,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1626825182, now seen corresponding path program 1 times [2023-11-12 02:28:22,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:28:22,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341769091] [2023-11-12 02:28:22,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:28:22,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:28:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:24,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:28:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:24,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:28:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:24,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:28:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:24,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:28:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:24,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:28:24,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:24,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-12 02:28:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:24,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-12 02:28:24,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:24,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:28:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:24,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:28:24,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:24,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:28:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:24,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-12 02:28:24,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:24,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:28:24,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:24,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:28:24,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:24,191 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-12 02:28:24,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:28:24,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341769091] [2023-11-12 02:28:24,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341769091] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:28:24,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:28:24,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-12 02:28:24,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642732944] [2023-11-12 02:28:24,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:28:24,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:28:24,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:28:24,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:28:24,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:28:24,197 INFO L87 Difference]: Start difference. First operand 81 states and 115 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-12 02:28:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:28:25,259 INFO L93 Difference]: Finished difference Result 190 states and 271 transitions. [2023-11-12 02:28:25,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-12 02:28:25,260 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 88 [2023-11-12 02:28:25,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:28:25,263 INFO L225 Difference]: With dead ends: 190 [2023-11-12 02:28:25,263 INFO L226 Difference]: Without dead ends: 188 [2023-11-12 02:28:25,264 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2023-11-12 02:28:25,265 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 75 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:28:25,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 320 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:28:25,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2023-11-12 02:28:25,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 97. [2023-11-12 02:28:25,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 68 states have internal predecessors, (84), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-12 02:28:25,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2023-11-12 02:28:25,321 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 88 [2023-11-12 02:28:25,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:28:25,324 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2023-11-12 02:28:25,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-12 02:28:25,325 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2023-11-12 02:28:25,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-12 02:28:25,329 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:28:25,329 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:28:25,330 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:28:25,330 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:28:25,330 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:28:25,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1628672224, now seen corresponding path program 1 times [2023-11-12 02:28:25,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:28:25,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522795829] [2023-11-12 02:28:25,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:28:25,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:28:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:27,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:28:27,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:27,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:28:27,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:27,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:28:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:27,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:28:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:27,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:28:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:27,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-12 02:28:27,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:27,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-12 02:28:27,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:27,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:28:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:27,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:28:27,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:27,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:28:27,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:27,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-12 02:28:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:27,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:28:27,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:27,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:28:27,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:27,571 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-12 02:28:27,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:28:27,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522795829] [2023-11-12 02:28:27,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522795829] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:28:27,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:28:27,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-12 02:28:27,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345146688] [2023-11-12 02:28:27,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:28:27,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-12 02:28:27,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:28:27,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-12 02:28:27,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2023-11-12 02:28:27,579 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-12 02:28:28,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:28:28,778 INFO L93 Difference]: Finished difference Result 184 states and 264 transitions. [2023-11-12 02:28:28,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-12 02:28:28,778 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 88 [2023-11-12 02:28:28,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:28:28,781 INFO L225 Difference]: With dead ends: 184 [2023-11-12 02:28:28,781 INFO L226 Difference]: Without dead ends: 182 [2023-11-12 02:28:28,782 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2023-11-12 02:28:28,783 INFO L413 NwaCegarLoop]: 92 mSDtfsCounter, 48 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:28:28,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 298 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:28:28,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2023-11-12 02:28:28,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 97. [2023-11-12 02:28:28,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 68 states have (on average 1.2352941176470589) internal successors, (84), 68 states have internal predecessors, (84), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2023-11-12 02:28:28,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 136 transitions. [2023-11-12 02:28:28,842 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 136 transitions. Word has length 88 [2023-11-12 02:28:28,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:28:28,845 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 136 transitions. [2023-11-12 02:28:28,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-12 02:28:28,846 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 136 transitions. [2023-11-12 02:28:28,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2023-11-12 02:28:28,852 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:28:28,852 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:28:28,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:28:28,853 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:28:28,853 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:28:28,854 INFO L85 PathProgramCache]: Analyzing trace with hash -448020475, now seen corresponding path program 1 times [2023-11-12 02:28:28,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:28:28,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646994473] [2023-11-12 02:28:28,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:28:28,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:28:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:29,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:28:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:29,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:28:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:29,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:28:29,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:29,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:28:29,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:29,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:28:29,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:29,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-12 02:28:29,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:29,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-12 02:28:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:29,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:28:29,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:29,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:28:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:29,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:28:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:29,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-12 02:28:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:29,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:28:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:29,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:28:29,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:29,093 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-12 02:28:29,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:28:29,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646994473] [2023-11-12 02:28:29,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646994473] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:28:29,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:28:29,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:28:29,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469508641] [2023-11-12 02:28:29,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:28:29,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:28:29,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:28:29,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:28:29,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:28:29,096 INFO L87 Difference]: Start difference. First operand 97 states and 136 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-12 02:28:29,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:28:29,230 INFO L93 Difference]: Finished difference Result 233 states and 326 transitions. [2023-11-12 02:28:29,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:28:29,232 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 89 [2023-11-12 02:28:29,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:28:29,234 INFO L225 Difference]: With dead ends: 233 [2023-11-12 02:28:29,234 INFO L226 Difference]: Without dead ends: 139 [2023-11-12 02:28:29,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 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-12 02:28:29,238 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 41 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:28:29,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 167 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:28:29,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-12 02:28:29,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 134. [2023-11-12 02:28:29,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 91 states have (on average 1.1978021978021978) internal successors, (109), 91 states have internal predecessors, (109), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-12 02:28:29,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 187 transitions. [2023-11-12 02:28:29,286 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 187 transitions. Word has length 89 [2023-11-12 02:28:29,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:28:29,286 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 187 transitions. [2023-11-12 02:28:29,287 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-12 02:28:29,287 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 187 transitions. [2023-11-12 02:28:29,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-11-12 02:28:29,290 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:28:29,291 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:28:29,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:28:29,291 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:28:29,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:28:29,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1109662877, now seen corresponding path program 1 times [2023-11-12 02:28:29,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:28:29,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912626724] [2023-11-12 02:28:29,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:28:29,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:28:29,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:28:30,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:28:30,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:28:30,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:28:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:28:30,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-12 02:28:30,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-12 02:28:30,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:28:30,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:28:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:28:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-12 02:28:30,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:28:30,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:28:30,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:28:30,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:28:30,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:28:30,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:28:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:28:30,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:28:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-12 02:28:30,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-12 02:28:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-12 02:28:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-12 02:28:30,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-12 02:28:30,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-12 02:28:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-12 02:28:30,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:30,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2023-11-12 02:28:30,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:28:30,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912626724] [2023-11-12 02:28:30,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912626724] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:28:30,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:28:30,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-12 02:28:30,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730806121] [2023-11-12 02:28:30,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:28:30,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 02:28:30,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:28:30,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 02:28:30,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:28:30,659 INFO L87 Difference]: Start difference. First operand 134 states and 187 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-12 02:28:31,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:28:31,786 INFO L93 Difference]: Finished difference Result 236 states and 336 transitions. [2023-11-12 02:28:31,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-12 02:28:31,786 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 174 [2023-11-12 02:28:31,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:28:31,789 INFO L225 Difference]: With dead ends: 236 [2023-11-12 02:28:31,789 INFO L226 Difference]: Without dead ends: 234 [2023-11-12 02:28:31,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2023-11-12 02:28:31,798 INFO L413 NwaCegarLoop]: 121 mSDtfsCounter, 65 mSDsluCounter, 475 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-12 02:28:31,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 596 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-12 02:28:31,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2023-11-12 02:28:31,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 134. [2023-11-12 02:28:31,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 91 states have (on average 1.1978021978021978) internal successors, (109), 91 states have internal predecessors, (109), 39 states have call successors, (39), 3 states have call predecessors, (39), 3 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-11-12 02:28:31,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 187 transitions. [2023-11-12 02:28:31,837 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 187 transitions. Word has length 174 [2023-11-12 02:28:31,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:28:31,838 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 187 transitions. [2023-11-12 02:28:31,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-12 02:28:31,838 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 187 transitions. [2023-11-12 02:28:31,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2023-11-12 02:28:31,841 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:28:31,841 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 26, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:28:31,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:28:31,842 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:28:31,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:28:31,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1107815835, now seen corresponding path program 1 times [2023-11-12 02:28:31,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:28:31,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940915843] [2023-11-12 02:28:31,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:28:31,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:28:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-12 02:28:33,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:28:33,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2023-11-12 02:28:33,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-12 02:28:33,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-12 02:28:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2023-11-12 02:28:33,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2023-11-12 02:28:33,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2023-11-12 02:28:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-12 02:28:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:28:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-12 02:28:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:28:33,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:28:33,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2023-11-12 02:28:33,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-12 02:28:33,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2023-11-12 02:28:33,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2023-11-12 02:28:33,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-12 02:28:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-12 02:28:33,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2023-11-12 02:28:33,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2023-11-12 02:28:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2023-11-12 02:28:33,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-12 02:28:33,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2023-11-12 02:28:33,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-12 02:28:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2023-11-12 02:28:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:28:33,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 1323 trivial. 0 not checked. [2023-11-12 02:28:33,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:28:33,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940915843] [2023-11-12 02:28:33,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940915843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:28:33,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:28:33,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-12 02:28:33,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100769239] [2023-11-12 02:28:33,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:28:33,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-12 02:28:33,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:28:33,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-12 02:28:33,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2023-11-12 02:28:33,532 INFO L87 Difference]: Start difference. First operand 134 states and 187 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-12 02:28:35,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:28:35,043 INFO L93 Difference]: Finished difference Result 230 states and 329 transitions. [2023-11-12 02:28:35,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-12 02:28:35,044 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) Word has length 174 [2023-11-12 02:28:35,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:28:35,045 INFO L225 Difference]: With dead ends: 230 [2023-11-12 02:28:35,045 INFO L226 Difference]: Without dead ends: 0 [2023-11-12 02:28:35,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=179, Invalid=421, Unknown=0, NotChecked=0, Total=600 [2023-11-12 02:28:35,048 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 53 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:28:35,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 634 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:28:35,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-12 02:28:35,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-12 02:28:35,050 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-12 02:28:35,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-12 02:28:35,050 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 174 [2023-11-12 02:28:35,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:28:35,051 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 02:28:35,051 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 1 states have call successors, (13), 1 states have call predecessors, (13), 1 states have return successors, (13), 1 states have call predecessors, (13), 1 states have call successors, (13) [2023-11-12 02:28:35,051 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-12 02:28:35,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-12 02:28:35,054 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-12 02:28:35,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:28:35,056 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-12 02:28:35,143 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 58) no Hoare annotation was computed. [2023-11-12 02:28:35,143 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-12 02:28:35,144 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-11-12 02:28:35,144 INFO L899 garLoopResultBuilder]: For program point L81(lines 60 82) no Hoare annotation was computed. [2023-11-12 02:28:35,144 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-11-12 02:28:35,144 INFO L902 garLoopResultBuilder]: At program point L77(line 77) the Hoare annotation is: true [2023-11-12 02:28:35,144 INFO L902 garLoopResultBuilder]: At program point L77-1(line 77) the Hoare annotation is: true [2023-11-12 02:28:35,145 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 91 102) no Hoare annotation was computed. [2023-11-12 02:28:35,145 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 44) no Hoare annotation was computed. [2023-11-12 02:28:35,145 INFO L899 garLoopResultBuilder]: For program point L40-1(lines 40 44) no Hoare annotation was computed. [2023-11-12 02:28:35,145 INFO L902 garLoopResultBuilder]: At program point L69(line 69) the Hoare annotation is: true [2023-11-12 02:28:35,145 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2023-11-12 02:28:35,146 INFO L899 garLoopResultBuilder]: For program point L69-1(line 69) no Hoare annotation was computed. [2023-11-12 02:28:35,146 INFO L902 garLoopResultBuilder]: At program point L65(line 65) the Hoare annotation is: true [2023-11-12 02:28:35,146 INFO L899 garLoopResultBuilder]: For program point L65-1(line 65) no Hoare annotation was computed. [2023-11-12 02:28:35,146 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-12 02:28:35,146 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-12 02:28:35,146 INFO L902 garLoopResultBuilder]: At program point L94-2(lines 94 100) the Hoare annotation is: true [2023-11-12 02:28:35,146 INFO L899 garLoopResultBuilder]: For program point L94-3(lines 94 100) no Hoare annotation was computed. [2023-11-12 02:28:35,147 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-12 02:28:35,147 INFO L899 garLoopResultBuilder]: For program point L78(line 78) no Hoare annotation was computed. [2023-11-12 02:28:35,147 INFO L899 garLoopResultBuilder]: For program point property_returnLabel#1(lines 87 90) no Hoare annotation was computed. [2023-11-12 02:28:35,147 INFO L902 garLoopResultBuilder]: At program point L74(line 74) the Hoare annotation is: true [2023-11-12 02:28:35,149 INFO L902 garLoopResultBuilder]: At program point L74-1(line 74) the Hoare annotation is: true [2023-11-12 02:28:35,149 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 43) no Hoare annotation was computed. [2023-11-12 02:28:35,150 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-12 02:28:35,150 INFO L902 garLoopResultBuilder]: At program point L62(line 62) the Hoare annotation is: true [2023-11-12 02:28:35,150 INFO L902 garLoopResultBuilder]: At program point L62-1(line 62) the Hoare annotation is: true [2023-11-12 02:28:35,150 INFO L899 garLoopResultBuilder]: For program point L83(lines 83 86) no Hoare annotation was computed. [2023-11-12 02:28:35,150 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 54) no Hoare annotation was computed. [2023-11-12 02:28:35,151 INFO L899 garLoopResultBuilder]: For program point L46-1(lines 46 54) no Hoare annotation was computed. [2023-11-12 02:28:35,151 INFO L899 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2023-11-12 02:28:35,151 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-12 02:28:35,151 INFO L902 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: true [2023-11-12 02:28:35,151 INFO L902 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: true [2023-11-12 02:28:35,151 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 59) no Hoare annotation was computed. [2023-11-12 02:28:35,152 INFO L902 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: true [2023-11-12 02:28:35,152 INFO L899 garLoopResultBuilder]: For program point L67-1(line 67) no Hoare annotation was computed. [2023-11-12 02:28:35,153 INFO L899 garLoopResultBuilder]: For program point L63(line 63) no Hoare annotation was computed. [2023-11-12 02:28:35,153 INFO L902 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: true [2023-11-12 02:28:35,153 INFO L902 garLoopResultBuilder]: At program point L80-1(line 80) the Hoare annotation is: true [2023-11-12 02:28:35,153 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 51) no Hoare annotation was computed. [2023-11-12 02:28:35,153 INFO L899 garLoopResultBuilder]: For program point L72(line 72) no Hoare annotation was computed. [2023-11-12 02:28:35,154 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-11-12 02:28:35,154 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-11-12 02:28:35,154 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-11-12 02:28:35,154 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-11-12 02:28:35,157 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-12 02:28:35,159 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:28:35,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:28:35 BoogieIcfgContainer [2023-11-12 02:28:35,170 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:28:35,170 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:28:35,170 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:28:35,171 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:28:35,171 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:28:20" (3/4) ... [2023-11-12 02:28:35,173 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-12 02:28:35,179 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure assume_abort_if_not [2023-11-12 02:28:35,187 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2023-11-12 02:28:35,187 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-12 02:28:35,188 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-12 02:28:35,188 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 02:28:35,295 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2775c82a-1b14-416d-b08d-cf1b125513b6/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:28:35,296 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2775c82a-1b14-416d-b08d-cf1b125513b6/bin/uautomizer-verify-uTZkv6EMXl/witness.yml [2023-11-12 02:28:35,296 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:28:35,296 INFO L158 Benchmark]: Toolchain (without parser) took 16036.36ms. Allocated memory was 138.4MB in the beginning and 297.8MB in the end (delta: 159.4MB). Free memory was 102.6MB in the beginning and 227.9MB in the end (delta: -125.2MB). Peak memory consumption was 34.6MB. Max. memory is 16.1GB. [2023-11-12 02:28:35,297 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 138.4MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:28:35,297 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.89ms. Allocated memory is still 138.4MB. Free memory was 102.6MB in the beginning and 90.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-12 02:28:35,297 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.60ms. Allocated memory is still 138.4MB. Free memory was 90.1MB in the beginning and 87.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:28:35,298 INFO L158 Benchmark]: Boogie Preprocessor took 37.16ms. Allocated memory is still 138.4MB. Free memory was 87.5MB in the beginning and 85.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:28:35,298 INFO L158 Benchmark]: RCFGBuilder took 522.02ms. Allocated memory is still 138.4MB. Free memory was 85.9MB in the beginning and 70.3MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-12 02:28:35,298 INFO L158 Benchmark]: TraceAbstraction took 14886.08ms. Allocated memory was 138.4MB in the beginning and 297.8MB in the end (delta: 159.4MB). Free memory was 69.8MB in the beginning and 233.1MB in the end (delta: -163.3MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:28:35,299 INFO L158 Benchmark]: Witness Printer took 125.41ms. Allocated memory is still 297.8MB. Free memory was 233.1MB in the beginning and 227.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 02:28:35,302 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.58ms. Allocated memory is still 138.4MB. Free memory is still 107.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.89ms. Allocated memory is still 138.4MB. Free memory was 102.6MB in the beginning and 90.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.60ms. Allocated memory is still 138.4MB. Free memory was 90.1MB in the beginning and 87.5MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.16ms. Allocated memory is still 138.4MB. Free memory was 87.5MB in the beginning and 85.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 522.02ms. Allocated memory is still 138.4MB. Free memory was 85.9MB in the beginning and 70.3MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 14886.08ms. Allocated memory was 138.4MB in the beginning and 297.8MB in the end (delta: 159.4MB). Free memory was 69.8MB in the beginning and 233.1MB in the end (delta: -163.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 125.41ms. Allocated memory is still 297.8MB. Free memory was 233.1MB in the beginning and 227.9MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.8s, OverallIterations: 6, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 406 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 354 mSDsluCounter, 2183 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1605 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 729 IncrementalHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 578 mSDtfsCounter, 729 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 233 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 4.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=4, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 313 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 118 PreInvPairs, 188 NumberOfFragments, 15 HoareAnnotationTreeSize, 118 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 286 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.2s InterpolantComputationTime, 700 NumberOfCodeBlocks, 700 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 694 ConstructedInterpolants, 0 QuantifiedInterpolants, 5419 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 3912/3912 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-11-12 02:28:35,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2775c82a-1b14-416d-b08d-cf1b125513b6/bin/uautomizer-verify-uTZkv6EMXl/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