./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 cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fc5cb4f-a179-415c-a5d2-2894a2286fa2/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fc5cb4f-a179-415c-a5d2-2894a2286fa2/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fc5cb4f-a179-415c-a5d2-2894a2286fa2/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fc5cb4f-a179-415c-a5d2-2894a2286fa2/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fc5cb4f-a179-415c-a5d2-2894a2286fa2/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fc5cb4f-a179-415c-a5d2-2894a2286fa2/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:12:20,317 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:12:20,433 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fc5cb4f-a179-415c-a5d2-2894a2286fa2/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:12:20,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:12:20,441 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:12:20,477 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:12:20,478 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:12:20,479 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:12:20,480 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:12:20,485 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:12:20,487 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:12:20,487 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:12:20,488 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:12:20,490 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:12:20,490 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:12:20,491 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:12:20,491 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:12:20,492 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:12:20,492 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:12:20,493 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:12:20,493 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:12:20,494 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:12:20,494 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:12:20,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:12:20,495 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:12:20,496 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:12:20,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:12:20,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:12:20,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:12:20,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:12:20,499 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:12:20,499 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:12:20,499 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:12:20,500 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:12:20,500 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:12:20,500 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:12:20,501 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:12:20,501 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:12:20,501 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:12:20,501 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_2fc5cb4f-a179-415c-a5d2-2894a2286fa2/bin/uautomizer-verify-uTZkv6EMXl/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fc5cb4f-a179-415c-a5d2-2894a2286fa2/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b5097186312a07da16ab8fdeadf6c0d6b4634620407ae37986153d9e0823e6f5 [2023-11-12 02:12:20,820 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:12:20,852 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:12:20,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:12:20,858 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:12:20,858 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:12:20,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fc5cb4f-a179-415c-a5d2-2894a2286fa2/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2023-11-12 02:12:23,984 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:12:24,237 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:12:24,237 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fc5cb4f-a179-415c-a5d2-2894a2286fa2/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i [2023-11-12 02:12:24,246 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fc5cb4f-a179-415c-a5d2-2894a2286fa2/bin/uautomizer-verify-uTZkv6EMXl/data/22dcd714d/788be50b3e8341a88f83f28572c7b265/FLAG89bde0a22 [2023-11-12 02:12:24,263 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fc5cb4f-a179-415c-a5d2-2894a2286fa2/bin/uautomizer-verify-uTZkv6EMXl/data/22dcd714d/788be50b3e8341a88f83f28572c7b265 [2023-11-12 02:12:24,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:12:24,268 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:12:24,270 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:12:24,270 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:12:24,277 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:12:24,278 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:12:24" (1/1) ... [2023-11-12 02:12:24,279 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@644c2a41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:24, skipping insertion in model container [2023-11-12 02:12:24,279 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:12:24" (1/1) ... [2023-11-12 02:12:24,309 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:12:24,495 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_2fc5cb4f-a179-415c-a5d2-2894a2286fa2/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2023-11-12 02:12:24,521 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:12:24,534 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:12:24,548 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_2fc5cb4f-a179-415c-a5d2-2894a2286fa2/sv-benchmarks/c/loop-invgen/apache-escape-absolute.i[893,906] [2023-11-12 02:12:24,569 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:12:24,586 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:12:24,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:24 WrapperNode [2023-11-12 02:12:24,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:12:24,589 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:12:24,589 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:12:24,589 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:12:24,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:24" (1/1) ... [2023-11-12 02:12:24,615 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:24" (1/1) ... [2023-11-12 02:12:24,654 INFO L138 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 112 [2023-11-12 02:12:24,654 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:12:24,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:12:24,656 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:12:24,656 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:12:24,668 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:24" (1/1) ... [2023-11-12 02:12:24,668 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:24" (1/1) ... [2023-11-12 02:12:24,685 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:24" (1/1) ... [2023-11-12 02:12:24,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:24" (1/1) ... [2023-11-12 02:12:24,689 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:24" (1/1) ... [2023-11-12 02:12:24,694 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:24" (1/1) ... [2023-11-12 02:12:24,696 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:24" (1/1) ... [2023-11-12 02:12:24,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:24" (1/1) ... [2023-11-12 02:12:24,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:12:24,701 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:12:24,701 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:12:24,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:12:24,703 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:24" (1/1) ... [2023-11-12 02:12:24,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:12:24,728 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fc5cb4f-a179-415c-a5d2-2894a2286fa2/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:12:24,742 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fc5cb4f-a179-415c-a5d2-2894a2286fa2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:12:24,746 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fc5cb4f-a179-415c-a5d2-2894a2286fa2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:12:24,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:12:24,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:12:24,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:12:24,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:12:24,787 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-12 02:12:24,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-12 02:12:24,872 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:12:24,876 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:12:25,113 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:12:25,124 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:12:25,124 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-12 02:12:25,126 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:12:25 BoogieIcfgContainer [2023-11-12 02:12:25,126 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:12:25,136 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:12:25,136 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:12:25,141 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:12:25,142 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:12:24" (1/3) ... [2023-11-12 02:12:25,142 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5ef30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:12:25, skipping insertion in model container [2023-11-12 02:12:25,143 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:12:24" (2/3) ... [2023-11-12 02:12:25,144 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f5ef30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:12:25, skipping insertion in model container [2023-11-12 02:12:25,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:12:25" (3/3) ... [2023-11-12 02:12:25,145 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-escape-absolute.i [2023-11-12 02:12:25,181 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:12:25,181 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:12:25,246 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:12:25,253 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7e00450e, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:12:25,254 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:12:25,257 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-12 02:12:25,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-11-12 02:12:25,267 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:25,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:12:25,268 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:12:25,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:25,274 INFO L85 PathProgramCache]: Analyzing trace with hash 92647790, now seen corresponding path program 1 times [2023-11-12 02:12:25,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:25,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846905824] [2023-11-12 02:12:25,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:25,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:25,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:25,691 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-12 02:12:25,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:25,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846905824] [2023-11-12 02:12:25,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846905824] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:25,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:25,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:12:25,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677360524] [2023-11-12 02:12:25,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:25,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-12 02:12:25,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:25,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-12 02:12:25,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-12 02:12:25,755 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-12 02:12:26,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:26,041 INFO L93 Difference]: Finished difference Result 105 states and 200 transitions. [2023-11-12 02:12:26,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-12 02:12:26,045 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-12 02:12:26,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:26,057 INFO L225 Difference]: With dead ends: 105 [2023-11-12 02:12:26,057 INFO L226 Difference]: Without dead ends: 60 [2023-11-12 02:12:26,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:12:26,066 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-12 02:12:26,068 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-12 02:12:26,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-11-12 02:12:26,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2023-11-12 02:12:26,124 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-12 02:12:26,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 76 transitions. [2023-11-12 02:12:26,128 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 76 transitions. Word has length 13 [2023-11-12 02:12:26,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:26,129 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 76 transitions. [2023-11-12 02:12:26,129 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-12 02:12:26,130 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 76 transitions. [2023-11-12 02:12:26,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-12 02:12:26,131 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:26,132 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:12:26,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:12:26,132 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:12:26,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:26,133 INFO L85 PathProgramCache]: Analyzing trace with hash -2083816530, now seen corresponding path program 1 times [2023-11-12 02:12:26,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:26,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719600615] [2023-11-12 02:12:26,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:26,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:26,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-12 02:12:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,385 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-12 02:12:26,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:26,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719600615] [2023-11-12 02:12:26,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719600615] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:26,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:26,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:12:26,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264374209] [2023-11-12 02:12:26,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:26,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:12:26,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:26,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:12:26,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:12:26,399 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-12 02:12:26,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:26,590 INFO L93 Difference]: Finished difference Result 59 states and 81 transitions. [2023-11-12 02:12:26,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:12:26,591 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-12 02:12:26,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:26,596 INFO L225 Difference]: With dead ends: 59 [2023-11-12 02:12:26,596 INFO L226 Difference]: Without dead ends: 57 [2023-11-12 02:12:26,601 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-12 02:12:26,605 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.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:12:26,606 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.1s Time] [2023-11-12 02:12:26,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-12 02:12:26,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-12 02:12:26,627 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-12 02:12:26,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 79 transitions. [2023-11-12 02:12:26,629 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 79 transitions. Word has length 18 [2023-11-12 02:12:26,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:26,630 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 79 transitions. [2023-11-12 02:12:26,630 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-12 02:12:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 79 transitions. [2023-11-12 02:12:26,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-11-12 02:12:26,632 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:26,634 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-12 02:12:26,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:12:26,634 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:12:26,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:26,635 INFO L85 PathProgramCache]: Analyzing trace with hash 323306105, now seen corresponding path program 1 times [2023-11-12 02:12:26,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:26,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398460314] [2023-11-12 02:12:26,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:26,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-12 02:12:26,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-12 02:12:26,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:12:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:12:26,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-12 02:12:26,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2023-11-12 02:12:26,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:26,813 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-12 02:12:26,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:26,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398460314] [2023-11-12 02:12:26,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398460314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:26,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:26,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:12:26,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557311904] [2023-11-12 02:12:26,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:26,817 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:12:26,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:26,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:12:26,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:12:26,823 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-12 02:12:26,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:26,857 INFO L93 Difference]: Finished difference Result 86 states and 119 transitions. [2023-11-12 02:12:26,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:12:26,858 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-12 02:12:26,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:26,859 INFO L225 Difference]: With dead ends: 86 [2023-11-12 02:12:26,860 INFO L226 Difference]: Without dead ends: 57 [2023-11-12 02:12:26,861 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-12 02:12:26,862 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 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-12 02:12:26,862 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-12 02:12:26,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-12 02:12:26,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-12 02:12:26,874 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-12 02:12:26,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 77 transitions. [2023-11-12 02:12:26,876 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 77 transitions. Word has length 47 [2023-11-12 02:12:26,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:26,877 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 77 transitions. [2023-11-12 02:12:26,877 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-12 02:12:26,877 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 77 transitions. [2023-11-12 02:12:26,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-12 02:12:26,880 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:26,880 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-12 02:12:26,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:12:26,881 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:12:26,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:26,881 INFO L85 PathProgramCache]: Analyzing trace with hash -353292279, now seen corresponding path program 1 times [2023-11-12 02:12:26,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:26,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683755013] [2023-11-12 02:12:26,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:26,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:26,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-12 02:12:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-12 02:12:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:12:27,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:12:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-12 02:12:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:12:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,131 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-12 02:12:27,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:27,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683755013] [2023-11-12 02:12:27,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683755013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:27,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:27,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:12:27,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189849948] [2023-11-12 02:12:27,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:27,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:12:27,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:27,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:12:27,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:12:27,136 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-12 02:12:27,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:27,289 INFO L93 Difference]: Finished difference Result 64 states and 83 transitions. [2023-11-12 02:12:27,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:12:27,290 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-12 02:12:27,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:27,292 INFO L225 Difference]: With dead ends: 64 [2023-11-12 02:12:27,292 INFO L226 Difference]: Without dead ends: 62 [2023-11-12 02:12:27,293 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-12 02:12:27,294 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 19 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:12:27,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 153 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:12:27,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2023-11-12 02:12:27,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2023-11-12 02:12:27,317 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-12 02:12:27,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 80 transitions. [2023-11-12 02:12:27,322 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 80 transitions. Word has length 48 [2023-11-12 02:12:27,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:27,324 INFO L495 AbstractCegarLoop]: Abstraction has 61 states and 80 transitions. [2023-11-12 02:12:27,324 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-12 02:12:27,325 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 80 transitions. [2023-11-12 02:12:27,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2023-11-12 02:12:27,334 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:27,334 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-12 02:12:27,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:12:27,335 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:12:27,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:27,336 INFO L85 PathProgramCache]: Analyzing trace with hash 89962133, now seen corresponding path program 1 times [2023-11-12 02:12:27,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:27,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804997132] [2023-11-12 02:12:27,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:27,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:27,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-12 02:12:27,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-12 02:12:27,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:12:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:12:27,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-12 02:12:27,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:12:27,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:12:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:12:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:12:27,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-12 02:12:27,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:12:27,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:12:27,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,567 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-12 02:12:27,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:27,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804997132] [2023-11-12 02:12:27,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804997132] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:27,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:27,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:12:27,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599477755] [2023-11-12 02:12:27,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:27,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:12:27,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:27,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:12:27,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:12:27,571 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-12 02:12:27,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:27,680 INFO L93 Difference]: Finished difference Result 70 states and 88 transitions. [2023-11-12 02:12:27,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:12:27,685 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-12 02:12:27,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:27,689 INFO L225 Difference]: With dead ends: 70 [2023-11-12 02:12:27,689 INFO L226 Difference]: Without dead ends: 68 [2023-11-12 02:12:27,690 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-12 02:12:27,691 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 7 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:12:27,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 265 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:12:27,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2023-11-12 02:12:27,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2023-11-12 02:12:27,727 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-12 02:12:27,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 83 transitions. [2023-11-12 02:12:27,731 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 83 transitions. Word has length 83 [2023-11-12 02:12:27,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:27,733 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 83 transitions. [2023-11-12 02:12:27,733 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-12 02:12:27,733 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 83 transitions. [2023-11-12 02:12:27,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2023-11-12 02:12:27,736 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:12:27,736 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-12 02:12:27,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:12:27,737 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:12:27,737 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:12:27,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1632378009, now seen corresponding path program 1 times [2023-11-12 02:12:27,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:12:27,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005546959] [2023-11-12 02:12:27,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:12:27,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:12:27,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-12 02:12:27,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2023-11-12 02:12:27,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-12 02:12:27,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2023-11-12 02:12:27,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2023-11-12 02:12:27,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2023-11-12 02:12:27,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-12 02:12:27,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2023-11-12 02:12:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-12 02:12:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-12 02:12:27,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2023-11-12 02:12:27,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-12 02:12:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2023-11-12 02:12:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:12:27,997 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-12 02:12:27,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:12:27,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005546959] [2023-11-12 02:12:27,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005546959] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:12:27,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:12:27,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-12 02:12:27,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685565379] [2023-11-12 02:12:27,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:12:28,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-12 02:12:28,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:12:28,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-12 02:12:28,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-12 02:12:28,002 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-12 02:12:28,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:12:28,112 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2023-11-12 02:12:28,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:12:28,113 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-12 02:12:28,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:12:28,116 INFO L225 Difference]: With dead ends: 71 [2023-11-12 02:12:28,117 INFO L226 Difference]: Without dead ends: 0 [2023-11-12 02:12:28,121 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-12 02:12:28,123 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-12 02:12:28,125 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-12 02:12:28,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-11-12 02:12:28,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-11-12 02:12:28,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:12:28,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-11-12 02:12:28,128 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 88 [2023-11-12 02:12:28,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:12:28,128 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-11-12 02:12:28,128 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-12 02:12:28,129 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-11-12 02:12:28,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-11-12 02:12:28,131 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-12 02:12:28,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:12:28,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-11-12 02:12:28,576 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 80) no Hoare annotation was computed. [2023-11-12 02:12:28,577 INFO L899 garLoopResultBuilder]: For program point main_returnLabel#1(lines 24 83) no Hoare annotation was computed. [2023-11-12 02:12:28,577 INFO L899 garLoopResultBuilder]: For program point L69(lines 69 75) no Hoare annotation was computed. [2023-11-12 02:12:28,577 INFO L899 garLoopResultBuilder]: For program point L36(lines 25 83) no Hoare annotation was computed. [2023-11-12 02:12:28,577 INFO L899 garLoopResultBuilder]: For program point L69-1(lines 69 75) no Hoare annotation was computed. [2023-11-12 02:12:28,577 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 79) no Hoare annotation was computed. [2023-11-12 02:12:28,577 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2023-11-12 02:12:28,578 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-12 02:12:28,578 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-12 02:12:28,578 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-12 02:12:28,579 INFO L899 garLoopResultBuilder]: For program point L37(lines 25 83) no Hoare annotation was computed. [2023-11-12 02:12:28,579 INFO L899 garLoopResultBuilder]: For program point L54(lines 44 80) no Hoare annotation was computed. [2023-11-12 02:12:28,579 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-11-12 02:12:28,579 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-12 02:12:28,579 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-12 02:12:28,580 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-12 02:12:28,580 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-12 02:12:28,580 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-12 02:12:28,580 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-12 02:12:28,581 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-12 02:12:28,581 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-12 02:12:28,581 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-12 02:12:28,581 INFO L899 garLoopResultBuilder]: For program point L81(lines 25 83) no Hoare annotation was computed. [2023-11-12 02:12:28,581 INFO L899 garLoopResultBuilder]: For program point L48(line 48) no Hoare annotation was computed. [2023-11-12 02:12:28,582 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-12 02:12:28,582 INFO L899 garLoopResultBuilder]: For program point L32(line 32) no Hoare annotation was computed. [2023-11-12 02:12:28,582 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-12 02:12:28,582 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2023-11-12 02:12:28,582 INFO L899 garLoopResultBuilder]: For program point L57(lines 44 80) no Hoare annotation was computed. [2023-11-12 02:12:28,582 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-12 02:12:28,583 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-12 02:12:28,583 INFO L899 garLoopResultBuilder]: For program point L33(line 33) no Hoare annotation was computed. [2023-11-12 02:12:28,583 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-11-12 02:12:28,583 INFO L899 garLoopResultBuilder]: For program point L50(line 50) no Hoare annotation was computed. [2023-11-12 02:12:28,583 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-12 02:12:28,584 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-12 02:12:28,584 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-12 02:12:28,584 INFO L899 garLoopResultBuilder]: For program point L34(line 34) no Hoare annotation was computed. [2023-11-12 02:12:28,584 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-12 02:12:28,584 INFO L899 garLoopResultBuilder]: For program point L43(line 43) no Hoare annotation was computed. [2023-11-12 02:12:28,585 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-11-12 02:12:28,585 INFO L899 garLoopResultBuilder]: For program point L35(line 35) no Hoare annotation was computed. [2023-11-12 02:12:28,585 INFO L899 garLoopResultBuilder]: For program point L35-1(lines 25 83) no Hoare annotation was computed. [2023-11-12 02:12:28,585 INFO L899 garLoopResultBuilder]: For program point L18-2(lines 17 22) no Hoare annotation was computed. [2023-11-12 02:12:28,585 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 17 22) no Hoare annotation was computed. [2023-11-12 02:12:28,585 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 17 22) the Hoare annotation is: true [2023-11-12 02:12:28,585 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-11-12 02:12:28,586 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-11-12 02:12:28,586 INFO L899 garLoopResultBuilder]: For program point L18(lines 18 20) no Hoare annotation was computed. [2023-11-12 02:12:28,594 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-11-12 02:12:28,596 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-11-12 02:12:28,613 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.11 02:12:28 BoogieIcfgContainer [2023-11-12 02:12:28,613 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-12 02:12:28,614 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-12 02:12:28,614 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-12 02:12:28,614 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-12 02:12:28,615 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:12:25" (3/4) ... [2023-11-12 02:12:28,617 INFO L137 WitnessPrinter]: Generating witness for correct program [2023-11-12 02:12:28,621 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2023-11-12 02:12:28,631 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2023-11-12 02:12:28,632 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2023-11-12 02:12:28,632 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2023-11-12 02:12:28,632 INFO L944 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2023-11-12 02:12:28,771 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fc5cb4f-a179-415c-a5d2-2894a2286fa2/bin/uautomizer-verify-uTZkv6EMXl/witness.graphml [2023-11-12 02:12:28,772 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fc5cb4f-a179-415c-a5d2-2894a2286fa2/bin/uautomizer-verify-uTZkv6EMXl/witness.yml [2023-11-12 02:12:28,772 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-12 02:12:28,773 INFO L158 Benchmark]: Toolchain (without parser) took 4505.20ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 116.5MB in the beginning and 95.2MB in the end (delta: 21.3MB). Peak memory consumption was 56.5MB. Max. memory is 16.1GB. [2023-11-12 02:12:28,773 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 113.2MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:12:28,774 INFO L158 Benchmark]: CACSL2BoogieTranslator took 318.03ms. Allocated memory is still 161.5MB. Free memory was 116.1MB in the beginning and 104.7MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-12 02:12:28,774 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.05ms. Allocated memory is still 161.5MB. Free memory was 104.7MB in the beginning and 103.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-12 02:12:28,775 INFO L158 Benchmark]: Boogie Preprocessor took 44.68ms. Allocated memory is still 161.5MB. Free memory was 103.0MB in the beginning and 101.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-12 02:12:28,775 INFO L158 Benchmark]: RCFGBuilder took 425.66ms. Allocated memory is still 161.5MB. Free memory was 101.8MB in the beginning and 88.8MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-12 02:12:28,776 INFO L158 Benchmark]: TraceAbstraction took 3476.95ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 87.9MB in the beginning and 100.4MB in the end (delta: -12.5MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. [2023-11-12 02:12:28,776 INFO L158 Benchmark]: Witness Printer took 158.67ms. Allocated memory is still 195.0MB. Free memory was 100.4MB in the beginning and 95.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-12 02:12:28,779 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.30ms. Allocated memory is still 113.2MB. Free memory is still 62.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 318.03ms. Allocated memory is still 161.5MB. Free memory was 116.1MB in the beginning and 104.7MB in the end (delta: 11.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.05ms. Allocated memory is still 161.5MB. Free memory was 104.7MB in the beginning and 103.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.68ms. Allocated memory is still 161.5MB. Free memory was 103.0MB in the beginning and 101.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 425.66ms. Allocated memory is still 161.5MB. Free memory was 101.8MB in the beginning and 88.8MB in the end (delta: 12.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 3476.95ms. Allocated memory was 161.5MB in the beginning and 195.0MB in the end (delta: 33.6MB). Free memory was 87.9MB in the beginning and 100.4MB in the end (delta: -12.5MB). Peak memory consumption was 22.9MB. Max. memory is 16.1GB. * Witness Printer took 158.67ms. Allocated memory is still 195.0MB. Free memory was 100.4MB in the beginning and 95.2MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 49 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.4s, OverallIterations: 6, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 115 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 84 mSDsluCounter, 1247 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 883 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 327 IncrementalHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 364 mSDtfsCounter, 327 mSolverCounterSat, 0.1s 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.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 11 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 21 LocationsWithAnnotation, 71 PreInvPairs, 96 NumberOfFragments, 436 HoareAnnotationTreeSize, 71 FomulaSimplifications, 27 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 21 FomulaSimplificationsInter, 222 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s 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: 65]: Loop Invariant Derived loop invariant: (((((c == 0) && ((cp + 1) <= urilen)) && (1 <= cp)) && (0 <= scheme)) || (((((cp + 1) <= urilen) && (1 <= c)) && (1 <= cp)) && (0 <= scheme))) RESULT: Ultimate proved your program to be correct! [2023-11-12 02:12:28,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2fc5cb4f-a179-415c-a5d2-2894a2286fa2/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE