./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2cafbc7-a64a-4d31-bdc6-98fde797c9de/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2cafbc7-a64a-4d31-bdc6-98fde797c9de/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2cafbc7-a64a-4d31-bdc6-98fde797c9de/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2cafbc7-a64a-4d31-bdc6-98fde797c9de/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2cafbc7-a64a-4d31-bdc6-98fde797c9de/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2cafbc7-a64a-4d31-bdc6-98fde797c9de/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:44:51,593 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:44:51,745 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2cafbc7-a64a-4d31-bdc6-98fde797c9de/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:44:51,750 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:44:51,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:44:51,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:44:51,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:44:51,780 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:44:51,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:44:51,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:44:51,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:44:51,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:44:51,784 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:44:51,784 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:44:51,785 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:44:51,786 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:44:51,786 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:44:51,787 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:44:51,787 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:44:51,788 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:44:51,788 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:44:51,789 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:44:51,790 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:44:51,790 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:44:51,791 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:44:51,791 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:44:51,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:44:51,792 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:44:51,792 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:44:51,793 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:44:51,793 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:44:51,794 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:44:51,794 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:44:51,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:44:51,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:44:51,795 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:44:51,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:44:51,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:44:51,796 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:44:51,796 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_b2cafbc7-a64a-4d31-bdc6-98fde797c9de/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2cafbc7-a64a-4d31-bdc6-98fde797c9de/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 [2023-11-06 22:44:52,180 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:44:52,212 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:44:52,216 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:44:52,218 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:44:52,218 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:44:52,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2cafbc7-a64a-4d31-bdc6-98fde797c9de/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2023-11-06 22:44:55,463 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:44:55,757 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:44:55,758 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2cafbc7-a64a-4d31-bdc6-98fde797c9de/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2023-11-06 22:44:55,774 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2cafbc7-a64a-4d31-bdc6-98fde797c9de/bin/uautomizer-verify-WvqO1wxjHP/data/8272c6ada/06936133cd424a8ab7243ee8c8c61e39/FLAGafb58d54a [2023-11-06 22:44:55,793 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2cafbc7-a64a-4d31-bdc6-98fde797c9de/bin/uautomizer-verify-WvqO1wxjHP/data/8272c6ada/06936133cd424a8ab7243ee8c8c61e39 [2023-11-06 22:44:55,800 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:44:55,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:44:55,804 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:44:55,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:44:55,811 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:44:55,814 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:44:55" (1/1) ... [2023-11-06 22:44:55,815 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ac4775 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:55, skipping insertion in model container [2023-11-06 22:44:55,815 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:44:55" (1/1) ... [2023-11-06 22:44:55,848 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:44:56,025 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_b2cafbc7-a64a-4d31-bdc6-98fde797c9de/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2023-11-06 22:44:56,049 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:44:56,062 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:44:56,076 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_b2cafbc7-a64a-4d31-bdc6-98fde797c9de/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2023-11-06 22:44:56,089 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:44:56,106 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:44:56,106 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:56 WrapperNode [2023-11-06 22:44:56,107 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:44:56,108 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:44:56,108 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:44:56,109 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:44:56,117 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:56" (1/1) ... [2023-11-06 22:44:56,141 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:56" (1/1) ... [2023-11-06 22:44:56,174 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 112 [2023-11-06 22:44:56,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:44:56,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:44:56,175 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:44:56,175 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:44:56,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:56" (1/1) ... [2023-11-06 22:44:56,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:56" (1/1) ... [2023-11-06 22:44:56,217 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:56" (1/1) ... [2023-11-06 22:44:56,217 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:56" (1/1) ... [2023-11-06 22:44:56,239 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:56" (1/1) ... [2023-11-06 22:44:56,251 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:56" (1/1) ... [2023-11-06 22:44:56,253 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:56" (1/1) ... [2023-11-06 22:44:56,254 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:56" (1/1) ... [2023-11-06 22:44:56,257 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:44:56,258 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:44:56,259 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:44:56,259 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:44:56,260 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:56" (1/1) ... [2023-11-06 22:44:56,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:44:56,285 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2cafbc7-a64a-4d31-bdc6-98fde797c9de/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:44:56,299 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2cafbc7-a64a-4d31-bdc6-98fde797c9de/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:44:56,322 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2cafbc7-a64a-4d31-bdc6-98fde797c9de/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:44:56,351 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:44:56,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:44:56,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:44:56,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:44:56,352 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-06 22:44:56,352 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-06 22:44:56,433 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:44:56,436 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:44:56,650 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:44:56,657 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:44:56,658 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:44:56,660 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:44:56 BoogieIcfgContainer [2023-11-06 22:44:56,660 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:44:56,663 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:44:56,663 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:44:56,666 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:44:56,667 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:44:55" (1/3) ... [2023-11-06 22:44:56,667 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34445095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:44:56, skipping insertion in model container [2023-11-06 22:44:56,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:44:56" (2/3) ... [2023-11-06 22:44:56,668 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34445095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:44:56, skipping insertion in model container [2023-11-06 22:44:56,668 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:44:56" (3/3) ... [2023-11-06 22:44:56,669 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2023-11-06 22:44:56,691 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:44:56,692 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:44:56,762 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:44:56,770 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@120bcd69, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:44:56,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-06 22:44:56,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 49 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 32 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-11-06 22:44:56,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-06 22:44:56,784 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:44:56,785 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:44:56,786 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:44:56,792 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:56,792 INFO L85 PathProgramCache]: Analyzing trace with hash 92647790, now seen corresponding path program 1 times [2023-11-06 22:44:56,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:56,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376127320] [2023-11-06 22:44:56,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:56,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:56,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:44:57,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:57,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376127320] [2023-11-06 22:44:57,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376127320] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:57,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:57,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:44:57,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687341095] [2023-11-06 22:44:57,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:57,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:44:57,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:57,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:44:57,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:44:57,310 INFO L87 Difference]: Start difference. First operand has 49 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 32 states have internal predecessors, (47), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:44:57,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:44:57,516 INFO L93 Difference]: Finished difference Result 105 states and 200 transitions. [2023-11-06 22:44:57,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:44:57,521 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2023-11-06 22:44:57,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:44:57,535 INFO L225 Difference]: With dead ends: 105 [2023-11-06 22:44:57,536 INFO L226 Difference]: Without dead ends: 60 [2023-11-06 22:44:57,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:44:57,544 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 17 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:44:57,547 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 241 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:44:57,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-06 22:44:57,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2023-11-06 22:44:57,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.2) internal successors, (36), 34 states have internal predecessors, (36), 20 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:44:57,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2023-11-06 22:44:57,636 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 13 [2023-11-06 22:44:57,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:44:57,639 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2023-11-06 22:44:57,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:44:57,640 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2023-11-06 22:44:57,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-06 22:44:57,643 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:44:57,644 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:44:57,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:44:57,645 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:44:57,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:57,647 INFO L85 PathProgramCache]: Analyzing trace with hash -2083816530, now seen corresponding path program 1 times [2023-11-06 22:44:57,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:57,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973308427] [2023-11-06 22:44:57,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:57,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:57,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:44:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:57,922 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:44:57,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:57,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973308427] [2023-11-06 22:44:57,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973308427] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:57,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:57,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:44:57,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10822830] [2023-11-06 22:44:57,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:57,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:44:57,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:57,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:44:57,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:44:57,940 INFO L87 Difference]: Start difference. First operand 53 states and 76 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:44:58,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:44:58,199 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2023-11-06 22:44:58,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:44:58,200 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2023-11-06 22:44:58,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:44:58,206 INFO L225 Difference]: With dead ends: 59 [2023-11-06 22:44:58,206 INFO L226 Difference]: Without dead ends: 57 [2023-11-06 22:44:58,212 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:44:58,216 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 31 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-06 22:44:58,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 185 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-06 22:44:58,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-06 22:44:58,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-06 22:44:58,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 37 states have internal predecessors, (39), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:44:58,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2023-11-06 22:44:58,255 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 18 [2023-11-06 22:44:58,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:44:58,255 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2023-11-06 22:44:58,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-11-06 22:44:58,256 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2023-11-06 22:44:58,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-06 22:44:58,260 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:44:58,261 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:44:58,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:44:58,262 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:44:58,263 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:58,264 INFO L85 PathProgramCache]: Analyzing trace with hash 323306105, now seen corresponding path program 1 times [2023-11-06 22:44:58,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:58,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351640122] [2023-11-06 22:44:58,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:58,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:58,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:44:58,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:58,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:44:58,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:58,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:44:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:58,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:44:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:58,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-06 22:44:58,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:58,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-06 22:44:58,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:58,415 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-06 22:44:58,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:58,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351640122] [2023-11-06 22:44:58,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351640122] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:58,417 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:58,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:44:58,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778023383] [2023-11-06 22:44:58,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:58,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:44:58,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:58,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:44:58,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:44:58,421 INFO L87 Difference]: Start difference. First operand 57 states and 79 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:44:58,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:44:58,456 INFO L93 Difference]: Finished difference Result 86 states and 119 transitions. [2023-11-06 22:44:58,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:44:58,456 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 47 [2023-11-06 22:44:58,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:44:58,461 INFO L225 Difference]: With dead ends: 86 [2023-11-06 22:44:58,461 INFO L226 Difference]: Without dead ends: 57 [2023-11-06 22:44:58,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:44:58,469 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-06 22:44:58,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-06 22:44:58,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-06 22:44:58,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-06 22:44:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 33 states have (on average 1.121212121212121) internal successors, (37), 37 states have internal predecessors, (37), 20 states have call successors, (20), 3 states have call predecessors, (20), 3 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:44:58,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2023-11-06 22:44:58,500 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 47 [2023-11-06 22:44:58,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:44:58,501 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2023-11-06 22:44:58,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:44:58,501 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2023-11-06 22:44:58,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-06 22:44:58,506 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:44:58,506 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:44:58,506 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:44:58,507 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:44:58,508 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:58,509 INFO L85 PathProgramCache]: Analyzing trace with hash -353292279, now seen corresponding path program 1 times [2023-11-06 22:44:58,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:58,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870190548] [2023-11-06 22:44:58,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:58,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:58,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:58,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:44:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:58,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:44:58,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:58,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:44:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:58,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:44:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:58,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:44:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:58,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:44:58,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:58,888 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-11-06 22:44:58,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:58,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870190548] [2023-11-06 22:44:58,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870190548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:58,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:58,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:44:58,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563885329] [2023-11-06 22:44:58,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:58,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:44:58,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:58,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:44:58,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:44:58,892 INFO L87 Difference]: Start difference. First operand 57 states and 77 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:44:59,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:44:59,076 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2023-11-06 22:44:59,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:44:59,078 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 48 [2023-11-06 22:44:59,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:44:59,082 INFO L225 Difference]: With dead ends: 64 [2023-11-06 22:44:59,082 INFO L226 Difference]: Without dead ends: 62 [2023-11-06 22:44:59,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:44:59,091 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 12 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:44:59,093 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 179 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:44:59,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-06 22:44:59,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2023-11-06 22:44:59,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 40 states have internal predecessors, (40), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:44:59,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2023-11-06 22:44:59,125 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 48 [2023-11-06 22:44:59,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:44:59,128 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2023-11-06 22:44:59,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 2 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-11-06 22:44:59,129 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2023-11-06 22:44:59,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-06 22:44:59,136 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:44:59,137 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:44:59,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:44:59,138 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:44:59,138 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:59,138 INFO L85 PathProgramCache]: Analyzing trace with hash 89962133, now seen corresponding path program 1 times [2023-11-06 22:44:59,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:59,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997886907] [2023-11-06 22:44:59,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:59,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:59,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:44:59,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:44:59,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:44:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:44:59,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:44:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:44:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:44:59,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:44:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:44:59,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 22:44:59,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:44:59,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:44:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,380 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2023-11-06 22:44:59,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:59,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997886907] [2023-11-06 22:44:59,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997886907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:59,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:59,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:44:59,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701420658] [2023-11-06 22:44:59,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:59,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:44:59,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:59,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:44:59,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:44:59,384 INFO L87 Difference]: Start difference. First operand 61 states and 80 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:44:59,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:44:59,484 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2023-11-06 22:44:59,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:44:59,485 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2023-11-06 22:44:59,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:44:59,486 INFO L225 Difference]: With dead ends: 70 [2023-11-06 22:44:59,487 INFO L226 Difference]: Without dead ends: 68 [2023-11-06 22:44:59,487 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:44:59,488 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 9 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:44:59,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 215 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:44:59,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-06 22:44:59,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2023-11-06 22:44:59,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 43 states have internal predecessors, (43), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-06 22:44:59,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2023-11-06 22:44:59,505 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 83 [2023-11-06 22:44:59,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:44:59,506 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2023-11-06 22:44:59,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2023-11-06 22:44:59,506 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2023-11-06 22:44:59,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-06 22:44:59,508 INFO L187 NwaCegarLoop]: Found error trace [2023-11-06 22:44:59,508 INFO L195 NwaCegarLoop]: trace histogram [14, 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-06 22:44:59,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:44:59,509 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-06 22:44:59,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:44:59,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1632378009, now seen corresponding path program 1 times [2023-11-06 22:44:59,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:44:59,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911980187] [2023-11-06 22:44:59,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:44:59,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:44:59,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-06 22:44:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-06 22:44:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-06 22:44:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-06 22:44:59,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-06 22:44:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-06 22:44:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-06 22:44:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-06 22:44:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-06 22:44:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-06 22:44:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-06 22:44:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-06 22:44:59,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-06 22:44:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:44:59,716 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-11-06 22:44:59,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:44:59,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911980187] [2023-11-06 22:44:59,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911980187] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:44:59,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:44:59,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-06 22:44:59,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906924434] [2023-11-06 22:44:59,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:44:59,718 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:44:59,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:44:59,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:44:59,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:44:59,720 INFO L87 Difference]: Start difference. First operand 65 states and 83 transitions. Second operand has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-06 22:44:59,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-06 22:44:59,815 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2023-11-06 22:44:59,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:44:59,815 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 88 [2023-11-06 22:44:59,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-06 22:44:59,816 INFO L225 Difference]: With dead ends: 71 [2023-11-06 22:44:59,817 INFO L226 Difference]: Without dead ends: 0 [2023-11-06 22:44:59,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:44:59,818 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 10 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-06 22:44:59,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 281 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-06 22:44:59,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-06 22:44:59,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-06 22:44:59,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:44:59,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-06 22:44:59,821 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2023-11-06 22:44:59,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-06 22:44:59,821 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-06 22:44:59,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 3 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2023-11-06 22:44:59,821 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-06 22:44:59,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-06 22:44:59,824 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-06 22:44:59,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:44:59,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-06 22:45:00,238 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 80) no Hoare annotation was computed. [2023-11-06 22:45:00,238 INFO L902 garLoopResultBuilder]: At program point main_returnLabel#1(lines 24 83) the Hoare annotation is: true [2023-11-06 22:45:00,238 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2023-11-06 22:45:00,238 INFO L899 garLoopResultBuilder]: For program point L36(lines 25 83) no Hoare annotation was computed. [2023-11-06 22:45:00,238 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 69 75) no Hoare annotation was computed. [2023-11-06 22:45:00,239 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 79) no Hoare annotation was computed. [2023-11-06 22:45:00,239 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-06 22:45:00,239 INFO L895 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) [2023-11-06 22:45:00,239 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) [2023-11-06 22:45:00,239 INFO L895 garLoopResultBuilder]: At program point L45-1(line 45) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) [2023-11-06 22:45:00,240 INFO L899 garLoopResultBuilder]: For program point L37(lines 25 83) no Hoare annotation was computed. [2023-11-06 22:45:00,240 INFO L899 garLoopResultBuilder]: For program point L54(lines 44 80) no Hoare annotation was computed. [2023-11-06 22:45:00,240 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-06 22:45:00,240 INFO L895 garLoopResultBuilder]: At program point L71(line 71) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (and (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~tokenlen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)))) [2023-11-06 22:45:00,240 INFO L895 garLoopResultBuilder]: At program point L71-1(line 71) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (and (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~tokenlen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)))) [2023-11-06 22:45:00,241 INFO L895 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (and (= |ULTIMATE.start_main_~c~0#1| 0) (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)))) [2023-11-06 22:45:00,241 INFO L895 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (and (= |ULTIMATE.start_main_~c~0#1| 0) (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)))) [2023-11-06 22:45:00,241 INFO L895 garLoopResultBuilder]: At program point L47-1(lines 47 52) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) [2023-11-06 22:45:00,241 INFO L895 garLoopResultBuilder]: At program point L47-2(lines 47 52) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) [2023-11-06 22:45:00,241 INFO L895 garLoopResultBuilder]: At program point L72(line 72) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (and (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~tokenlen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)))) [2023-11-06 22:45:00,242 INFO L895 garLoopResultBuilder]: At program point L56(line 56) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (and (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)))) [2023-11-06 22:45:00,242 INFO L895 garLoopResultBuilder]: At program point L56-1(line 56) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (and (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)))) [2023-11-06 22:45:00,242 INFO L902 garLoopResultBuilder]: At program point L81(lines 25 83) the Hoare annotation is: true [2023-11-06 22:45:00,242 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-11-06 22:45:00,242 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (and (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~c~0#1|) (<= (+ |ULTIMATE.start_main_~c~0#1| 1) |ULTIMATE.start_main_~tokenlen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)))) [2023-11-06 22:45:00,242 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2023-11-06 22:45:00,243 INFO L895 garLoopResultBuilder]: At program point L65-1(lines 65 77) the Hoare annotation is: (let ((.cse0 (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|)) (.cse1 (<= 1 |ULTIMATE.start_main_~cp~0#1|)) (.cse2 (<= 0 |ULTIMATE.start_main_~scheme~0#1|))) (or (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 .cse1 .cse2) (and .cse0 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2))) [2023-11-06 22:45:00,243 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-06 22:45:00,243 INFO L899 garLoopResultBuilder]: For program point L57(lines 44 80) no Hoare annotation was computed. [2023-11-06 22:45:00,243 INFO L895 garLoopResultBuilder]: At program point L49(line 49) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (and (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)))) [2023-11-06 22:45:00,243 INFO L895 garLoopResultBuilder]: At program point L49-1(line 49) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (and (<= .cse0 |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|) (not (= .cse0 |ULTIMATE.start_main_~urilen~0#1|)))) [2023-11-06 22:45:00,243 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2023-11-06 22:45:00,244 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-06 22:45:00,244 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-11-06 22:45:00,244 INFO L895 garLoopResultBuilder]: At program point L42(line 42) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) [2023-11-06 22:45:00,244 INFO L895 garLoopResultBuilder]: At program point L42-1(line 42) the Hoare annotation is: (and (<= (+ |ULTIMATE.start_main_~cp~0#1| 1) |ULTIMATE.start_main_~urilen~0#1|) (<= 1 |ULTIMATE.start_main_~cp~0#1|) (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) [2023-11-06 22:45:00,244 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (let ((.cse0 (<= .cse4 |ULTIMATE.start_main_~urilen~0#1|)) (.cse1 (<= 1 |ULTIMATE.start_main_~cp~0#1|)) (.cse2 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse3 (not (= .cse4 |ULTIMATE.start_main_~urilen~0#1|)))) (or (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 (<= 2 |ULTIMATE.start_main_~tokenlen~0#1|) .cse1 .cse2 .cse3) (and .cse0 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2 (<= (+ 2 |ULTIMATE.start_main_~c~0#1|) |ULTIMATE.start_main_~tokenlen~0#1|) .cse3)))) [2023-11-06 22:45:00,244 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2023-11-06 22:45:00,246 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (let ((.cse4 (+ |ULTIMATE.start_main_~cp~0#1| 1))) (let ((.cse0 (<= .cse4 |ULTIMATE.start_main_~urilen~0#1|)) (.cse1 (<= 1 |ULTIMATE.start_main_~cp~0#1|)) (.cse2 (<= 0 |ULTIMATE.start_main_~scheme~0#1|)) (.cse3 (not (= .cse4 |ULTIMATE.start_main_~urilen~0#1|)))) (or (and (= |ULTIMATE.start_main_~c~0#1| 0) .cse0 (<= 2 |ULTIMATE.start_main_~tokenlen~0#1|) .cse1 .cse2 .cse3) (and .cse0 (<= 1 |ULTIMATE.start_main_~c~0#1|) .cse1 .cse2 (<= (+ 2 |ULTIMATE.start_main_~c~0#1|) |ULTIMATE.start_main_~tokenlen~0#1|) .cse3)))) [2023-11-06 22:45:00,246 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2023-11-06 22:45:00,246 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-11-06 22:45:00,247 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2023-11-06 22:45:00,247 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 25 83) no Hoare annotation was computed. [2023-11-06 22:45:00,247 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2023-11-06 22:45:00,247 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2023-11-06 22:45:00,247 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 22) the Hoare annotation is: true [2023-11-06 22:45:00,248 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-06 22:45:00,248 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-06 22:45:00,248 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2023-11-06 22:45:00,252 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-06 22:45:00,254 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 22:45:00,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:45:00 BoogieIcfgContainer [2023-11-06 22:45:00,268 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 22:45:00,269 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 22:45:00,269 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 22:45:00,269 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 22:45:00,270 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:44:56" (3/4) ... [2023-11-06 22:45:00,272 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-06 22:45:00,278 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-06 22:45:00,284 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-11-06 22:45:00,284 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-06 22:45:00,285 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-06 22:45:00,285 INFO L939 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-06 22:45:00,360 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2cafbc7-a64a-4d31-bdc6-98fde797c9de/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 22:45:00,361 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2cafbc7-a64a-4d31-bdc6-98fde797c9de/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.yaml [2023-11-06 22:45:00,361 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 22:45:00,362 INFO L158 Benchmark]: Toolchain (without parser) took 4559.32ms. Allocated memory is still 178.3MB. Free memory was 147.2MB in the beginning and 103.8MB in the end (delta: 43.4MB). Peak memory consumption was 43.3MB. Max. memory is 16.1GB. [2023-11-06 22:45:00,362 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 125.8MB. Free memory is still 97.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:45:00,362 INFO L158 Benchmark]: CACSL2BoogieTranslator took 303.28ms. Allocated memory is still 178.3MB. Free memory was 146.1MB in the beginning and 135.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:45:00,363 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.08ms. Allocated memory is still 178.3MB. Free memory was 135.6MB in the beginning and 148.8MB in the end (delta: -13.2MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. [2023-11-06 22:45:00,363 INFO L158 Benchmark]: Boogie Preprocessor took 82.48ms. Allocated memory is still 178.3MB. Free memory was 148.8MB in the beginning and 147.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 22:45:00,364 INFO L158 Benchmark]: RCFGBuilder took 401.88ms. Allocated memory is still 178.3MB. Free memory was 147.7MB in the beginning and 134.1MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-06 22:45:00,364 INFO L158 Benchmark]: TraceAbstraction took 3605.50ms. Allocated memory is still 178.3MB. Free memory was 133.0MB in the beginning and 108.0MB in the end (delta: 25.0MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. [2023-11-06 22:45:00,365 INFO L158 Benchmark]: Witness Printer took 92.38ms. Allocated memory is still 178.3MB. Free memory was 108.0MB in the beginning and 103.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 22:45:00,367 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.39ms. Allocated memory is still 125.8MB. Free memory is still 97.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 303.28ms. Allocated memory is still 178.3MB. Free memory was 146.1MB in the beginning and 135.6MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.08ms. Allocated memory is still 178.3MB. Free memory was 135.6MB in the beginning and 148.8MB in the end (delta: -13.2MB). Peak memory consumption was 2.7MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.48ms. Allocated memory is still 178.3MB. Free memory was 148.8MB in the beginning and 147.7MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 401.88ms. Allocated memory is still 178.3MB. Free memory was 147.7MB in the beginning and 134.1MB in the end (delta: 13.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3605.50ms. Allocated memory is still 178.3MB. Free memory was 133.0MB in the beginning and 108.0MB in the end (delta: 25.0MB). Peak memory consumption was 25.9MB. Max. memory is 16.1GB. * Witness Printer took 92.38ms. Allocated memory is still 178.3MB. Free memory was 108.0MB in the beginning and 103.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 110 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 79 mSDsluCounter, 1220 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 858 mSDsCounter, 69 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 326 IncrementalHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 69 mSolverCounterUnsat, 362 mSDtfsCounter, 326 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65occurred in iteration=5, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 73 PreInvPairs, 102 NumberOfFragments, 438 HoareAnnotationTreeSize, 73 FomulaSimplifications, 27 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 222 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 452 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 772/772 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: 47]: Loop Invariant Derived loop invariant: ((((cp + 1) <= urilen) && (1 <= cp)) && (0 <= scheme)) - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: (((((c == 0) && ((cp + 1) <= urilen)) && (1 <= cp)) && (0 <= scheme)) || (((((cp + 1) <= urilen) && (1 <= c)) && (1 <= cp)) && (0 <= scheme))) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2023-11-06 22:45:00,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_b2cafbc7-a64a-4d31-bdc6-98fde797c9de/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE