./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_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 a367fffaabe322cc88315ee22f1c9c69606de0332ddd62ff36608ec1e5019dc8 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 02:21:22,646 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 02:21:22,723 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 02:21:22,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 02:21:22,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 02:21:22,770 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 02:21:22,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 02:21:22,771 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 02:21:22,772 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 02:21:22,773 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 02:21:22,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 02:21:22,782 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 02:21:22,782 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 02:21:22,783 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 02:21:22,783 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 02:21:22,783 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 02:21:22,784 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 02:21:22,784 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 02:21:22,784 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 02:21:22,785 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 02:21:22,785 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 02:21:22,786 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 02:21:22,786 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 02:21:22,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 02:21:22,787 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 02:21:22,787 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 02:21:22,787 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 02:21:22,788 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 02:21:22,788 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 02:21:22,788 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 02:21:22,789 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 02:21:22,789 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 02:21:22,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:21:22,789 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 02:21:22,790 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 02:21:22,790 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 02:21:22,790 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 02:21:22,791 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 02:21:22,791 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 02:21:22,791 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 02:21:22,791 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 02:21:22,792 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 02:21:22,792 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/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/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 -> a367fffaabe322cc88315ee22f1c9c69606de0332ddd62ff36608ec1e5019dc8 [2024-10-14 02:21:23,043 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 02:21:23,069 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 02:21:23,072 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 02:21:23,074 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 02:21:23,074 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 02:21:23,075 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2024-10-14 02:21:24,488 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 02:21:24,689 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 02:21:24,700 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2024-10-14 02:21:24,709 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4065b809/5e93db4facf54bae8221abb48c5be47d/FLAGd8e58bd8d [2024-10-14 02:21:25,069 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c4065b809/5e93db4facf54bae8221abb48c5be47d [2024-10-14 02:21:25,071 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 02:21:25,072 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 02:21:25,073 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 02:21:25,073 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 02:21:25,078 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 02:21:25,079 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:21:25" (1/1) ... [2024-10-14 02:21:25,080 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@570a495a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:25, skipping insertion in model container [2024-10-14 02:21:25,080 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 02:21:25" (1/1) ... [2024-10-14 02:21:25,103 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 02:21:25,257 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_unwindbound50.c[524,537] [2024-10-14 02:21:25,276 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:21:25,285 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 02:21:25,296 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_unwindbound50.c[524,537] [2024-10-14 02:21:25,305 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 02:21:25,321 INFO L204 MainTranslator]: Completed translation [2024-10-14 02:21:25,321 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:25 WrapperNode [2024-10-14 02:21:25,322 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 02:21:25,323 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 02:21:25,323 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 02:21:25,323 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 02:21:25,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:25" (1/1) ... [2024-10-14 02:21:25,338 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:25" (1/1) ... [2024-10-14 02:21:25,357 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2024-10-14 02:21:25,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 02:21:25,359 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 02:21:25,359 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 02:21:25,359 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 02:21:25,369 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:25" (1/1) ... [2024-10-14 02:21:25,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:25" (1/1) ... [2024-10-14 02:21:25,371 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:25" (1/1) ... [2024-10-14 02:21:25,387 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-14 02:21:25,388 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:25" (1/1) ... [2024-10-14 02:21:25,388 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:25" (1/1) ... [2024-10-14 02:21:25,391 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:25" (1/1) ... [2024-10-14 02:21:25,395 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:25" (1/1) ... [2024-10-14 02:21:25,397 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:25" (1/1) ... [2024-10-14 02:21:25,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:25" (1/1) ... [2024-10-14 02:21:25,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 02:21:25,403 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 02:21:25,403 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 02:21:25,404 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 02:21:25,404 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:25" (1/1) ... [2024-10-14 02:21:25,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 02:21:25,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:21:25,439 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 02:21:25,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 02:21:25,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 02:21:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 02:21:25,489 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 02:21:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 02:21:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 02:21:25,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 02:21:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 02:21:25,490 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 02:21:25,558 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 02:21:25,564 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 02:21:25,747 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2024-10-14 02:21:25,749 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 02:21:25,787 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 02:21:25,787 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 02:21:25,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:21:25 BoogieIcfgContainer [2024-10-14 02:21:25,788 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 02:21:25,791 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 02:21:25,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 02:21:25,795 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 02:21:25,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 02:21:25" (1/3) ... [2024-10-14 02:21:25,797 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3762c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:21:25, skipping insertion in model container [2024-10-14 02:21:25,797 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 02:21:25" (2/3) ... [2024-10-14 02:21:25,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3762c51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 02:21:25, skipping insertion in model container [2024-10-14 02:21:25,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:21:25" (3/3) ... [2024-10-14 02:21:25,799 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound50.c [2024-10-14 02:21:25,817 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 02:21:25,818 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 02:21:25,874 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 02:21:25,882 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;@532026c5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 02:21:25,883 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 02:21:25,887 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-14 02:21:25,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-10-14 02:21:25,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:21:25,897 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:21:25,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:21:25,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:21:25,902 INFO L85 PathProgramCache]: Analyzing trace with hash -1060579028, now seen corresponding path program 1 times [2024-10-14 02:21:25,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:21:25,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561492845] [2024-10-14 02:21:25,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:25,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:21:25,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:26,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:21:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:26,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:21:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:26,063 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-14 02:21:26,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:21:26,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561492845] [2024-10-14 02:21:26,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561492845] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:21:26,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:21:26,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 02:21:26,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745241051] [2024-10-14 02:21:26,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:21:26,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 02:21:26,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:21:26,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 02:21:26,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 02:21:26,094 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-14 02:21:26,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:21:26,113 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2024-10-14 02:21:26,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 02:21:26,115 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-14 02:21:26,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:21:26,121 INFO L225 Difference]: With dead ends: 42 [2024-10-14 02:21:26,121 INFO L226 Difference]: Without dead ends: 20 [2024-10-14 02:21:26,123 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-14 02:21:26,126 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-14 02:21:26,127 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-14 02:21:26,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-10-14 02:21:26,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-10-14 02:21:26,152 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-14 02:21:26,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2024-10-14 02:21:26,154 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 17 [2024-10-14 02:21:26,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:21:26,155 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2024-10-14 02:21:26,155 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-14 02:21:26,155 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2024-10-14 02:21:26,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 02:21:26,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:21:26,157 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:21:26,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 02:21:26,158 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:21:26,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:21:26,159 INFO L85 PathProgramCache]: Analyzing trace with hash -778881514, now seen corresponding path program 1 times [2024-10-14 02:21:26,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:21:26,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508859187] [2024-10-14 02:21:26,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:26,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:21:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:26,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:21:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:26,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:21:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:26,385 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-14 02:21:26,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:21:26,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508859187] [2024-10-14 02:21:26,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508859187] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:21:26,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:21:26,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 02:21:26,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543099381] [2024-10-14 02:21:26,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:21:26,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 02:21:26,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:21:26,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 02:21:26,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 02:21:26,392 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-14 02:21:26,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:21:26,414 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2024-10-14 02:21:26,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 02:21:26,415 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-14 02:21:26,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:21:26,416 INFO L225 Difference]: With dead ends: 29 [2024-10-14 02:21:26,416 INFO L226 Difference]: Without dead ends: 22 [2024-10-14 02:21:26,416 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-14 02:21:26,417 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-14 02:21:26,418 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-14 02:21:26,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-10-14 02:21:26,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2024-10-14 02:21:26,423 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-14 02:21:26,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2024-10-14 02:21:26,424 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 18 [2024-10-14 02:21:26,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:21:26,425 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2024-10-14 02:21:26,426 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-14 02:21:26,426 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2024-10-14 02:21:26,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-14 02:21:26,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:21:26,427 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:21:26,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 02:21:26,427 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:21:26,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:21:26,428 INFO L85 PathProgramCache]: Analyzing trace with hash -777094054, now seen corresponding path program 1 times [2024-10-14 02:21:26,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:21:26,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573726378] [2024-10-14 02:21:26,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:26,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:21:26,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 02:21:26,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [552041171] [2024-10-14 02:21:26,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:26,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:26,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:21:26,469 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:21:26,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 02:21:26,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:26,544 INFO L255 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-14 02:21:26,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:21:26,851 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-14 02:21:26,852 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 02:21:26,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:21:26,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573726378] [2024-10-14 02:21:26,853 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 02:21:26,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [552041171] [2024-10-14 02:21:26,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [552041171] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 02:21:26,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 02:21:26,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 02:21:26,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627546685] [2024-10-14 02:21:26,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 02:21:26,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 02:21:26,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:21:26,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 02:21:26,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 02:21:26,856 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-14 02:21:28,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2024-10-14 02:21:28,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:21:28,085 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2024-10-14 02:21:28,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 02:21:28,085 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-14 02:21:28,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:21:28,086 INFO L225 Difference]: With dead ends: 34 [2024-10-14 02:21:28,086 INFO L226 Difference]: Without dead ends: 32 [2024-10-14 02:21:28,086 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-14 02:21:28,087 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-14 02:21:28,088 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-14 02:21:28,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2024-10-14 02:21:28,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2024-10-14 02:21:28,094 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-14 02:21:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2024-10-14 02:21:28,095 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 18 [2024-10-14 02:21:28,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:21:28,096 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2024-10-14 02:21:28,096 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-14 02:21:28,096 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2024-10-14 02:21:28,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-14 02:21:28,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:21:28,097 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-14 02:21:28,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 02:21:28,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:28,302 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:21:28,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:21:28,303 INFO L85 PathProgramCache]: Analyzing trace with hash -331201790, now seen corresponding path program 1 times [2024-10-14 02:21:28,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:21:28,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284432398] [2024-10-14 02:21:28,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:28,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:21:28,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:28,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:21:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:28,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:21:28,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:28,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:21:28,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:28,661 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-14 02:21:28,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:21:28,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284432398] [2024-10-14 02:21:28,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284432398] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:21:28,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [541641751] [2024-10-14 02:21:28,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:28,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:28,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:21:28,665 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:21:28,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 02:21:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:28,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 02:21:28,721 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:21:28,809 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-14 02:21:28,810 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:21:28,957 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-14 02:21:28,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [541641751] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:21:28,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:21:28,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 12 [2024-10-14 02:21:28,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037795124] [2024-10-14 02:21:28,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:21:28,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 02:21:28,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:21:28,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 02:21:28,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-14 02:21:28,964 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-14 02:21:29,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:21:29,095 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-10-14 02:21:29,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 02:21:29,096 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-14 02:21:29,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:21:29,097 INFO L225 Difference]: With dead ends: 38 [2024-10-14 02:21:29,097 INFO L226 Difference]: Without dead ends: 33 [2024-10-14 02:21:29,098 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-14 02:21:29,099 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-14 02:21:29,099 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-14 02:21:29,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-10-14 02:21:29,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2024-10-14 02:21:29,113 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-14 02:21:29,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2024-10-14 02:21:29,114 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 24 [2024-10-14 02:21:29,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:21:29,114 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2024-10-14 02:21:29,114 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-14 02:21:29,115 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2024-10-14 02:21:29,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 02:21:29,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:21:29,120 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-14 02:21:29,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 02:21:29,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-14 02:21:29,321 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:21:29,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:21:29,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1584280999, now seen corresponding path program 1 times [2024-10-14 02:21:29,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:21:29,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237303028] [2024-10-14 02:21:29,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:29,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:21:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:29,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:21:29,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:29,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:21:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:29,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:21:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:29,465 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-14 02:21:29,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:21:29,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237303028] [2024-10-14 02:21:29,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237303028] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:21:29,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [748946724] [2024-10-14 02:21:29,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:29,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:29,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:21:29,469 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:21:29,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 02:21:29,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:29,517 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-14 02:21:29,519 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:21:29,571 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-14 02:21:29,571 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:21:29,622 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-14 02:21:29,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [748946724] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:21:29,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:21:29,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 5] total 10 [2024-10-14 02:21:29,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589185249] [2024-10-14 02:21:29,623 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:21:29,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 02:21:29,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:21:29,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 02:21:29,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-14 02:21:29,625 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-14 02:21:29,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:21:29,699 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2024-10-14 02:21:29,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 02:21:29,700 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-14 02:21:29,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:21:29,701 INFO L225 Difference]: With dead ends: 56 [2024-10-14 02:21:29,701 INFO L226 Difference]: Without dead ends: 51 [2024-10-14 02:21:29,702 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-14 02:21:29,702 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-14 02:21:29,703 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-14 02:21:29,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-14 02:21:29,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-14 02:21:29,720 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-14 02:21:29,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2024-10-14 02:21:29,723 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 27 [2024-10-14 02:21:29,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:21:29,723 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2024-10-14 02:21:29,723 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-14 02:21:29,723 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2024-10-14 02:21:29,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-10-14 02:21:29,726 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:21:29,726 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-14 02:21:29,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 02:21:29,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:29,927 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:21:29,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:21:29,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1262136106, now seen corresponding path program 2 times [2024-10-14 02:21:29,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:21:29,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688411190] [2024-10-14 02:21:29,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:29,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:21:29,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:30,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:21:30,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:30,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:21:30,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:30,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:21:30,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:30,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 02:21:30,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:30,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:21:30,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:30,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:21:30,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:30,102 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-14 02:21:30,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:21:30,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688411190] [2024-10-14 02:21:30,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688411190] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:21:30,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281977766] [2024-10-14 02:21:30,104 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 02:21:30,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:30,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:21:30,108 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:21:30,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 02:21:30,170 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 02:21:30,170 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 02:21:30,171 INFO L255 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-14 02:21:30,174 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:21:30,261 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-14 02:21:30,263 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:21:30,408 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-14 02:21:30,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281977766] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:21:30,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:21:30,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 8] total 16 [2024-10-14 02:21:30,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468170958] [2024-10-14 02:21:30,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:21:30,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-14 02:21:30,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:21:30,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-14 02:21:30,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2024-10-14 02:21:30,411 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-14 02:21:30,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:21:30,663 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2024-10-14 02:21:30,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-10-14 02:21:30,664 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-14 02:21:30,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:21:30,666 INFO L225 Difference]: With dead ends: 110 [2024-10-14 02:21:30,666 INFO L226 Difference]: Without dead ends: 105 [2024-10-14 02:21:30,666 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-14 02:21:30,667 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-14 02:21:30,667 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-14 02:21:30,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-10-14 02:21:30,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-10-14 02:21:30,700 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-14 02:21:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2024-10-14 02:21:30,701 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 54 [2024-10-14 02:21:30,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:21:30,702 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2024-10-14 02:21:30,702 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-14 02:21:30,702 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2024-10-14 02:21:30,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-14 02:21:30,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:21:30,704 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-14 02:21:30,722 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 02:21:30,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:30,909 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:21:30,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:21:30,909 INFO L85 PathProgramCache]: Analyzing trace with hash -254685450, now seen corresponding path program 3 times [2024-10-14 02:21:30,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:21:30,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386871597] [2024-10-14 02:21:30,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:30,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:21:30,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:31,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:21:31,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:31,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:21:31,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:31,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:21:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:31,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 02:21:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:31,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:21:31,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:31,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:21:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:31,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 02:21:31,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:31,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 02:21:31,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:31,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 02:21:31,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:31,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 02:21:31,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:31,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 02:21:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:31,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 02:21:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:31,403 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-14 02:21:31,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:21:31,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386871597] [2024-10-14 02:21:31,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386871597] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:21:31,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [799206362] [2024-10-14 02:21:31,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-14 02:21:31,405 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:31,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:21:31,407 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:21:31,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-14 02:21:31,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2024-10-14 02:21:31,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 02:21:31,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-14 02:21:31,682 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:21:31,863 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-14 02:21:31,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:21:32,216 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-14 02:21:32,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [799206362] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:21:32,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:21:32,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 28 [2024-10-14 02:21:32,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655417664] [2024-10-14 02:21:32,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:21:32,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-14 02:21:32,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:21:32,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-14 02:21:32,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2024-10-14 02:21:32,221 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-14 02:21:32,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:21:32,792 INFO L93 Difference]: Finished difference Result 218 states and 252 transitions. [2024-10-14 02:21:32,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2024-10-14 02:21:32,793 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-14 02:21:32,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:21:32,795 INFO L225 Difference]: With dead ends: 218 [2024-10-14 02:21:32,795 INFO L226 Difference]: Without dead ends: 213 [2024-10-14 02:21:32,797 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-14 02:21:32,800 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 136 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-14 02:21:32,800 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-14 02:21:32,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-10-14 02:21:32,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2024-10-14 02:21:32,873 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-14 02:21:32,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 236 transitions. [2024-10-14 02:21:32,874 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 236 transitions. Word has length 108 [2024-10-14 02:21:32,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:21:32,877 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 236 transitions. [2024-10-14 02:21:32,877 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-14 02:21:32,877 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 236 transitions. [2024-10-14 02:21:32,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-10-14 02:21:32,880 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:21:32,880 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-14 02:21:32,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-14 02:21:33,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:33,081 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:21:33,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:21:33,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1987984182, now seen corresponding path program 4 times [2024-10-14 02:21:33,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:21:33,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194581667] [2024-10-14 02:21:33,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:33,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:21:33,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:21:34,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:21:34,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:21:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 02:21:34,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:21:34,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:21:34,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 02:21:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 02:21:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 02:21:34,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 02:21:34,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 02:21:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 02:21:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 02:21:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 02:21:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 02:21:34,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 02:21:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 02:21:34,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 02:21:34,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 02:21:34,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 02:21:34,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-14 02:21:34,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 02:21:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-14 02:21:34,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-14 02:21:34,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:34,428 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-14 02:21:34,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:21:34,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194581667] [2024-10-14 02:21:34,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194581667] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:21:34,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583893038] [2024-10-14 02:21:34,429 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2024-10-14 02:21:34,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:34,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:21:34,432 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:21:34,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-14 02:21:34,556 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2024-10-14 02:21:34,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 02:21:34,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-14 02:21:34,569 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:21:34,850 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-14 02:21:34,851 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:21:35,946 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-14 02:21:35,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583893038] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:21:35,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:21:35,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 26] total 52 [2024-10-14 02:21:35,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14335865] [2024-10-14 02:21:35,947 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:21:35,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-10-14 02:21:35,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:21:35,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-10-14 02:21:35,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1230, Invalid=1422, Unknown=0, NotChecked=0, Total=2652 [2024-10-14 02:21:35,953 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-14 02:21:37,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:21:37,500 INFO L93 Difference]: Finished difference Result 434 states and 504 transitions. [2024-10-14 02:21:37,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2024-10-14 02:21:37,501 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-14 02:21:37,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:21:37,508 INFO L225 Difference]: With dead ends: 434 [2024-10-14 02:21:37,508 INFO L226 Difference]: Without dead ends: 429 [2024-10-14 02:21:37,512 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-14 02:21:37,512 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-14 02:21:37,513 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-14 02:21:37,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-10-14 02:21:37,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2024-10-14 02:21:37,579 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-14 02:21:37,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 476 transitions. [2024-10-14 02:21:37,581 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 476 transitions. Word has length 216 [2024-10-14 02:21:37,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:21:37,582 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 476 transitions. [2024-10-14 02:21:37,582 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-14 02:21:37,583 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 476 transitions. [2024-10-14 02:21:37,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2024-10-14 02:21:37,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:21:37,588 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-14 02:21:37,605 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-14 02:21:37,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:37,793 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:21:37,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:21:37,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1235022774, now seen corresponding path program 5 times [2024-10-14 02:21:37,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:21:37,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359691440] [2024-10-14 02:21:37,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:37,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:21:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-14 02:21:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-10-14 02:21:41,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-14 02:21:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-14 02:21:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-14 02:21:41,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-14 02:21:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-14 02:21:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-14 02:21:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 02:21:41,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-14 02:21:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-14 02:21:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-14 02:21:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-14 02:21:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-14 02:21:41,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-14 02:21:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-10-14 02:21:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2024-10-14 02:21:41,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-10-14 02:21:41,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2024-10-14 02:21:41,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-10-14 02:21:41,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2024-10-14 02:21:41,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2024-10-14 02:21:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2024-10-14 02:21:41,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2024-10-14 02:21:41,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2024-10-14 02:21:41,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 221 [2024-10-14 02:21:41,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2024-10-14 02:21:41,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2024-10-14 02:21:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2024-10-14 02:21:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2024-10-14 02:21:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2024-10-14 02:21:41,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2024-10-14 02:21:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2024-10-14 02:21:41,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2024-10-14 02:21:41,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2024-10-14 02:21:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2024-10-14 02:21:41,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2024-10-14 02:21:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 329 [2024-10-14 02:21:41,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 338 [2024-10-14 02:21:41,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 347 [2024-10-14 02:21:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2024-10-14 02:21:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2024-10-14 02:21:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 374 [2024-10-14 02:21:41,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 383 [2024-10-14 02:21:41,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 392 [2024-10-14 02:21:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 401 [2024-10-14 02:21:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 410 [2024-10-14 02:21:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 419 [2024-10-14 02:21:41,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 02:21:41,888 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-14 02:21:41,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 02:21:41,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359691440] [2024-10-14 02:21:41,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359691440] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 02:21:41,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [586131877] [2024-10-14 02:21:41,889 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2024-10-14 02:21:41,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:41,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:21:41,892 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:21:41,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-14 02:21:43,372 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2024-10-14 02:21:43,372 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 02:21:43,379 INFO L255 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-10-14 02:21:43,391 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 02:21:43,905 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-14 02:21:43,906 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 02:21:45,280 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-14 02:21:45,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [586131877] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 02:21:45,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 02:21:45,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 49, 50] total 56 [2024-10-14 02:21:45,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369959405] [2024-10-14 02:21:45,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 02:21:45,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2024-10-14 02:21:45,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 02:21:45,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2024-10-14 02:21:45,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1436, Invalid=1644, Unknown=0, NotChecked=0, Total=3080 [2024-10-14 02:21:45,287 INFO L87 Difference]: Start difference. First operand 429 states and 476 transitions. Second operand has 56 states, 56 states have (on average 6.392857142857143) internal successors, (358), 56 states have internal predecessors, (358), 52 states have call successors, (102), 49 states have call predecessors, (102), 48 states have return successors, (101), 51 states have call predecessors, (101), 51 states have call successors, (101) [2024-10-14 02:21:46,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 02:21:46,882 INFO L93 Difference]: Finished difference Result 470 states and 524 transitions. [2024-10-14 02:21:46,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2024-10-14 02:21:46,883 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 6.392857142857143) internal successors, (358), 56 states have internal predecessors, (358), 52 states have call successors, (102), 49 states have call predecessors, (102), 48 states have return successors, (101), 51 states have call predecessors, (101), 51 states have call successors, (101) Word has length 432 [2024-10-14 02:21:46,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 02:21:46,892 INFO L225 Difference]: With dead ends: 470 [2024-10-14 02:21:46,893 INFO L226 Difference]: Without dead ends: 465 [2024-10-14 02:21:46,898 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1056 GetRequests, 910 SyntacticMatches, 44 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2538 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3978, Invalid=6734, Unknown=0, NotChecked=0, Total=10712 [2024-10-14 02:21:46,899 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 176 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 02:21:46,900 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 377 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 02:21:46,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-10-14 02:21:46,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2024-10-14 02:21:46,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 360 states have (on average 1.1416666666666666) internal successors, (411), 360 states have internal predecessors, (411), 53 states have call successors, (53), 52 states have call predecessors, (53), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 02:21:46,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 516 transitions. [2024-10-14 02:21:46,953 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 516 transitions. Word has length 432 [2024-10-14 02:21:46,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 02:21:46,954 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 516 transitions. [2024-10-14 02:21:46,955 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 6.392857142857143) internal successors, (358), 56 states have internal predecessors, (358), 52 states have call successors, (102), 49 states have call predecessors, (102), 48 states have return successors, (101), 51 states have call predecessors, (101), 51 states have call successors, (101) [2024-10-14 02:21:46,955 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 516 transitions. [2024-10-14 02:21:46,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2024-10-14 02:21:46,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 02:21:46,964 INFO L215 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 02:21:46,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-14 02:21:47,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:47,169 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 02:21:47,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 02:21:47,170 INFO L85 PathProgramCache]: Analyzing trace with hash -866598282, now seen corresponding path program 6 times [2024-10-14 02:21:47,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 02:21:47,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213989862] [2024-10-14 02:21:47,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 02:21:47,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 02:21:47,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 02:21:47,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [368515174] [2024-10-14 02:21:47,466 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2024-10-14 02:21:47,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 02:21:47,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 02:21:47,468 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 02:21:47,469 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-14 02:21:48,443 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2024-10-14 02:21:48,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2024-10-14 02:21:48,444 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 02:21:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 02:21:48,695 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 02:21:48,695 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 02:21:48,696 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 02:21:48,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-14 02:21:48,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-14 02:21:48,902 INFO L407 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2024-10-14 02:21:49,050 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 02:21:49,055 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 02:21:49 BoogieIcfgContainer [2024-10-14 02:21:49,055 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 02:21:49,056 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 02:21:49,056 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 02:21:49,056 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 02:21:49,057 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 02:21:25" (3/4) ... [2024-10-14 02:21:49,058 INFO L133 WitnessPrinter]: Generating witness for reachability counterexample [2024-10-14 02:21:49,187 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 02:21:49,189 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 02:21:49,190 INFO L158 Benchmark]: Toolchain (without parser) took 24117.42ms. Allocated memory was 184.5MB in the beginning and 465.6MB in the end (delta: 281.0MB). Free memory was 155.9MB in the beginning and 364.3MB in the end (delta: -208.4MB). Peak memory consumption was 71.5MB. Max. memory is 16.1GB. [2024-10-14 02:21:49,190 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 127.9MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 02:21:49,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 248.97ms. Allocated memory is still 184.5MB. Free memory was 155.7MB in the beginning and 147.3MB in the end (delta: 8.3MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-10-14 02:21:49,190 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.57ms. Allocated memory is still 184.5MB. Free memory was 147.3MB in the beginning and 146.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 02:21:49,190 INFO L158 Benchmark]: Boogie Preprocessor took 43.65ms. Allocated memory is still 184.5MB. Free memory was 146.0MB in the beginning and 144.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 02:21:49,191 INFO L158 Benchmark]: RCFGBuilder took 385.03ms. Allocated memory is still 184.5MB. Free memory was 144.5MB in the beginning and 131.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 02:21:49,191 INFO L158 Benchmark]: TraceAbstraction took 23264.04ms. Allocated memory was 184.5MB in the beginning and 465.6MB in the end (delta: 281.0MB). Free memory was 131.4MB in the beginning and 380.0MB in the end (delta: -248.6MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. [2024-10-14 02:21:49,191 INFO L158 Benchmark]: Witness Printer took 133.39ms. Allocated memory is still 465.6MB. Free memory was 380.0MB in the beginning and 364.3MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 02:21:49,192 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 127.9MB. Free memory is still 92.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 248.97ms. Allocated memory is still 184.5MB. Free memory was 155.7MB in the beginning and 147.3MB in the end (delta: 8.3MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.57ms. Allocated memory is still 184.5MB. Free memory was 147.3MB in the beginning and 146.0MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 43.65ms. Allocated memory is still 184.5MB. Free memory was 146.0MB in the beginning and 144.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 385.03ms. Allocated memory is still 184.5MB. Free memory was 144.5MB in the beginning and 131.9MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 23264.04ms. Allocated memory was 184.5MB in the beginning and 465.6MB in the end (delta: 281.0MB). Free memory was 131.4MB in the beginning and 380.0MB in the end (delta: -248.6MB). Peak memory consumption was 33.4MB. Max. memory is 16.1GB. * Witness Printer took 133.39ms. Allocated memory is still 465.6MB. Free memory was 380.0MB in the beginning and 364.3MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. 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=1567507, R=1253, 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=1567507, R=1253, counter=0] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [A=1567507, counter=0, r=2502, u=2507, v=1] [L34] EXPR counter++ VAL [A=1567507, counter=1, r=2502, u=2507, v=1] [L34] COND TRUE counter++<50 [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=1567507, counter=1, r=2502, u=2507, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=1, r=2502, u=2507, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=1, r=2501, u=2507, v=3] [L34] EXPR counter++ VAL [A=1567507, counter=2, r=2501, u=2507, v=3] [L34] COND TRUE counter++<50 [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=1567507, counter=2, r=2501, u=2507, v=3] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=2, r=2501, u=2507, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=2, r=2498, u=2507, v=5] [L34] EXPR counter++ VAL [A=1567507, counter=3, r=2498, u=2507, v=5] [L34] COND TRUE counter++<50 [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=1567507, counter=3, r=2498, u=2507, v=5] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=3, r=2498, u=2507, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=3, r=2493, u=2507, v=7] [L34] EXPR counter++ VAL [A=1567507, counter=4, r=2493, u=2507, v=7] [L34] COND TRUE counter++<50 [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=1567507, counter=4, r=2493, u=2507, v=7] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=4, r=2493, u=2507, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=4, r=2486, u=2507, v=9] [L34] EXPR counter++ VAL [A=1567507, counter=5, r=2486, u=2507, v=9] [L34] COND TRUE counter++<50 [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=1567507, counter=5, r=2486, u=2507, v=9] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=5, r=2486, u=2507, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=5, r=2477, u=2507, v=11] [L34] EXPR counter++ VAL [A=1567507, counter=6, r=2477, u=2507, v=11] [L34] COND TRUE counter++<50 [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=1567507, counter=6, r=2477, u=2507, v=11] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=6, r=2477, u=2507, v=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=6, r=2466, u=2507, v=13] [L34] EXPR counter++ VAL [A=1567507, counter=7, r=2466, u=2507, v=13] [L34] COND TRUE counter++<50 [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=1567507, counter=7, r=2466, u=2507, v=13] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=7, r=2466, u=2507, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=7, r=2453, u=2507, v=15] [L34] EXPR counter++ VAL [A=1567507, counter=8, r=2453, u=2507, v=15] [L34] COND TRUE counter++<50 [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=1567507, counter=8, r=2453, u=2507, v=15] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=8, r=2453, u=2507, v=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=8, r=2438, u=2507, v=17] [L34] EXPR counter++ VAL [A=1567507, counter=9, r=2438, u=2507, v=17] [L34] COND TRUE counter++<50 [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=1567507, counter=9, r=2438, u=2507, v=17] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=9, r=2438, u=2507, v=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=9, r=2421, u=2507, v=19] [L34] EXPR counter++ VAL [A=1567507, counter=10, r=2421, u=2507, v=19] [L34] COND TRUE counter++<50 [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=1567507, counter=10, r=2421, u=2507, v=19] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=10, r=2421, u=2507, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=10, r=2402, u=2507, v=21] [L34] EXPR counter++ VAL [A=1567507, counter=11, r=2402, u=2507, v=21] [L34] COND TRUE counter++<50 [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=1567507, counter=11, r=2402, u=2507, v=21] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=11, r=2402, u=2507, v=21] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=11, r=2381, u=2507, v=23] [L34] EXPR counter++ VAL [A=1567507, counter=12, r=2381, u=2507, v=23] [L34] COND TRUE counter++<50 [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=1567507, counter=12, r=2381, u=2507, v=23] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=12, r=2381, u=2507, v=23] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=12, r=2358, u=2507, v=25] [L34] EXPR counter++ VAL [A=1567507, counter=13, r=2358, u=2507, v=25] [L34] COND TRUE counter++<50 [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=1567507, counter=13, r=2358, u=2507, v=25] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=13, r=2358, u=2507, v=25] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=13, r=2333, u=2507, v=27] [L34] EXPR counter++ VAL [A=1567507, counter=14, r=2333, u=2507, v=27] [L34] COND TRUE counter++<50 [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=1567507, counter=14, r=2333, u=2507, v=27] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=14, r=2333, u=2507, v=27] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=14, r=2306, u=2507, v=29] [L34] EXPR counter++ VAL [A=1567507, counter=15, r=2306, u=2507, v=29] [L34] COND TRUE counter++<50 [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=1567507, counter=15, r=2306, u=2507, v=29] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=15, r=2306, u=2507, v=29] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=15, r=2277, u=2507, v=31] [L34] EXPR counter++ VAL [A=1567507, counter=16, r=2277, u=2507, v=31] [L34] COND TRUE counter++<50 [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=1567507, counter=16, r=2277, u=2507, v=31] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=16, r=2277, u=2507, v=31] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=16, r=2246, u=2507, v=33] [L34] EXPR counter++ VAL [A=1567507, counter=17, r=2246, u=2507, v=33] [L34] COND TRUE counter++<50 [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=1567507, counter=17, r=2246, u=2507, v=33] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=17, r=2246, u=2507, v=33] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=17, r=2213, u=2507, v=35] [L34] EXPR counter++ VAL [A=1567507, counter=18, r=2213, u=2507, v=35] [L34] COND TRUE counter++<50 [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=1567507, counter=18, r=2213, u=2507, v=35] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=18, r=2213, u=2507, v=35] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=18, r=2178, u=2507, v=37] [L34] EXPR counter++ VAL [A=1567507, counter=19, r=2178, u=2507, v=37] [L34] COND TRUE counter++<50 [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=1567507, counter=19, r=2178, u=2507, v=37] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=19, r=2178, u=2507, v=37] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=19, r=2141, u=2507, v=39] [L34] EXPR counter++ VAL [A=1567507, counter=20, r=2141, u=2507, v=39] [L34] COND TRUE counter++<50 [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=1567507, counter=20, r=2141, u=2507, v=39] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=20, r=2141, u=2507, v=39] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=20, r=2102, u=2507, v=41] [L34] EXPR counter++ VAL [A=1567507, counter=21, r=2102, u=2507, v=41] [L34] COND TRUE counter++<50 [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=1567507, counter=21, r=2102, u=2507, v=41] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=21, r=2102, u=2507, v=41] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=21, r=2061, u=2507, v=43] [L34] EXPR counter++ VAL [A=1567507, counter=22, r=2061, u=2507, v=43] [L34] COND TRUE counter++<50 [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=1567507, counter=22, r=2061, u=2507, v=43] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=22, r=2061, u=2507, v=43] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=22, r=2018, u=2507, v=45] [L34] EXPR counter++ VAL [A=1567507, counter=23, r=2018, u=2507, v=45] [L34] COND TRUE counter++<50 [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=1567507, counter=23, r=2018, u=2507, v=45] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=23, r=2018, u=2507, v=45] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=23, r=1973, u=2507, v=47] [L34] EXPR counter++ VAL [A=1567507, counter=24, r=1973, u=2507, v=47] [L34] COND TRUE counter++<50 [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=1567507, counter=24, r=1973, u=2507, v=47] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=24, r=1973, u=2507, v=47] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=24, r=1926, u=2507, v=49] [L34] EXPR counter++ VAL [A=1567507, counter=25, r=1926, u=2507, v=49] [L34] COND TRUE counter++<50 [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=1567507, counter=25, r=1926, u=2507, v=49] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=25, r=1926, u=2507, v=49] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=25, r=1877, u=2507, v=51] [L34] EXPR counter++ VAL [A=1567507, counter=26, r=1877, u=2507, v=51] [L34] COND TRUE counter++<50 [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=1567507, counter=26, r=1877, u=2507, v=51] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=26, r=1877, u=2507, v=51] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=26, r=1826, u=2507, v=53] [L34] EXPR counter++ VAL [A=1567507, counter=27, r=1826, u=2507, v=53] [L34] COND TRUE counter++<50 [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=1567507, counter=27, r=1826, u=2507, v=53] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=27, r=1826, u=2507, v=53] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=27, r=1773, u=2507, v=55] [L34] EXPR counter++ VAL [A=1567507, counter=28, r=1773, u=2507, v=55] [L34] COND TRUE counter++<50 [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=1567507, counter=28, r=1773, u=2507, v=55] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=28, r=1773, u=2507, v=55] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=28, r=1718, u=2507, v=57] [L34] EXPR counter++ VAL [A=1567507, counter=29, r=1718, u=2507, v=57] [L34] COND TRUE counter++<50 [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=1567507, counter=29, r=1718, u=2507, v=57] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=29, r=1718, u=2507, v=57] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=29, r=1661, u=2507, v=59] [L34] EXPR counter++ VAL [A=1567507, counter=30, r=1661, u=2507, v=59] [L34] COND TRUE counter++<50 [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=1567507, counter=30, r=1661, u=2507, v=59] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=30, r=1661, u=2507, v=59] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=30, r=1602, u=2507, v=61] [L34] EXPR counter++ VAL [A=1567507, counter=31, r=1602, u=2507, v=61] [L34] COND TRUE counter++<50 [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=1567507, counter=31, r=1602, u=2507, v=61] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=31, r=1602, u=2507, v=61] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=31, r=1541, u=2507, v=63] [L34] EXPR counter++ VAL [A=1567507, counter=32, r=1541, u=2507, v=63] [L34] COND TRUE counter++<50 [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=1567507, counter=32, r=1541, u=2507, v=63] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=32, r=1541, u=2507, v=63] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=32, r=1478, u=2507, v=65] [L34] EXPR counter++ VAL [A=1567507, counter=33, r=1478, u=2507, v=65] [L34] COND TRUE counter++<50 [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=1567507, counter=33, r=1478, u=2507, v=65] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=33, r=1478, u=2507, v=65] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=33, r=1413, u=2507, v=67] [L34] EXPR counter++ VAL [A=1567507, counter=34, r=1413, u=2507, v=67] [L34] COND TRUE counter++<50 [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=1567507, counter=34, r=1413, u=2507, v=67] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=34, r=1413, u=2507, v=67] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=34, r=1346, u=2507, v=69] [L34] EXPR counter++ VAL [A=1567507, counter=35, r=1346, u=2507, v=69] [L34] COND TRUE counter++<50 [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=1567507, counter=35, r=1346, u=2507, v=69] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=35, r=1346, u=2507, v=69] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=35, r=1277, u=2507, v=71] [L34] EXPR counter++ VAL [A=1567507, counter=36, r=1277, u=2507, v=71] [L34] COND TRUE counter++<50 [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=1567507, counter=36, r=1277, u=2507, v=71] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=36, r=1277, u=2507, v=71] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=36, r=1206, u=2507, v=73] [L34] EXPR counter++ VAL [A=1567507, counter=37, r=1206, u=2507, v=73] [L34] COND TRUE counter++<50 [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=1567507, counter=37, r=1206, u=2507, v=73] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=37, r=1206, u=2507, v=73] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=37, r=1133, u=2507, v=75] [L34] EXPR counter++ VAL [A=1567507, counter=38, r=1133, u=2507, v=75] [L34] COND TRUE counter++<50 [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=1567507, counter=38, r=1133, u=2507, v=75] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=38, r=1133, u=2507, v=75] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=38, r=1058, u=2507, v=77] [L34] EXPR counter++ VAL [A=1567507, counter=39, r=1058, u=2507, v=77] [L34] COND TRUE counter++<50 [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=1567507, counter=39, r=1058, u=2507, v=77] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=39, r=1058, u=2507, v=77] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=39, r=981, u=2507, v=79] [L34] EXPR counter++ VAL [A=1567507, counter=40, r=981, u=2507, v=79] [L34] COND TRUE counter++<50 [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=1567507, counter=40, r=981, u=2507, v=79] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=40, r=981, u=2507, v=79] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=40, r=902, u=2507, v=81] [L34] EXPR counter++ VAL [A=1567507, counter=41, r=902, u=2507, v=81] [L34] COND TRUE counter++<50 [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=1567507, counter=41, r=902, u=2507, v=81] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=41, r=902, u=2507, v=81] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=41, r=821, u=2507, v=83] [L34] EXPR counter++ VAL [A=1567507, counter=42, r=821, u=2507, v=83] [L34] COND TRUE counter++<50 [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=1567507, counter=42, r=821, u=2507, v=83] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=42, r=821, u=2507, v=83] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=42, r=738, u=2507, v=85] [L34] EXPR counter++ VAL [A=1567507, counter=43, r=738, u=2507, v=85] [L34] COND TRUE counter++<50 [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=1567507, counter=43, r=738, u=2507, v=85] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=43, r=738, u=2507, v=85] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=43, r=653, u=2507, v=87] [L34] EXPR counter++ VAL [A=1567507, counter=44, r=653, u=2507, v=87] [L34] COND TRUE counter++<50 [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=1567507, counter=44, r=653, u=2507, v=87] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=44, r=653, u=2507, v=87] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=44, r=566, u=2507, v=89] [L34] EXPR counter++ VAL [A=1567507, counter=45, r=566, u=2507, v=89] [L34] COND TRUE counter++<50 [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=1567507, counter=45, r=566, u=2507, v=89] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=45, r=566, u=2507, v=89] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=45, r=477, u=2507, v=91] [L34] EXPR counter++ VAL [A=1567507, counter=46, r=477, u=2507, v=91] [L34] COND TRUE counter++<50 [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=1567507, counter=46, r=477, u=2507, v=91] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=46, r=477, u=2507, v=91] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=46, r=386, u=2507, v=93] [L34] EXPR counter++ VAL [A=1567507, counter=47, r=386, u=2507, v=93] [L34] COND TRUE counter++<50 [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=1567507, counter=47, r=386, u=2507, v=93] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=47, r=386, u=2507, v=93] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=47, r=293, u=2507, v=95] [L34] EXPR counter++ VAL [A=1567507, counter=48, r=293, u=2507, v=95] [L34] COND TRUE counter++<50 [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=1567507, counter=48, r=293, u=2507, v=95] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=48, r=293, u=2507, v=95] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=48, r=198, u=2507, v=97] [L34] EXPR counter++ VAL [A=1567507, counter=49, r=198, u=2507, v=97] [L34] COND TRUE counter++<50 [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=1567507, counter=49, r=198, u=2507, v=97] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=49, r=198, u=2507, v=97] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=49, r=101, u=2507, v=99] [L34] EXPR counter++ VAL [A=1567507, counter=50, r=101, u=2507, v=99] [L34] COND TRUE counter++<50 [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=1567507, counter=50, r=101, u=2507, v=99] [L36] COND FALSE !(!(r != 0)) VAL [A=1567507, counter=50, r=101, u=2507, v=99] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1567507, counter=50, r=2, u=2507, v=101] [L34] EXPR counter++ VAL [A=1567507, counter=51, r=2, u=2507, v=101] [L34] COND FALSE !(counter++<50) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=51] [L12] COND TRUE !(cond) VAL [\old(cond)=0, counter=51] [L14] reach_error() VAL [\old(cond)=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 23.0s, OverallIterations: 10, TraceHistogramMax: 51, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 5.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 732 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 731 mSDsluCounter, 1422 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1243 mSDsCounter, 62 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 709 IncrementalHoareTripleChecker+Invalid, 771 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 62 mSolverCounterUnsat, 179 mSDtfsCounter, 709 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2169 GetRequests, 1832 SyntacticMatches, 46 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4366 ImplicationChecksByTransitivity, 6.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=465occurred in iteration=9, InterpolantAutomatonStates: 293, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 3.3s SatisfiabilityAnalysisTime, 11.3s InterpolantComputationTime, 2729 NumberOfCodeBlocks, 2729 NumberOfCodeBlocksAsserted, 126 NumberOfCheckSat, 2615 ConstructedInterpolants, 0 QuantifiedInterpolants, 6328 SizeOfPredicates, 85 NumberOfNonLiveVariables, 2126 ConjunctsInSsa, 200 ConjunctsInUnsatCore, 21 InterpolantComputations, 3 PerfectInterpolantSequences, 11121/36645 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-14 02:21:49,228 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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