./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c4f91361 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 ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-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 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c --- Real Ultimate output --- This is Ultimate 0.2.3-dev-c4f9136-m [2023-11-23 14:47:56,609 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 14:47:56,689 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-23 14:47:56,694 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 14:47:56,694 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 14:47:56,716 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 14:47:56,716 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 14:47:56,717 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 14:47:56,717 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-23 14:47:56,720 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-23 14:47:56,721 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 14:47:56,721 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 14:47:56,722 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 14:47:56,723 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 14:47:56,723 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 14:47:56,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 14:47:56,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-23 14:47:56,724 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 14:47:56,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 14:47:56,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 14:47:56,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 14:47:56,725 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-23 14:47:56,725 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 14:47:56,725 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-23 14:47:56,725 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 14:47:56,725 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-23 14:47:56,726 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 14:47:56,726 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 14:47:56,726 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 14:47:56,726 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 14:47:56,727 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 14:47:56,727 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 14:47:56,728 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 14:47:56,729 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 14:47:56,729 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-23 14:47:56,729 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 14:47:56,729 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 14:47:56,729 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 14:47:56,729 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 14:47:56,730 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-23 14:47:56,730 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 14:47:56,730 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 14:47:56,730 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 -> 0bb6ea6333d2c4e133ad252fe2bcbc17b832f383e2bb5defb402851de157204c [2023-11-23 14:47:56,979 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 14:47:56,999 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 14:47:57,001 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 14:47:57,002 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 14:47:57,002 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 14:47:57,004 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2023-11-23 14:47:58,171 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 14:47:58,360 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 14:47:58,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2023-11-23 14:47:58,369 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68fa8550c/16c5de427b394eb2ad7727adbcf441e1/FLAG4c36c02ca [2023-11-23 14:47:58,386 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/68fa8550c/16c5de427b394eb2ad7727adbcf441e1 [2023-11-23 14:47:58,388 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 14:47:58,389 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 14:47:58,391 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 14:47:58,391 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 14:47:58,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 14:47:58,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:47:58" (1/1) ... [2023-11-23 14:47:58,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@92f7ef2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:58, skipping insertion in model container [2023-11-23 14:47:58,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:47:58" (1/1) ... [2023-11-23 14:47:58,418 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 14:47:58,551 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2023-11-23 14:47:58,574 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 14:47:58,585 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 14:47:58,596 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound50.c[597,610] [2023-11-23 14:47:58,615 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 14:47:58,626 INFO L206 MainTranslator]: Completed translation [2023-11-23 14:47:58,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:58 WrapperNode [2023-11-23 14:47:58,628 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 14:47:58,629 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 14:47:58,629 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 14:47:58,629 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 14:47:58,635 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:58" (1/1) ... [2023-11-23 14:47:58,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:58" (1/1) ... [2023-11-23 14:47:58,660 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-11-23 14:47:58,661 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 14:47:58,661 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 14:47:58,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 14:47:58,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 14:47:58,670 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:58" (1/1) ... [2023-11-23 14:47:58,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:58" (1/1) ... [2023-11-23 14:47:58,679 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:58" (1/1) ... [2023-11-23 14:47:58,695 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]. [2023-11-23 14:47:58,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:58" (1/1) ... [2023-11-23 14:47:58,696 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:58" (1/1) ... [2023-11-23 14:47:58,706 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:58" (1/1) ... [2023-11-23 14:47:58,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:58" (1/1) ... [2023-11-23 14:47:58,710 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:58" (1/1) ... [2023-11-23 14:47:58,711 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:58" (1/1) ... [2023-11-23 14:47:58,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 14:47:58,716 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 14:47:58,716 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 14:47:58,716 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 14:47:58,717 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:58" (1/1) ... [2023-11-23 14:47:58,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 14:47:58,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:47:58,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 14:47:58,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 14:47:58,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 14:47:58,794 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-23 14:47:58,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 14:47:58,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 14:47:58,794 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-11-23 14:47:58,794 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-11-23 14:47:58,839 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 14:47:58,841 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 14:47:59,004 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 14:47:59,029 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 14:47:59,029 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-23 14:47:59,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:47:59 BoogieIcfgContainer [2023-11-23 14:47:59,030 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 14:47:59,032 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 14:47:59,032 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 14:47:59,035 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 14:47:59,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:47:58" (1/3) ... [2023-11-23 14:47:59,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e878762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:47:59, skipping insertion in model container [2023-11-23 14:47:59,036 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:47:58" (2/3) ... [2023-11-23 14:47:59,038 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e878762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:47:59, skipping insertion in model container [2023-11-23 14:47:59,038 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:47:59" (3/3) ... [2023-11-23 14:47:59,039 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2023-11-23 14:47:59,052 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 14:47:59,053 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-23 14:47:59,100 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 14:47:59,107 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@999dbd5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 14:47:59,108 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-23 14:47:59,111 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 14:47:59,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-23 14:47:59,119 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:47:59,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:47:59,120 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:47:59,125 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:47:59,125 INFO L85 PathProgramCache]: Analyzing trace with hash -26250642, now seen corresponding path program 1 times [2023-11-23 14:47:59,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:47:59,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680415441] [2023-11-23 14:47:59,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:47:59,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:47:59,203 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-23 14:47:59,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1380378331] [2023-11-23 14:47:59,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:47:59,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:47:59,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:47:59,237 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) [2023-11-23 14:47:59,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-23 14:47:59,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:47:59,293 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2023-11-23 14:47:59,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:47:59,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 14:47:59,478 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-23 14:47:59,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:47:59,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680415441] [2023-11-23 14:47:59,479 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-23 14:47:59,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1380378331] [2023-11-23 14:47:59,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1380378331] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 14:47:59,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 14:47:59,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 14:47:59,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515991489] [2023-11-23 14:47:59,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 14:47:59,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 14:47:59,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:47:59,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 14:47:59,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 14:47:59,515 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 14:47:59,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:47:59,653 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2023-11-23 14:47:59,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 14:47:59,655 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-23 14:47:59,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:47:59,660 INFO L225 Difference]: With dead ends: 46 [2023-11-23 14:47:59,661 INFO L226 Difference]: Without dead ends: 24 [2023-11-23 14:47:59,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-23 14:47:59,666 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 14:47:59,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 41 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 14:47:59,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-11-23 14:47:59,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2023-11-23 14:47:59,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 14:47:59,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-11-23 14:47:59,756 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 7 [2023-11-23 14:47:59,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:47:59,756 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-11-23 14:47:59,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 14:47:59,757 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-11-23 14:47:59,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-23 14:47:59,758 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:47:59,759 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:47:59,773 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-23 14:47:59,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-11-23 14:47:59,966 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:47:59,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:47:59,967 INFO L85 PathProgramCache]: Analyzing trace with hash -479331439, now seen corresponding path program 1 times [2023-11-23 14:47:59,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:47:59,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927942720] [2023-11-23 14:47:59,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:47:59,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:47:59,976 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-23 14:47:59,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [745268722] [2023-11-23 14:47:59,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:47:59,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:47:59,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:47:59,978 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) [2023-11-23 14:47:59,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-23 14:48:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:48:00,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-23 14:48:00,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:48:00,174 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 14:48:00,174 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:48:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-23 14:48:00,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:48:00,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927942720] [2023-11-23 14:48:00,271 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-23 14:48:00,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745268722] [2023-11-23 14:48:00,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745268722] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 14:48:00,272 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 14:48:00,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2023-11-23 14:48:00,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398485980] [2023-11-23 14:48:00,273 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 14:48:00,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-23 14:48:00,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:48:00,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-23 14:48:00,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-23 14:48:00,275 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 14:48:00,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:48:00,444 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2023-11-23 14:48:00,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-23 14:48:00,444 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-11-23 14:48:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:48:00,445 INFO L225 Difference]: With dead ends: 40 [2023-11-23 14:48:00,446 INFO L226 Difference]: Without dead ends: 33 [2023-11-23 14:48:00,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2023-11-23 14:48:00,447 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 20 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 14:48:00,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 70 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 14:48:00,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-11-23 14:48:00,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-11-23 14:48:00,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 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) [2023-11-23 14:48:00,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-11-23 14:48:00,454 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 17 [2023-11-23 14:48:00,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:48:00,455 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-11-23 14:48:00,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 10 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 14:48:00,455 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-11-23 14:48:00,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-11-23 14:48:00,456 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:48:00,456 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:48:00,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-23 14:48:00,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-11-23 14:48:00,669 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:48:00,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:48:00,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1366888132, now seen corresponding path program 1 times [2023-11-23 14:48:00,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:48:00,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985865835] [2023-11-23 14:48:00,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:48:00,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:48:00,678 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-23 14:48:00,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [361458559] [2023-11-23 14:48:00,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:48:00,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:48:00,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:48:00,694 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) [2023-11-23 14:48:00,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-23 14:48:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:48:00,732 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 14:48:00,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:48:00,766 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 14:48:00,766 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:48:00,800 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 14:48:00,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:48:00,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985865835] [2023-11-23 14:48:00,800 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-23 14:48:00,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [361458559] [2023-11-23 14:48:00,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [361458559] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 14:48:00,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 14:48:00,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-11-23 14:48:00,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004788172] [2023-11-23 14:48:00,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 14:48:00,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-23 14:48:00,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:48:00,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-23 14:48:00,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-23 14:48:00,803 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 14:48:00,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:48:00,877 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2023-11-23 14:48:00,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 14:48:00,877 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-11-23 14:48:00,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:48:00,878 INFO L225 Difference]: With dead ends: 72 [2023-11-23 14:48:00,878 INFO L226 Difference]: Without dead ends: 66 [2023-11-23 14:48:00,879 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-11-23 14:48:00,879 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 27 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 14:48:00,880 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 74 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 14:48:00,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-11-23 14:48:00,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2023-11-23 14:48:00,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-23 14:48:00,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2023-11-23 14:48:00,889 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 18 [2023-11-23 14:48:00,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:48:00,889 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2023-11-23 14:48:00,890 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-23 14:48:00,890 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2023-11-23 14:48:00,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-23 14:48:00,890 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:48:00,891 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:48:00,902 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-23 14:48:01,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:48:01,103 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:48:01,103 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:48:01,103 INFO L85 PathProgramCache]: Analyzing trace with hash -382706270, now seen corresponding path program 1 times [2023-11-23 14:48:01,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:48:01,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196969809] [2023-11-23 14:48:01,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:48:01,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:48:01,111 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-23 14:48:01,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1456341321] [2023-11-23 14:48:01,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:48:01,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:48:01,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:48:01,113 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) [2023-11-23 14:48:01,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-23 14:48:01,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:48:01,149 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 30 conjunts are in the unsatisfiable core [2023-11-23 14:48:01,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:48:01,371 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 14:48:01,371 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:48:01,887 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-23 14:48:01,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:48:01,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196969809] [2023-11-23 14:48:01,888 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-23 14:48:01,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456341321] [2023-11-23 14:48:01,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456341321] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 14:48:01,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 14:48:01,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 21 [2023-11-23 14:48:01,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946473692] [2023-11-23 14:48:01,888 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 14:48:01,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-23 14:48:01,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:48:01,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-23 14:48:01,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2023-11-23 14:48:01,889 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 21 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 19 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 14:48:03,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:48:03,441 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2023-11-23 14:48:03,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-23 14:48:03,442 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 19 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 24 [2023-11-23 14:48:03,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:48:03,443 INFO L225 Difference]: With dead ends: 83 [2023-11-23 14:48:03,443 INFO L226 Difference]: Without dead ends: 75 [2023-11-23 14:48:03,443 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=181, Invalid=749, Unknown=0, NotChecked=0, Total=930 [2023-11-23 14:48:03,444 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 21 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-23 14:48:03,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 110 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-23 14:48:03,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-23 14:48:03,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2023-11-23 14:48:03,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 58 states have (on average 1.1551724137931034) internal successors, (67), 58 states have internal predecessors, (67), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-11-23 14:48:03,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 82 transitions. [2023-11-23 14:48:03,464 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 82 transitions. Word has length 24 [2023-11-23 14:48:03,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:48:03,465 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 82 transitions. [2023-11-23 14:48:03,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 17 states have (on average 1.8235294117647058) internal successors, (31), 19 states have internal predecessors, (31), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 14:48:03,465 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 82 transitions. [2023-11-23 14:48:03,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-23 14:48:03,466 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:48:03,466 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-23 14:48:03,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-23 14:48:03,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:48:03,680 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:48:03,680 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:48:03,681 INFO L85 PathProgramCache]: Analyzing trace with hash 506464861, now seen corresponding path program 1 times [2023-11-23 14:48:03,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:48:03,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394722133] [2023-11-23 14:48:03,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:48:03,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:48:03,689 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-23 14:48:03,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1909288511] [2023-11-23 14:48:03,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:48:03,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:48:03,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:48:03,691 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) [2023-11-23 14:48:03,705 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-23 14:48:03,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:48:03,730 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-23 14:48:03,731 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:48:03,850 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 14:48:03,851 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:48:03,956 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-11-23 14:48:03,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:48:03,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394722133] [2023-11-23 14:48:03,957 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-23 14:48:03,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1909288511] [2023-11-23 14:48:03,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1909288511] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 14:48:03,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 14:48:03,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 15 [2023-11-23 14:48:03,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021643181] [2023-11-23 14:48:03,961 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 14:48:03,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-23 14:48:03,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:48:03,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-23 14:48:03,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2023-11-23 14:48:03,962 INFO L87 Difference]: Start difference. First operand 72 states and 82 transitions. Second operand has 15 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 14:48:04,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:48:04,091 INFO L93 Difference]: Finished difference Result 90 states and 104 transitions. [2023-11-23 14:48:04,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 14:48:04,091 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 34 [2023-11-23 14:48:04,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:48:04,095 INFO L225 Difference]: With dead ends: 90 [2023-11-23 14:48:04,095 INFO L226 Difference]: Without dead ends: 84 [2023-11-23 14:48:04,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=244, Unknown=0, NotChecked=0, Total=306 [2023-11-23 14:48:04,097 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 26 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 14:48:04,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 75 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 14:48:04,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2023-11-23 14:48:04,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2023-11-23 14:48:04,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 67 states have (on average 1.164179104477612) internal successors, (78), 67 states have internal predecessors, (78), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-23 14:48:04,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 95 transitions. [2023-11-23 14:48:04,120 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 95 transitions. Word has length 34 [2023-11-23 14:48:04,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:48:04,120 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 95 transitions. [2023-11-23 14:48:04,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 11 states have (on average 2.272727272727273) internal successors, (25), 14 states have internal predecessors, (25), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 14:48:04,121 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 95 transitions. [2023-11-23 14:48:04,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-23 14:48:04,122 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:48:04,122 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:48:04,150 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-23 14:48:04,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:48:04,335 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:48:04,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:48:04,336 INFO L85 PathProgramCache]: Analyzing trace with hash -598180516, now seen corresponding path program 1 times [2023-11-23 14:48:04,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:48:04,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331511152] [2023-11-23 14:48:04,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:48:04,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:48:04,358 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-23 14:48:04,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [258843759] [2023-11-23 14:48:04,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:48:04,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:48:04,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:48:04,360 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) [2023-11-23 14:48:04,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-23 14:48:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:48:04,426 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 38 conjunts are in the unsatisfiable core [2023-11-23 14:48:04,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:48:05,000 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 17 proven. 33 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-11-23 14:48:05,000 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:48:05,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:48:05,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331511152] [2023-11-23 14:48:05,362 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-23 14:48:05,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [258843759] [2023-11-23 14:48:05,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [258843759] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-23 14:48:05,362 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-11-23 14:48:05,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2023-11-23 14:48:05,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194882876] [2023-11-23 14:48:05,364 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-11-23 14:48:05,365 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 14:48:05,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:48:05,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 14:48:05,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2023-11-23 14:48:05,366 INFO L87 Difference]: Start difference. First operand 82 states and 95 transitions. Second operand has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 14:48:05,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:48:05,623 INFO L93 Difference]: Finished difference Result 118 states and 140 transitions. [2023-11-23 14:48:05,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-23 14:48:05,624 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 44 [2023-11-23 14:48:05,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:48:05,625 INFO L225 Difference]: With dead ends: 118 [2023-11-23 14:48:05,625 INFO L226 Difference]: Without dead ends: 94 [2023-11-23 14:48:05,625 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=100, Invalid=452, Unknown=0, NotChecked=0, Total=552 [2023-11-23 14:48:05,626 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 8 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 14:48:05,626 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 106 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 14:48:05,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-23 14:48:05,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 88. [2023-11-23 14:48:05,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 72 states have (on average 1.1527777777777777) internal successors, (83), 72 states have internal predecessors, (83), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-23 14:48:05,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 102 transitions. [2023-11-23 14:48:05,643 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 102 transitions. Word has length 44 [2023-11-23 14:48:05,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:48:05,645 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 102 transitions. [2023-11-23 14:48:05,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-11-23 14:48:05,645 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 102 transitions. [2023-11-23 14:48:05,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-23 14:48:05,646 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:48:05,647 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:48:05,663 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-23 14:48:05,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:48:05,860 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:48:05,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:48:05,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1582734628, now seen corresponding path program 2 times [2023-11-23 14:48:05,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:48:05,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499674141] [2023-11-23 14:48:05,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:48:05,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:48:05,886 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-23 14:48:05,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [454210692] [2023-11-23 14:48:05,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 14:48:05,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:48:05,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:48:05,896 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) [2023-11-23 14:48:05,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-23 14:48:05,941 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 14:48:05,941 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 14:48:05,942 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-23 14:48:05,945 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:48:05,973 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 16 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2023-11-23 14:48:05,974 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:48:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 22 proven. 16 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-23 14:48:06,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:48:06,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499674141] [2023-11-23 14:48:06,013 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-23 14:48:06,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454210692] [2023-11-23 14:48:06,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454210692] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 14:48:06,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 14:48:06,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2023-11-23 14:48:06,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181808534] [2023-11-23 14:48:06,014 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 14:48:06,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 14:48:06,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:48:06,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 14:48:06,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-23 14:48:06,015 INFO L87 Difference]: Start difference. First operand 88 states and 102 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-23 14:48:06,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:48:06,064 INFO L93 Difference]: Finished difference Result 123 states and 146 transitions. [2023-11-23 14:48:06,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 14:48:06,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2023-11-23 14:48:06,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:48:06,065 INFO L225 Difference]: With dead ends: 123 [2023-11-23 14:48:06,065 INFO L226 Difference]: Without dead ends: 99 [2023-11-23 14:48:06,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 81 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-23 14:48:06,066 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 14:48:06,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 67 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 14:48:06,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-23 14:48:06,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 97. [2023-11-23 14:48:06,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 79 states have (on average 1.1518987341772151) internal successors, (91), 79 states have internal predecessors, (91), 12 states have call successors, (12), 6 states have call predecessors, (12), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-11-23 14:48:06,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2023-11-23 14:48:06,090 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 44 [2023-11-23 14:48:06,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:48:06,090 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2023-11-23 14:48:06,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 6 states have internal predecessors, (33), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2023-11-23 14:48:06,091 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2023-11-23 14:48:06,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2023-11-23 14:48:06,092 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:48:06,092 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:48:06,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-11-23 14:48:06,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:48:06,304 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:48:06,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:48:06,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1442186018, now seen corresponding path program 3 times [2023-11-23 14:48:06,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:48:06,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16628491] [2023-11-23 14:48:06,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:48:06,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:48:06,311 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-23 14:48:06,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [292106128] [2023-11-23 14:48:06,312 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 14:48:06,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:48:06,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:48:06,322 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) [2023-11-23 14:48:06,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-23 14:48:06,389 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-23 14:48:06,389 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 14:48:06,390 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-23 14:48:06,392 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:48:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-23 14:48:06,495 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:48:06,631 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 32 proven. 1 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2023-11-23 14:48:06,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:48:06,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16628491] [2023-11-23 14:48:06,632 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-23 14:48:06,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292106128] [2023-11-23 14:48:06,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [292106128] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 14:48:06,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 14:48:06,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 18 [2023-11-23 14:48:06,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546218565] [2023-11-23 14:48:06,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 14:48:06,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-23 14:48:06,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:48:06,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-23 14:48:06,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2023-11-23 14:48:06,634 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand has 18 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 14:48:06,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:48:06,899 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2023-11-23 14:48:06,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-23 14:48:06,899 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 44 [2023-11-23 14:48:06,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:48:06,900 INFO L225 Difference]: With dead ends: 104 [2023-11-23 14:48:06,900 INFO L226 Difference]: Without dead ends: 98 [2023-11-23 14:48:06,900 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=579, Unknown=0, NotChecked=0, Total=702 [2023-11-23 14:48:06,901 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 25 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 14:48:06,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 69 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 14:48:06,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-23 14:48:06,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 83. [2023-11-23 14:48:06,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 67 states have (on average 1.1044776119402986) internal successors, (74), 67 states have internal predecessors, (74), 10 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-11-23 14:48:06,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 93 transitions. [2023-11-23 14:48:06,914 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 93 transitions. Word has length 44 [2023-11-23 14:48:06,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:48:06,914 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 93 transitions. [2023-11-23 14:48:06,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.0714285714285716) internal successors, (29), 15 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 14:48:06,914 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 93 transitions. [2023-11-23 14:48:06,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-11-23 14:48:06,915 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:48:06,915 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-11-23 14:48:06,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-23 14:48:07,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-11-23 14:48:07,122 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:48:07,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:48:07,122 INFO L85 PathProgramCache]: Analyzing trace with hash 2080125809, now seen corresponding path program 1 times [2023-11-23 14:48:07,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:48:07,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258869251] [2023-11-23 14:48:07,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:48:07,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:48:07,128 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-23 14:48:07,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1378008750] [2023-11-23 14:48:07,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:48:07,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:48:07,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:48:07,129 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 14:48:07,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-23 14:48:07,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:48:07,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-23 14:48:07,241 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:48:07,298 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 14:48:07,298 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:48:07,378 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-23 14:48:07,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:48:07,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258869251] [2023-11-23 14:48:07,379 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-23 14:48:07,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378008750] [2023-11-23 14:48:07,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378008750] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 14:48:07,379 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 14:48:07,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-11-23 14:48:07,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124656483] [2023-11-23 14:48:07,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 14:48:07,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-23 14:48:07,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:48:07,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-23 14:48:07,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-11-23 14:48:07,381 INFO L87 Difference]: Start difference. First operand 83 states and 93 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-23 14:48:07,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:48:07,498 INFO L93 Difference]: Finished difference Result 149 states and 170 transitions. [2023-11-23 14:48:07,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-23 14:48:07,498 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 48 [2023-11-23 14:48:07,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:48:07,499 INFO L225 Difference]: With dead ends: 149 [2023-11-23 14:48:07,499 INFO L226 Difference]: Without dead ends: 143 [2023-11-23 14:48:07,500 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2023-11-23 14:48:07,500 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 59 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-23 14:48:07,500 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 109 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-23 14:48:07,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-23 14:48:07,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2023-11-23 14:48:07,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 115 states have (on average 1.1130434782608696) internal successors, (128), 115 states have internal predecessors, (128), 16 states have call successors, (16), 12 states have call predecessors, (16), 11 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2023-11-23 14:48:07,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 159 transitions. [2023-11-23 14:48:07,517 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 159 transitions. Word has length 48 [2023-11-23 14:48:07,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:48:07,518 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 159 transitions. [2023-11-23 14:48:07,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-11-23 14:48:07,518 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 159 transitions. [2023-11-23 14:48:07,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-11-23 14:48:07,519 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:48:07,519 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2023-11-23 14:48:07,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-23 14:48:07,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:48:07,731 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:48:07,732 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:48:07,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1893266719, now seen corresponding path program 2 times [2023-11-23 14:48:07,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:48:07,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898669831] [2023-11-23 14:48:07,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:48:07,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:48:07,739 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-23 14:48:07,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1969110061] [2023-11-23 14:48:07,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 14:48:07,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:48:07,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:48:07,740 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 14:48:07,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-23 14:48:07,806 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 14:48:07,806 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 14:48:07,807 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-23 14:48:07,811 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:48:07,975 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 14:48:07,976 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:48:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-11-23 14:48:08,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:48:08,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898669831] [2023-11-23 14:48:08,285 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-23 14:48:08,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969110061] [2023-11-23 14:48:08,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969110061] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 14:48:08,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 14:48:08,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2023-11-23 14:48:08,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893410666] [2023-11-23 14:48:08,286 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 14:48:08,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-23 14:48:08,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:48:08,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-23 14:48:08,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2023-11-23 14:48:08,287 INFO L87 Difference]: Start difference. First operand 143 states and 159 transitions. Second operand has 26 states, 26 states have (on average 5.5) internal successors, (143), 26 states have internal predecessors, (143), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-23 14:48:08,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:48:08,658 INFO L93 Difference]: Finished difference Result 269 states and 308 transitions. [2023-11-23 14:48:08,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-11-23 14:48:08,658 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.5) internal successors, (143), 26 states have internal predecessors, (143), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Word has length 108 [2023-11-23 14:48:08,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:48:08,663 INFO L225 Difference]: With dead ends: 269 [2023-11-23 14:48:08,663 INFO L226 Difference]: Without dead ends: 263 [2023-11-23 14:48:08,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2023-11-23 14:48:08,665 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 126 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 14:48:08,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 208 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 14:48:08,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2023-11-23 14:48:08,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2023-11-23 14:48:08,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 263 states, 211 states have (on average 1.1184834123222749) internal successors, (236), 211 states have internal predecessors, (236), 28 states have call successors, (28), 24 states have call predecessors, (28), 23 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2023-11-23 14:48:08,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 291 transitions. [2023-11-23 14:48:08,708 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 291 transitions. Word has length 108 [2023-11-23 14:48:08,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:48:08,709 INFO L495 AbstractCegarLoop]: Abstraction has 263 states and 291 transitions. [2023-11-23 14:48:08,710 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.5) internal successors, (143), 26 states have internal predecessors, (143), 21 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-11-23 14:48:08,710 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 291 transitions. [2023-11-23 14:48:08,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-11-23 14:48:08,714 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:48:08,715 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2023-11-23 14:48:08,730 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-11-23 14:48:08,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-11-23 14:48:08,928 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:48:08,928 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:48:08,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1650934405, now seen corresponding path program 3 times [2023-11-23 14:48:08,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:48:08,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956406226] [2023-11-23 14:48:08,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:48:08,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:48:08,950 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-23 14:48:08,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1179795617] [2023-11-23 14:48:08,952 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 14:48:08,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:48:08,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:48:08,953 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 14:48:08,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-23 14:48:09,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-23 14:48:09,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 14:48:09,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 22 conjunts are in the unsatisfiable core [2023-11-23 14:48:09,034 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:48:09,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 234 proven. 1 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2023-11-23 14:48:09,259 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:48:09,535 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 106 proven. 129 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2023-11-23 14:48:09,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:48:09,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956406226] [2023-11-23 14:48:09,536 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-23 14:48:09,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179795617] [2023-11-23 14:48:09,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179795617] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 14:48:09,536 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 14:48:09,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 17 [2023-11-23 14:48:09,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458338588] [2023-11-23 14:48:09,537 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 14:48:09,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-11-23 14:48:09,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:48:09,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-11-23 14:48:09,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2023-11-23 14:48:09,538 INFO L87 Difference]: Start difference. First operand 263 states and 291 transitions. Second operand has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 16 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 14:48:09,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:48:09,730 INFO L93 Difference]: Finished difference Result 466 states and 512 transitions. [2023-11-23 14:48:09,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-23 14:48:09,730 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 16 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 228 [2023-11-23 14:48:09,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:48:09,732 INFO L225 Difference]: With dead ends: 466 [2023-11-23 14:48:09,732 INFO L226 Difference]: Without dead ends: 460 [2023-11-23 14:48:09,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 436 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2023-11-23 14:48:09,734 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 21 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-23 14:48:09,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 70 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-23 14:48:09,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2023-11-23 14:48:09,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 457. [2023-11-23 14:48:09,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 366 states have (on average 1.1202185792349726) internal successors, (410), 366 states have internal predecessors, (410), 47 states have call successors, (47), 44 states have call predecessors, (47), 43 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-11-23 14:48:09,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 503 transitions. [2023-11-23 14:48:09,789 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 503 transitions. Word has length 228 [2023-11-23 14:48:09,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:48:09,790 INFO L495 AbstractCegarLoop]: Abstraction has 457 states and 503 transitions. [2023-11-23 14:48:09,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 16 states have internal predecessors, (31), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-23 14:48:09,790 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 503 transitions. [2023-11-23 14:48:09,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-11-23 14:48:09,792 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:48:09,792 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:48:09,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-11-23 14:48:10,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-23 14:48:10,015 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:48:10,015 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:48:10,015 INFO L85 PathProgramCache]: Analyzing trace with hash -970876035, now seen corresponding path program 1 times [2023-11-23 14:48:10,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:48:10,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273101975] [2023-11-23 14:48:10,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:48:10,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:48:10,034 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-23 14:48:10,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1593355752] [2023-11-23 14:48:10,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:48:10,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:48:10,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:48:10,035 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 14:48:10,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-23 14:48:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 14:48:10,147 INFO L262 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-23 14:48:10,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:48:10,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 14:48:10,547 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:48:11,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 1430 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-11-23 14:48:11,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:48:11,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273101975] [2023-11-23 14:48:11,291 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-23 14:48:11,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593355752] [2023-11-23 14:48:11,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593355752] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 14:48:11,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 14:48:11,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2023-11-23 14:48:11,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409177798] [2023-11-23 14:48:11,291 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 14:48:11,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-11-23 14:48:11,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:48:11,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-11-23 14:48:11,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2023-11-23 14:48:11,294 INFO L87 Difference]: Start difference. First operand 457 states and 503 transitions. Second operand has 50 states, 50 states have (on average 5.98) internal successors, (299), 50 states have internal predecessors, (299), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-23 14:48:12,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:48:12,378 INFO L93 Difference]: Finished difference Result 946 states and 1063 transitions. [2023-11-23 14:48:12,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-11-23 14:48:12,378 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.98) internal successors, (299), 50 states have internal predecessors, (299), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) Word has length 228 [2023-11-23 14:48:12,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:48:12,381 INFO L225 Difference]: With dead ends: 946 [2023-11-23 14:48:12,381 INFO L226 Difference]: Without dead ends: 940 [2023-11-23 14:48:12,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 406 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2023-11-23 14:48:12,383 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 300 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 14:48:12,383 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 389 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 14:48:12,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 940 states. [2023-11-23 14:48:12,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 940 to 937. [2023-11-23 14:48:12,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 750 states have (on average 1.1226666666666667) internal successors, (842), 750 states have internal predecessors, (842), 95 states have call successors, (95), 92 states have call predecessors, (95), 91 states have return successors, (94), 94 states have call predecessors, (94), 94 states have call successors, (94) [2023-11-23 14:48:12,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1031 transitions. [2023-11-23 14:48:12,493 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1031 transitions. Word has length 228 [2023-11-23 14:48:12,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:48:12,493 INFO L495 AbstractCegarLoop]: Abstraction has 937 states and 1031 transitions. [2023-11-23 14:48:12,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.98) internal successors, (299), 50 states have internal predecessors, (299), 45 states have call successors, (45), 24 states have call predecessors, (45), 23 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2023-11-23 14:48:12,494 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1031 transitions. [2023-11-23 14:48:12,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2023-11-23 14:48:12,499 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:48:12,499 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 45, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:48:12,528 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-11-23 14:48:12,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-23 14:48:12,711 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:48:12,711 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:48:12,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1917042635, now seen corresponding path program 2 times [2023-11-23 14:48:12,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:48:12,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065393809] [2023-11-23 14:48:12,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:48:12,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:48:12,736 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-23 14:48:12,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [786833835] [2023-11-23 14:48:12,736 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-23 14:48:12,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:48:12,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:48:12,738 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 14:48:12,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-23 14:48:12,935 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-23 14:48:12,935 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-23 14:48:12,943 INFO L262 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 95 conjunts are in the unsatisfiable core [2023-11-23 14:48:12,952 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-23 14:48:14,142 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 14:48:14,143 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-23 14:48:15,423 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 6302 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2023-11-23 14:48:15,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 14:48:15,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065393809] [2023-11-23 14:48:15,424 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-23 14:48:15,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786833835] [2023-11-23 14:48:15,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786833835] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-23 14:48:15,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-23 14:48:15,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2023-11-23 14:48:15,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801790461] [2023-11-23 14:48:15,424 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-23 14:48:15,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-11-23 14:48:15,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 14:48:15,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-11-23 14:48:15,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2023-11-23 14:48:15,427 INFO L87 Difference]: Start difference. First operand 937 states and 1031 transitions. Second operand has 54 states, 54 states have (on average 7.351851851851852) internal successors, (397), 54 states have internal predecessors, (397), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) [2023-11-23 14:48:16,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-23 14:48:16,927 INFO L93 Difference]: Finished difference Result 1026 states and 1131 transitions. [2023-11-23 14:48:16,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-11-23 14:48:16,928 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 7.351851851851852) internal successors, (397), 54 states have internal predecessors, (397), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) Word has length 468 [2023-11-23 14:48:16,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-23 14:48:16,931 INFO L225 Difference]: With dead ends: 1026 [2023-11-23 14:48:16,931 INFO L226 Difference]: Without dead ends: 1020 [2023-11-23 14:48:16,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 983 GetRequests, 838 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2023-11-23 14:48:16,934 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 175 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-23 14:48:16,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 412 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-23 14:48:16,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2023-11-23 14:48:17,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 1017. [2023-11-23 14:48:17,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1017 states, 814 states have (on average 1.1228501228501229) internal successors, (914), 814 states have internal predecessors, (914), 103 states have call successors, (103), 100 states have call predecessors, (103), 99 states have return successors, (102), 102 states have call predecessors, (102), 102 states have call successors, (102) [2023-11-23 14:48:17,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1017 states to 1017 states and 1119 transitions. [2023-11-23 14:48:17,041 INFO L78 Accepts]: Start accepts. Automaton has 1017 states and 1119 transitions. Word has length 468 [2023-11-23 14:48:17,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-23 14:48:17,042 INFO L495 AbstractCegarLoop]: Abstraction has 1017 states and 1119 transitions. [2023-11-23 14:48:17,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 7.351851851851852) internal successors, (397), 54 states have internal predecessors, (397), 50 states have call successors, (93), 48 states have call predecessors, (93), 47 states have return successors, (92), 49 states have call predecessors, (92), 49 states have call successors, (92) [2023-11-23 14:48:17,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1017 states and 1119 transitions. [2023-11-23 14:48:17,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2023-11-23 14:48:17,048 INFO L187 NwaCegarLoop]: Found error trace [2023-11-23 14:48:17,048 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 14:48:17,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-11-23 14:48:17,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-23 14:48:17,261 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-23 14:48:17,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 14:48:17,262 INFO L85 PathProgramCache]: Analyzing trace with hash 2091126185, now seen corresponding path program 3 times [2023-11-23 14:48:17,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 14:48:17,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62623603] [2023-11-23 14:48:17,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 14:48:17,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 14:48:17,291 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-23 14:48:17,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1989915982] [2023-11-23 14:48:17,292 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-23 14:48:17,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:48:17,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-11-23 14:48:17,299 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-23 14:48:17,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-23 14:48:18,736 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2023-11-23 14:48:18,736 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-23 14:48:18,736 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 14:48:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 14:48:19,099 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 14:48:19,099 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 14:48:19,100 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-11-23 14:48:19,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-11-23 14:48:19,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-23 14:48:19,328 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 3, 1, 1, 1, 1, 1] [2023-11-23 14:48:19,331 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 14:48:19,385 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,387 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,388 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,389 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,389 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,390 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,391 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,392 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,393 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,393 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,394 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,395 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,396 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,396 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,397 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,398 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,399 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,399 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,400 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,401 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,402 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,403 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,414 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,415 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,415 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,416 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,416 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,416 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,417 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,418 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,419 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,419 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,419 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,420 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,421 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,422 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,423 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,424 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,473 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:48:19 BoogieIcfgContainer [2023-11-23 14:48:19,473 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 14:48:19,473 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 14:48:19,473 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 14:48:19,473 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 14:48:19,474 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:47:59" (3/4) ... [2023-11-23 14:48:19,474 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-23 14:48:19,493 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,493 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,493 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,494 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,494 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,494 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,496 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,496 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,496 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,497 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,497 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,498 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,499 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,499 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,499 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,499 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,501 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,501 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,501 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,502 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,502 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,502 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,502 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,502 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,502 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,503 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,503 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,503 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,503 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,503 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,505 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,505 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,505 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,505 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,506 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,506 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,506 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,506 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,506 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,507 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,507 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,507 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,507 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,507 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,508 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,508 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,508 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated [2023-11-23 14:48:19,597 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2023-11-23 14:48:19,597 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 14:48:19,597 INFO L158 Benchmark]: Toolchain (without parser) took 21208.37ms. Allocated memory was 157.3MB in the beginning and 285.2MB in the end (delta: 127.9MB). Free memory was 124.5MB in the beginning and 192.3MB in the end (delta: -67.8MB). Peak memory consumption was 59.4MB. Max. memory is 16.1GB. [2023-11-23 14:48:19,598 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 125.8MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 14:48:19,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 237.13ms. Allocated memory is still 157.3MB. Free memory was 124.5MB in the beginning and 113.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-23 14:48:19,598 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.90ms. Allocated memory is still 157.3MB. Free memory was 113.5MB in the beginning and 112.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 14:48:19,599 INFO L158 Benchmark]: Boogie Preprocessor took 53.01ms. Allocated memory is still 157.3MB. Free memory was 112.1MB in the beginning and 110.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 14:48:19,599 INFO L158 Benchmark]: RCFGBuilder took 314.61ms. Allocated memory is still 157.3MB. Free memory was 110.6MB in the beginning and 98.8MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-23 14:48:19,599 INFO L158 Benchmark]: TraceAbstraction took 20441.42ms. Allocated memory was 157.3MB in the beginning and 285.2MB in the end (delta: 127.9MB). Free memory was 98.0MB in the beginning and 213.3MB in the end (delta: -115.3MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB. [2023-11-23 14:48:19,599 INFO L158 Benchmark]: Witness Printer took 123.74ms. Allocated memory is still 285.2MB. Free memory was 213.3MB in the beginning and 192.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2023-11-23 14:48:19,601 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.17ms. Allocated memory is still 125.8MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 237.13ms. Allocated memory is still 157.3MB. Free memory was 124.5MB in the beginning and 113.5MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.90ms. Allocated memory is still 157.3MB. Free memory was 113.5MB in the beginning and 112.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.01ms. Allocated memory is still 157.3MB. Free memory was 112.1MB in the beginning and 110.6MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 314.61ms. Allocated memory is still 157.3MB. Free memory was 110.6MB in the beginning and 98.8MB in the end (delta: 11.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 20441.42ms. Allocated memory was 157.3MB in the beginning and 285.2MB in the end (delta: 127.9MB). Free memory was 98.0MB in the beginning and 213.3MB in the end (delta: -115.3MB). Peak memory consumption was 141.2MB. Max. memory is 16.1GB. * Witness Printer took 123.74ms. Allocated memory is still 285.2MB. Free memory was 213.3MB in the beginning and 192.3MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~post6 could not be translated - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [X=100, Y=1, counter=0, v=-98, x=0, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=1, v=-98, x=0, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=1, v=-98, x=0, x=0, x=0, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=1, v=-98, x=0, x=0, x=0, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=1, v=-98, x=0, x=0, x=0, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=1, v=-96, x=0, x=0, x=0, y=0] [L45] x++ VAL [X=100, Y=1, counter=1, v=-96, x=0, x=0, x=1, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=2, v=-96, x=0, x=0, x=1, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=2, v=-96, x=0, x=1, x=1, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=2, v=-96, x=0, x=1, x=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=2, v=-96, x=0, x=1, x=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=2, v=-94, x=0, x=1, x=1, y=0] [L45] x++ VAL [X=100, Y=1, counter=2, v=-94, x=0, x=1, x=2, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=3, v=-94, x=0, x=1, x=2, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=3, v=-94, x=0, x=2, x=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=3, v=-94, x=0, x=2, x=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=3, v=-94, x=0, x=2, x=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=3, v=-92, x=0, x=2, x=2, y=0] [L45] x++ VAL [X=100, Y=1, counter=3, v=-92, x=0, x=2, x=3, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=4, v=-92, x=0, x=2, x=3, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=4, v=-92, x=0, x=3, x=3, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=4, v=-92, x=0, x=3, x=3, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=4, v=-92, x=0, x=3, x=3, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=4, v=-90, x=0, x=3, x=3, y=0] [L45] x++ VAL [X=100, Y=1, counter=4, v=-90, x=0, x=3, x=4, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=5, v=-90, x=0, x=3, x=4, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=5, v=-90, x=0, x=4, x=4, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=5, v=-90, x=0, x=4, x=4, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=5, v=-90, x=0, x=4, x=4, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=5, v=-88, x=0, x=4, x=4, y=0] [L45] x++ VAL [X=100, Y=1, counter=5, v=-88, x=0, x=4, x=5, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=6, v=-88, x=0, x=4, x=5, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=6, v=-88, x=0, x=5, x=5, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=6, v=-88, x=0, x=5, x=5, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=6, v=-88, x=0, x=5, x=5, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=6, v=-86, x=0, x=5, x=5, y=0] [L45] x++ VAL [X=100, Y=1, counter=6, v=-86, x=0, x=5, x=6, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=7, v=-86, x=0, x=5, x=6, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=7, v=-86, x=0, x=6, x=6, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=7, v=-86, x=0, x=6, x=6, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=7, v=-86, x=0, x=6, x=6, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=7, v=-84, x=0, x=6, x=6, y=0] [L45] x++ VAL [X=100, Y=1, counter=7, v=-84, x=0, x=6, x=7, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=8, v=-84, x=0, x=6, x=7, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=8, v=-84, x=0, x=7, x=7, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=8, v=-84, x=0, x=7, x=7, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=8, v=-84, x=0, x=7, x=7, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=8, v=-82, x=0, x=7, x=7, y=0] [L45] x++ VAL [X=100, Y=1, counter=8, v=-82, x=0, x=7, x=8, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=9, v=-82, x=0, x=7, x=8, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=9, v=-82, x=0, x=8, x=8, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=9, v=-82, x=0, x=8, x=8, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=9, v=-82, x=0, x=8, x=8, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=9, v=-80, x=0, x=8, x=8, y=0] [L45] x++ VAL [X=100, Y=1, counter=9, v=-80, x=0, x=8, x=9, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=10, v=-80, x=0, x=8, x=9, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=10, v=-80, x=0, x=9, x=9, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=10, v=-80, x=0, x=9, x=9, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=10, v=-80, x=0, x=9, x=9, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=10, v=-78, x=0, x=9, x=9, y=0] [L45] x++ VAL [X=100, Y=1, counter=10, v=-78, x=0, x=10, x=9, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=11, v=-78, x=0, x=10, x=9, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=11, v=-78, x=0, x=10, x=10, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=11, v=-78, x=0, x=10, x=10, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=11, v=-78, x=0, x=10, x=10, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=11, v=-76, x=0, x=10, x=10, y=0] [L45] x++ VAL [X=100, Y=1, counter=11, v=-76, x=0, x=10, x=11, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=12, v=-76, x=0, x=10, x=11, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=12, v=-76, x=0, x=11, x=11, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=12, v=-76, x=0, x=11, x=11, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=12, v=-76, x=0, x=11, x=11, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=12, v=-74, x=0, x=11, x=11, y=0] [L45] x++ VAL [X=100, Y=1, counter=12, v=-74, x=0, x=11, x=12, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=13, v=-74, x=0, x=11, x=12, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=13, v=-74, x=0, x=12, x=12, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=13, v=-74, x=0, x=12, x=12, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=13, v=-74, x=0, x=12, x=12, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=13, v=-72, x=0, x=12, x=12, y=0] [L45] x++ VAL [X=100, Y=1, counter=13, v=-72, x=0, x=12, x=13, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=14, v=-72, x=0, x=12, x=13, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=14, v=-72, x=0, x=13, x=13, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=14, v=-72, x=0, x=13, x=13, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=14, v=-72, x=0, x=13, x=13, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=14, v=-70, x=0, x=13, x=13, y=0] [L45] x++ VAL [X=100, Y=1, counter=14, v=-70, x=0, x=13, x=14, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=15, v=-70, x=0, x=13, x=14, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=15, v=-70, x=0, x=14, x=14, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=15, v=-70, x=0, x=14, x=14, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=15, v=-70, x=0, x=14, x=14, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=15, v=-68, x=0, x=14, x=14, y=0] [L45] x++ VAL [X=100, Y=1, counter=15, v=-68, x=0, x=14, x=15, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=16, v=-68, x=0, x=14, x=15, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=16, v=-68, x=0, x=15, x=15, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=16, v=-68, x=0, x=15, x=15, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=16, v=-68, x=0, x=15, x=15, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=16, v=-66, x=0, x=15, x=15, y=0] [L45] x++ VAL [X=100, Y=1, counter=16, v=-66, x=0, x=15, x=16, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=17, v=-66, x=0, x=15, x=16, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=17, v=-66, x=0, x=16, x=16, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=17, v=-66, x=0, x=16, x=16, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=17, v=-66, x=0, x=16, x=16, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=17, v=-64, x=0, x=16, x=16, y=0] [L45] x++ VAL [X=100, Y=1, counter=17, v=-64, x=0, x=16, x=17, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=18, v=-64, x=0, x=16, x=17, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=18, v=-64, x=0, x=17, x=17, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=18, v=-64, x=0, x=17, x=17, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=18, v=-64, x=0, x=17, x=17, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=18, v=-62, x=0, x=17, x=17, y=0] [L45] x++ VAL [X=100, Y=1, counter=18, v=-62, x=0, x=17, x=18, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=19, v=-62, x=0, x=17, x=18, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=19, v=-62, x=0, x=18, x=18, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=19, v=-62, x=0, x=18, x=18, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=19, v=-62, x=0, x=18, x=18, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=19, v=-60, x=0, x=18, x=18, y=0] [L45] x++ VAL [X=100, Y=1, counter=19, v=-60, x=0, x=18, x=19, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=20, v=-60, x=0, x=18, x=19, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=20, v=-60, x=0, x=19, x=19, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=20, v=-60, x=0, x=19, x=19, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=20, v=-60, x=0, x=19, x=19, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=20, v=-58, x=0, x=19, x=19, y=0] [L45] x++ VAL [X=100, Y=1, counter=20, v=-58, x=0, x=19, x=20, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=21, v=-58, x=0, x=19, x=20, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=21, v=-58, x=0, x=20, x=20, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=21] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=21, v=-58, x=0, x=20, x=20, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=21, v=-58, x=0, x=20, x=20, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=21, v=-56, x=0, x=20, x=20, y=0] [L45] x++ VAL [X=100, Y=1, counter=21, v=-56, x=0, x=20, x=21, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=22, v=-56, x=0, x=20, x=21, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=22, v=-56, x=0, x=21, x=21, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=22] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=22, v=-56, x=0, x=21, x=21, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=22, v=-56, x=0, x=21, x=21, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=22, v=-54, x=0, x=21, x=21, y=0] [L45] x++ VAL [X=100, Y=1, counter=22, v=-54, x=0, x=21, x=22, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=23, v=-54, x=0, x=21, x=22, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=23, v=-54, x=0, x=22, x=22, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=23] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=23, v=-54, x=0, x=22, x=22, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=23, v=-54, x=0, x=22, x=22, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=23, v=-52, x=0, x=22, x=22, y=0] [L45] x++ VAL [X=100, Y=1, counter=23, v=-52, x=0, x=22, x=23, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=24, v=-52, x=0, x=22, x=23, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=24, v=-52, x=0, x=23, x=23, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=24] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=24, v=-52, x=0, x=23, x=23, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=24, v=-52, x=0, x=23, x=23, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=24, v=-50, x=0, x=23, x=23, y=0] [L45] x++ VAL [X=100, Y=1, counter=24, v=-50, x=0, x=23, x=24, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=25, v=-50, x=0, x=23, x=24, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=25, v=-50, x=0, x=24, x=24, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=25] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=25, v=-50, x=0, x=24, x=24, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=25, v=-50, x=0, x=24, x=24, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=25, v=-48, x=0, x=24, x=24, y=0] [L45] x++ VAL [X=100, Y=1, counter=25, v=-48, x=0, x=24, x=25, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=26, v=-48, x=0, x=24, x=25, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=26, v=-48, x=0, x=25, x=25, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=26] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=26, v=-48, x=0, x=25, x=25, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=26, v=-48, x=0, x=25, x=25, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=26, v=-46, x=0, x=25, x=25, y=0] [L45] x++ VAL [X=100, Y=1, counter=26, v=-46, x=0, x=25, x=26, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=27, v=-46, x=0, x=25, x=26, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=27, v=-46, x=0, x=26, x=26, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=27] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=27, v=-46, x=0, x=26, x=26, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=27, v=-46, x=0, x=26, x=26, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=27, v=-44, x=0, x=26, x=26, y=0] [L45] x++ VAL [X=100, Y=1, counter=27, v=-44, x=0, x=26, x=27, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=28, v=-44, x=0, x=26, x=27, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=28, v=-44, x=0, x=27, x=27, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=28] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=28, v=-44, x=0, x=27, x=27, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=28, v=-44, x=0, x=27, x=27, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=28, v=-42, x=0, x=27, x=27, y=0] [L45] x++ VAL [X=100, Y=1, counter=28, v=-42, x=0, x=27, x=28, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=29, v=-42, x=0, x=27, x=28, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=29, v=-42, x=0, x=28, x=28, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=29] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=29, v=-42, x=0, x=28, x=28, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=29, v=-42, x=0, x=28, x=28, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=29, v=-40, x=0, x=28, x=28, y=0] [L45] x++ VAL [X=100, Y=1, counter=29, v=-40, x=0, x=28, x=29, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=30, v=-40, x=0, x=28, x=29, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=30, v=-40, x=0, x=29, x=29, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=30] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=30, v=-40, x=0, x=29, x=29, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=30, v=-40, x=0, x=29, x=29, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=30, v=-38, x=0, x=29, x=29, y=0] [L45] x++ VAL [X=100, Y=1, counter=30, v=-38, x=0, x=29, x=30, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=31, v=-38, x=0, x=29, x=30, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=31, v=-38, x=0, x=30, x=30, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=31] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=31, v=-38, x=0, x=30, x=30, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=31, v=-38, x=0, x=30, x=30, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=31, v=-36, x=0, x=30, x=30, y=0] [L45] x++ VAL [X=100, Y=1, counter=31, v=-36, x=0, x=30, x=31, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=32, v=-36, x=0, x=30, x=31, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=32, v=-36, x=0, x=31, x=31, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=32] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=32, v=-36, x=0, x=31, x=31, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=32, v=-36, x=0, x=31, x=31, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=32, v=-34, x=0, x=31, x=31, y=0] [L45] x++ VAL [X=100, Y=1, counter=32, v=-34, x=0, x=31, x=32, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=33, v=-34, x=0, x=31, x=32, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=33, v=-34, x=0, x=32, x=32, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=33] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=33, v=-34, x=0, x=32, x=32, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=33, v=-34, x=0, x=32, x=32, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=33, v=-32, x=0, x=32, x=32, y=0] [L45] x++ VAL [X=100, Y=1, counter=33, v=-32, x=0, x=32, x=33, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=34, v=-32, x=0, x=32, x=33, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=34, v=-32, x=0, x=33, x=33, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=34] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=34, v=-32, x=0, x=33, x=33, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=34, v=-32, x=0, x=33, x=33, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=34, v=-30, x=0, x=33, x=33, y=0] [L45] x++ VAL [X=100, Y=1, counter=34, v=-30, x=0, x=33, x=34, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=35, v=-30, x=0, x=33, x=34, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=35, v=-30, x=0, x=34, x=34, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=35] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=35, v=-30, x=0, x=34, x=34, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=35, v=-30, x=0, x=34, x=34, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=35, v=-28, x=0, x=34, x=34, y=0] [L45] x++ VAL [X=100, Y=1, counter=35, v=-28, x=0, x=34, x=35, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=36, v=-28, x=0, x=34, x=35, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=36, v=-28, x=0, x=35, x=35, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=36] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=36, v=-28, x=0, x=35, x=35, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=36, v=-28, x=0, x=35, x=35, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=36, v=-26, x=0, x=35, x=35, y=0] [L45] x++ VAL [X=100, Y=1, counter=36, v=-26, x=0, x=35, x=36, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=37, v=-26, x=0, x=35, x=36, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=37, v=-26, x=0, x=36, x=36, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=37] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=37, v=-26, x=0, x=36, x=36, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=37, v=-26, x=0, x=36, x=36, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=37, v=-24, x=0, x=36, x=36, y=0] [L45] x++ VAL [X=100, Y=1, counter=37, v=-24, x=0, x=36, x=37, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=38, v=-24, x=0, x=36, x=37, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=38, v=-24, x=0, x=37, x=37, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=38] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=38, v=-24, x=0, x=37, x=37, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=38, v=-24, x=0, x=37, x=37, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=38, v=-22, x=0, x=37, x=37, y=0] [L45] x++ VAL [X=100, Y=1, counter=38, v=-22, x=0, x=37, x=38, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=39, v=-22, x=0, x=37, x=38, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=39, v=-22, x=0, x=38, x=38, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=39] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=39, v=-22, x=0, x=38, x=38, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=39, v=-22, x=0, x=38, x=38, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=39, v=-20, x=0, x=38, x=38, y=0] [L45] x++ VAL [X=100, Y=1, counter=39, v=-20, x=0, x=38, x=39, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=40, v=-20, x=0, x=38, x=39, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=40, v=-20, x=0, x=39, x=39, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=40] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=40, v=-20, x=0, x=39, x=39, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=40, v=-20, x=0, x=39, x=39, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=40, v=-18, x=0, x=39, x=39, y=0] [L45] x++ VAL [X=100, Y=1, counter=40, v=-18, x=0, x=39, x=40, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=41, v=-18, x=0, x=39, x=40, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=41, v=-18, x=0, x=40, x=40, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=41] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=41, v=-18, x=0, x=40, x=40, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=41, v=-18, x=0, x=40, x=40, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=41, v=-16, x=0, x=40, x=40, y=0] [L45] x++ VAL [X=100, Y=1, counter=41, v=-16, x=0, x=40, x=41, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=42, v=-16, x=0, x=40, x=41, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=42, v=-16, x=0, x=41, x=41, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=42] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=42, v=-16, x=0, x=41, x=41, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=42, v=-16, x=0, x=41, x=41, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=42, v=-14, x=0, x=41, x=41, y=0] [L45] x++ VAL [X=100, Y=1, counter=42, v=-14, x=0, x=41, x=42, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=43, v=-14, x=0, x=41, x=42, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=43, v=-14, x=0, x=42, x=42, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=43] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=43, v=-14, x=0, x=42, x=42, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=43, v=-14, x=0, x=42, x=42, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=43, v=-12, x=0, x=42, x=42, y=0] [L45] x++ VAL [X=100, Y=1, counter=43, v=-12, x=0, x=42, x=43, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=44, v=-12, x=0, x=42, x=43, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=44, v=-12, x=0, x=43, x=43, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=44] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=44, v=-12, x=0, x=43, x=43, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=44, v=-12, x=0, x=43, x=43, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=44, v=-10, x=0, x=43, x=43, y=0] [L45] x++ VAL [X=100, Y=1, counter=44, v=-10, x=0, x=43, x=44, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=45, v=-10, x=0, x=43, x=44, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=45, v=-10, x=0, x=44, x=44, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=45] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=45, v=-10, x=0, x=44, x=44, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=45, v=-10, x=0, x=44, x=44, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=45, v=-8, x=0, x=44, x=44, y=0] [L45] x++ VAL [X=100, Y=1, counter=45, v=-8, x=0, x=44, x=45, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=46, v=-8, x=0, x=44, x=45, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=46, v=-8, x=0, x=45, x=45, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=46] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=46, v=-8, x=0, x=45, x=45, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=46, v=-8, x=0, x=45, x=45, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=46, v=-6, x=0, x=45, x=45, y=0] [L45] x++ VAL [X=100, Y=1, counter=46, v=-6, x=0, x=45, x=46, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=47, v=-6, x=0, x=45, x=46, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=47, v=-6, x=0, x=46, x=46, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=47] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=47, v=-6, x=0, x=46, x=46, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=47, v=-6, x=0, x=46, x=46, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=47, v=-4, x=0, x=46, x=46, y=0] [L45] x++ VAL [X=100, Y=1, counter=47, v=-4, x=0, x=46, x=47, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=48, v=-4, x=0, x=46, x=47, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=48, v=-4, x=0, x=47, x=47, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=48] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=48, v=-4, x=0, x=47, x=47, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=48, v=-4, x=0, x=47, x=47, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=48, v=-2, x=0, x=47, x=47, y=0] [L45] x++ VAL [X=100, Y=1, counter=48, v=-2, x=0, x=47, x=48, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=49, v=-2, x=0, x=47, x=48, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=49, v=-2, x=0, x=48, x=48, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=49] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=49, v=-2, x=0, x=48, x=48, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=49, v=-2, x=0, x=48, x=48, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=100, Y=1, counter=49, v=0, x=0, x=48, x=48, y=0] [L45] x++ VAL [X=100, Y=1, counter=49, v=0, x=0, x=48, x=49, y=0] [L31] EXPR counter++ VAL [X=100, Y=1, counter=50, v=0, x=0, x=48, x=49, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=100, Y=1, counter=50, v=0, x=0, x=49, x=49, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=50] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=100, Y=1, counter=50, v=0, x=0, x=49, x=49, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=100, Y=1, counter=50, v=0, x=0, x=49, x=49, y=0] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=100, Y=1, counter=50, v=-198, x=0, x=49, x=49, y=1] [L45] x++ VAL [X=100, Y=1, counter=50, v=-198, x=0, x=49, x=50, y=1] [L31] EXPR counter++ VAL [X=100, Y=1, counter=51, v=-198, x=0, x=49, x=50, y=1] [L31] COND FALSE !(counter++<50) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=100, Y=1, counter=51, v=-198, x=50, x=50, x=50, y=1] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=51] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L16] reach_error() VAL [\old(cond)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.2s, OverallIterations: 14, TraceHistogramMax: 51, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 6.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 830 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 825 mSDsluCounter, 1800 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1645 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1740 IncrementalHoareTripleChecker+Invalid, 1861 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 155 mSDtfsCounter, 1740 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2730 GetRequests, 2270 SyntacticMatches, 55 SemanticMatches, 405 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4520 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1017occurred in iteration=13, InterpolantAutomatonStates: 370, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 52 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 7.5s InterpolantComputationTime, 1820 NumberOfCodeBlocks, 1590 NumberOfCodeBlocksAsserted, 69 NumberOfCheckSat, 2549 ConstructedInterpolants, 2 QuantifiedInterpolants, 8102 SizeOfPredicates, 125 NumberOfNonLiveVariables, 3025 ConjunctsInSsa, 350 ConjunctsInUnsatCore, 24 InterpolantComputations, 1 PerfectInterpolantSequences, 10591/32208 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! [2023-11-23 14:48:19,637 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (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