/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 true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound50.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 21:37:59,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 21:37:59,252 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-19 21:37:59,257 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 21:37:59,258 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 21:37:59,279 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 21:37:59,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 21:37:59,280 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 21:37:59,280 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 21:37:59,288 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 21:37:59,288 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 21:37:59,288 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 21:37:59,289 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 21:37:59,289 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 21:37:59,289 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 21:37:59,289 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 21:37:59,290 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 21:37:59,290 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 21:37:59,290 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 21:37:59,290 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 21:37:59,290 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 21:37:59,290 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 21:37:59,291 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 21:37:59,291 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 21:37:59,291 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 21:37:59,291 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 21:37:59,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 21:37:59,291 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 21:37:59,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 21:37:59,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 21:37:59,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 21:37:59,293 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 21:37:59,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 21:37:59,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 21:37:59,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 21:37:59,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 21:37:59,293 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 21:37:59,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 21:37:59,293 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 21:37:59,293 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 21:37:59,294 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 21:37:59,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 21:37:59,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 21:37:59,294 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 -> true [2023-12-19 21:37:59,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 21:37:59,495 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 21:37:59,497 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 21:37:59,498 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 21:37:59,499 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 21:37:59,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound50.c [2023-12-19 21:38:00,541 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 21:38:00,664 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 21:38:00,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps4-ll_unwindbound50.c [2023-12-19 21:38:00,669 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4953f8622/b61037b4ee324262b93ad5c8ac1bbffc/FLAG7e214ed14 [2023-12-19 21:38:00,677 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4953f8622/b61037b4ee324262b93ad5c8ac1bbffc [2023-12-19 21:38:00,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 21:38:00,680 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 21:38:00,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 21:38:00,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 21:38:00,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 21:38:00,684 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 09:38:00" (1/1) ... [2023-12-19 21:38:00,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1568c294 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:38:00, skipping insertion in model container [2023-12-19 21:38:00,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 09:38:00" (1/1) ... [2023-12-19 21:38:00,697 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 21:38:00,794 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/ps4-ll_unwindbound50.c[458,471] [2023-12-19 21:38:00,815 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 21:38:00,823 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 21:38:00,832 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/ps4-ll_unwindbound50.c[458,471] [2023-12-19 21:38:00,846 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 21:38:00,856 INFO L206 MainTranslator]: Completed translation [2023-12-19 21:38:00,856 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:38:00 WrapperNode [2023-12-19 21:38:00,856 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 21:38:00,857 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 21:38:00,857 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 21:38:00,857 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 21:38:00,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:38:00" (1/1) ... [2023-12-19 21:38:00,866 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:38:00" (1/1) ... [2023-12-19 21:38:00,877 INFO L138 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 39 [2023-12-19 21:38:00,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 21:38:00,878 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 21:38:00,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 21:38:00,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 21:38:00,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:38:00" (1/1) ... [2023-12-19 21:38:00,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:38:00" (1/1) ... [2023-12-19 21:38:00,893 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:38:00" (1/1) ... [2023-12-19 21:38:00,900 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-19 21:38:00,901 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:38:00" (1/1) ... [2023-12-19 21:38:00,901 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:38:00" (1/1) ... [2023-12-19 21:38:00,902 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:38:00" (1/1) ... [2023-12-19 21:38:00,904 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:38:00" (1/1) ... [2023-12-19 21:38:00,905 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:38:00" (1/1) ... [2023-12-19 21:38:00,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:38:00" (1/1) ... [2023-12-19 21:38:00,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 21:38:00,907 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 21:38:00,907 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 21:38:00,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 21:38:00,907 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:38:00" (1/1) ... [2023-12-19 21:38:00,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 21:38:00,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 21:38:00,933 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-19 21:38:00,951 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-19 21:38:00,957 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 21:38:00,958 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 21:38:00,958 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 21:38:00,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 21:38:00,959 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-19 21:38:00,959 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-19 21:38:01,000 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 21:38:01,002 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 21:38:01,136 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 21:38:01,150 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 21:38:01,150 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 21:38:01,150 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 09:38:01 BoogieIcfgContainer [2023-12-19 21:38:01,150 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 21:38:01,152 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 21:38:01,152 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 21:38:01,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 21:38:01,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 09:38:00" (1/3) ... [2023-12-19 21:38:01,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edbad7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 09:38:01, skipping insertion in model container [2023-12-19 21:38:01,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 09:38:00" (2/3) ... [2023-12-19 21:38:01,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3edbad7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 09:38:01, skipping insertion in model container [2023-12-19 21:38:01,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 09:38:01" (3/3) ... [2023-12-19 21:38:01,156 INFO L112 eAbstractionObserver]: Analyzing ICFG ps4-ll_unwindbound50.c [2023-12-19 21:38:01,168 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 21:38:01,168 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 21:38:01,205 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 21:38:01,211 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;@7f2a9908, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 21:38:01,211 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 21:38:01,214 INFO L276 IsEmpty]: Start isEmpty. Operand has 15 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 21:38:01,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-19 21:38:01,223 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 21:38:01,223 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-19 21:38:01,223 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 21:38:01,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 21:38:01,229 INFO L85 PathProgramCache]: Analyzing trace with hash -2070802916, now seen corresponding path program 1 times [2023-12-19 21:38:01,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 21:38:01,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688359141] [2023-12-19 21:38:01,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 21:38:01,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 21:38:01,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 21:38:01,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 21:38:01,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688359141] [2023-12-19 21:38:01,324 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-19 21:38:01,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441984890] [2023-12-19 21:38:01,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 21:38:01,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 21:38:01,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 21:38:01,326 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-19 21:38:01,329 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-19 21:38:01,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 21:38:01,361 INFO L262 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-19 21:38:01,363 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 21:38:01,375 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-19 21:38:01,376 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 21:38:01,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441984890] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 21:38:01,376 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 21:38:01,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 21:38:01,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003095664] [2023-12-19 21:38:01,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 21:38:01,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 21:38:01,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 21:38:01,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 21:38:01,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 21:38:01,399 INFO L87 Difference]: Start difference. First operand has 15 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-19 21:38:01,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 21:38:01,414 INFO L93 Difference]: Finished difference Result 29 states and 42 transitions. [2023-12-19 21:38:01,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 21:38:01,415 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 6 [2023-12-19 21:38:01,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 21:38:01,420 INFO L225 Difference]: With dead ends: 29 [2023-12-19 21:38:01,420 INFO L226 Difference]: Without dead ends: 13 [2023-12-19 21:38:01,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 21:38:01,425 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 21:38:01,426 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 21:38:01,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2023-12-19 21:38:01,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2023-12-19 21:38:01,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 21:38:01,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2023-12-19 21:38:01,447 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 6 [2023-12-19 21:38:01,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 21:38:01,447 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2023-12-19 21:38:01,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-19 21:38:01,448 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2023-12-19 21:38:01,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-19 21:38:01,449 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 21:38:01,449 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-19 21:38:01,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-19 21:38:01,653 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-19 21:38:01,653 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 21:38:01,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 21:38:01,655 INFO L85 PathProgramCache]: Analyzing trace with hash -170804699, now seen corresponding path program 1 times [2023-12-19 21:38:01,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 21:38:01,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646871366] [2023-12-19 21:38:01,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 21:38:01,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 21:38:01,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 21:38:01,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 21:38:01,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646871366] [2023-12-19 21:38:01,678 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-19 21:38:01,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348153531] [2023-12-19 21:38:01,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 21:38:01,678 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 21:38:01,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 21:38:01,683 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-19 21:38:01,684 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-19 21:38:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 21:38:01,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 21:38:01,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 21:38:01,754 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-19 21:38:01,755 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 21:38:01,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348153531] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 21:38:01,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 21:38:01,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 21:38:01,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235823774] [2023-12-19 21:38:01,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 21:38:01,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 21:38:01,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 21:38:01,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 21:38:01,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 21:38:01,757 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 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-19 21:38:01,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 21:38:01,780 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2023-12-19 21:38:01,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 21:38:01,780 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 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-19 21:38:01,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 21:38:01,781 INFO L225 Difference]: With dead ends: 23 [2023-12-19 21:38:01,781 INFO L226 Difference]: Without dead ends: 15 [2023-12-19 21:38:01,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 21:38:01,782 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 0 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 21:38:01,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 21:38:01,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2023-12-19 21:38:01,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2023-12-19 21:38:01,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 21:38:01,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2023-12-19 21:38:01,786 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 7 [2023-12-19 21:38:01,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 21:38:01,786 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2023-12-19 21:38:01,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 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-19 21:38:01,786 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2023-12-19 21:38:01,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-19 21:38:01,786 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 21:38:01,786 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-19 21:38:01,796 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-19 21:38:01,991 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-19 21:38:01,991 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 21:38:01,991 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 21:38:01,991 INFO L85 PathProgramCache]: Analyzing trace with hash -169017239, now seen corresponding path program 1 times [2023-12-19 21:38:01,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 21:38:01,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853390972] [2023-12-19 21:38:01,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 21:38:01,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 21:38:01,999 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 21:38:01,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1645958371] [2023-12-19 21:38:01,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 21:38:01,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 21:38:02,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 21:38:02,004 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-19 21:38:02,012 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-19 21:38:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 21:38:02,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-19 21:38:02,048 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 21:38:02,120 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-19 21:38:02,120 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 21:38:02,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 21:38:02,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853390972] [2023-12-19 21:38:02,120 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 21:38:02,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645958371] [2023-12-19 21:38:02,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645958371] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 21:38:02,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 21:38:02,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-19 21:38:02,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47172125] [2023-12-19 21:38:02,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 21:38:02,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-19 21:38:02,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 21:38:02,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-19 21:38:02,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-19 21:38:02,122 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 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-19 21:38:02,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 21:38:02,158 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2023-12-19 21:38:02,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-19 21:38:02,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 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-19 21:38:02,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 21:38:02,159 INFO L225 Difference]: With dead ends: 25 [2023-12-19 21:38:02,159 INFO L226 Difference]: Without dead ends: 21 [2023-12-19 21:38:02,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-19 21:38:02,160 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 6 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 21:38:02,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 45 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 21:38:02,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-19 21:38:02,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-19 21:38:02,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 15 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 21:38:02,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2023-12-19 21:38:02,165 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 7 [2023-12-19 21:38:02,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 21:38:02,165 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2023-12-19 21:38:02,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 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-19 21:38:02,165 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2023-12-19 21:38:02,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-19 21:38:02,166 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 21:38:02,166 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 21:38:02,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-19 21:38:02,373 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-19 21:38:02,373 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 21:38:02,374 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 21:38:02,374 INFO L85 PathProgramCache]: Analyzing trace with hash 867499275, now seen corresponding path program 1 times [2023-12-19 21:38:02,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 21:38:02,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834369041] [2023-12-19 21:38:02,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 21:38:02,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 21:38:02,380 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 21:38:02,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [824706388] [2023-12-19 21:38:02,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 21:38:02,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 21:38:02,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 21:38:02,382 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-19 21:38:02,407 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-19 21:38:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 21:38:02,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-19 21:38:02,432 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 21:38:02,456 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-19 21:38:02,456 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 21:38:02,494 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-19 21:38:02,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 21:38:02,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834369041] [2023-12-19 21:38:02,494 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 21:38:02,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824706388] [2023-12-19 21:38:02,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824706388] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 21:38:02,494 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 21:38:02,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-19 21:38:02,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429767541] [2023-12-19 21:38:02,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 21:38:02,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 21:38:02,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 21:38:02,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 21:38:02,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-19 21:38:02,496 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-19 21:38:02,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 21:38:02,548 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2023-12-19 21:38:02,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 21:38:02,548 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 15 [2023-12-19 21:38:02,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 21:38:02,549 INFO L225 Difference]: With dead ends: 55 [2023-12-19 21:38:02,549 INFO L226 Difference]: Without dead ends: 47 [2023-12-19 21:38:02,549 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 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-19 21:38:02,550 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 29 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 21:38:02,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 69 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 21:38:02,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-12-19 21:38:02,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2023-12-19 21:38:02,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 28 states have (on average 1.25) internal successors, (35), 31 states have internal predecessors, (35), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-19 21:38:02,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2023-12-19 21:38:02,558 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 52 transitions. Word has length 15 [2023-12-19 21:38:02,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 21:38:02,558 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 52 transitions. [2023-12-19 21:38:02,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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-19 21:38:02,558 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 52 transitions. [2023-12-19 21:38:02,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-19 21:38:02,559 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 21:38:02,559 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 21:38:02,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-19 21:38:02,763 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-19 21:38:02,763 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 21:38:02,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 21:38:02,764 INFO L85 PathProgramCache]: Analyzing trace with hash 869286735, now seen corresponding path program 1 times [2023-12-19 21:38:02,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 21:38:02,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080534516] [2023-12-19 21:38:02,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 21:38:02,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 21:38:02,774 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 21:38:02,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1311554170] [2023-12-19 21:38:02,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 21:38:02,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 21:38:02,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 21:38:02,776 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-19 21:38:02,796 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-19 21:38:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 21:38:02,811 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-19 21:38:02,813 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 21:38:02,883 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 21:38:02,883 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 21:38:03,047 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 21:38:03,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 21:38:03,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080534516] [2023-12-19 21:38:03,048 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 21:38:03,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1311554170] [2023-12-19 21:38:03,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1311554170] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 21:38:03,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 21:38:03,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2023-12-19 21:38:03,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420360928] [2023-12-19 21:38:03,053 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 21:38:03,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 21:38:03,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 21:38:03,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 21:38:03,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-19 21:38:03,055 INFO L87 Difference]: Start difference. First operand 43 states and 52 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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-19 21:38:03,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 21:38:03,146 INFO L93 Difference]: Finished difference Result 57 states and 65 transitions. [2023-12-19 21:38:03,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-19 21:38:03,147 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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 15 [2023-12-19 21:38:03,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 21:38:03,149 INFO L225 Difference]: With dead ends: 57 [2023-12-19 21:38:03,149 INFO L226 Difference]: Without dead ends: 46 [2023-12-19 21:38:03,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2023-12-19 21:38:03,153 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 21:38:03,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 69 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 21:38:03,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-19 21:38:03,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 40. [2023-12-19 21:38:03,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 30 states have (on average 1.1333333333333333) internal successors, (34), 30 states have internal predecessors, (34), 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-19 21:38:03,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2023-12-19 21:38:03,161 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 15 [2023-12-19 21:38:03,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 21:38:03,161 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2023-12-19 21:38:03,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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-19 21:38:03,162 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2023-12-19 21:38:03,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-12-19 21:38:03,162 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 21:38:03,162 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-12-19 21:38:03,166 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-19 21:38:03,362 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-19 21:38:03,363 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 21:38:03,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 21:38:03,364 INFO L85 PathProgramCache]: Analyzing trace with hash 24753612, now seen corresponding path program 1 times [2023-12-19 21:38:03,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 21:38:03,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266934203] [2023-12-19 21:38:03,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 21:38:03,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 21:38:03,382 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 21:38:03,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1699664821] [2023-12-19 21:38:03,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 21:38:03,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 21:38:03,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 21:38:03,398 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-19 21:38:03,409 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-19 21:38:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 21:38:03,427 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-19 21:38:03,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 21:38:03,548 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-19 21:38:03,548 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 21:38:03,766 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-19 21:38:03,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 21:38:03,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266934203] [2023-12-19 21:38:03,766 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 21:38:03,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699664821] [2023-12-19 21:38:03,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699664821] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 21:38:03,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 21:38:03,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-12-19 21:38:03,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615173859] [2023-12-19 21:38:03,767 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 21:38:03,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-19 21:38:03,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 21:38:03,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-19 21:38:03,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-12-19 21:38:03,780 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 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-19 21:38:07,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-19 21:38:07,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 21:38:07,948 INFO L93 Difference]: Finished difference Result 49 states and 53 transitions. [2023-12-19 21:38:07,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 21:38:07,948 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 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 21 [2023-12-19 21:38:07,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 21:38:07,949 INFO L225 Difference]: With dead ends: 49 [2023-12-19 21:38:07,949 INFO L226 Difference]: Without dead ends: 42 [2023-12-19 21:38:07,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=364, Unknown=0, NotChecked=0, Total=462 [2023-12-19 21:38:07,950 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 17 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 9 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-12-19 21:38:07,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 101 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 103 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2023-12-19 21:38:07,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-19 21:38:07,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-19 21:38:07,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 31 states have (on average 1.064516129032258) internal successors, (33), 31 states have internal predecessors, (33), 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-19 21:38:07,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2023-12-19 21:38:07,956 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 21 [2023-12-19 21:38:07,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 21:38:07,956 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2023-12-19 21:38:07,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 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-19 21:38:07,956 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2023-12-19 21:38:07,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-19 21:38:07,957 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 21:38:07,957 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1] [2023-12-19 21:38:07,966 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-19 21:38:08,167 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-19 21:38:08,168 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 21:38:08,168 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 21:38:08,168 INFO L85 PathProgramCache]: Analyzing trace with hash -795795011, now seen corresponding path program 2 times [2023-12-19 21:38:08,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 21:38:08,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077445765] [2023-12-19 21:38:08,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 21:38:08,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 21:38:08,179 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 21:38:08,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [389396498] [2023-12-19 21:38:08,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 21:38:08,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 21:38:08,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 21:38:08,180 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-19 21:38:08,202 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-19 21:38:08,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 21:38:08,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 21:38:08,223 INFO L262 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-19 21:38:08,229 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 21:38:08,289 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 21:38:08,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 21:38:08,365 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 8 proven. 32 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-19 21:38:08,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 21:38:08,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077445765] [2023-12-19 21:38:08,365 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 21:38:08,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389396498] [2023-12-19 21:38:08,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389396498] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 21:38:08,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 21:38:08,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-19 21:38:08,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260401751] [2023-12-19 21:38:08,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 21:38:08,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 21:38:08,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 21:38:08,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 21:38:08,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-12-19 21:38:08,368 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 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-19 21:38:08,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 21:38:08,481 INFO L93 Difference]: Finished difference Result 118 states and 124 transitions. [2023-12-19 21:38:08,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-19 21:38:08,481 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 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 39 [2023-12-19 21:38:08,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 21:38:08,482 INFO L225 Difference]: With dead ends: 118 [2023-12-19 21:38:08,482 INFO L226 Difference]: Without dead ends: 113 [2023-12-19 21:38:08,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 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-19 21:38:08,483 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 85 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 21:38:08,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 86 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 21:38:08,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-12-19 21:38:08,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 88. [2023-12-19 21:38:08,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.106060606060606) internal successors, (73), 66 states have internal predecessors, (73), 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-19 21:38:08,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2023-12-19 21:38:08,494 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 39 [2023-12-19 21:38:08,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 21:38:08,494 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2023-12-19 21:38:08,494 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 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-19 21:38:08,494 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2023-12-19 21:38:08,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2023-12-19 21:38:08,495 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 21:38:08,495 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1] [2023-12-19 21:38:08,504 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-19 21:38:08,703 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-19 21:38:08,704 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 21:38:08,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 21:38:08,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1312813826, now seen corresponding path program 2 times [2023-12-19 21:38:08,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 21:38:08,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304455232] [2023-12-19 21:38:08,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 21:38:08,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 21:38:08,710 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 21:38:08,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [459490892] [2023-12-19 21:38:08,711 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 21:38:08,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 21:38:08,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 21:38:08,712 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-19 21:38:08,727 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-19 21:38:08,758 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 21:38:08,758 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 21:38:08,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-19 21:38:08,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 21:38:08,865 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 15 proven. 47 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-19 21:38:08,865 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 21:38:16,983 WARN L854 $PredicateComparison]: unable to prove that (or (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 3) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 3)) 4) 0)) (= (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 2)) (+ (* |c_ULTIMATE.start_main_~c~0#1| 2) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|)))) is different from false [2023-12-19 21:38:25,033 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-19 21:38:33,052 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-19 21:38:45,066 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-19 21:38:53,080 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| Int) (|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_12| Int)) (or (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|)) (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_12|) (* |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_12| 2))) (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| 3) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| 3)) 4) 0)))) is different from true [2023-12-19 21:39:05,098 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-19 21:39:21,119 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-19 21:39:29,304 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| Int) (|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_12| Int)) (or (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18|)) (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_12|) (* |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_12| 2))) (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| 3) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| 2) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_18| 3)) 4) 0))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-12-19 21:39:45,357 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ (* |c_ULTIMATE.start_main_~c~0#1| 3) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 3))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 3) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 3)) 4) 0))) is different from false [2023-12-19 21:40:05,461 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~c~0#1| 4)) (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 4))) (not (= (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 2) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 3) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 3)) 4) 0))) is different from false [2023-12-19 21:40:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 15 proven. 6 refuted. 6 times theorem prover too weak. 28 trivial. 35 not checked. [2023-12-19 21:40:17,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 21:40:17,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304455232] [2023-12-19 21:40:17,488 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 21:40:17,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459490892] [2023-12-19 21:40:17,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459490892] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 21:40:17,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 21:40:17,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2023-12-19 21:40:17,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746483739] [2023-12-19 21:40:17,488 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 21:40:17,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-12-19 21:40:17,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 21:40:17,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-12-19 21:40:17,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=230, Unknown=5, NotChecked=170, Total=462 [2023-12-19 21:40:17,489 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 22 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-19 21:40:17,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 21:40:17,744 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2023-12-19 21:40:17,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-19 21:40:17,745 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Word has length 45 [2023-12-19 21:40:17,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 21:40:17,745 INFO L225 Difference]: With dead ends: 94 [2023-12-19 21:40:17,746 INFO L226 Difference]: Without dead ends: 88 [2023-12-19 21:40:17,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 68 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=123, Invalid=542, Unknown=5, NotChecked=260, Total=930 [2023-12-19 21:40:17,746 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 170 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 21:40:17,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 185 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 140 Invalid, 0 Unknown, 170 Unchecked, 0.1s Time] [2023-12-19 21:40:17,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-12-19 21:40:17,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-12-19 21:40:17,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 66 states have (on average 1.0151515151515151) internal successors, (67), 66 states have internal predecessors, (67), 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-19 21:40:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2023-12-19 21:40:17,761 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 45 [2023-12-19 21:40:17,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 21:40:17,763 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2023-12-19 21:40:17,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.3) internal successors, (46), 20 states have internal predecessors, (46), 12 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-19 21:40:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2023-12-19 21:40:17,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2023-12-19 21:40:17,769 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 21:40:17,769 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1] [2023-12-19 21:40:17,776 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-19 21:40:17,977 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-19 21:40:17,979 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 21:40:17,979 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 21:40:17,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1242040609, now seen corresponding path program 3 times [2023-12-19 21:40:17,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 21:40:17,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209361263] [2023-12-19 21:40:17,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 21:40:17,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 21:40:18,000 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 21:40:18,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1142017125] [2023-12-19 21:40:18,000 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-19 21:40:18,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 21:40:18,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 21:40:18,001 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-19 21:40:18,003 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-19 21:40:18,088 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-12-19 21:40:18,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 21:40:18,089 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-19 21:40:18,092 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 21:40:18,211 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 21:40:18,211 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 21:40:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 20 proven. 200 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-19 21:40:18,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 21:40:18,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209361263] [2023-12-19 21:40:18,435 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 21:40:18,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142017125] [2023-12-19 21:40:18,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142017125] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 21:40:18,435 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 21:40:18,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2023-12-19 21:40:18,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665000130] [2023-12-19 21:40:18,435 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 21:40:18,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-19 21:40:18,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 21:40:18,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-19 21:40:18,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2023-12-19 21:40:18,437 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand has 26 states, 26 states have (on average 3.923076923076923) internal successors, (102), 26 states have internal predecessors, (102), 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-19 21:40:18,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 21:40:18,783 INFO L93 Difference]: Finished difference Result 189 states and 200 transitions. [2023-12-19 21:40:18,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2023-12-19 21:40:18,783 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.923076923076923) internal successors, (102), 26 states have internal predecessors, (102), 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 87 [2023-12-19 21:40:18,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 21:40:18,785 INFO L225 Difference]: With dead ends: 189 [2023-12-19 21:40:18,785 INFO L226 Difference]: Without dead ends: 184 [2023-12-19 21:40:18,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 148 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-19 21:40:18,788 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 71 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 21:40:18,788 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 129 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 21:40:18,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-12-19 21:40:18,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2023-12-19 21:40:18,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 138 states have (on average 1.0072463768115942) internal successors, (139), 138 states have internal predecessors, (139), 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-19 21:40:18,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2023-12-19 21:40:18,819 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 87 [2023-12-19 21:40:18,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 21:40:18,820 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2023-12-19 21:40:18,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.923076923076923) internal successors, (102), 26 states have internal predecessors, (102), 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-19 21:40:18,821 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2023-12-19 21:40:18,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2023-12-19 21:40:18,823 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 21:40:18,823 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1] [2023-12-19 21:40:18,828 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-19 21:40:19,028 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-19 21:40:19,031 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 21:40:19,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 21:40:19,031 INFO L85 PathProgramCache]: Analyzing trace with hash 539512809, now seen corresponding path program 4 times [2023-12-19 21:40:19,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 21:40:19,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812672022] [2023-12-19 21:40:19,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 21:40:19,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 21:40:19,044 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 21:40:19,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [394344613] [2023-12-19 21:40:19,044 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-19 21:40:19,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 21:40:19,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 21:40:19,045 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-19 21:40:19,050 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-19 21:40:19,643 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-19 21:40:19,643 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 21:40:19,646 INFO L262 TraceCheckSpWp]: Trace formula consists of 507 conjuncts, 47 conjunts are in the unsatisfiable core [2023-12-19 21:40:19,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 21:40:20,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 44 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 21:40:20,033 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 21:40:20,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 44 proven. 968 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2023-12-19 21:40:20,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 21:40:20,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812672022] [2023-12-19 21:40:20,716 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 21:40:20,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394344613] [2023-12-19 21:40:20,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394344613] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 21:40:20,716 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 21:40:20,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2023-12-19 21:40:20,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810585496] [2023-12-19 21:40:20,716 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 21:40:20,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2023-12-19 21:40:20,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 21:40:20,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2023-12-19 21:40:20,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2023-12-19 21:40:20,719 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand has 50 states, 50 states have (on average 4.2) internal successors, (210), 50 states have internal predecessors, (210), 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-19 21:40:21,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 21:40:21,885 INFO L93 Difference]: Finished difference Result 381 states and 404 transitions. [2023-12-19 21:40:21,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2023-12-19 21:40:21,886 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 4.2) internal successors, (210), 50 states have internal predecessors, (210), 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 183 [2023-12-19 21:40:21,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 21:40:21,888 INFO L225 Difference]: With dead ends: 381 [2023-12-19 21:40:21,888 INFO L226 Difference]: Without dead ends: 376 [2023-12-19 21:40:21,889 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 409 GetRequests, 316 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2023-12-19 21:40:21,890 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 245 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 21:40:21,890 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 230 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 21:40:21,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2023-12-19 21:40:21,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2023-12-19 21:40:21,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 282 states have (on average 1.00354609929078) internal successors, (283), 282 states have internal predecessors, (283), 47 states have call successors, (47), 47 states have call predecessors, (47), 46 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2023-12-19 21:40:21,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2023-12-19 21:40:21,923 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 183 [2023-12-19 21:40:21,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 21:40:21,924 INFO L495 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2023-12-19 21:40:21,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 4.2) internal successors, (210), 50 states have internal predecessors, (210), 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-19 21:40:21,924 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2023-12-19 21:40:21,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2023-12-19 21:40:21,927 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 21:40:21,927 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1] [2023-12-19 21:40:21,934 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-12-19 21:40:22,133 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-19 21:40:22,134 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 21:40:22,134 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 21:40:22,134 INFO L85 PathProgramCache]: Analyzing trace with hash -890061447, now seen corresponding path program 5 times [2023-12-19 21:40:22,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 21:40:22,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295821666] [2023-12-19 21:40:22,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 21:40:22,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 21:40:22,148 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 21:40:22,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [903417035] [2023-12-19 21:40:22,148 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-19 21:40:22,148 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 21:40:22,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 21:40:22,149 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 21:40:22,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-19 21:40:37,049 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2023-12-19 21:40:37,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 21:40:37,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 1011 conjuncts, 95 conjunts are in the unsatisfiable core [2023-12-19 21:40:37,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 21:40:38,128 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 92 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-19 21:40:38,128 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 21:40:39,205 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 92 proven. 4232 refuted. 0 times theorem prover too weak. 4140 trivial. 0 not checked. [2023-12-19 21:40:39,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 21:40:39,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295821666] [2023-12-19 21:40:39,206 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 21:40:39,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903417035] [2023-12-19 21:40:39,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903417035] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 21:40:39,206 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 21:40:39,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2023-12-19 21:40:39,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143581118] [2023-12-19 21:40:39,206 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 21:40:39,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-12-19 21:40:39,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 21:40:39,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-12-19 21:40:39,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2023-12-19 21:40:39,238 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand has 54 states, 54 states have (on average 5.5) internal successors, (297), 54 states have internal predecessors, (297), 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-19 21:40:40,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 21:40:40,409 INFO L93 Difference]: Finished difference Result 413 states and 416 transitions. [2023-12-19 21:40:40,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2023-12-19 21:40:40,410 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 5.5) internal successors, (297), 54 states have internal predecessors, (297), 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 375 [2023-12-19 21:40:40,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 21:40:40,412 INFO L225 Difference]: With dead ends: 413 [2023-12-19 21:40:40,412 INFO L226 Difference]: Without dead ends: 408 [2023-12-19 21:40:40,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 797 GetRequests, 652 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2023-12-19 21:40:40,414 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-19 21:40:40,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 237 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-19 21:40:40,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2023-12-19 21:40:40,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2023-12-19 21:40:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 306 states have (on average 1.0032679738562091) internal successors, (307), 306 states have internal predecessors, (307), 51 states have call successors, (51), 51 states have call predecessors, (51), 50 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2023-12-19 21:40:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 408 transitions. [2023-12-19 21:40:40,456 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 408 transitions. Word has length 375 [2023-12-19 21:40:40,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 21:40:40,457 INFO L495 AbstractCegarLoop]: Abstraction has 408 states and 408 transitions. [2023-12-19 21:40:40,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 5.5) internal successors, (297), 54 states have internal predecessors, (297), 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-19 21:40:40,457 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 408 transitions. [2023-12-19 21:40:40,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2023-12-19 21:40:40,460 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 21:40:40,460 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1] [2023-12-19 21:40:40,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-19 21:40:40,670 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-12-19 21:40:40,670 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 21:40:40,670 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 21:40:40,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1280322287, now seen corresponding path program 6 times [2023-12-19 21:40:40,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 21:40:40,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037447025] [2023-12-19 21:40:40,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 21:40:40,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 21:40:40,684 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 21:40:40,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [508833067] [2023-12-19 21:40:40,684 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-12-19 21:40:40,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 21:40:40,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 21:40:40,685 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 21:40:40,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-19 21:41:46,705 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2023-12-19 21:41:46,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-19 21:41:46,705 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 21:41:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 21:41:52,935 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 21:41:52,935 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 21:41:52,935 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 21:41:52,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-19 21:41:53,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-19 21:41:53,139 INFO L445 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1] [2023-12-19 21:41:53,142 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 21:41:53,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 09:41:53 BoogieIcfgContainer [2023-12-19 21:41:53,222 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 21:41:53,223 INFO L158 Benchmark]: Toolchain (without parser) took 232542.95ms. Allocated memory is still 275.8MB. Free memory was 239.9MB in the beginning and 130.9MB in the end (delta: 109.1MB). Peak memory consumption was 110.3MB. Max. memory is 8.0GB. [2023-12-19 21:41:53,223 INFO L158 Benchmark]: CDTParser took 0.39ms. Allocated memory is still 204.5MB. Free memory is still 158.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 21:41:53,223 INFO L158 Benchmark]: CACSL2BoogieTranslator took 175.65ms. Allocated memory is still 275.8MB. Free memory was 239.9MB in the beginning and 228.7MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-19 21:41:53,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.59ms. Allocated memory is still 275.8MB. Free memory was 228.7MB in the beginning and 227.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-19 21:41:53,223 INFO L158 Benchmark]: Boogie Preprocessor took 28.51ms. Allocated memory is still 275.8MB. Free memory was 227.0MB in the beginning and 225.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 21:41:53,224 INFO L158 Benchmark]: RCFGBuilder took 243.83ms. Allocated memory is still 275.8MB. Free memory was 225.6MB in the beginning and 214.8MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-19 21:41:53,224 INFO L158 Benchmark]: TraceAbstraction took 232070.48ms. Allocated memory is still 275.8MB. Free memory was 214.1MB in the beginning and 130.9MB in the end (delta: 83.2MB). Peak memory consumption was 84.1MB. Max. memory is 8.0GB. [2023-12-19 21:41:53,224 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.39ms. Allocated memory is still 204.5MB. Free memory is still 158.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 175.65ms. Allocated memory is still 275.8MB. Free memory was 239.9MB in the beginning and 228.7MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.59ms. Allocated memory is still 275.8MB. Free memory was 228.7MB in the beginning and 227.0MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 28.51ms. Allocated memory is still 275.8MB. Free memory was 227.0MB in the beginning and 225.6MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 243.83ms. Allocated memory is still 275.8MB. Free memory was 225.6MB in the beginning and 214.8MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 232070.48ms. Allocated memory is still 275.8MB. Free memory was 214.1MB in the beginning and 130.9MB in the end (delta: 83.2MB). Peak memory consumption was 84.1MB. 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: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int counter = 0; [L19] short k; [L20] long long y, x, c; [L21] k = __VERIFIER_nondet_short() [L23] y = 0 [L24] x = 0 [L25] c = 0 VAL [c=0, counter=0, k=51, x=0, y=0] [L27] EXPR counter++ VAL [c=0, counter=1, k=51, x=0, y=0] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=1] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=0, counter=1, k=51, x=0, y=0] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=1, counter=1, k=51, x=1, y=1] [L27] EXPR counter++ VAL [c=1, counter=2, k=51, x=1, y=1] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=2] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=1, counter=2, k=51, x=1, y=1] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=2, counter=2, k=51, x=9, y=2] [L27] EXPR counter++ VAL [c=2, counter=3, k=51, x=9, y=2] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=3] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=2, counter=3, k=51, x=9, y=2] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=3, counter=3, k=51, x=36, y=3] [L27] EXPR counter++ VAL [c=3, counter=4, k=51, x=36, y=3] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=4] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=3, counter=4, k=51, x=36, y=3] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=4, counter=4, k=51, x=100, y=4] [L27] EXPR counter++ VAL [c=4, counter=5, k=51, x=100, y=4] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=5] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=4, counter=5, k=51, x=100, y=4] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=5, counter=5, k=51, x=225, y=5] [L27] EXPR counter++ VAL [c=5, counter=6, k=51, x=225, y=5] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=6] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=5, counter=6, k=51, x=225, y=5] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=6, counter=6, k=51, x=441, y=6] [L27] EXPR counter++ VAL [c=6, counter=7, k=51, x=441, y=6] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=7] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=6, counter=7, k=51, x=441, y=6] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=7, counter=7, k=51, x=784, y=7] [L27] EXPR counter++ VAL [c=7, counter=8, k=51, x=784, y=7] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=8] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=7, counter=8, k=51, x=784, y=7] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=8, counter=8, k=51, x=1296, y=8] [L27] EXPR counter++ VAL [c=8, counter=9, k=51, x=1296, y=8] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=9] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=8, counter=9, k=51, x=1296, y=8] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=9, counter=9, k=51, x=2025, y=9] [L27] EXPR counter++ VAL [c=9, counter=10, k=51, x=2025, y=9] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=10] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=9, counter=10, k=51, x=2025, y=9] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=10, counter=10, k=51, x=3025, y=10] [L27] EXPR counter++ VAL [c=10, counter=11, k=51, x=3025, y=10] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=11] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=10, counter=11, k=51, x=3025, y=10] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=11, counter=11, k=51, x=4356, y=11] [L27] EXPR counter++ VAL [c=11, counter=12, k=51, x=4356, y=11] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=12] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=11, counter=12, k=51, x=4356, y=11] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=12, counter=12, k=51, x=6084, y=12] [L27] EXPR counter++ VAL [c=12, counter=13, k=51, x=6084, y=12] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=13] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=12, counter=13, k=51, x=6084, y=12] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=13, counter=13, k=51, x=8281, y=13] [L27] EXPR counter++ VAL [c=13, counter=14, k=51, x=8281, y=13] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=14] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=13, counter=14, k=51, x=8281, y=13] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=14, counter=14, k=51, x=11025, y=14] [L27] EXPR counter++ VAL [c=14, counter=15, k=51, x=11025, y=14] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=15] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=14, counter=15, k=51, x=11025, y=14] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=15, counter=15, k=51, x=14400, y=15] [L27] EXPR counter++ VAL [c=15, counter=16, k=51, x=14400, y=15] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=16] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=15, counter=16, k=51, x=14400, y=15] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=16, counter=16, k=51, x=18496, y=16] [L27] EXPR counter++ VAL [c=16, counter=17, k=51, x=18496, y=16] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=17] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=16, counter=17, k=51, x=18496, y=16] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=17, counter=17, k=51, x=23409, y=17] [L27] EXPR counter++ VAL [c=17, counter=18, k=51, x=23409, y=17] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=18] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=17, counter=18, k=51, x=23409, y=17] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=18, counter=18, k=51, x=29241, y=18] [L27] EXPR counter++ VAL [c=18, counter=19, k=51, x=29241, y=18] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=19] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=18, counter=19, k=51, x=29241, y=18] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=19, counter=19, k=51, x=36100, y=19] [L27] EXPR counter++ VAL [c=19, counter=20, k=51, x=36100, y=19] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=20] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=19, counter=20, k=51, x=36100, y=19] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=20, counter=20, k=51, x=44100, y=20] [L27] EXPR counter++ VAL [c=20, counter=21, k=51, x=44100, y=20] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=21] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=20, counter=21, k=51, x=44100, y=20] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=21, counter=21, k=51, x=53361, y=21] [L27] EXPR counter++ VAL [c=21, counter=22, k=51, x=53361, y=21] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=22] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=21, counter=22, k=51, x=53361, y=21] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=22, counter=22, k=51, x=64009, y=22] [L27] EXPR counter++ VAL [c=22, counter=23, k=51, x=64009, y=22] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=23] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=22, counter=23, k=51, x=64009, y=22] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=23, counter=23, k=51, x=76176, y=23] [L27] EXPR counter++ VAL [c=23, counter=24, k=51, x=76176, y=23] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=24] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=23, counter=24, k=51, x=76176, y=23] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=24, counter=24, k=51, x=90000, y=24] [L27] EXPR counter++ VAL [c=24, counter=25, k=51, x=90000, y=24] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=25] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=24, counter=25, k=51, x=90000, y=24] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=25, counter=25, k=51, x=105625, y=25] [L27] EXPR counter++ VAL [c=25, counter=26, k=51, x=105625, y=25] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=26] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=25, counter=26, k=51, x=105625, y=25] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=26, counter=26, k=51, x=123201, y=26] [L27] EXPR counter++ VAL [c=26, counter=27, k=51, x=123201, y=26] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=27] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=26, counter=27, k=51, x=123201, y=26] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=27, counter=27, k=51, x=142884, y=27] [L27] EXPR counter++ VAL [c=27, counter=28, k=51, x=142884, y=27] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=28] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=27, counter=28, k=51, x=142884, y=27] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=28, counter=28, k=51, x=164836, y=28] [L27] EXPR counter++ VAL [c=28, counter=29, k=51, x=164836, y=28] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=29] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=28, counter=29, k=51, x=164836, y=28] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=29, counter=29, k=51, x=189225, y=29] [L27] EXPR counter++ VAL [c=29, counter=30, k=51, x=189225, y=29] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=30] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=29, counter=30, k=51, x=189225, y=29] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=30, counter=30, k=51, x=216225, y=30] [L27] EXPR counter++ VAL [c=30, counter=31, k=51, x=216225, y=30] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=31] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=30, counter=31, k=51, x=216225, y=30] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=31, counter=31, k=51, x=246016, y=31] [L27] EXPR counter++ VAL [c=31, counter=32, k=51, x=246016, y=31] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=32] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=31, counter=32, k=51, x=246016, y=31] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=32, counter=32, k=51, x=278784, y=32] [L27] EXPR counter++ VAL [c=32, counter=33, k=51, x=278784, y=32] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=33] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=32, counter=33, k=51, x=278784, y=32] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=33, counter=33, k=51, x=314721, y=33] [L27] EXPR counter++ VAL [c=33, counter=34, k=51, x=314721, y=33] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=34] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=33, counter=34, k=51, x=314721, y=33] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=34, counter=34, k=51, x=354025, y=34] [L27] EXPR counter++ VAL [c=34, counter=35, k=51, x=354025, y=34] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=35] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=34, counter=35, k=51, x=354025, y=34] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=35, counter=35, k=51, x=396900, y=35] [L27] EXPR counter++ VAL [c=35, counter=36, k=51, x=396900, y=35] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=36] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=35, counter=36, k=51, x=396900, y=35] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=36, counter=36, k=51, x=443556, y=36] [L27] EXPR counter++ VAL [c=36, counter=37, k=51, x=443556, y=36] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=37] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=36, counter=37, k=51, x=443556, y=36] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=37, counter=37, k=51, x=494209, y=37] [L27] EXPR counter++ VAL [c=37, counter=38, k=51, x=494209, y=37] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=38] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=37, counter=38, k=51, x=494209, y=37] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=38, counter=38, k=51, x=549081, y=38] [L27] EXPR counter++ VAL [c=38, counter=39, k=51, x=549081, y=38] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=39] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=38, counter=39, k=51, x=549081, y=38] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=39, counter=39, k=51, x=608400, y=39] [L27] EXPR counter++ VAL [c=39, counter=40, k=51, x=608400, y=39] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=40] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=39, counter=40, k=51, x=608400, y=39] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=40, counter=40, k=51, x=672400, y=40] [L27] EXPR counter++ VAL [c=40, counter=41, k=51, x=672400, y=40] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=41] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=40, counter=41, k=51, x=672400, y=40] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=41, counter=41, k=51, x=741321, y=41] [L27] EXPR counter++ VAL [c=41, counter=42, k=51, x=741321, y=41] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=42] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=41, counter=42, k=51, x=741321, y=41] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=42, counter=42, k=51, x=815409, y=42] [L27] EXPR counter++ VAL [c=42, counter=43, k=51, x=815409, y=42] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=43] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=42, counter=43, k=51, x=815409, y=42] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=43, counter=43, k=51, x=894916, y=43] [L27] EXPR counter++ VAL [c=43, counter=44, k=51, x=894916, y=43] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=44] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=43, counter=44, k=51, x=894916, y=43] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=44, counter=44, k=51, x=980100, y=44] [L27] EXPR counter++ VAL [c=44, counter=45, k=51, x=980100, y=44] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=45] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=44, counter=45, k=51, x=980100, y=44] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=45, counter=45, k=51, x=1071225, y=45] [L27] EXPR counter++ VAL [c=45, counter=46, k=51, x=1071225, y=45] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=46] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=45, counter=46, k=51, x=1071225, y=45] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=46, counter=46, k=51, x=1168561, y=46] [L27] EXPR counter++ VAL [c=46, counter=47, k=51, x=1168561, y=46] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=47] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=46, counter=47, k=51, x=1168561, y=46] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=47, counter=47, k=51, x=1272384, y=47] [L27] EXPR counter++ VAL [c=47, counter=48, k=51, x=1272384, y=47] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=48] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=47, counter=48, k=51, x=1272384, y=47] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=48, counter=48, k=51, x=1382976, y=48] [L27] EXPR counter++ VAL [c=48, counter=49, k=51, x=1382976, y=48] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=49] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=48, counter=49, k=51, x=1382976, y=48] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=49, counter=49, k=51, x=1500625, y=49] [L27] EXPR counter++ VAL [c=49, counter=50, k=51, x=1500625, y=49] [L27] COND TRUE counter++<50 [L28] CALL __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [\old(cond)=1, counter=50] [L10] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L28] RET __VERIFIER_assert(4*x - y*y*y*y - 2*y*y*y - y*y == 0) VAL [c=49, counter=50, k=51, x=1500625, y=49] [L30] COND FALSE !(!(c < k)) [L33] c = c + 1 [L34] y = y + 1 [L35] x = y * y * y + x VAL [c=50, counter=50, k=51, x=1625625, y=50] [L27] EXPR counter++ VAL [c=50, counter=51, k=51, x=1625625, y=50] [L27] COND FALSE !(counter++<50) [L37] CALL __VERIFIER_assert(k*y - (y*y) == 0) VAL [\old(cond)=0, counter=51] [L10] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L12] reach_error() VAL [\old(cond)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 15 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 231.9s, OverallIterations: 12, TraceHistogramMax: 51, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 7.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 509 SdHoareTripleChecker+Valid, 4.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 504 mSDsluCounter, 1205 SdHoareTripleChecker+Invalid, 4.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 170 IncrementalHoareTripleChecker+Unchecked, 1068 mSDsCounter, 107 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 918 IncrementalHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 107 mSolverCounterUnsat, 137 mSDtfsCounter, 918 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1709 GetRequests, 1327 SyntacticMatches, 47 SemanticMatches, 335 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 4098 ImplicationChecksByTransitivity, 24.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=408occurred in iteration=11, InterpolantAutomatonStates: 322, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 35 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 81.6s SatisfiabilityAnalysisTime, 133.2s InterpolantComputationTime, 1220 NumberOfCodeBlocks, 1220 NumberOfCodeBlocksAsserted, 123 NumberOfCheckSat, 1561 ConstructedInterpolants, 3 QuantifiedInterpolants, 4898 SizeOfPredicates, 98 NumberOfNonLiveVariables, 2380 ConjunctsInSsa, 275 ConjunctsInUnsatCore, 19 InterpolantComputations, 3 PerfectInterpolantSequences, 5704/21950 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-19 21:41:53,248 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...