./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --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 36da946a83103a61b88f0f1db9af94484aad5eefbde5313f974f53b267bd14bf --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:11:39,585 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:11:39,655 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:11:39,661 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:11:39,662 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:11:39,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:11:39,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:11:39,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:11:39,692 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:11:39,694 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:11:39,696 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:11:39,697 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:11:39,697 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:11:39,697 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:11:39,698 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:11:39,698 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:11:39,698 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:11:39,698 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:11:39,699 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:11:39,699 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:11:39,699 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:11:39,702 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:11:39,702 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:11:39,702 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:11:39,703 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:11:39,703 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:11:39,703 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:11:39,703 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:11:39,704 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:11:39,704 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:11:39,704 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:11:39,704 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:11:39,705 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:11:39,705 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:11:39,705 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:11:39,705 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:11:39,706 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:11:39,706 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:11:39,706 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:11:39,706 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:11:39,707 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:11:39,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:11:39,708 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:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux 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 -> 36da946a83103a61b88f0f1db9af94484aad5eefbde5313f974f53b267bd14bf [2024-10-11 02:11:39,951 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:11:39,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:11:39,979 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:11:39,980 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:11:39,981 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:11:39,982 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c [2024-10-11 02:11:41,339 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:11:41,547 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:11:41,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c [2024-10-11 02:11:41,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e05231648/0ee9029cb09645278203eae7da6c7fa3/FLAG49bc662e8 [2024-10-11 02:11:41,572 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e05231648/0ee9029cb09645278203eae7da6c7fa3 [2024-10-11 02:11:41,574 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:11:41,576 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:11:41,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:11:41,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:11:41,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:11:41,585 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:11:41" (1/1) ... [2024-10-11 02:11:41,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2add961e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:41, skipping insertion in model container [2024-10-11 02:11:41,586 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:11:41" (1/1) ... [2024-10-11 02:11:41,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:11:41,793 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c[524,537] [2024-10-11 02:11:41,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:11:41,824 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:11:41,836 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound100.c[524,537] [2024-10-11 02:11:41,848 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:11:41,866 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:11:41,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:41 WrapperNode [2024-10-11 02:11:41,867 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:11:41,868 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:11:41,868 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:11:41,868 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:11:41,875 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:41" (1/1) ... [2024-10-11 02:11:41,881 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:41" (1/1) ... [2024-10-11 02:11:41,900 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2024-10-11 02:11:41,901 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:11:41,902 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:11:41,902 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:11:41,902 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:11:41,913 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:41" (1/1) ... [2024-10-11 02:11:41,913 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:41" (1/1) ... [2024-10-11 02:11:41,915 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:41" (1/1) ... [2024-10-11 02:11:41,926 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 02:11:41,927 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:41" (1/1) ... [2024-10-11 02:11:41,928 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:41" (1/1) ... [2024-10-11 02:11:41,932 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:41" (1/1) ... [2024-10-11 02:11:41,937 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:41" (1/1) ... [2024-10-11 02:11:41,937 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:41" (1/1) ... [2024-10-11 02:11:41,939 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:41" (1/1) ... [2024-10-11 02:11:41,944 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:11:41,945 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:11:41,945 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:11:41,945 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:11:41,946 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:41" (1/1) ... [2024-10-11 02:11:41,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:11:41,962 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:41,977 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:11:41,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:11:42,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:11:42,015 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 02:11:42,016 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 02:11:42,016 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:11:42,016 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:11:42,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:11:42,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 02:11:42,017 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 02:11:42,072 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:11:42,074 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:11:42,197 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-11 02:11:42,197 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:11:42,225 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:11:42,226 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:11:42,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:11:42 BoogieIcfgContainer [2024-10-11 02:11:42,226 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:11:42,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:11:42,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:11:42,234 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:11:42,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:11:41" (1/3) ... [2024-10-11 02:11:42,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78360738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:11:42, skipping insertion in model container [2024-10-11 02:11:42,235 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:11:41" (2/3) ... [2024-10-11 02:11:42,236 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78360738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:11:42, skipping insertion in model container [2024-10-11 02:11:42,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:11:42" (3/3) ... [2024-10-11 02:11:42,237 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound100.c [2024-10-11 02:11:42,253 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:11:42,253 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:11:42,309 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:11:42,316 INFO L333 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, 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;@426cdd73, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:11:42,317 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:11:42,320 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 02:11:42,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-11 02:11:42,325 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:42,325 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:42,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:42,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:42,330 INFO L85 PathProgramCache]: Analyzing trace with hash -1060579028, now seen corresponding path program 1 times [2024-10-11 02:11:42,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:42,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595987836] [2024-10-11 02:11:42,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:42,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:42,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:42,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:42,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:42,491 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:42,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:42,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595987836] [2024-10-11 02:11:42,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595987836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:11:42,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:11:42,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 02:11:42,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857950776] [2024-10-11 02:11:42,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:11:42,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:11:42,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:42,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:11:42,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 02:11:42,525 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:11:42,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:42,544 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2024-10-11 02:11:42,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:11:42,546 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-10-11 02:11:42,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:42,551 INFO L225 Difference]: With dead ends: 42 [2024-10-11 02:11:42,551 INFO L226 Difference]: Without dead ends: 20 [2024-10-11 02:11:42,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 02:11:42,556 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:42,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:11:42,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-11 02:11:42,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-11 02:11:42,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 02:11:42,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-11 02:11:42,582 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 17 [2024-10-11 02:11:42,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:42,583 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-11 02:11:42,583 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-10-11 02:11:42,583 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-11 02:11:42,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 02:11:42,584 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:42,584 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:42,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 02:11:42,585 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:42,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:42,586 INFO L85 PathProgramCache]: Analyzing trace with hash -778881514, now seen corresponding path program 1 times [2024-10-11 02:11:42,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:42,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129481161] [2024-10-11 02:11:42,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:42,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:42,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:42,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:42,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:42,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:42,794 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:42,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:42,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129481161] [2024-10-11 02:11:42,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129481161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:11:42,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:11:42,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 02:11:42,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32502942] [2024-10-11 02:11:42,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:11:42,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 02:11:42,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:42,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 02:11:42,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:11:42,798 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 02:11:42,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:42,822 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-10-11 02:11:42,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 02:11:42,822 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-11 02:11:42,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:42,823 INFO L225 Difference]: With dead ends: 29 [2024-10-11 02:11:42,823 INFO L226 Difference]: Without dead ends: 22 [2024-10-11 02:11:42,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 02:11:42,826 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:42,827 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 54 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:11:42,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-11 02:11:42,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-11 02:11:42,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 02:11:42,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-10-11 02:11:42,833 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 18 [2024-10-11 02:11:42,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:42,834 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-11 02:11:42,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 02:11:42,834 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-10-11 02:11:42,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 02:11:42,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:42,835 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:42,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 02:11:42,836 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:42,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:42,836 INFO L85 PathProgramCache]: Analyzing trace with hash -777094054, now seen corresponding path program 1 times [2024-10-11 02:11:42,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:42,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806642848] [2024-10-11 02:11:42,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:42,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:42,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:11:42,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [307332409] [2024-10-11 02:11:42,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:42,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:42,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:42,903 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:42,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:11:42,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:42,992 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 02:11:43,002 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:43,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:43,294 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:11:43,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:43,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806642848] [2024-10-11 02:11:43,296 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-11 02:11:43,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307332409] [2024-10-11 02:11:43,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307332409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:11:43,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:11:43,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 02:11:43,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119005352] [2024-10-11 02:11:43,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:11:43,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:11:43,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:43,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:11:43,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 02:11:43,302 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 02:11:44,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-11 02:11:44,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:44,519 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-10-11 02:11:44,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:11:44,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2024-10-11 02:11:44,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:44,521 INFO L225 Difference]: With dead ends: 34 [2024-10-11 02:11:44,521 INFO L226 Difference]: Without dead ends: 32 [2024-10-11 02:11:44,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 02:11:44,523 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 5 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:44,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 68 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 02:11:44,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-11 02:11:44,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-10-11 02:11:44,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-10-11 02:11:44,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-10-11 02:11:44,534 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 18 [2024-10-11 02:11:44,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:44,535 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-10-11 02:11:44,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 02:11:44,535 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-10-11 02:11:44,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 02:11:44,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:44,536 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:44,554 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:11:44,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:44,738 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:44,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:44,739 INFO L85 PathProgramCache]: Analyzing trace with hash -331201790, now seen corresponding path program 1 times [2024-10-11 02:11:44,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:44,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756769444] [2024-10-11 02:11:44,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:44,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:44,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:45,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:45,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:45,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:45,062 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:45,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:45,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756769444] [2024-10-11 02:11:45,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756769444] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:45,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2003375787] [2024-10-11 02:11:45,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:45,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:45,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:45,067 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:45,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:11:45,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:45,118 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-11 02:11:45,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:45,191 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:45,191 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:45,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:45,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2003375787] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:45,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:45,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2024-10-11 02:11:45,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487947548] [2024-10-11 02:11:45,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:45,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:11:45,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:45,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:11:45,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:11:45,335 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 02:11:45,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:45,443 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-10-11 02:11:45,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 02:11:45,444 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) Word has length 24 [2024-10-11 02:11:45,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:45,445 INFO L225 Difference]: With dead ends: 38 [2024-10-11 02:11:45,446 INFO L226 Difference]: Without dead ends: 33 [2024-10-11 02:11:45,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-10-11 02:11:45,448 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 12 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:45,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 113 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:11:45,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-11 02:11:45,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2024-10-11 02:11:45,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 02:11:45,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-10-11 02:11:45,463 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 24 [2024-10-11 02:11:45,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:45,464 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-10-11 02:11:45,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.8181818181818181) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 1 states have call successors, (5) [2024-10-11 02:11:45,464 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-10-11 02:11:45,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 02:11:45,465 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:45,465 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:45,487 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:11:45,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:45,666 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:45,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:45,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1584280999, now seen corresponding path program 1 times [2024-10-11 02:11:45,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:45,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929411802] [2024-10-11 02:11:45,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:45,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:45,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:45,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:45,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:45,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:45,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:45,855 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:45,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:45,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929411802] [2024-10-11 02:11:45,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929411802] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:45,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179782824] [2024-10-11 02:11:45,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:45,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:45,856 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:45,858 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:45,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:11:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:45,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 02:11:45,907 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:45,954 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:45,956 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:46,009 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:46,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179782824] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:46,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:46,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2024-10-11 02:11:46,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083414063] [2024-10-11 02:11:46,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:46,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 02:11:46,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:46,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 02:11:46,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:11:46,016 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-11 02:11:46,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:46,090 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2024-10-11 02:11:46,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 02:11:46,091 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) Word has length 27 [2024-10-11 02:11:46,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:46,092 INFO L225 Difference]: With dead ends: 56 [2024-10-11 02:11:46,092 INFO L226 Difference]: Without dead ends: 51 [2024-10-11 02:11:46,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:11:46,093 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 20 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:46,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 100 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:11:46,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-11 02:11:46,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-11 02:11:46,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-11 02:11:46,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-10-11 02:11:46,109 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 27 [2024-10-11 02:11:46,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:46,109 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-10-11 02:11:46,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 6 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 5 states have call predecessors, (9), 5 states have call successors, (9) [2024-10-11 02:11:46,110 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-10-11 02:11:46,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-11 02:11:46,111 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:46,111 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:46,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 02:11:46,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:46,316 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:46,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:46,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1262136106, now seen corresponding path program 2 times [2024-10-11 02:11:46,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:46,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501268465] [2024-10-11 02:11:46,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:46,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:46,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:46,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:46,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:46,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:46,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:46,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:11:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:46,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:11:46,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:46,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:11:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:11:46,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:46,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501268465] [2024-10-11 02:11:46,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501268465] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:46,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [354869069] [2024-10-11 02:11:46,506 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 02:11:46,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:46,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:46,509 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:46,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 02:11:46,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 02:11:46,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 02:11:46,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-11 02:11:46,571 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:46,651 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:46,651 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:46,800 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:11:46,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [354869069] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:46,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:46,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 16 [2024-10-11 02:11:46,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857852843] [2024-10-11 02:11:46,801 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:46,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 02:11:46,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:46,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 02:11:46,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:11:46,803 INFO L87 Difference]: Start difference. First operand 51 states and 56 transitions. Second operand has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-11 02:11:47,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:47,049 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2024-10-11 02:11:47,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-11 02:11:47,051 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) Word has length 54 [2024-10-11 02:11:47,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:47,053 INFO L225 Difference]: With dead ends: 110 [2024-10-11 02:11:47,054 INFO L226 Difference]: Without dead ends: 105 [2024-10-11 02:11:47,055 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=356, Unknown=0, NotChecked=0, Total=552 [2024-10-11 02:11:47,056 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 80 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:47,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 111 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:11:47,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-11 02:11:47,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-11 02:11:47,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.1375) internal successors, (91), 80 states have internal predecessors, (91), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 02:11:47,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2024-10-11 02:11:47,094 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 54 [2024-10-11 02:11:47,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:47,095 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2024-10-11 02:11:47,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.25) internal successors, (68), 16 states have internal predecessors, (68), 12 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (18), 11 states have call predecessors, (18), 11 states have call successors, (18) [2024-10-11 02:11:47,095 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2024-10-11 02:11:47,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-11 02:11:47,098 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:47,098 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:47,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 02:11:47,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-11 02:11:47,303 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:47,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:47,304 INFO L85 PathProgramCache]: Analyzing trace with hash -254685450, now seen corresponding path program 3 times [2024-10-11 02:11:47,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:47,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751212594] [2024-10-11 02:11:47,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:47,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:47,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:47,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:47,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:47,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:47,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:47,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:11:47,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:47,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:11:47,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:47,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:11:47,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:47,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:11:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:47,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:11:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:47,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:11:47,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:47,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:11:47,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:47,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:11:47,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:47,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:11:47,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:47,788 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-11 02:11:47,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:47,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751212594] [2024-10-11 02:11:47,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751212594] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:47,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824246440] [2024-10-11 02:11:47,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 02:11:47,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:47,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:47,793 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:47,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 02:11:48,086 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-11 02:11:48,087 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 02:11:48,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 02:11:48,092 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:48,243 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:48,243 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:48,596 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2024-10-11 02:11:48,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824246440] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:48,596 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:48,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 28 [2024-10-11 02:11:48,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105377302] [2024-10-11 02:11:48,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:48,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-11 02:11:48,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:48,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-11 02:11:48,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2024-10-11 02:11:48,599 INFO L87 Difference]: Start difference. First operand 105 states and 116 transitions. Second operand has 28 states, 28 states have (on average 4.785714285714286) internal successors, (134), 28 states have internal predecessors, (134), 24 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 23 states have call predecessors, (36), 23 states have call successors, (36) [2024-10-11 02:11:49,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:49,146 INFO L93 Difference]: Finished difference Result 218 states and 252 transitions. [2024-10-11 02:11:49,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-11 02:11:49,147 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 4.785714285714286) internal successors, (134), 28 states have internal predecessors, (134), 24 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 23 states have call predecessors, (36), 23 states have call successors, (36) Word has length 108 [2024-10-11 02:11:49,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:49,150 INFO L225 Difference]: With dead ends: 218 [2024-10-11 02:11:49,150 INFO L226 Difference]: Without dead ends: 213 [2024-10-11 02:11:49,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 330 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=1436, Unknown=0, NotChecked=0, Total=2256 [2024-10-11 02:11:49,155 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 136 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:49,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 195 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 02:11:49,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-11 02:11:49,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-10-11 02:11:49,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 164 states have (on average 1.1402439024390243) internal successors, (187), 164 states have internal predecessors, (187), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 02:11:49,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 236 transitions. [2024-10-11 02:11:49,202 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 236 transitions. Word has length 108 [2024-10-11 02:11:49,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:49,203 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 236 transitions. [2024-10-11 02:11:49,203 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 4.785714285714286) internal successors, (134), 28 states have internal predecessors, (134), 24 states have call successors, (37), 13 states have call predecessors, (37), 12 states have return successors, (36), 23 states have call predecessors, (36), 23 states have call successors, (36) [2024-10-11 02:11:49,203 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 236 transitions. [2024-10-11 02:11:49,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-11 02:11:49,205 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:49,206 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:49,214 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 02:11:49,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:49,410 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:49,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:49,411 INFO L85 PathProgramCache]: Analyzing trace with hash 1987984182, now seen corresponding path program 4 times [2024-10-11 02:11:49,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:49,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100099901] [2024-10-11 02:11:49,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:49,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:50,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:11:50,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:11:50,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:11:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:11:50,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:11:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:11:50,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:11:50,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:11:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:11:50,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:11:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 02:11:50,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 02:11:50,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 02:11:50,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 02:11:50,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 02:11:50,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 02:11:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 02:11:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 02:11:50,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 02:11:50,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 02:11:50,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-11 02:11:50,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 1199 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2024-10-11 02:11:50,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:50,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100099901] [2024-10-11 02:11:50,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100099901] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:50,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1724000919] [2024-10-11 02:11:50,706 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-11 02:11:50,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:50,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:50,709 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:50,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 02:11:50,838 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-11 02:11:50,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 02:11:50,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-11 02:11:50,851 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:51,157 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 2123 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:51,158 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:11:52,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 1199 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2024-10-11 02:11:52,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1724000919] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:11:52,241 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:11:52,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 26] total 52 [2024-10-11 02:11:52,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587142843] [2024-10-11 02:11:52,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:11:52,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-11 02:11:52,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:11:52,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-11 02:11:52,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1230, Invalid=1422, Unknown=0, NotChecked=0, Total=2652 [2024-10-11 02:11:52,246 INFO L87 Difference]: Start difference. First operand 213 states and 236 transitions. Second operand has 52 states, 52 states have (on average 5.115384615384615) internal successors, (266), 52 states have internal predecessors, (266), 48 states have call successors, (73), 25 states have call predecessors, (73), 24 states have return successors, (72), 47 states have call predecessors, (72), 47 states have call successors, (72) [2024-10-11 02:11:53,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:11:53,751 INFO L93 Difference]: Finished difference Result 434 states and 504 transitions. [2024-10-11 02:11:53,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-10-11 02:11:53,752 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 5.115384615384615) internal successors, (266), 52 states have internal predecessors, (266), 48 states have call successors, (73), 25 states have call predecessors, (73), 24 states have return successors, (72), 47 states have call predecessors, (72), 47 states have call successors, (72) Word has length 216 [2024-10-11 02:11:53,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:11:53,755 INFO L225 Difference]: With dead ends: 434 [2024-10-11 02:11:53,755 INFO L226 Difference]: Without dead ends: 429 [2024-10-11 02:11:53,759 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 548 GetRequests, 454 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1380 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3364, Invalid=5756, Unknown=0, NotChecked=0, Total=9120 [2024-10-11 02:11:53,760 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 297 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 02:11:53,760 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 380 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 02:11:53,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-10-11 02:11:53,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2024-10-11 02:11:53,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 332 states have (on average 1.141566265060241) internal successors, (379), 332 states have internal predecessors, (379), 49 states have call successors, (49), 48 states have call predecessors, (49), 47 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 02:11:53,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 476 transitions. [2024-10-11 02:11:53,822 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 476 transitions. Word has length 216 [2024-10-11 02:11:53,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:11:53,824 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 476 transitions. [2024-10-11 02:11:53,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 5.115384615384615) internal successors, (266), 52 states have internal predecessors, (266), 48 states have call successors, (73), 25 states have call predecessors, (73), 24 states have return successors, (72), 47 states have call predecessors, (72), 47 states have call successors, (72) [2024-10-11 02:11:53,825 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 476 transitions. [2024-10-11 02:11:53,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2024-10-11 02:11:53,836 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:11:53,836 INFO L215 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:11:53,854 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 02:11:54,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-10-11 02:11:54,041 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:11:54,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:11:54,041 INFO L85 PathProgramCache]: Analyzing trace with hash 1235022774, now seen corresponding path program 5 times [2024-10-11 02:11:54,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:11:54,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471610356] [2024-10-11 02:11:54,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:11:54,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:11:54,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:11:57,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:11:57,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:11:57,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:11:57,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:11:57,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:11:57,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:11:57,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:11:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:11:57,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:11:57,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:11:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:11:57,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:11:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 02:11:57,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 02:11:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 02:11:57,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 02:11:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 02:11:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 02:11:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 02:11:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 02:11:57,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 02:11:57,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 02:11:57,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-11 02:11:57,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 02:11:57,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-10-11 02:11:57,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-11 02:11:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-11 02:11:57,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-11 02:11:57,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-11 02:11:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-10-11 02:11:57,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-10-11 02:11:57,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-11 02:11:57,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2024-10-11 02:11:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-10-11 02:11:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2024-10-11 02:11:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2024-10-11 02:11:57,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-10-11 02:11:57,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2024-10-11 02:11:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2024-10-11 02:11:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-10-11 02:11:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2024-10-11 02:11:57,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2024-10-11 02:11:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 383 [2024-10-11 02:11:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2024-10-11 02:11:57,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 401 [2024-10-11 02:11:57,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 410 [2024-10-11 02:11:57,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2024-10-11 02:11:57,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:11:57,829 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 5267 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2024-10-11 02:11:57,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:11:57,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471610356] [2024-10-11 02:11:57,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471610356] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:11:57,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752273800] [2024-10-11 02:11:57,830 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-11 02:11:57,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:11:57,830 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:11:57,832 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:11:57,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 02:11:59,121 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-10-11 02:11:59,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 02:11:59,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-10-11 02:11:59,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:11:59,622 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 9407 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:11:59,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:12:02,299 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 5267 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2024-10-11 02:12:02,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752273800] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:12:02,300 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:12:02,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 49, 50] total 100 [2024-10-11 02:12:02,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253840837] [2024-10-11 02:12:02,300 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:12:02,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2024-10-11 02:12:02,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:12:02,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2024-10-11 02:12:02,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4758, Invalid=5142, Unknown=0, NotChecked=0, Total=9900 [2024-10-11 02:12:02,310 INFO L87 Difference]: Start difference. First operand 429 states and 476 transitions. Second operand has 100 states, 100 states have (on average 5.3) internal successors, (530), 100 states have internal predecessors, (530), 96 states have call successors, (145), 49 states have call predecessors, (145), 48 states have return successors, (144), 95 states have call predecessors, (144), 95 states have call successors, (144) [2024-10-11 02:12:06,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:12:06,896 INFO L93 Difference]: Finished difference Result 866 states and 1008 transitions. [2024-10-11 02:12:06,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2024-10-11 02:12:06,914 INFO L78 Accepts]: Start accepts. Automaton has has 100 states, 100 states have (on average 5.3) internal successors, (530), 100 states have internal predecessors, (530), 96 states have call successors, (145), 49 states have call predecessors, (145), 48 states have return successors, (144), 95 states have call predecessors, (144), 95 states have call successors, (144) Word has length 432 [2024-10-11 02:12:06,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:12:06,921 INFO L225 Difference]: With dead ends: 866 [2024-10-11 02:12:06,921 INFO L226 Difference]: Without dead ends: 861 [2024-10-11 02:12:06,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1100 GetRequests, 910 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5640 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=13636, Invalid=23036, Unknown=0, NotChecked=0, Total=36672 [2024-10-11 02:12:06,929 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 855 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:12:06,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 629 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 02:12:06,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2024-10-11 02:12:07,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 861. [2024-10-11 02:12:07,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 668 states have (on average 1.1422155688622755) internal successors, (763), 668 states have internal predecessors, (763), 97 states have call successors, (97), 96 states have call predecessors, (97), 95 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2024-10-11 02:12:07,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 956 transitions. [2024-10-11 02:12:07,050 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 956 transitions. Word has length 432 [2024-10-11 02:12:07,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:12:07,051 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 956 transitions. [2024-10-11 02:12:07,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 100 states, 100 states have (on average 5.3) internal successors, (530), 100 states have internal predecessors, (530), 96 states have call successors, (145), 49 states have call predecessors, (145), 48 states have return successors, (144), 95 states have call predecessors, (144), 95 states have call successors, (144) [2024-10-11 02:12:07,052 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 956 transitions. [2024-10-11 02:12:07,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 865 [2024-10-11 02:12:07,076 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:12:07,077 INFO L215 NwaCegarLoop]: trace histogram [95, 95, 94, 94, 94, 94, 94, 94, 94, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:12:07,087 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-11 02:12:07,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:12:07,281 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:12:07,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:12:07,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1364073290, now seen corresponding path program 6 times [2024-10-11 02:12:07,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:12:07,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095349398] [2024-10-11 02:12:07,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:12:07,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:12:07,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:18,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 02:12:18,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:18,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-11 02:12:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:18,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:12:18,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:18,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-11 02:12:18,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:18,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:12:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:18,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-11 02:12:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:18,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:12:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:18,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:12:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:18,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:12:19,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:12:19,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:12:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:12:19,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:12:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 02:12:19,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 02:12:19,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-11 02:12:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-11 02:12:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-11 02:12:19,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-11 02:12:19,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-11 02:12:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-11 02:12:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-11 02:12:19,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-11 02:12:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-11 02:12:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-11 02:12:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-10-11 02:12:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-11 02:12:19,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-11 02:12:19,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-11 02:12:19,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-11 02:12:19,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-10-11 02:12:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-10-11 02:12:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-11 02:12:19,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2024-10-11 02:12:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-10-11 02:12:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2024-10-11 02:12:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2024-10-11 02:12:19,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-10-11 02:12:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2024-10-11 02:12:19,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2024-10-11 02:12:19,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-10-11 02:12:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2024-10-11 02:12:19,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2024-10-11 02:12:19,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 383 [2024-10-11 02:12:19,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2024-10-11 02:12:19,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 401 [2024-10-11 02:12:19,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 410 [2024-10-11 02:12:19,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2024-10-11 02:12:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2024-10-11 02:12:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 437 [2024-10-11 02:12:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 446 [2024-10-11 02:12:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2024-10-11 02:12:19,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 464 [2024-10-11 02:12:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 473 [2024-10-11 02:12:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 482 [2024-10-11 02:12:19,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2024-10-11 02:12:19,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 500 [2024-10-11 02:12:19,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2024-10-11 02:12:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 518 [2024-10-11 02:12:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 527 [2024-10-11 02:12:19,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 536 [2024-10-11 02:12:19,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 545 [2024-10-11 02:12:19,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 554 [2024-10-11 02:12:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 563 [2024-10-11 02:12:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 572 [2024-10-11 02:12:19,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 581 [2024-10-11 02:12:19,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 590 [2024-10-11 02:12:19,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 599 [2024-10-11 02:12:19,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 608 [2024-10-11 02:12:19,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 617 [2024-10-11 02:12:19,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 626 [2024-10-11 02:12:19,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 635 [2024-10-11 02:12:19,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 644 [2024-10-11 02:12:19,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 653 [2024-10-11 02:12:19,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 662 [2024-10-11 02:12:19,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 671 [2024-10-11 02:12:19,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 680 [2024-10-11 02:12:19,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 689 [2024-10-11 02:12:19,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 698 [2024-10-11 02:12:19,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 707 [2024-10-11 02:12:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 716 [2024-10-11 02:12:19,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 725 [2024-10-11 02:12:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 734 [2024-10-11 02:12:19,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 743 [2024-10-11 02:12:19,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 752 [2024-10-11 02:12:19,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 761 [2024-10-11 02:12:19,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 770 [2024-10-11 02:12:19,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 779 [2024-10-11 02:12:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 788 [2024-10-11 02:12:19,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 797 [2024-10-11 02:12:19,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 806 [2024-10-11 02:12:19,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 815 [2024-10-11 02:12:19,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 824 [2024-10-11 02:12:19,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 833 [2024-10-11 02:12:19,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 842 [2024-10-11 02:12:19,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 851 [2024-10-11 02:12:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:12:19,229 INFO L134 CoverageAnalysis]: Checked inductivity of 39719 backedges. 188 proven. 22043 refuted. 0 times theorem prover too weak. 17488 trivial. 0 not checked. [2024-10-11 02:12:19,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:12:19,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095349398] [2024-10-11 02:12:19,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095349398] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:12:19,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821101248] [2024-10-11 02:12:19,232 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-11 02:12:19,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:12:19,233 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:12:19,234 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:12:19,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 02:12:33,166 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 95 check-sat command(s) [2024-10-11 02:12:33,166 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 02:12:33,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 1945 conjuncts, 191 conjuncts are in the unsatisfiable core [2024-10-11 02:12:33,206 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:12:34,122 INFO L134 CoverageAnalysis]: Checked inductivity of 39719 backedges. 188 proven. 39527 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 02:12:34,122 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:12:38,346 INFO L134 CoverageAnalysis]: Checked inductivity of 39719 backedges. 188 proven. 22043 refuted. 0 times theorem prover too weak. 17488 trivial. 0 not checked. [2024-10-11 02:12:38,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821101248] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:12:38,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:12:38,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [99, 97, 98] total 106 [2024-10-11 02:12:38,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594189521] [2024-10-11 02:12:38,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:12:38,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2024-10-11 02:12:38,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:12:38,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2024-10-11 02:12:38,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5361, Invalid=5769, Unknown=0, NotChecked=0, Total=11130 [2024-10-11 02:12:38,356 INFO L87 Difference]: Start difference. First operand 861 states and 956 transitions. Second operand has 106 states, 106 states have (on average 6.622641509433962) internal successors, (702), 106 states have internal predecessors, (702), 102 states have call successors, (200), 97 states have call predecessors, (200), 96 states have return successors, (199), 101 states have call predecessors, (199), 101 states have call successors, (199) [2024-10-11 02:12:43,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:12:43,159 INFO L93 Difference]: Finished difference Result 920 states and 1026 transitions. [2024-10-11 02:12:43,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 202 states. [2024-10-11 02:12:43,160 INFO L78 Accepts]: Start accepts. Automaton has has 106 states, 106 states have (on average 6.622641509433962) internal successors, (702), 106 states have internal predecessors, (702), 102 states have call successors, (200), 97 states have call predecessors, (200), 96 states have return successors, (199), 101 states have call predecessors, (199), 101 states have call successors, (199) Word has length 864 [2024-10-11 02:12:43,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:12:43,168 INFO L225 Difference]: With dead ends: 920 [2024-10-11 02:12:43,169 INFO L226 Difference]: Without dead ends: 915 [2024-10-11 02:12:43,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2114 GetRequests, 1822 SyntacticMatches, 90 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9885 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=15451, Invalid=25961, Unknown=0, NotChecked=0, Total=41412 [2024-10-11 02:12:43,175 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 373 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:12:43,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [373 Valid, 677 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 02:12:43,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 915 states. [2024-10-11 02:12:43,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 915 to 915. [2024-10-11 02:12:43,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 915 states, 710 states have (on average 1.1422535211267606) internal successors, (811), 710 states have internal predecessors, (811), 103 states have call successors, (103), 102 states have call predecessors, (103), 101 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2024-10-11 02:12:43,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 915 states to 915 states and 1016 transitions. [2024-10-11 02:12:43,278 INFO L78 Accepts]: Start accepts. Automaton has 915 states and 1016 transitions. Word has length 864 [2024-10-11 02:12:43,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:12:43,285 INFO L471 AbstractCegarLoop]: Abstraction has 915 states and 1016 transitions. [2024-10-11 02:12:43,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 106 states have (on average 6.622641509433962) internal successors, (702), 106 states have internal predecessors, (702), 102 states have call successors, (200), 97 states have call predecessors, (200), 96 states have return successors, (199), 101 states have call predecessors, (199), 101 states have call successors, (199) [2024-10-11 02:12:43,286 INFO L276 IsEmpty]: Start isEmpty. Operand 915 states and 1016 transitions. [2024-10-11 02:12:43,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 919 [2024-10-11 02:12:43,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:12:43,312 INFO L215 NwaCegarLoop]: trace histogram [101, 101, 100, 100, 100, 100, 100, 100, 100, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:12:43,327 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 02:12:43,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 02:12:43,513 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:12:43,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:12:43,514 INFO L85 PathProgramCache]: Analyzing trace with hash 120043222, now seen corresponding path program 7 times [2024-10-11 02:12:43,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:12:43,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647046829] [2024-10-11 02:12:43,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:12:43,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:12:44,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-11 02:12:44,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2118977923] [2024-10-11 02:12:44,282 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2024-10-11 02:12:44,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:12:44,283 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:12:44,284 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:12:44,285 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 02:12:44,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 02:12:44,711 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 02:12:44,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 02:12:45,194 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 02:12:45,194 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 02:12:45,195 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 02:12:45,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 02:12:45,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:12:45,400 INFO L407 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1] [2024-10-11 02:12:45,607 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 02:12:45,610 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:12:45 BoogieIcfgContainer [2024-10-11 02:12:45,610 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 02:12:45,614 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 02:12:45,614 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 02:12:45,615 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 02:12:45,615 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:11:42" (3/4) ... [2024-10-11 02:12:45,616 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-11 02:12:45,812 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 02:12:45,813 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 02:12:45,814 INFO L158 Benchmark]: Toolchain (without parser) took 64238.31ms. Allocated memory was 186.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 157.2MB in the beginning and 1.1GB in the end (delta: -982.2MB). Peak memory consumption was 250.0MB. Max. memory is 16.1GB. [2024-10-11 02:12:45,814 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 123.7MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:12:45,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.31ms. Allocated memory is still 186.6MB. Free memory was 157.2MB in the beginning and 144.7MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 02:12:45,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.08ms. Allocated memory is still 186.6MB. Free memory was 144.7MB in the beginning and 143.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 02:12:45,815 INFO L158 Benchmark]: Boogie Preprocessor took 42.03ms. Allocated memory is still 186.6MB. Free memory was 143.7MB in the beginning and 141.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 02:12:45,815 INFO L158 Benchmark]: RCFGBuilder took 281.52ms. Allocated memory is still 186.6MB. Free memory was 141.6MB in the beginning and 129.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 02:12:45,816 INFO L158 Benchmark]: TraceAbstraction took 63380.31ms. Allocated memory was 186.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 129.1MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 193.4MB. Max. memory is 16.1GB. [2024-10-11 02:12:45,816 INFO L158 Benchmark]: Witness Printer took 199.27ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-10-11 02:12:45,817 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.15ms. Allocated memory is still 123.7MB. Free memory is still 84.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.31ms. Allocated memory is still 186.6MB. Free memory was 157.2MB in the beginning and 144.7MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.08ms. Allocated memory is still 186.6MB. Free memory was 144.7MB in the beginning and 143.7MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 42.03ms. Allocated memory is still 186.6MB. Free memory was 143.7MB in the beginning and 141.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 281.52ms. Allocated memory is still 186.6MB. Free memory was 141.6MB in the beginning and 129.1MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 63380.31ms. Allocated memory was 186.6MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 129.1MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 193.4MB. Max. memory is 16.1GB. * Witness Printer took 199.27ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. 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 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [A=25010003, R=5002, counter=0] [L28] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, counter=0] [L28] RET assume_abort_if_not(A % 2 == 1) VAL [A=25010003, R=5002, counter=0] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [A=25010003, counter=0, r=10001, u=10005, v=1] [L34] EXPR counter++ VAL [A=25010003, counter=1, r=10001, u=10005, v=1] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=1, r=10001, u=10005, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=1, r=10001, u=10005, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=1, r=10000, u=10005, v=3] [L34] EXPR counter++ VAL [A=25010003, counter=2, r=10000, u=10005, v=3] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=2] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=2, r=10000, u=10005, v=3] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=2, r=10000, u=10005, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=2, r=9997, u=10005, v=5] [L34] EXPR counter++ VAL [A=25010003, counter=3, r=9997, u=10005, v=5] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=3] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=3, r=9997, u=10005, v=5] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=3, r=9997, u=10005, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=3, r=9992, u=10005, v=7] [L34] EXPR counter++ VAL [A=25010003, counter=4, r=9992, u=10005, v=7] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=4] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=4, r=9992, u=10005, v=7] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=4, r=9992, u=10005, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=4, r=9985, u=10005, v=9] [L34] EXPR counter++ VAL [A=25010003, counter=5, r=9985, u=10005, v=9] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=5, r=9985, u=10005, v=9] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=5, r=9985, u=10005, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=5, r=9976, u=10005, v=11] [L34] EXPR counter++ VAL [A=25010003, counter=6, r=9976, u=10005, v=11] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=6] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=6, r=9976, u=10005, v=11] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=6, r=9976, u=10005, v=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=6, r=9965, u=10005, v=13] [L34] EXPR counter++ VAL [A=25010003, counter=7, r=9965, u=10005, v=13] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=7] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=7, r=9965, u=10005, v=13] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=7, r=9965, u=10005, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=7, r=9952, u=10005, v=15] [L34] EXPR counter++ VAL [A=25010003, counter=8, r=9952, u=10005, v=15] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=8] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=8, r=9952, u=10005, v=15] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=8, r=9952, u=10005, v=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=8, r=9937, u=10005, v=17] [L34] EXPR counter++ VAL [A=25010003, counter=9, r=9937, u=10005, v=17] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=9] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=9, r=9937, u=10005, v=17] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=9, r=9937, u=10005, v=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=9, r=9920, u=10005, v=19] [L34] EXPR counter++ VAL [A=25010003, counter=10, r=9920, u=10005, v=19] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=10] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=10, r=9920, u=10005, v=19] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=10, r=9920, u=10005, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=10, r=9901, u=10005, v=21] [L34] EXPR counter++ VAL [A=25010003, counter=11, r=9901, u=10005, v=21] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=11] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=11, r=9901, u=10005, v=21] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=11, r=9901, u=10005, v=21] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=11, r=9880, u=10005, v=23] [L34] EXPR counter++ VAL [A=25010003, counter=12, r=9880, u=10005, v=23] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=12] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=12, r=9880, u=10005, v=23] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=12, r=9880, u=10005, v=23] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=12, r=9857, u=10005, v=25] [L34] EXPR counter++ VAL [A=25010003, counter=13, r=9857, u=10005, v=25] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=13] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=13, r=9857, u=10005, v=25] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=13, r=9857, u=10005, v=25] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=13, r=9832, u=10005, v=27] [L34] EXPR counter++ VAL [A=25010003, counter=14, r=9832, u=10005, v=27] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=14] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=14, r=9832, u=10005, v=27] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=14, r=9832, u=10005, v=27] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=14, r=9805, u=10005, v=29] [L34] EXPR counter++ VAL [A=25010003, counter=15, r=9805, u=10005, v=29] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=15] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=15, r=9805, u=10005, v=29] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=15, r=9805, u=10005, v=29] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=15, r=9776, u=10005, v=31] [L34] EXPR counter++ VAL [A=25010003, counter=16, r=9776, u=10005, v=31] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=16] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=16, r=9776, u=10005, v=31] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=16, r=9776, u=10005, v=31] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=16, r=9745, u=10005, v=33] [L34] EXPR counter++ VAL [A=25010003, counter=17, r=9745, u=10005, v=33] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=17] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=17, r=9745, u=10005, v=33] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=17, r=9745, u=10005, v=33] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=17, r=9712, u=10005, v=35] [L34] EXPR counter++ VAL [A=25010003, counter=18, r=9712, u=10005, v=35] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=18] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=18, r=9712, u=10005, v=35] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=18, r=9712, u=10005, v=35] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=18, r=9677, u=10005, v=37] [L34] EXPR counter++ VAL [A=25010003, counter=19, r=9677, u=10005, v=37] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=19] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=19, r=9677, u=10005, v=37] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=19, r=9677, u=10005, v=37] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=19, r=9640, u=10005, v=39] [L34] EXPR counter++ VAL [A=25010003, counter=20, r=9640, u=10005, v=39] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=20] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=20, r=9640, u=10005, v=39] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=20, r=9640, u=10005, v=39] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=20, r=9601, u=10005, v=41] [L34] EXPR counter++ VAL [A=25010003, counter=21, r=9601, u=10005, v=41] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=21] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=21] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=21, r=9601, u=10005, v=41] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=21, r=9601, u=10005, v=41] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=21, r=9560, u=10005, v=43] [L34] EXPR counter++ VAL [A=25010003, counter=22, r=9560, u=10005, v=43] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=22] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=22] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=22, r=9560, u=10005, v=43] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=22, r=9560, u=10005, v=43] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=22, r=9517, u=10005, v=45] [L34] EXPR counter++ VAL [A=25010003, counter=23, r=9517, u=10005, v=45] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=23] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=23] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=23, r=9517, u=10005, v=45] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=23, r=9517, u=10005, v=45] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=23, r=9472, u=10005, v=47] [L34] EXPR counter++ VAL [A=25010003, counter=24, r=9472, u=10005, v=47] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=24] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=24] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=24, r=9472, u=10005, v=47] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=24, r=9472, u=10005, v=47] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=24, r=9425, u=10005, v=49] [L34] EXPR counter++ VAL [A=25010003, counter=25, r=9425, u=10005, v=49] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=25] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=25] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=25, r=9425, u=10005, v=49] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=25, r=9425, u=10005, v=49] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=25, r=9376, u=10005, v=51] [L34] EXPR counter++ VAL [A=25010003, counter=26, r=9376, u=10005, v=51] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=26] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=26] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=26, r=9376, u=10005, v=51] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=26, r=9376, u=10005, v=51] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=26, r=9325, u=10005, v=53] [L34] EXPR counter++ VAL [A=25010003, counter=27, r=9325, u=10005, v=53] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=27] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=27] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=27, r=9325, u=10005, v=53] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=27, r=9325, u=10005, v=53] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=27, r=9272, u=10005, v=55] [L34] EXPR counter++ VAL [A=25010003, counter=28, r=9272, u=10005, v=55] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=28] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=28] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=28, r=9272, u=10005, v=55] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=28, r=9272, u=10005, v=55] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=28, r=9217, u=10005, v=57] [L34] EXPR counter++ VAL [A=25010003, counter=29, r=9217, u=10005, v=57] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=29] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=29] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=29, r=9217, u=10005, v=57] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=29, r=9217, u=10005, v=57] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=29, r=9160, u=10005, v=59] [L34] EXPR counter++ VAL [A=25010003, counter=30, r=9160, u=10005, v=59] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=30] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=30] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=30, r=9160, u=10005, v=59] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=30, r=9160, u=10005, v=59] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=30, r=9101, u=10005, v=61] [L34] EXPR counter++ VAL [A=25010003, counter=31, r=9101, u=10005, v=61] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=31] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=31] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=31, r=9101, u=10005, v=61] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=31, r=9101, u=10005, v=61] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=31, r=9040, u=10005, v=63] [L34] EXPR counter++ VAL [A=25010003, counter=32, r=9040, u=10005, v=63] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=32] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=32] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=32, r=9040, u=10005, v=63] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=32, r=9040, u=10005, v=63] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=32, r=8977, u=10005, v=65] [L34] EXPR counter++ VAL [A=25010003, counter=33, r=8977, u=10005, v=65] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=33] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=33] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=33, r=8977, u=10005, v=65] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=33, r=8977, u=10005, v=65] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=33, r=8912, u=10005, v=67] [L34] EXPR counter++ VAL [A=25010003, counter=34, r=8912, u=10005, v=67] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=34] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=34] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=34, r=8912, u=10005, v=67] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=34, r=8912, u=10005, v=67] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=34, r=8845, u=10005, v=69] [L34] EXPR counter++ VAL [A=25010003, counter=35, r=8845, u=10005, v=69] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=35] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=35] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=35, r=8845, u=10005, v=69] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=35, r=8845, u=10005, v=69] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=35, r=8776, u=10005, v=71] [L34] EXPR counter++ VAL [A=25010003, counter=36, r=8776, u=10005, v=71] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=36] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=36] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=36, r=8776, u=10005, v=71] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=36, r=8776, u=10005, v=71] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=36, r=8705, u=10005, v=73] [L34] EXPR counter++ VAL [A=25010003, counter=37, r=8705, u=10005, v=73] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=37] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=37] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=37, r=8705, u=10005, v=73] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=37, r=8705, u=10005, v=73] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=37, r=8632, u=10005, v=75] [L34] EXPR counter++ VAL [A=25010003, counter=38, r=8632, u=10005, v=75] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=38] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=38] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=38, r=8632, u=10005, v=75] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=38, r=8632, u=10005, v=75] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=38, r=8557, u=10005, v=77] [L34] EXPR counter++ VAL [A=25010003, counter=39, r=8557, u=10005, v=77] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=39] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=39] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=39, r=8557, u=10005, v=77] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=39, r=8557, u=10005, v=77] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=39, r=8480, u=10005, v=79] [L34] EXPR counter++ VAL [A=25010003, counter=40, r=8480, u=10005, v=79] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=40] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=40] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=40, r=8480, u=10005, v=79] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=40, r=8480, u=10005, v=79] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=40, r=8401, u=10005, v=81] [L34] EXPR counter++ VAL [A=25010003, counter=41, r=8401, u=10005, v=81] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=41] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=41] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=41, r=8401, u=10005, v=81] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=41, r=8401, u=10005, v=81] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=41, r=8320, u=10005, v=83] [L34] EXPR counter++ VAL [A=25010003, counter=42, r=8320, u=10005, v=83] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=42] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=42] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=42, r=8320, u=10005, v=83] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=42, r=8320, u=10005, v=83] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=42, r=8237, u=10005, v=85] [L34] EXPR counter++ VAL [A=25010003, counter=43, r=8237, u=10005, v=85] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=43] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=43] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=43, r=8237, u=10005, v=85] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=43, r=8237, u=10005, v=85] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=43, r=8152, u=10005, v=87] [L34] EXPR counter++ VAL [A=25010003, counter=44, r=8152, u=10005, v=87] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=44] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=44] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=44, r=8152, u=10005, v=87] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=44, r=8152, u=10005, v=87] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=44, r=8065, u=10005, v=89] [L34] EXPR counter++ VAL [A=25010003, counter=45, r=8065, u=10005, v=89] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=45] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=45] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=45, r=8065, u=10005, v=89] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=45, r=8065, u=10005, v=89] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=45, r=7976, u=10005, v=91] [L34] EXPR counter++ VAL [A=25010003, counter=46, r=7976, u=10005, v=91] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=46] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=46] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=46, r=7976, u=10005, v=91] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=46, r=7976, u=10005, v=91] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=46, r=7885, u=10005, v=93] [L34] EXPR counter++ VAL [A=25010003, counter=47, r=7885, u=10005, v=93] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=47] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=47] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=47, r=7885, u=10005, v=93] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=47, r=7885, u=10005, v=93] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=47, r=7792, u=10005, v=95] [L34] EXPR counter++ VAL [A=25010003, counter=48, r=7792, u=10005, v=95] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=48] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=48] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=48, r=7792, u=10005, v=95] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=48, r=7792, u=10005, v=95] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=48, r=7697, u=10005, v=97] [L34] EXPR counter++ VAL [A=25010003, counter=49, r=7697, u=10005, v=97] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=49] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=49] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=49, r=7697, u=10005, v=97] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=49, r=7697, u=10005, v=97] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=49, r=7600, u=10005, v=99] [L34] EXPR counter++ VAL [A=25010003, counter=50, r=7600, u=10005, v=99] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=50] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=50] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=50, r=7600, u=10005, v=99] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=50, r=7600, u=10005, v=99] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=50, r=7501, u=10005, v=101] [L34] EXPR counter++ VAL [A=25010003, counter=51, r=7501, u=10005, v=101] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=51] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=51] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=51, r=7501, u=10005, v=101] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=51, r=7501, u=10005, v=101] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=51, r=7400, u=10005, v=103] [L34] EXPR counter++ VAL [A=25010003, counter=52, r=7400, u=10005, v=103] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=52] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=52] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=52, r=7400, u=10005, v=103] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=52, r=7400, u=10005, v=103] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=52, r=7297, u=10005, v=105] [L34] EXPR counter++ VAL [A=25010003, counter=53, r=7297, u=10005, v=105] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=53] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=53] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=53, r=7297, u=10005, v=105] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=53, r=7297, u=10005, v=105] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=53, r=7192, u=10005, v=107] [L34] EXPR counter++ VAL [A=25010003, counter=54, r=7192, u=10005, v=107] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=54] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=54] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=54, r=7192, u=10005, v=107] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=54, r=7192, u=10005, v=107] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=54, r=7085, u=10005, v=109] [L34] EXPR counter++ VAL [A=25010003, counter=55, r=7085, u=10005, v=109] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=55] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=55] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=55, r=7085, u=10005, v=109] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=55, r=7085, u=10005, v=109] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=55, r=6976, u=10005, v=111] [L34] EXPR counter++ VAL [A=25010003, counter=56, r=6976, u=10005, v=111] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=56] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=56] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=56, r=6976, u=10005, v=111] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=56, r=6976, u=10005, v=111] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=56, r=6865, u=10005, v=113] [L34] EXPR counter++ VAL [A=25010003, counter=57, r=6865, u=10005, v=113] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=57] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=57] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=57, r=6865, u=10005, v=113] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=57, r=6865, u=10005, v=113] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=57, r=6752, u=10005, v=115] [L34] EXPR counter++ VAL [A=25010003, counter=58, r=6752, u=10005, v=115] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=58] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=58] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=58, r=6752, u=10005, v=115] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=58, r=6752, u=10005, v=115] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=58, r=6637, u=10005, v=117] [L34] EXPR counter++ VAL [A=25010003, counter=59, r=6637, u=10005, v=117] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=59] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=59] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=59, r=6637, u=10005, v=117] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=59, r=6637, u=10005, v=117] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=59, r=6520, u=10005, v=119] [L34] EXPR counter++ VAL [A=25010003, counter=60, r=6520, u=10005, v=119] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=60] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=60] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=60, r=6520, u=10005, v=119] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=60, r=6520, u=10005, v=119] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=60, r=6401, u=10005, v=121] [L34] EXPR counter++ VAL [A=25010003, counter=61, r=6401, u=10005, v=121] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=61] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=61] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=61, r=6401, u=10005, v=121] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=61, r=6401, u=10005, v=121] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=61, r=6280, u=10005, v=123] [L34] EXPR counter++ VAL [A=25010003, counter=62, r=6280, u=10005, v=123] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=62] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=62] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=62, r=6280, u=10005, v=123] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=62, r=6280, u=10005, v=123] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=62, r=6157, u=10005, v=125] [L34] EXPR counter++ VAL [A=25010003, counter=63, r=6157, u=10005, v=125] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=63] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=63] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=63, r=6157, u=10005, v=125] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=63, r=6157, u=10005, v=125] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=63, r=6032, u=10005, v=127] [L34] EXPR counter++ VAL [A=25010003, counter=64, r=6032, u=10005, v=127] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=64] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=64] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=64, r=6032, u=10005, v=127] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=64, r=6032, u=10005, v=127] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=64, r=5905, u=10005, v=129] [L34] EXPR counter++ VAL [A=25010003, counter=65, r=5905, u=10005, v=129] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=65] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=65] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=65, r=5905, u=10005, v=129] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=65, r=5905, u=10005, v=129] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=65, r=5776, u=10005, v=131] [L34] EXPR counter++ VAL [A=25010003, counter=66, r=5776, u=10005, v=131] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=66] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=66] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=66, r=5776, u=10005, v=131] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=66, r=5776, u=10005, v=131] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=66, r=5645, u=10005, v=133] [L34] EXPR counter++ VAL [A=25010003, counter=67, r=5645, u=10005, v=133] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=67] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=67] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=67, r=5645, u=10005, v=133] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=67, r=5645, u=10005, v=133] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=67, r=5512, u=10005, v=135] [L34] EXPR counter++ VAL [A=25010003, counter=68, r=5512, u=10005, v=135] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=68] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=68] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=68, r=5512, u=10005, v=135] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=68, r=5512, u=10005, v=135] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=68, r=5377, u=10005, v=137] [L34] EXPR counter++ VAL [A=25010003, counter=69, r=5377, u=10005, v=137] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=69] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=69] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=69, r=5377, u=10005, v=137] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=69, r=5377, u=10005, v=137] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=69, r=5240, u=10005, v=139] [L34] EXPR counter++ VAL [A=25010003, counter=70, r=5240, u=10005, v=139] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=70] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=70] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=70, r=5240, u=10005, v=139] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=70, r=5240, u=10005, v=139] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=70, r=5101, u=10005, v=141] [L34] EXPR counter++ VAL [A=25010003, counter=71, r=5101, u=10005, v=141] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=71] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=71] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=71, r=5101, u=10005, v=141] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=71, r=5101, u=10005, v=141] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=71, r=4960, u=10005, v=143] [L34] EXPR counter++ VAL [A=25010003, counter=72, r=4960, u=10005, v=143] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=72] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=72] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=72, r=4960, u=10005, v=143] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=72, r=4960, u=10005, v=143] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=72, r=4817, u=10005, v=145] [L34] EXPR counter++ VAL [A=25010003, counter=73, r=4817, u=10005, v=145] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=73] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=73] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=73, r=4817, u=10005, v=145] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=73, r=4817, u=10005, v=145] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=73, r=4672, u=10005, v=147] [L34] EXPR counter++ VAL [A=25010003, counter=74, r=4672, u=10005, v=147] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=74] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=74] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=74, r=4672, u=10005, v=147] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=74, r=4672, u=10005, v=147] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=74, r=4525, u=10005, v=149] [L34] EXPR counter++ VAL [A=25010003, counter=75, r=4525, u=10005, v=149] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=75] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=75] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=75, r=4525, u=10005, v=149] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=75, r=4525, u=10005, v=149] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=75, r=4376, u=10005, v=151] [L34] EXPR counter++ VAL [A=25010003, counter=76, r=4376, u=10005, v=151] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=76] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=76] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=76, r=4376, u=10005, v=151] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=76, r=4376, u=10005, v=151] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=76, r=4225, u=10005, v=153] [L34] EXPR counter++ VAL [A=25010003, counter=77, r=4225, u=10005, v=153] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=77] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=77] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=77, r=4225, u=10005, v=153] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=77, r=4225, u=10005, v=153] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=77, r=4072, u=10005, v=155] [L34] EXPR counter++ VAL [A=25010003, counter=78, r=4072, u=10005, v=155] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=78] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=78] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=78, r=4072, u=10005, v=155] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=78, r=4072, u=10005, v=155] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=78, r=3917, u=10005, v=157] [L34] EXPR counter++ VAL [A=25010003, counter=79, r=3917, u=10005, v=157] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=79] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=79] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=79, r=3917, u=10005, v=157] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=79, r=3917, u=10005, v=157] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=79, r=3760, u=10005, v=159] [L34] EXPR counter++ VAL [A=25010003, counter=80, r=3760, u=10005, v=159] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=80] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=80] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=80, r=3760, u=10005, v=159] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=80, r=3760, u=10005, v=159] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=80, r=3601, u=10005, v=161] [L34] EXPR counter++ VAL [A=25010003, counter=81, r=3601, u=10005, v=161] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=81] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=81] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=81, r=3601, u=10005, v=161] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=81, r=3601, u=10005, v=161] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=81, r=3440, u=10005, v=163] [L34] EXPR counter++ VAL [A=25010003, counter=82, r=3440, u=10005, v=163] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=82] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=82] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=82, r=3440, u=10005, v=163] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=82, r=3440, u=10005, v=163] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=82, r=3277, u=10005, v=165] [L34] EXPR counter++ VAL [A=25010003, counter=83, r=3277, u=10005, v=165] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=83] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=83] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=83, r=3277, u=10005, v=165] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=83, r=3277, u=10005, v=165] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=83, r=3112, u=10005, v=167] [L34] EXPR counter++ VAL [A=25010003, counter=84, r=3112, u=10005, v=167] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=84] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=84] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=84, r=3112, u=10005, v=167] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=84, r=3112, u=10005, v=167] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=84, r=2945, u=10005, v=169] [L34] EXPR counter++ VAL [A=25010003, counter=85, r=2945, u=10005, v=169] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=85] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=85] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=85, r=2945, u=10005, v=169] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=85, r=2945, u=10005, v=169] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=85, r=2776, u=10005, v=171] [L34] EXPR counter++ VAL [A=25010003, counter=86, r=2776, u=10005, v=171] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=86] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=86] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=86, r=2776, u=10005, v=171] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=86, r=2776, u=10005, v=171] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=86, r=2605, u=10005, v=173] [L34] EXPR counter++ VAL [A=25010003, counter=87, r=2605, u=10005, v=173] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=87] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=87] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=87, r=2605, u=10005, v=173] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=87, r=2605, u=10005, v=173] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=87, r=2432, u=10005, v=175] [L34] EXPR counter++ VAL [A=25010003, counter=88, r=2432, u=10005, v=175] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=88] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=88] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=88, r=2432, u=10005, v=175] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=88, r=2432, u=10005, v=175] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=88, r=2257, u=10005, v=177] [L34] EXPR counter++ VAL [A=25010003, counter=89, r=2257, u=10005, v=177] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=89] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=89] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=89, r=2257, u=10005, v=177] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=89, r=2257, u=10005, v=177] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=89, r=2080, u=10005, v=179] [L34] EXPR counter++ VAL [A=25010003, counter=90, r=2080, u=10005, v=179] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=90] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=90] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=90, r=2080, u=10005, v=179] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=90, r=2080, u=10005, v=179] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=90, r=1901, u=10005, v=181] [L34] EXPR counter++ VAL [A=25010003, counter=91, r=1901, u=10005, v=181] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=91] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=91] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=91, r=1901, u=10005, v=181] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=91, r=1901, u=10005, v=181] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=91, r=1720, u=10005, v=183] [L34] EXPR counter++ VAL [A=25010003, counter=92, r=1720, u=10005, v=183] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=92] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=92] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=92, r=1720, u=10005, v=183] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=92, r=1720, u=10005, v=183] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=92, r=1537, u=10005, v=185] [L34] EXPR counter++ VAL [A=25010003, counter=93, r=1537, u=10005, v=185] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=93] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=93] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=93, r=1537, u=10005, v=185] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=93, r=1537, u=10005, v=185] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=93, r=1352, u=10005, v=187] [L34] EXPR counter++ VAL [A=25010003, counter=94, r=1352, u=10005, v=187] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=94] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=94] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=94, r=1352, u=10005, v=187] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=94, r=1352, u=10005, v=187] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=94, r=1165, u=10005, v=189] [L34] EXPR counter++ VAL [A=25010003, counter=95, r=1165, u=10005, v=189] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=95] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=95] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=95, r=1165, u=10005, v=189] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=95, r=1165, u=10005, v=189] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=95, r=976, u=10005, v=191] [L34] EXPR counter++ VAL [A=25010003, counter=96, r=976, u=10005, v=191] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=96] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=96] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=96, r=976, u=10005, v=191] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=96, r=976, u=10005, v=191] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=96, r=785, u=10005, v=193] [L34] EXPR counter++ VAL [A=25010003, counter=97, r=785, u=10005, v=193] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=97] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=97] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=97, r=785, u=10005, v=193] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=97, r=785, u=10005, v=193] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=97, r=592, u=10005, v=195] [L34] EXPR counter++ VAL [A=25010003, counter=98, r=592, u=10005, v=195] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=98] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=98] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=98, r=592, u=10005, v=195] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=98, r=592, u=10005, v=195] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=98, r=397, u=10005, v=197] [L34] EXPR counter++ VAL [A=25010003, counter=99, r=397, u=10005, v=197] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=99] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=99] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=99, r=397, u=10005, v=197] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=99, r=397, u=10005, v=197] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=99, r=200, u=10005, v=199] [L34] EXPR counter++ VAL [A=25010003, counter=100, r=200, u=10005, v=199] [L34] COND TRUE counter++<100 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=100] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, counter=100] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=25010003, counter=100, r=200, u=10005, v=199] [L36] COND FALSE !(!(r != 0)) VAL [A=25010003, counter=100, r=200, u=10005, v=199] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=25010003, counter=100, r=1, u=10005, v=201] [L34] EXPR counter++ VAL [A=25010003, counter=101, r=1, u=10005, v=201] [L34] COND FALSE !(counter++<100) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=101] [L12] COND TRUE !(cond) VAL [\old(cond)=0, counter=101] [L14] reach_error() VAL [\old(cond)=0, counter=101] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 63.1s, OverallIterations: 11, TraceHistogramMax: 101, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.1s, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1784 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1783 mSDsluCounter, 2351 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2152 mSDsCounter, 164 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1278 IncrementalHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 164 mSolverCounterUnsat, 199 mSDtfsCounter, 1278 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4327 GetRequests, 3654 SyntacticMatches, 92 SemanticMatches, 581 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17353 ImplicationChecksByTransitivity, 19.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=915occurred in iteration=10, InterpolantAutomatonStates: 583, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 10 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 17.1s SatisfiabilityAnalysisTime, 28.9s InterpolantComputationTime, 5357 NumberOfCodeBlocks, 5357 NumberOfCodeBlocksAsserted, 172 NumberOfCheckSat, 5204 ConstructedInterpolants, 0 QuantifiedInterpolants, 12539 SizeOfPredicates, 179 NumberOfNonLiveVariables, 4071 ConjunctsInSsa, 391 ConjunctsInUnsatCore, 24 InterpolantComputations, 3 PerfectInterpolantSequences, 46665/155802 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 RESULT: Ultimate proved your program to be incorrect! [2024-10-11 02:12:45,874 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE