/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 04:57:54,025 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 04:57:54,094 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-16 04:57:54,098 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 04:57:54,099 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 04:57:54,119 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 04:57:54,119 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 04:57:54,120 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 04:57:54,120 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 04:57:54,123 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 04:57:54,123 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 04:57:54,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 04:57:54,124 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 04:57:54,125 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 04:57:54,125 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 04:57:54,126 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 04:57:54,126 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 04:57:54,126 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 04:57:54,126 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-16 04:57:54,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 04:57:54,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 04:57:54,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 04:57:54,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 04:57:54,128 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 04:57:54,128 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 04:57:54,128 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 04:57:54,128 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 04:57:54,128 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 04:57:54,129 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 04:57:54,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 04:57:54,130 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 04:57:54,130 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 04:57:54,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:57:54,130 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 04:57:54,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 04:57:54,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 04:57:54,131 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-16 04:57:54,131 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-16 04:57:54,131 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 04:57:54,131 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 04:57:54,131 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 04:57:54,131 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 04:57:54,131 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 04:57:54,132 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: Use bitabs translation -> false [2023-12-16 04:57:54,323 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 04:57:54,340 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 04:57:54,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 04:57:54,342 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 04:57:54,342 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 04:57:54,343 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-12-16 04:57:55,716 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 04:57:55,852 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 04:57:55,855 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound50.c [2023-12-16 04:57:55,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03bf0fab4/b92fec6efb2b4148ac5a6d8270385e10/FLAG9c6e86e01 [2023-12-16 04:57:55,874 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03bf0fab4/b92fec6efb2b4148ac5a6d8270385e10 [2023-12-16 04:57:55,876 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 04:57:55,876 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 04:57:55,878 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 04:57:55,878 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 04:57:55,881 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 04:57:55,882 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:57:55" (1/1) ... [2023-12-16 04:57:55,882 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@90d5dab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:57:55, skipping insertion in model container [2023-12-16 04:57:55,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:57:55" (1/1) ... [2023-12-16 04:57:55,897 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 04:57:56,012 WARN L239 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-12-16 04:57:56,031 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:57:56,038 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 04:57:56,045 WARN L239 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-12-16 04:57:56,051 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 04:57:56,059 INFO L206 MainTranslator]: Completed translation [2023-12-16 04:57:56,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:57:56 WrapperNode [2023-12-16 04:57:56,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 04:57:56,060 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 04:57:56,060 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 04:57:56,060 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 04:57:56,065 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:57:56" (1/1) ... [2023-12-16 04:57:56,070 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:57:56" (1/1) ... [2023-12-16 04:57:56,080 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-12-16 04:57:56,081 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 04:57:56,081 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 04:57:56,081 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 04:57:56,081 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 04:57:56,087 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:57:56" (1/1) ... [2023-12-16 04:57:56,087 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:57:56" (1/1) ... [2023-12-16 04:57:56,088 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:57:56" (1/1) ... [2023-12-16 04:57:56,094 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-12-16 04:57:56,094 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:57:56" (1/1) ... [2023-12-16 04:57:56,095 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:57:56" (1/1) ... [2023-12-16 04:57:56,096 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:57:56" (1/1) ... [2023-12-16 04:57:56,098 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:57:56" (1/1) ... [2023-12-16 04:57:56,100 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:57:56" (1/1) ... [2023-12-16 04:57:56,101 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:57:56" (1/1) ... [2023-12-16 04:57:56,107 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 04:57:56,108 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 04:57:56,108 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 04:57:56,108 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 04:57:56,109 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:57:56" (1/1) ... [2023-12-16 04:57:56,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 04:57:56,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:57:56,138 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 04:57:56,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 04:57:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 04:57:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-16 04:57:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 04:57:56,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 04:57:56,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-16 04:57:56,161 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-16 04:57:56,206 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 04:57:56,208 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 04:57:56,352 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 04:57:56,371 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 04:57:56,371 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 04:57:56,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:57:56 BoogieIcfgContainer [2023-12-16 04:57:56,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 04:57:56,373 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 04:57:56,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 04:57:56,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 04:57:56,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:57:55" (1/3) ... [2023-12-16 04:57:56,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a403f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:57:56, skipping insertion in model container [2023-12-16 04:57:56,379 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:57:56" (2/3) ... [2023-12-16 04:57:56,380 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a403f8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:57:56, skipping insertion in model container [2023-12-16 04:57:56,380 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:57:56" (3/3) ... [2023-12-16 04:57:56,381 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound50.c [2023-12-16 04:57:56,392 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 04:57:56,392 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 04:57:56,427 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 04:57:56,432 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;@392a5177, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 04:57:56,432 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 04:57:56,435 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-12-16 04:57:56,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 04:57:56,440 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:57:56,441 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:57:56,441 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:57:56,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:57:56,446 INFO L85 PathProgramCache]: Analyzing trace with hash -26250642, now seen corresponding path program 1 times [2023-12-16 04:57:56,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:57:56,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067449217] [2023-12-16 04:57:56,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:57:56,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:57:56,524 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:57:56,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1717331801] [2023-12-16 04:57:56,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:57:56,525 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:57:56,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:57:56,539 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-12-16 04:57:56,582 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-12-16 04:57:56,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:57:56,604 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-16 04:57:56,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:57:56,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:57:56,743 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 04:57:56,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:57:56,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067449217] [2023-12-16 04:57:56,743 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:57:56,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1717331801] [2023-12-16 04:57:56,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1717331801] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 04:57:56,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 04:57:56,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-16 04:57:56,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689287319] [2023-12-16 04:57:56,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 04:57:56,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 04:57:56,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:57:56,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 04:57:56,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-16 04:57:56,786 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-12-16 04:57:56,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:57:56,892 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2023-12-16 04:57:56,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 04:57:56,894 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-12-16 04:57:56,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:57:56,899 INFO L225 Difference]: With dead ends: 46 [2023-12-16 04:57:56,899 INFO L226 Difference]: Without dead ends: 24 [2023-12-16 04:57:56,901 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-12-16 04:57:56,904 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-12-16 04:57:56,905 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-12-16 04:57:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-16 04:57:56,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2023-12-16 04:57:56,931 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-12-16 04:57:56,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-12-16 04:57:56,933 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 7 [2023-12-16 04:57:56,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:57:56,933 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-12-16 04:57:56,933 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-12-16 04:57:56,934 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-12-16 04:57:56,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-16 04:57:56,934 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:57:56,935 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:57:56,950 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-16 04:57:57,139 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-12-16 04:57:57,140 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:57:57,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:57:57,141 INFO L85 PathProgramCache]: Analyzing trace with hash -479331439, now seen corresponding path program 1 times [2023-12-16 04:57:57,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:57:57,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088064434] [2023-12-16 04:57:57,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:57:57,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:57:57,159 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:57:57,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [202658031] [2023-12-16 04:57:57,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:57:57,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:57:57,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:57:57,162 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-12-16 04:57:57,196 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-12-16 04:57:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:57:57,237 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-16 04:57:57,239 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:57:57,370 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:57:57,370 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:57:57,459 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-16 04:57:57,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:57:57,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088064434] [2023-12-16 04:57:57,460 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:57:57,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [202658031] [2023-12-16 04:57:57,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [202658031] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:57:57,460 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:57:57,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2023-12-16 04:57:57,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842958000] [2023-12-16 04:57:57,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:57:57,461 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-16 04:57:57,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:57:57,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-16 04:57:57,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-12-16 04:57:57,462 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 04:57:57,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:57:57,582 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2023-12-16 04:57:57,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-16 04:57:57,582 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (4), 3 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-12-16 04:57:57,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:57:57,583 INFO L225 Difference]: With dead ends: 40 [2023-12-16 04:57:57,583 INFO L226 Difference]: Without dead ends: 33 [2023-12-16 04:57:57,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-12-16 04:57:57,584 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:57:57,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 83 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:57:57,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-16 04:57:57,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-12-16 04:57:57,589 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-12-16 04:57:57,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-12-16 04:57:57,590 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 17 [2023-12-16 04:57:57,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:57:57,590 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-12-16 04:57:57,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-16 04:57:57,590 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-12-16 04:57:57,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-16 04:57:57,591 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:57:57,591 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:57:57,602 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-16 04:57:57,796 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-12-16 04:57:57,796 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:57:57,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:57:57,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1366888132, now seen corresponding path program 1 times [2023-12-16 04:57:57,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:57:57,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481396537] [2023-12-16 04:57:57,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:57:57,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:57:57,802 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:57:57,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [31607993] [2023-12-16 04:57:57,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:57:57,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:57:57,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:57:57,820 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-12-16 04:57:57,888 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-12-16 04:57:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:57:57,922 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 04:57:57,923 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:57:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:57:57,950 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:57:57,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:57:57,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:57:57,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481396537] [2023-12-16 04:57:57,972 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:57:57,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31607993] [2023-12-16 04:57:57,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31607993] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:57:57,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:57:57,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-16 04:57:57,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885917786] [2023-12-16 04:57:57,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:57:57,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 04:57:57,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:57:57,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 04:57:57,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-16 04:57:57,973 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-12-16 04:57:58,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:57:58,014 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2023-12-16 04:57:58,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:57:58,014 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-12-16 04:57:58,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:57:58,015 INFO L225 Difference]: With dead ends: 72 [2023-12-16 04:57:58,015 INFO L226 Difference]: Without dead ends: 66 [2023-12-16 04:57:58,015 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-12-16 04:57:58,016 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:57:58,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 93 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:57:58,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-16 04:57:58,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2023-12-16 04:57:58,023 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-12-16 04:57:58,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2023-12-16 04:57:58,024 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 18 [2023-12-16 04:57:58,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:57:58,024 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2023-12-16 04:57:58,024 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-12-16 04:57:58,024 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2023-12-16 04:57:58,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-16 04:57:58,025 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:57:58,025 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:57:58,041 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-12-16 04:57:58,241 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-12-16 04:57:58,242 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:57:58,242 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:57:58,242 INFO L85 PathProgramCache]: Analyzing trace with hash -382706270, now seen corresponding path program 1 times [2023-12-16 04:57:58,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:57:58,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324943330] [2023-12-16 04:57:58,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:57:58,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:57:58,249 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:57:58,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1316145858] [2023-12-16 04:57:58,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:57:58,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:57:58,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:57:58,250 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-12-16 04:57:58,268 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-12-16 04:57:58,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:57:58,286 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-16 04:57:58,287 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:57:58,455 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-16 04:57:58,455 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:57:58,719 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-16 04:57:58,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:57:58,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324943330] [2023-12-16 04:57:58,719 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:57:58,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316145858] [2023-12-16 04:57:58,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316145858] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:57:58,720 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:57:58,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2023-12-16 04:57:58,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748576826] [2023-12-16 04:57:58,720 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:57:58,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-16 04:57:58,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:57:58,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-16 04:57:58,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-12-16 04:57:58,721 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 23 states, 19 states have (on average 1.736842105263158) internal successors, (33), 20 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 04:57:59,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:57:59,172 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2023-12-16 04:57:59,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-16 04:57:59,173 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.736842105263158) internal successors, (33), 20 states have internal predecessors, (33), 6 states have call successors, (6), 3 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-12-16 04:57:59,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:57:59,173 INFO L225 Difference]: With dead ends: 64 [2023-12-16 04:57:59,173 INFO L226 Difference]: Without dead ends: 56 [2023-12-16 04:57:59,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2023-12-16 04:57:59,174 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 51 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:57:59,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 107 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:57:59,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-16 04:57:59,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2023-12-16 04:57:59,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 04:57:59,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2023-12-16 04:57:59,200 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 24 [2023-12-16 04:57:59,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:57:59,200 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2023-12-16 04:57:59,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.736842105263158) internal successors, (33), 20 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-16 04:57:59,201 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2023-12-16 04:57:59,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-16 04:57:59,201 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:57:59,201 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-12-16 04:57:59,208 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-16 04:57:59,406 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-12-16 04:57:59,407 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:57:59,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:57:59,407 INFO L85 PathProgramCache]: Analyzing trace with hash 2080125809, now seen corresponding path program 1 times [2023-12-16 04:57:59,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:57:59,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262386721] [2023-12-16 04:57:59,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:57:59,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:57:59,432 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:57:59,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [481458228] [2023-12-16 04:57:59,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:57:59,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:57:59,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:57:59,433 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-12-16 04:57:59,445 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-12-16 04:57:59,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:57:59,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-16 04:57:59,476 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:57:59,533 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:57:59,533 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:57:59,604 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-16 04:57:59,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:57:59,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262386721] [2023-12-16 04:57:59,605 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:57:59,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [481458228] [2023-12-16 04:57:59,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [481458228] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:57:59,605 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:57:59,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-16 04:57:59,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29103212] [2023-12-16 04:57:59,605 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:57:59,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-16 04:57:59,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:57:59,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-16 04:57:59,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-12-16 04:57:59,607 INFO L87 Difference]: Start difference. First operand 49 states and 53 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-12-16 04:57:59,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:57:59,718 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2023-12-16 04:57:59,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-16 04:57:59,719 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-12-16 04:57:59,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:57:59,720 INFO L225 Difference]: With dead ends: 115 [2023-12-16 04:57:59,720 INFO L226 Difference]: Without dead ends: 109 [2023-12-16 04:57:59,720 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-12-16 04:57:59,720 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 44 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 04:57:59,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 124 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 04:57:59,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-16 04:57:59,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-12-16 04:57:59,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.1264367816091954) internal successors, (98), 87 states have internal predecessors, (98), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-16 04:57:59,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2023-12-16 04:57:59,736 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 48 [2023-12-16 04:57:59,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:57:59,736 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2023-12-16 04:57:59,736 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-12-16 04:57:59,736 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2023-12-16 04:57:59,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-16 04:57:59,738 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:57:59,738 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2023-12-16 04:57:59,745 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-12-16 04:57:59,943 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-12-16 04:57:59,943 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:57:59,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:57:59,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1893266719, now seen corresponding path program 2 times [2023-12-16 04:57:59,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:57:59,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516284725] [2023-12-16 04:57:59,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:57:59,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:57:59,965 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:57:59,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1919554697] [2023-12-16 04:57:59,966 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 04:57:59,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:57:59,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:57:59,967 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-12-16 04:57:59,983 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-12-16 04:58:00,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 04:58:00,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:58:00,044 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-16 04:58:00,047 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:58:00,248 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:58:00,248 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:58:00,501 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-16 04:58:00,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:58:00,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516284725] [2023-12-16 04:58:00,501 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:58:00,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919554697] [2023-12-16 04:58:00,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919554697] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:58:00,501 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:58:00,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2023-12-16 04:58:00,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579729546] [2023-12-16 04:58:00,502 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:58:00,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-16 04:58:00,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:58:00,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-16 04:58:00,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2023-12-16 04:58:00,505 INFO L87 Difference]: Start difference. First operand 109 states and 119 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-12-16 04:58:00,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:58:00,831 INFO L93 Difference]: Finished difference Result 235 states and 268 transitions. [2023-12-16 04:58:00,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-16 04:58:00,831 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-12-16 04:58:00,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:58:00,836 INFO L225 Difference]: With dead ends: 235 [2023-12-16 04:58:00,836 INFO L226 Difference]: Without dead ends: 229 [2023-12-16 04:58:00,837 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2023-12-16 04:58:00,838 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 151 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:58:00,838 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 198 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:58:00,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2023-12-16 04:58:00,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2023-12-16 04:58:00,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 183 states have (on average 1.1256830601092895) internal successors, (206), 183 states have internal predecessors, (206), 23 states have call successors, (23), 23 states have call predecessors, (23), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-16 04:58:00,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 251 transitions. [2023-12-16 04:58:00,880 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 251 transitions. Word has length 108 [2023-12-16 04:58:00,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:58:00,881 INFO L495 AbstractCegarLoop]: Abstraction has 229 states and 251 transitions. [2023-12-16 04:58:00,882 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-12-16 04:58:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 251 transitions. [2023-12-16 04:58:00,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-12-16 04:58:00,890 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:58:00,890 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1] [2023-12-16 04:58:00,908 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-12-16 04:58:01,095 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-12-16 04:58:01,096 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:58:01,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:58:01,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1650934405, now seen corresponding path program 3 times [2023-12-16 04:58:01,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:58:01,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012838016] [2023-12-16 04:58:01,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:58:01,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:58:01,119 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:58:01,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1723049904] [2023-12-16 04:58:01,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 04:58:01,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:58:01,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:58:01,144 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-12-16 04:58:01,177 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-12-16 04:58:01,203 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-16 04:58:01,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:58:01,204 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-16 04:58:01,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:58:01,421 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 234 proven. 1 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2023-12-16 04:58:01,421 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:58:01,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 106 proven. 129 refuted. 0 times theorem prover too weak. 2163 trivial. 0 not checked. [2023-12-16 04:58:01,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:58:01,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012838016] [2023-12-16 04:58:01,664 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:58:01,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1723049904] [2023-12-16 04:58:01,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1723049904] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:58:01,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:58:01,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-12-16 04:58:01,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219138903] [2023-12-16 04:58:01,664 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:58:01,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-16 04:58:01,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:58:01,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-16 04:58:01,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-12-16 04:58:01,666 INFO L87 Difference]: Start difference. First operand 229 states and 251 transitions. Second operand has 18 states, 14 states have (on average 2.357142857142857) internal successors, (33), 17 states have internal predecessors, (33), 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-12-16 04:58:01,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:58:01,833 INFO L93 Difference]: Finished difference Result 448 states and 491 transitions. [2023-12-16 04:58:01,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 04:58:01,833 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.357142857142857) internal successors, (33), 17 states have internal predecessors, (33), 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 228 [2023-12-16 04:58:01,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:58:01,835 INFO L225 Difference]: With dead ends: 448 [2023-12-16 04:58:01,835 INFO L226 Difference]: Without dead ends: 442 [2023-12-16 04:58:01,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 458 GetRequests, 437 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-12-16 04:58:01,836 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 25 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 04:58:01,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 69 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 04:58:01,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2023-12-16 04:58:01,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 439. [2023-12-16 04:58:01,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 439 states, 351 states have (on average 1.1253561253561253) internal successors, (395), 351 states have internal predecessors, (395), 44 states have call successors, (44), 44 states have call predecessors, (44), 43 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2023-12-16 04:58:01,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 482 transitions. [2023-12-16 04:58:01,878 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 482 transitions. Word has length 228 [2023-12-16 04:58:01,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:58:01,879 INFO L495 AbstractCegarLoop]: Abstraction has 439 states and 482 transitions. [2023-12-16 04:58:01,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.357142857142857) internal successors, (33), 17 states have internal predecessors, (33), 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-12-16 04:58:01,879 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 482 transitions. [2023-12-16 04:58:01,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2023-12-16 04:58:01,880 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:58:01,880 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 21, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:58:01,898 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-12-16 04:58:02,085 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-12-16 04:58:02,086 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:58:02,086 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:58:02,086 INFO L85 PathProgramCache]: Analyzing trace with hash -970876035, now seen corresponding path program 1 times [2023-12-16 04:58:02,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:58:02,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668591990] [2023-12-16 04:58:02,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:58:02,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:58:02,097 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:58:02,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1163296358] [2023-12-16 04:58:02,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:58:02,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:58:02,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:58:02,098 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-12-16 04:58:02,130 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-12-16 04:58:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 04:58:02,210 INFO L262 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-16 04:58:02,214 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:58:02,573 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:58:02,573 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:58:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 44 proven. 1430 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-16 04:58:03,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:58:03,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668591990] [2023-12-16 04:58:03,324 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:58:03,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1163296358] [2023-12-16 04:58:03,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1163296358] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:58:03,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:58:03,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2023-12-16 04:58:03,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209663793] [2023-12-16 04:58:03,324 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:58:03,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-16 04:58:03,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:58:03,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-16 04:58:03,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2023-12-16 04:58:03,327 INFO L87 Difference]: Start difference. First operand 439 states and 482 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-12-16 04:58:04,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:58:04,394 INFO L93 Difference]: Finished difference Result 928 states and 1042 transitions. [2023-12-16 04:58:04,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-12-16 04:58:04,395 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-12-16 04:58:04,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:58:04,398 INFO L225 Difference]: With dead ends: 928 [2023-12-16 04:58:04,398 INFO L226 Difference]: Without dead ends: 922 [2023-12-16 04:58:04,400 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-12-16 04:58:04,400 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 353 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:58:04,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 384 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:58:04,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2023-12-16 04:58:04,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 919. [2023-12-16 04:58:04,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 919 states, 735 states have (on average 1.125170068027211) internal successors, (827), 735 states have internal predecessors, (827), 92 states have call successors, (92), 92 states have call predecessors, (92), 91 states have return successors, (91), 91 states have call predecessors, (91), 91 states have call successors, (91) [2023-12-16 04:58:04,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 919 states to 919 states and 1010 transitions. [2023-12-16 04:58:04,470 INFO L78 Accepts]: Start accepts. Automaton has 919 states and 1010 transitions. Word has length 228 [2023-12-16 04:58:04,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:58:04,471 INFO L495 AbstractCegarLoop]: Abstraction has 919 states and 1010 transitions. [2023-12-16 04:58:04,471 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-12-16 04:58:04,471 INFO L276 IsEmpty]: Start isEmpty. Operand 919 states and 1010 transitions. [2023-12-16 04:58:04,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2023-12-16 04:58:04,476 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:58:04,476 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 45, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:58:04,484 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-12-16 04:58:04,682 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-12-16 04:58:04,682 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:58:04,682 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:58:04,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1917042635, now seen corresponding path program 2 times [2023-12-16 04:58:04,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:58:04,683 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142255130] [2023-12-16 04:58:04,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:58:04,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:58:04,704 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:58:04,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [636958997] [2023-12-16 04:58:04,704 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 04:58:04,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:58:04,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:58:04,705 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-12-16 04:58:04,720 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-12-16 04:58:04,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 04:58:04,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 04:58:04,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 1157 conjuncts, 95 conjunts are in the unsatisfiable core [2023-12-16 04:58:04,964 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 04:58:06,175 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 04:58:06,175 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 04:58:07,419 INFO L134 CoverageAnalysis]: Checked inductivity of 10534 backedges. 92 proven. 6302 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2023-12-16 04:58:07,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-16 04:58:07,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142255130] [2023-12-16 04:58:07,420 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-16 04:58:07,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636958997] [2023-12-16 04:58:07,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636958997] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 04:58:07,420 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 04:58:07,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2023-12-16 04:58:07,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800022308] [2023-12-16 04:58:07,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 04:58:07,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-12-16 04:58:07,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-16 04:58:07,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-12-16 04:58:07,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2023-12-16 04:58:07,423 INFO L87 Difference]: Start difference. First operand 919 states and 1010 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-12-16 04:58:08,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 04:58:08,767 INFO L93 Difference]: Finished difference Result 1008 states and 1110 transitions. [2023-12-16 04:58:08,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-12-16 04:58:08,767 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-12-16 04:58:08,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 04:58:08,770 INFO L225 Difference]: With dead ends: 1008 [2023-12-16 04:58:08,770 INFO L226 Difference]: Without dead ends: 1002 [2023-12-16 04:58:08,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 983 GetRequests, 838 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2023-12-16 04:58:08,773 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 175 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 04:58:08,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 409 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 04:58:08,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1002 states. [2023-12-16 04:58:08,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1002 to 999. [2023-12-16 04:58:08,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 799 states have (on average 1.1251564455569463) internal successors, (899), 799 states have internal predecessors, (899), 100 states have call successors, (100), 100 states have call predecessors, (100), 99 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2023-12-16 04:58:08,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1098 transitions. [2023-12-16 04:58:08,847 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1098 transitions. Word has length 468 [2023-12-16 04:58:08,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 04:58:08,847 INFO L495 AbstractCegarLoop]: Abstraction has 999 states and 1098 transitions. [2023-12-16 04:58:08,848 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-12-16 04:58:08,848 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1098 transitions. [2023-12-16 04:58:08,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 509 [2023-12-16 04:58:08,853 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 04:58:08,853 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 49, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 04:58:08,861 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-12-16 04:58:09,059 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-12-16 04:58:09,059 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 04:58:09,060 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 04:58:09,060 INFO L85 PathProgramCache]: Analyzing trace with hash 2091126185, now seen corresponding path program 3 times [2023-12-16 04:58:09,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-16 04:58:09,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534576286] [2023-12-16 04:58:09,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 04:58:09,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-16 04:58:09,087 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-16 04:58:09,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [517234877] [2023-12-16 04:58:09,088 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 04:58:09,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-16 04:58:09,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 04:58:09,088 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-12-16 04:58:09,121 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-12-16 04:58:09,429 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 51 check-sat command(s) [2023-12-16 04:58:09,429 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-16 04:58:09,429 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-16 04:58:09,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-16 04:58:09,702 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-16 04:58:09,702 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-16 04:58:09,703 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 04:58:09,725 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-12-16 04:58:09,911 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-12-16 04:58:09,914 INFO L445 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1] [2023-12-16 04:58:09,917 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 04:58:10,067 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:58:10 BoogieIcfgContainer [2023-12-16 04:58:10,067 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 04:58:10,068 INFO L158 Benchmark]: Toolchain (without parser) took 14191.29ms. Allocated memory was 281.0MB in the beginning and 405.8MB in the end (delta: 124.8MB). Free memory was 222.3MB in the beginning and 176.0MB in the end (delta: 46.3MB). Peak memory consumption was 172.1MB. Max. memory is 8.0GB. [2023-12-16 04:58:10,068 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 165.7MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 04:58:10,068 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.62ms. Allocated memory is still 281.0MB. Free memory was 221.8MB in the beginning and 210.7MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-16 04:58:10,068 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.44ms. Allocated memory is still 281.0MB. Free memory was 210.7MB in the beginning and 209.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 04:58:10,068 INFO L158 Benchmark]: Boogie Preprocessor took 26.54ms. Allocated memory is still 281.0MB. Free memory was 209.2MB in the beginning and 207.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-16 04:58:10,068 INFO L158 Benchmark]: RCFGBuilder took 263.60ms. Allocated memory is still 281.0MB. Free memory was 207.6MB in the beginning and 194.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 04:58:10,069 INFO L158 Benchmark]: TraceAbstraction took 13694.28ms. Allocated memory was 281.0MB in the beginning and 405.8MB in the end (delta: 124.8MB). Free memory was 194.0MB in the beginning and 176.0MB in the end (delta: 17.9MB). Peak memory consumption was 143.8MB. Max. memory is 8.0GB. [2023-12-16 04:58:10,069 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.43ms. Allocated memory is still 165.7MB. Free memory is still 114.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 181.62ms. Allocated memory is still 281.0MB. Free memory was 221.8MB in the beginning and 210.7MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.44ms. Allocated memory is still 281.0MB. Free memory was 210.7MB in the beginning and 209.2MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.54ms. Allocated memory is still 281.0MB. Free memory was 209.2MB in the beginning and 207.6MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 263.60ms. Allocated memory is still 281.0MB. Free memory was 207.6MB in the beginning and 194.5MB in the end (delta: 13.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 13694.28ms. Allocated memory was 281.0MB in the beginning and 405.8MB in the end (delta: 124.8MB). Free memory was 194.0MB in the beginning and 176.0MB in the end (delta: 17.9MB). Peak memory consumption was 143.8MB. Max. memory is 8.0GB. * 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=99, Y=1, counter=0, v=-97, x=0, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=1, v=-97, x=0, y=0] [L31] COND TRUE counter++<50 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=99, Y=1, counter=1, v=-97, 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=99, Y=1, counter=1, v=-97, x=0, x=0, x=0, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=1, v=-97, x=0, x=0, x=0, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=1, v=-95, x=0, x=0, x=0, y=0] [L45] x++ VAL [X=99, Y=1, counter=1, v=-95, x=0, x=0, x=1, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=2, v=-95, 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=99, Y=1, counter=2, v=-95, 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=99, Y=1, counter=2, v=-95, x=0, x=1, x=1, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=2, v=-95, x=0, x=1, x=1, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=2, v=-93, x=0, x=1, x=1, y=0] [L45] x++ VAL [X=99, Y=1, counter=2, v=-93, x=0, x=1, x=2, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=3, v=-93, 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=99, Y=1, counter=3, v=-93, 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=99, Y=1, counter=3, v=-93, x=0, x=2, x=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=3, v=-93, x=0, x=2, x=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=3, v=-91, x=0, x=2, x=2, y=0] [L45] x++ VAL [X=99, Y=1, counter=3, v=-91, x=0, x=2, x=3, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=4, v=-91, 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=99, Y=1, counter=4, v=-91, 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=99, Y=1, counter=4, v=-91, x=0, x=3, x=3, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=4, v=-91, x=0, x=3, x=3, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=4, v=-89, x=0, x=3, x=3, y=0] [L45] x++ VAL [X=99, Y=1, counter=4, v=-89, x=0, x=3, x=4, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=5, v=-89, 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=99, Y=1, counter=5, v=-89, 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=99, Y=1, counter=5, v=-89, x=0, x=4, x=4, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=5, v=-89, x=0, x=4, x=4, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=5, v=-87, x=0, x=4, x=4, y=0] [L45] x++ VAL [X=99, Y=1, counter=5, v=-87, x=0, x=4, x=5, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=6, v=-87, 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=99, Y=1, counter=6, v=-87, 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=99, Y=1, counter=6, v=-87, x=0, x=5, x=5, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=6, v=-87, x=0, x=5, x=5, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=6, v=-85, x=0, x=5, x=5, y=0] [L45] x++ VAL [X=99, Y=1, counter=6, v=-85, x=0, x=5, x=6, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=7, v=-85, 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=99, Y=1, counter=7, v=-85, 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=99, Y=1, counter=7, v=-85, x=0, x=6, x=6, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=7, v=-85, x=0, x=6, x=6, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=7, v=-83, x=0, x=6, x=6, y=0] [L45] x++ VAL [X=99, Y=1, counter=7, v=-83, x=0, x=6, x=7, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=8, v=-83, 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=99, Y=1, counter=8, v=-83, 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=99, Y=1, counter=8, v=-83, x=0, x=7, x=7, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=8, v=-83, x=0, x=7, x=7, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=8, v=-81, x=0, x=7, x=7, y=0] [L45] x++ VAL [X=99, Y=1, counter=8, v=-81, x=0, x=7, x=8, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=9, v=-81, 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=99, Y=1, counter=9, v=-81, 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=99, Y=1, counter=9, v=-81, x=0, x=8, x=8, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=9, v=-81, x=0, x=8, x=8, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=9, v=-79, x=0, x=8, x=8, y=0] [L45] x++ VAL [X=99, Y=1, counter=9, v=-79, x=0, x=8, x=9, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=10, v=-79, 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=99, Y=1, counter=10, v=-79, 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=99, Y=1, counter=10, v=-79, x=0, x=9, x=9, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=10, v=-79, x=0, x=9, x=9, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=10, v=-77, x=0, x=9, x=9, y=0] [L45] x++ VAL [X=99, Y=1, counter=10, v=-77, x=0, x=10, x=9, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=11, v=-77, 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=99, Y=1, counter=11, v=-77, 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=99, Y=1, counter=11, v=-77, x=0, x=10, x=10, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=11, v=-77, x=0, x=10, x=10, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=11, v=-75, x=0, x=10, x=10, y=0] [L45] x++ VAL [X=99, Y=1, counter=11, v=-75, x=0, x=10, x=11, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=12, v=-75, 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=99, Y=1, counter=12, v=-75, 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=99, Y=1, counter=12, v=-75, x=0, x=11, x=11, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=12, v=-75, x=0, x=11, x=11, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=12, v=-73, x=0, x=11, x=11, y=0] [L45] x++ VAL [X=99, Y=1, counter=12, v=-73, x=0, x=11, x=12, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=13, v=-73, 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=99, Y=1, counter=13, v=-73, 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=99, Y=1, counter=13, v=-73, x=0, x=12, x=12, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=13, v=-73, x=0, x=12, x=12, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=13, v=-71, x=0, x=12, x=12, y=0] [L45] x++ VAL [X=99, Y=1, counter=13, v=-71, x=0, x=12, x=13, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=14, v=-71, 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=99, Y=1, counter=14, v=-71, 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=99, Y=1, counter=14, v=-71, x=0, x=13, x=13, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=14, v=-71, x=0, x=13, x=13, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=14, v=-69, x=0, x=13, x=13, y=0] [L45] x++ VAL [X=99, Y=1, counter=14, v=-69, x=0, x=13, x=14, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=15, v=-69, 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=99, Y=1, counter=15, v=-69, 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=99, Y=1, counter=15, v=-69, x=0, x=14, x=14, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=15, v=-69, x=0, x=14, x=14, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=15, v=-67, x=0, x=14, x=14, y=0] [L45] x++ VAL [X=99, Y=1, counter=15, v=-67, x=0, x=14, x=15, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=16, v=-67, 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=99, Y=1, counter=16, v=-67, 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=99, Y=1, counter=16, v=-67, x=0, x=15, x=15, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=16, v=-67, x=0, x=15, x=15, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=16, v=-65, x=0, x=15, x=15, y=0] [L45] x++ VAL [X=99, Y=1, counter=16, v=-65, x=0, x=15, x=16, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=17, v=-65, 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=99, Y=1, counter=17, v=-65, 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=99, Y=1, counter=17, v=-65, x=0, x=16, x=16, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=17, v=-65, x=0, x=16, x=16, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=17, v=-63, x=0, x=16, x=16, y=0] [L45] x++ VAL [X=99, Y=1, counter=17, v=-63, x=0, x=16, x=17, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=18, v=-63, 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=99, Y=1, counter=18, v=-63, 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=99, Y=1, counter=18, v=-63, x=0, x=17, x=17, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=18, v=-63, x=0, x=17, x=17, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=18, v=-61, x=0, x=17, x=17, y=0] [L45] x++ VAL [X=99, Y=1, counter=18, v=-61, x=0, x=17, x=18, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=19, v=-61, 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=99, Y=1, counter=19, v=-61, 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=99, Y=1, counter=19, v=-61, x=0, x=18, x=18, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=19, v=-61, x=0, x=18, x=18, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=19, v=-59, x=0, x=18, x=18, y=0] [L45] x++ VAL [X=99, Y=1, counter=19, v=-59, x=0, x=18, x=19, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=20, v=-59, 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=99, Y=1, counter=20, v=-59, 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=99, Y=1, counter=20, v=-59, x=0, x=19, x=19, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=20, v=-59, x=0, x=19, x=19, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=20, v=-57, x=0, x=19, x=19, y=0] [L45] x++ VAL [X=99, Y=1, counter=20, v=-57, x=0, x=19, x=20, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=21, v=-57, 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=99, Y=1, counter=21, v=-57, 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=99, Y=1, counter=21, v=-57, x=0, x=20, x=20, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=21, v=-57, x=0, x=20, x=20, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=21, v=-55, x=0, x=20, x=20, y=0] [L45] x++ VAL [X=99, Y=1, counter=21, v=-55, x=0, x=20, x=21, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=22, v=-55, 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=99, Y=1, counter=22, v=-55, 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=99, Y=1, counter=22, v=-55, x=0, x=21, x=21, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=22, v=-55, x=0, x=21, x=21, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=22, v=-53, x=0, x=21, x=21, y=0] [L45] x++ VAL [X=99, Y=1, counter=22, v=-53, x=0, x=21, x=22, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=23, v=-53, 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=99, Y=1, counter=23, v=-53, 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=99, Y=1, counter=23, v=-53, x=0, x=22, x=22, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=23, v=-53, x=0, x=22, x=22, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=23, v=-51, x=0, x=22, x=22, y=0] [L45] x++ VAL [X=99, Y=1, counter=23, v=-51, x=0, x=22, x=23, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=24, v=-51, 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=99, Y=1, counter=24, v=-51, 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=99, Y=1, counter=24, v=-51, x=0, x=23, x=23, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=24, v=-51, x=0, x=23, x=23, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=24, v=-49, x=0, x=23, x=23, y=0] [L45] x++ VAL [X=99, Y=1, counter=24, v=-49, x=0, x=23, x=24, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=25, v=-49, 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=99, Y=1, counter=25, v=-49, 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=99, Y=1, counter=25, v=-49, x=0, x=24, x=24, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=25, v=-49, x=0, x=24, x=24, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=25, v=-47, x=0, x=24, x=24, y=0] [L45] x++ VAL [X=99, Y=1, counter=25, v=-47, x=0, x=24, x=25, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=26, v=-47, 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=99, Y=1, counter=26, v=-47, 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=99, Y=1, counter=26, v=-47, x=0, x=25, x=25, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=26, v=-47, x=0, x=25, x=25, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=26, v=-45, x=0, x=25, x=25, y=0] [L45] x++ VAL [X=99, Y=1, counter=26, v=-45, x=0, x=25, x=26, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=27, v=-45, 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=99, Y=1, counter=27, v=-45, 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=99, Y=1, counter=27, v=-45, x=0, x=26, x=26, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=27, v=-45, x=0, x=26, x=26, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=27, v=-43, x=0, x=26, x=26, y=0] [L45] x++ VAL [X=99, Y=1, counter=27, v=-43, x=0, x=26, x=27, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=28, v=-43, 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=99, Y=1, counter=28, v=-43, 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=99, Y=1, counter=28, v=-43, x=0, x=27, x=27, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=28, v=-43, x=0, x=27, x=27, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=28, v=-41, x=0, x=27, x=27, y=0] [L45] x++ VAL [X=99, Y=1, counter=28, v=-41, x=0, x=27, x=28, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=29, v=-41, 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=99, Y=1, counter=29, v=-41, 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=99, Y=1, counter=29, v=-41, x=0, x=28, x=28, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=29, v=-41, x=0, x=28, x=28, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=29, v=-39, x=0, x=28, x=28, y=0] [L45] x++ VAL [X=99, Y=1, counter=29, v=-39, x=0, x=28, x=29, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=30, v=-39, 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=99, Y=1, counter=30, v=-39, 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=99, Y=1, counter=30, v=-39, x=0, x=29, x=29, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=30, v=-39, x=0, x=29, x=29, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=30, v=-37, x=0, x=29, x=29, y=0] [L45] x++ VAL [X=99, Y=1, counter=30, v=-37, x=0, x=29, x=30, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=31, v=-37, 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=99, Y=1, counter=31, v=-37, 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=99, Y=1, counter=31, v=-37, x=0, x=30, x=30, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=31, v=-37, x=0, x=30, x=30, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=31, v=-35, x=0, x=30, x=30, y=0] [L45] x++ VAL [X=99, Y=1, counter=31, v=-35, x=0, x=30, x=31, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=32, v=-35, 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=99, Y=1, counter=32, v=-35, 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=99, Y=1, counter=32, v=-35, x=0, x=31, x=31, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=32, v=-35, x=0, x=31, x=31, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=32, v=-33, x=0, x=31, x=31, y=0] [L45] x++ VAL [X=99, Y=1, counter=32, v=-33, x=0, x=31, x=32, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=33, v=-33, 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=99, Y=1, counter=33, v=-33, 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=99, Y=1, counter=33, v=-33, x=0, x=32, x=32, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=33, v=-33, x=0, x=32, x=32, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=33, v=-31, x=0, x=32, x=32, y=0] [L45] x++ VAL [X=99, Y=1, counter=33, v=-31, x=0, x=32, x=33, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=34, v=-31, 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=99, Y=1, counter=34, v=-31, 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=99, Y=1, counter=34, v=-31, x=0, x=33, x=33, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=34, v=-31, x=0, x=33, x=33, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=34, v=-29, x=0, x=33, x=33, y=0] [L45] x++ VAL [X=99, Y=1, counter=34, v=-29, x=0, x=33, x=34, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=35, v=-29, 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=99, Y=1, counter=35, v=-29, 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=99, Y=1, counter=35, v=-29, x=0, x=34, x=34, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=35, v=-29, x=0, x=34, x=34, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=35, v=-27, x=0, x=34, x=34, y=0] [L45] x++ VAL [X=99, Y=1, counter=35, v=-27, x=0, x=34, x=35, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=36, v=-27, 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=99, Y=1, counter=36, v=-27, 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=99, Y=1, counter=36, v=-27, x=0, x=35, x=35, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=36, v=-27, x=0, x=35, x=35, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=36, v=-25, x=0, x=35, x=35, y=0] [L45] x++ VAL [X=99, Y=1, counter=36, v=-25, x=0, x=35, x=36, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=37, v=-25, 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=99, Y=1, counter=37, v=-25, 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=99, Y=1, counter=37, v=-25, x=0, x=36, x=36, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=37, v=-25, x=0, x=36, x=36, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=37, v=-23, x=0, x=36, x=36, y=0] [L45] x++ VAL [X=99, Y=1, counter=37, v=-23, x=0, x=36, x=37, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=38, v=-23, 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=99, Y=1, counter=38, v=-23, 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=99, Y=1, counter=38, v=-23, x=0, x=37, x=37, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=38, v=-23, x=0, x=37, x=37, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=38, v=-21, x=0, x=37, x=37, y=0] [L45] x++ VAL [X=99, Y=1, counter=38, v=-21, x=0, x=37, x=38, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=39, v=-21, 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=99, Y=1, counter=39, v=-21, 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=99, Y=1, counter=39, v=-21, x=0, x=38, x=38, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=39, v=-21, x=0, x=38, x=38, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=39, v=-19, x=0, x=38, x=38, y=0] [L45] x++ VAL [X=99, Y=1, counter=39, v=-19, x=0, x=38, x=39, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=40, v=-19, 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=99, Y=1, counter=40, v=-19, 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=99, Y=1, counter=40, v=-19, x=0, x=39, x=39, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=40, v=-19, x=0, x=39, x=39, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=40, v=-17, x=0, x=39, x=39, y=0] [L45] x++ VAL [X=99, Y=1, counter=40, v=-17, x=0, x=39, x=40, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=41, v=-17, 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=99, Y=1, counter=41, v=-17, 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=99, Y=1, counter=41, v=-17, x=0, x=40, x=40, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=41, v=-17, x=0, x=40, x=40, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=41, v=-15, x=0, x=40, x=40, y=0] [L45] x++ VAL [X=99, Y=1, counter=41, v=-15, x=0, x=40, x=41, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=42, v=-15, 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=99, Y=1, counter=42, v=-15, 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=99, Y=1, counter=42, v=-15, x=0, x=41, x=41, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=42, v=-15, x=0, x=41, x=41, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=42, v=-13, x=0, x=41, x=41, y=0] [L45] x++ VAL [X=99, Y=1, counter=42, v=-13, x=0, x=41, x=42, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=43, v=-13, 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=99, Y=1, counter=43, v=-13, 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=99, Y=1, counter=43, v=-13, x=0, x=42, x=42, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=43, v=-13, x=0, x=42, x=42, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=43, v=-11, x=0, x=42, x=42, y=0] [L45] x++ VAL [X=99, Y=1, counter=43, v=-11, x=0, x=42, x=43, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=44, v=-11, 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=99, Y=1, counter=44, v=-11, 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=99, Y=1, counter=44, v=-11, x=0, x=43, x=43, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=44, v=-11, x=0, x=43, x=43, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=44, v=-9, x=0, x=43, x=43, y=0] [L45] x++ VAL [X=99, Y=1, counter=44, v=-9, x=0, x=43, x=44, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=45, v=-9, 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=99, Y=1, counter=45, v=-9, 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=99, Y=1, counter=45, v=-9, x=0, x=44, x=44, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=45, v=-9, x=0, x=44, x=44, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=45, v=-7, x=0, x=44, x=44, y=0] [L45] x++ VAL [X=99, Y=1, counter=45, v=-7, x=0, x=44, x=45, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=46, v=-7, 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=99, Y=1, counter=46, v=-7, 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=99, Y=1, counter=46, v=-7, x=0, x=45, x=45, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=46, v=-7, x=0, x=45, x=45, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=46, v=-5, x=0, x=45, x=45, y=0] [L45] x++ VAL [X=99, Y=1, counter=46, v=-5, x=0, x=45, x=46, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=47, v=-5, 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=99, Y=1, counter=47, v=-5, 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=99, Y=1, counter=47, v=-5, x=0, x=46, x=46, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=47, v=-5, x=0, x=46, x=46, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=47, v=-3, x=0, x=46, x=46, y=0] [L45] x++ VAL [X=99, Y=1, counter=47, v=-3, x=0, x=46, x=47, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=48, v=-3, 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=99, Y=1, counter=48, v=-3, 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=99, Y=1, counter=48, v=-3, x=0, x=47, x=47, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=48, v=-3, x=0, x=47, x=47, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=48, v=-1, x=0, x=47, x=47, y=0] [L45] x++ VAL [X=99, Y=1, counter=48, v=-1, x=0, x=47, x=48, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=49, v=-1, 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=99, Y=1, counter=49, v=-1, 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=99, Y=1, counter=49, v=-1, x=0, x=48, x=48, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=49, v=-1, x=0, x=48, x=48, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=99, Y=1, counter=49, v=1, x=0, x=48, x=48, y=0] [L45] x++ VAL [X=99, Y=1, counter=49, v=1, x=0, x=48, x=49, y=0] [L31] EXPR counter++ VAL [X=99, Y=1, counter=50, v=1, 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=99, Y=1, counter=50, v=1, 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=99, Y=1, counter=50, v=1, x=0, x=49, x=49, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=99, Y=1, counter=50, v=1, 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=99, Y=1, counter=50, v=-195, x=0, x=49, x=49, y=1] [L45] x++ VAL [X=99, Y=1, counter=50, v=-195, x=0, x=49, x=50, y=1] [L31] EXPR counter++ VAL [X=99, Y=1, counter=51, v=-195, 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=99, Y=1, counter=51, v=-195, 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: 13.5s, OverallIterations: 10, TraceHistogramMax: 51, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 870 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 869 mSDsluCounter, 1508 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1406 mSDsCounter, 115 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1134 IncrementalHoareTripleChecker+Invalid, 1249 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 115 mSolverCounterUnsat, 102 mSDtfsCounter, 1134 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2422 GetRequests, 2029 SyntacticMatches, 45 SemanticMatches, 348 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4398 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=999occurred in iteration=9, InterpolantAutomatonStates: 330, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 9 MinimizatonAttempts, 31 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1654 NumberOfCodeBlocks, 1444 NumberOfCodeBlocksAsserted, 63 NumberOfCheckSat, 2268 ConstructedInterpolants, 1 QuantifiedInterpolants, 6390 SizeOfPredicates, 107 NumberOfNonLiveVariables, 2545 ConjunctsInSsa, 276 ConjunctsInUnsatCore, 17 InterpolantComputations, 1 PerfectInterpolantSequences, 10289/31834 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-12-16 04:58:10,085 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...