/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 08:23:37,912 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 08:23:37,957 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-21 08:23:37,960 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 08:23:37,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 08:23:37,973 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 08:23:37,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 08:23:37,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 08:23:37,974 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 08:23:37,974 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 08:23:37,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 08:23:37,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 08:23:37,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 08:23:37,975 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 08:23:37,975 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 08:23:37,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 08:23:37,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 08:23:37,976 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 08:23:37,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 08:23:37,976 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 08:23:37,976 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 08:23:37,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 08:23:37,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 08:23:37,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 08:23:37,977 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 08:23:37,978 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 08:23:37,978 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 08:23:37,978 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 08:23:37,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 08:23:37,979 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 08:23:37,979 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 08:23:37,979 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 08:23:37,979 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 08:23:37,979 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 08:23:37,980 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 08:23:37,980 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 08:23:37,980 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 08:23:37,980 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 08:23:37,980 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 08:23:37,980 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 08:23:37,981 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 08:23:37,992 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 08:23:37,992 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 08:23:37,992 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 08:23:38,135 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 08:23:38,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 08:23:38,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 08:23:38,151 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 08:23:38,151 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 08:23:38,151 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound20.c [2023-12-21 08:23:39,178 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 08:23:39,321 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 08:23:39,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/ps5-ll_valuebound20.c [2023-12-21 08:23:39,326 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc17ad26b/7540c1faa9424ed2bb97c10460889b99/FLAGcf8b5b6e2 [2023-12-21 08:23:39,336 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc17ad26b/7540c1faa9424ed2bb97c10460889b99 [2023-12-21 08:23:39,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 08:23:39,340 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 08:23:39,341 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 08:23:39,341 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 08:23:39,345 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 08:23:39,345 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:23:39" (1/1) ... [2023-12-21 08:23:39,346 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20fa559b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:39, skipping insertion in model container [2023-12-21 08:23:39,346 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 08:23:39" (1/1) ... [2023-12-21 08:23:39,362 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 08:23:39,488 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/ps5-ll_valuebound20.c[458,471] [2023-12-21 08:23:39,502 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 08:23:39,508 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 08:23:39,516 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/ps5-ll_valuebound20.c[458,471] [2023-12-21 08:23:39,521 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 08:23:39,534 INFO L206 MainTranslator]: Completed translation [2023-12-21 08:23:39,534 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:39 WrapperNode [2023-12-21 08:23:39,535 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 08:23:39,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 08:23:39,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 08:23:39,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 08:23:39,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:39" (1/1) ... [2023-12-21 08:23:39,548 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:39" (1/1) ... [2023-12-21 08:23:39,564 INFO L138 Inliner]: procedures = 14, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 36 [2023-12-21 08:23:39,565 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 08:23:39,565 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 08:23:39,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 08:23:39,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 08:23:39,575 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:39" (1/1) ... [2023-12-21 08:23:39,575 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:39" (1/1) ... [2023-12-21 08:23:39,583 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:39" (1/1) ... [2023-12-21 08:23:39,597 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-21 08:23:39,598 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:39" (1/1) ... [2023-12-21 08:23:39,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:39" (1/1) ... [2023-12-21 08:23:39,612 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:39" (1/1) ... [2023-12-21 08:23:39,614 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:39" (1/1) ... [2023-12-21 08:23:39,615 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:39" (1/1) ... [2023-12-21 08:23:39,615 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:39" (1/1) ... [2023-12-21 08:23:39,616 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 08:23:39,617 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 08:23:39,617 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 08:23:39,617 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 08:23:39,617 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:39" (1/1) ... [2023-12-21 08:23:39,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 08:23:39,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:23:39,662 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-21 08:23:39,676 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-21 08:23:39,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 08:23:39,687 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 08:23:39,687 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 08:23:39,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 08:23:39,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 08:23:39,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 08:23:39,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-21 08:23:39,689 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-21 08:23:39,727 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 08:23:39,728 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 08:23:39,810 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 08:23:39,823 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 08:23:39,824 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 08:23:39,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:23:39 BoogieIcfgContainer [2023-12-21 08:23:39,824 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 08:23:39,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 08:23:39,826 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 08:23:39,828 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 08:23:39,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 08:23:39" (1/3) ... [2023-12-21 08:23:39,828 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a511fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:23:39, skipping insertion in model container [2023-12-21 08:23:39,828 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 08:23:39" (2/3) ... [2023-12-21 08:23:39,829 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a511fbb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 08:23:39, skipping insertion in model container [2023-12-21 08:23:39,829 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 08:23:39" (3/3) ... [2023-12-21 08:23:39,829 INFO L112 eAbstractionObserver]: Analyzing ICFG ps5-ll_valuebound20.c [2023-12-21 08:23:39,840 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 08:23:39,841 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 08:23:39,868 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 08:23:39,873 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;@1c2f3b72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 08:23:39,873 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 08:23:39,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 08:23:39,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 08:23:39,880 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:23:39,880 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 08:23:39,880 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:23:39,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:23:39,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1419667615, now seen corresponding path program 1 times [2023-12-21 08:23:39,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:23:39,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342215047] [2023-12-21 08:23:39,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:23:39,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:23:39,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 08:23:39,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 08:23:39,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342215047] [2023-12-21 08:23:39,960 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-21 08:23:39,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [143826483] [2023-12-21 08:23:39,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:23:39,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:23:39,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:23:39,962 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-21 08:23:40,009 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-21 08:23:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 08:23:40,027 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 08:23:40,030 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 08:23:40,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 08:23:40,045 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 08:23:40,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [143826483] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 08:23:40,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 08:23:40,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 08:23:40,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749779428] [2023-12-21 08:23:40,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 08:23:40,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 08:23:40,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 08:23:40,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 08:23:40,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 08:23:40,080 INFO L87 Difference]: Start difference. First operand has 21 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 08:23:40,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 08:23:40,104 INFO L93 Difference]: Finished difference Result 40 states and 58 transitions. [2023-12-21 08:23:40,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 08:23:40,107 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-12-21 08:23:40,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 08:23:40,111 INFO L225 Difference]: With dead ends: 40 [2023-12-21 08:23:40,111 INFO L226 Difference]: Without dead ends: 19 [2023-12-21 08:23:40,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 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-21 08:23:40,119 INFO L413 NwaCegarLoop]: 22 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, 22 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-21 08:23:40,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 08:23:40,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2023-12-21 08:23:40,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2023-12-21 08:23:40,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 12 states have internal predecessors, (13), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-21 08:23:40,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2023-12-21 08:23:40,145 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 17 [2023-12-21 08:23:40,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 08:23:40,145 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2023-12-21 08:23:40,145 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 08:23:40,145 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2023-12-21 08:23:40,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 08:23:40,147 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:23:40,147 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 08:23:40,164 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-21 08:23:40,352 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-21 08:23:40,353 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:23:40,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:23:40,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1758174245, now seen corresponding path program 1 times [2023-12-21 08:23:40,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:23:40,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843633398] [2023-12-21 08:23:40,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:23:40,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:23:40,378 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 08:23:40,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1442547220] [2023-12-21 08:23:40,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:23:40,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:23:40,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:23:40,384 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-21 08:23:40,426 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-21 08:23:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 08:23:40,441 INFO L262 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-21 08:23:40,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 08:23:40,552 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 08:23:40,552 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 08:23:40,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 08:23:40,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843633398] [2023-12-21 08:23:40,553 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 08:23:40,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442547220] [2023-12-21 08:23:40,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442547220] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 08:23:40,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 08:23:40,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 08:23:40,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154108196] [2023-12-21 08:23:40,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 08:23:40,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 08:23:40,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 08:23:40,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 08:23:40,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 08:23:40,555 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 08:23:40,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 08:23:40,649 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2023-12-21 08:23:40,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 08:23:40,650 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-21 08:23:40,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 08:23:40,650 INFO L225 Difference]: With dead ends: 30 [2023-12-21 08:23:40,650 INFO L226 Difference]: Without dead ends: 26 [2023-12-21 08:23:40,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-21 08:23:40,651 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 8 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 08:23:40,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 68 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 08:23:40,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-21 08:23:40,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-21 08:23:40,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 08:23:40,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2023-12-21 08:23:40,657 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 17 [2023-12-21 08:23:40,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 08:23:40,657 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2023-12-21 08:23:40,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 6 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 08:23:40,658 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2023-12-21 08:23:40,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-21 08:23:40,658 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:23:40,658 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 08:23:40,663 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-21 08:23:40,858 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-21 08:23:40,859 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:23:40,860 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:23:40,860 INFO L85 PathProgramCache]: Analyzing trace with hash -795669560, now seen corresponding path program 1 times [2023-12-21 08:23:40,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:23:40,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213154953] [2023-12-21 08:23:40,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:23:40,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:23:40,876 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 08:23:40,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [971654333] [2023-12-21 08:23:40,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:23:40,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:23:40,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:23:40,891 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-21 08:23:40,916 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-21 08:23:40,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 08:23:40,991 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-21 08:23:40,993 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 08:23:41,088 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 08:23:41,089 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 08:23:41,195 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 08:23:41,195 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 08:23:41,195 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213154953] [2023-12-21 08:23:41,196 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 08:23:41,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971654333] [2023-12-21 08:23:41,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971654333] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 08:23:41,196 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 08:23:41,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 11 [2023-12-21 08:23:41,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047091411] [2023-12-21 08:23:41,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 08:23:41,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 08:23:41,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 08:23:41,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 08:23:41,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-21 08:23:41,197 INFO L87 Difference]: Start difference. First operand 26 states and 29 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-21 08:23:41,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 08:23:41,267 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2023-12-21 08:23:41,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 08:23:41,268 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 24 [2023-12-21 08:23:41,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 08:23:41,268 INFO L225 Difference]: With dead ends: 37 [2023-12-21 08:23:41,268 INFO L226 Difference]: Without dead ends: 33 [2023-12-21 08:23:41,269 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 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-21 08:23:41,269 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 18 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 08:23:41,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 91 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 08:23:41,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-21 08:23:41,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2023-12-21 08:23:41,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 18 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-21 08:23:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2023-12-21 08:23:41,276 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 24 [2023-12-21 08:23:41,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 08:23:41,276 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2023-12-21 08:23:41,276 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, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-21 08:23:41,276 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2023-12-21 08:23:41,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2023-12-21 08:23:41,277 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:23:41,277 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 08:23:41,284 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-21 08:23:41,481 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-21 08:23:41,482 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:23:41,482 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:23:41,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1266135666, now seen corresponding path program 1 times [2023-12-21 08:23:41,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:23:41,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279477460] [2023-12-21 08:23:41,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:23:41,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:23:41,492 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 08:23:41,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1520064103] [2023-12-21 08:23:41,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:23:41,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:23:41,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:23:41,494 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-21 08:23:41,496 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-21 08:23:41,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 08:23:41,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-21 08:23:41,533 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 08:23:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-12-21 08:23:41,630 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 08:23:49,716 WARN L854 $PredicateComparison]: unable to prove that (or (= (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~k~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (not (= (mod (+ (* |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| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |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| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0))) is different from false [2023-12-21 08:23:57,802 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-21 08:24:05,819 WARN L293 SmtUtils]: Spent 8.01s 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-21 08:24:21,869 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 08:24:25,880 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_9| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| Int)) (or (= (mod (+ (* 29 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 6 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 10 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 15 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|)) 30) 0) (= (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|))))) is different from true [2023-12-21 08:24:41,930 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 08:24:58,017 WARN L293 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 08:25:02,023 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_9| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| Int)) (or (= (mod (+ (* 29 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 6 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 10 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* 15 |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|)) 30) 0) (= (* |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_4| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_9|)))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-12-21 08:25:30,918 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ |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_~c~0#1| (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (not (= (mod (+ (* |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| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |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| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0))) is different from false [2023-12-21 08:25:36,163 WARN L293 SmtUtils]: Spent 5.23s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 08:25:40,181 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 4 not checked. [2023-12-21 08:25:40,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 08:25:40,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279477460] [2023-12-21 08:25:40,182 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 08:25:40,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520064103] [2023-12-21 08:25:40,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520064103] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 08:25:40,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 08:25:40,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 16 [2023-12-21 08:25:40,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793346712] [2023-12-21 08:25:40,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 08:25:40,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 08:25:40,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 08:25:40,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 08:25:40,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=107, Unknown=4, NotChecked=92, Total=240 [2023-12-21 08:25:40,185 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 16 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 8 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-21 08:25:40,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 08:25:40,331 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2023-12-21 08:25:40,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 08:25:40,332 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 8 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 35 [2023-12-21 08:25:40,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 08:25:40,333 INFO L225 Difference]: With dead ends: 37 [2023-12-21 08:25:40,333 INFO L226 Difference]: Without dead ends: 31 [2023-12-21 08:25:40,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=56, Invalid=166, Unknown=4, NotChecked=116, Total=342 [2023-12-21 08:25:40,334 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 8 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 08:25:40,334 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 129 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 100 Unchecked, 0.1s Time] [2023-12-21 08:25:40,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2023-12-21 08:25:40,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2023-12-21 08:25:40,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.05) internal successors, (21), 20 states have internal predecessors, (21), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 08:25:40,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2023-12-21 08:25:40,341 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 35 [2023-12-21 08:25:40,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 08:25:40,342 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2023-12-21 08:25:40,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 14 states have internal predecessors, (28), 8 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2023-12-21 08:25:40,342 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2023-12-21 08:25:40,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-21 08:25:40,343 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:25:40,343 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 08:25:40,349 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-21 08:25:40,549 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-21 08:25:40,549 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:25:40,549 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:25:40,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1244194529, now seen corresponding path program 2 times [2023-12-21 08:25:40,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:25:40,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98951375] [2023-12-21 08:25:40,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:25:40,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:25:40,559 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 08:25:40,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1644259146] [2023-12-21 08:25:40,560 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 08:25:40,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:25:40,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:25:40,575 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-21 08:25:40,591 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-21 08:25:40,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 08:25:40,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 08:25:40,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-21 08:25:40,650 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 08:25:40,808 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-21 08:25:40,808 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 08:25:48,980 WARN L854 $PredicateComparison]: unable to prove that (or (= (+ |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_~c~0#1| (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (not (= (mod (+ (* |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| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |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| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0))) is different from false [2023-12-21 08:25:57,009 WARN L293 SmtUtils]: Spent 8.01s 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-21 08:26:09,030 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 08:26:17,115 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_9| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| Int)) (or (= (+ |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19|)) (+ |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_9| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_9|))) (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| 6) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| 10) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| 29) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| 15)) 30) 0)))) is different from true [2023-12-21 08:26:29,151 WARN L293 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 08:26:45,195 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 7 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 08:26:53,222 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_9| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| Int)) (or (= (+ |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19|)) (+ |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_9| (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_9|))) (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| 6) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| 10) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| 29) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_19| 15)) 30) 0))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-12-21 08:27:07,076 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| |c_ULTIMATE.start_main_~y~0#1| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |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| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 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-21 08:27:15,123 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 1 refuted. 6 times theorem prover too weak. 19 trivial. 9 not checked. [2023-12-21 08:27:15,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 08:27:15,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98951375] [2023-12-21 08:27:15,123 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 08:27:15,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644259146] [2023-12-21 08:27:15,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644259146] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 08:27:15,124 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 08:27:15,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2023-12-21 08:27:15,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299191213] [2023-12-21 08:27:15,124 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 08:27:15,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-21 08:27:15,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 08:27:15,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-21 08:27:15,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=151, Unknown=4, NotChecked=108, Total=306 [2023-12-21 08:27:15,125 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand has 18 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 9 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2023-12-21 08:27:15,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 08:27:15,392 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2023-12-21 08:27:15,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-12-21 08:27:15,392 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 9 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) Word has length 42 [2023-12-21 08:27:15,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 08:27:15,395 INFO L225 Difference]: With dead ends: 50 [2023-12-21 08:27:15,395 INFO L226 Difference]: Without dead ends: 40 [2023-12-21 08:27:15,396 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 66 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=90, Invalid=342, Unknown=4, NotChecked=164, Total=600 [2023-12-21 08:27:15,399 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 165 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 08:27:15,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 145 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 105 Invalid, 0 Unknown, 165 Unchecked, 0.1s Time] [2023-12-21 08:27:15,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2023-12-21 08:27:15,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2023-12-21 08:27:15,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-21 08:27:15,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2023-12-21 08:27:15,420 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 42 [2023-12-21 08:27:15,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 08:27:15,422 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2023-12-21 08:27:15,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 9 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (10), 9 states have call predecessors, (10), 9 states have call successors, (10) [2023-12-21 08:27:15,423 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2023-12-21 08:27:15,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2023-12-21 08:27:15,425 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:27:15,425 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 6, 6, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 08:27:15,437 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-21 08:27:15,631 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-21 08:27:15,631 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:27:15,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:27:15,632 INFO L85 PathProgramCache]: Analyzing trace with hash 1662742834, now seen corresponding path program 3 times [2023-12-21 08:27:15,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:27:15,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420118529] [2023-12-21 08:27:15,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:27:15,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:27:15,643 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 08:27:15,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1164101816] [2023-12-21 08:27:15,643 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 08:27:15,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:27:15,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:27:15,644 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-21 08:27:15,646 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-21 08:28:15,270 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-21 08:28:15,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 08:28:15,282 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 36 conjunts are in the unsatisfiable core [2023-12-21 08:28:15,284 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 08:28:15,420 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 28 proven. 49 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2023-12-21 08:28:15,420 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 08:28:23,534 WARN L854 $PredicateComparison]: unable to prove that (or (= (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~k~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (< |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~k~0#1|) (not (= (mod (+ (* |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| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |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| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0))) is different from false [2023-12-21 08:28:31,565 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-21 08:28:39,577 WARN L293 SmtUtils]: Spent 8.01s 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-21 08:28:55,630 WARN L293 SmtUtils]: Spent 8.04s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 08:28:59,634 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_30| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_15| Int)) (or (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| 15) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| 6) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| 29) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| 10)) 30) 0) (= (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_15|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30|))))) is different from true [2023-12-21 08:29:15,657 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 08:29:26,908 WARN L293 SmtUtils]: Spent 7.23s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 08:29:34,919 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 08:29:38,927 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_30| Int) (|v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_15| Int)) (or (= (mod (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| 15) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| 6) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| 29) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| 10)) 30) 0) (= (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| |v_ULTIMATE.start_main_~k~0#1_BEFORE_CALL_15|) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_30|)))) (= c___VERIFIER_assert_~cond 0)) is different from true [2023-12-21 08:31:03,949 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| |c_ULTIMATE.start_main_~y~0#1| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |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| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 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-21 08:31:20,000 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| |c_ULTIMATE.start_main_~y~0#1| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |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| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0))) is different from false [2023-12-21 08:31:36,048 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| |c_ULTIMATE.start_main_~y~0#1| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |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| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0))) is different from false [2023-12-21 08:31:59,027 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| 5)) (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~y~0#1| 5))) (not (= (mod (+ (* |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| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |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| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0))) is different from false [2023-12-21 08:32:07,086 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 28 proven. 1 refuted. 3 times theorem prover too weak. 70 trivial. 45 not checked. [2023-12-21 08:32:07,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 08:32:07,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420118529] [2023-12-21 08:32:07,086 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 08:32:07,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1164101816] [2023-12-21 08:32:07,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1164101816] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 08:32:07,087 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 08:32:07,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2023-12-21 08:32:07,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351033483] [2023-12-21 08:32:07,087 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 08:32:07,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 08:32:07,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 08:32:07,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 08:32:07,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=222, Unknown=20, NotChecked=252, Total=552 [2023-12-21 08:32:07,088 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 24 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 15 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2023-12-21 08:32:50,224 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (let ((.cse2 (not (= (mod (+ (* |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| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |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| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0))) (.cse0 (= (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~k~0#1|) .cse3)) (.cse1 (< |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~k~0#1|))) (and (or .cse0 .cse1 .cse2) (or (= (+ |c_ULTIMATE.start_main_~y~0#1| .cse3) (+ |c_ULTIMATE.start_main_~c~0#1| (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|))) .cse2) (or .cse0 .cse1)))) is different from false [2023-12-21 08:32:54,309 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (.cse1 (not (= (mod (+ (* |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| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |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| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0)))) (and (or (= (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~k~0#1|) .cse0) (< |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~k~0#1|) .cse1) (or (= (+ |c_ULTIMATE.start_main_~y~0#1| .cse0) (+ |c_ULTIMATE.start_main_~c~0#1| (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|))) .cse1))) is different from false [2023-12-21 08:32:58,319 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (and (or (= (+ |c_ULTIMATE.start_main_~y~0#1| .cse0) (+ |c_ULTIMATE.start_main_~c~0#1| (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (not (= (mod (+ (* |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| 15) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| 29) (* |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| |c_ULTIMATE.start_main_~y~0#1| 6)) 30) 0))) (or (= (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~k~0#1|) .cse0) (< |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~k~0#1|)))) is different from false [2023-12-21 08:32:58,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 08:32:58,381 INFO L93 Difference]: Finished difference Result 57 states and 70 transitions. [2023-12-21 08:32:58,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-21 08:32:58,382 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 15 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) Word has length 63 [2023-12-21 08:32:58,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 08:32:58,382 INFO L225 Difference]: With dead ends: 57 [2023-12-21 08:32:58,383 INFO L226 Difference]: Without dead ends: 49 [2023-12-21 08:32:58,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 102 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 146.4s TimeCoverageRelationStatistics Valid=110, Invalid=503, Unknown=27, NotChecked=550, Total=1190 [2023-12-21 08:32:58,384 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 12 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 431 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 08:32:58,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 307 Invalid, 675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 233 Invalid, 0 Unknown, 431 Unchecked, 0.2s Time] [2023-12-21 08:32:58,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-21 08:32:58,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-21 08:32:58,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 13 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 08:32:58,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2023-12-21 08:32:58,397 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 63 [2023-12-21 08:32:58,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 08:32:58,398 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2023-12-21 08:32:58,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.0) internal successors, (44), 22 states have internal predecessors, (44), 15 states have call successors, (18), 3 states have call predecessors, (18), 3 states have return successors, (16), 15 states have call predecessors, (16), 15 states have call successors, (16) [2023-12-21 08:32:58,398 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2023-12-21 08:32:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-21 08:32:58,399 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 08:32:58,399 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 9, 9, 9, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 08:32:58,413 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-21 08:32:58,608 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-21 08:32:58,609 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 08:32:58,609 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 08:32:58,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1550512895, now seen corresponding path program 4 times [2023-12-21 08:32:58,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 08:32:58,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267709037] [2023-12-21 08:32:58,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 08:32:58,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 08:32:58,627 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 08:32:58,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1569657326] [2023-12-21 08:32:58,627 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 08:32:58,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 08:32:58,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 08:32:58,632 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-21 08:32:58,633 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-21 08:32:58,703 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 08:32:58,703 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 08:32:58,710 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 43 conjunts are in the unsatisfiable core [2023-12-21 08:32:58,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 08:32:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 108 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-12-21 08:32:58,934 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 08:32:59,319 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 20 proven. 108 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-12-21 08:32:59,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 08:32:59,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267709037] [2023-12-21 08:32:59,320 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 08:32:59,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1569657326] [2023-12-21 08:32:59,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1569657326] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 08:32:59,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 08:32:59,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2023-12-21 08:32:59,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315971256] [2023-12-21 08:32:59,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 08:32:59,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-12-21 08:32:59,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 08:32:59,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-12-21 08:32:59,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=529, Unknown=0, NotChecked=0, Total=650 [2023-12-21 08:32:59,322 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand has 26 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 21 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2023-12-21 08:32:59,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 08:32:59,956 INFO L93 Difference]: Finished difference Result 54 states and 66 transitions. [2023-12-21 08:32:59,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-21 08:32:59,956 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 21 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) Word has length 84 [2023-12-21 08:32:59,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 08:32:59,957 INFO L225 Difference]: With dead ends: 54 [2023-12-21 08:32:59,957 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 08:32:59,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=274, Invalid=1132, Unknown=0, NotChecked=0, Total=1406 [2023-12-21 08:32:59,958 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 19 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-21 08:32:59,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 530 Invalid, 321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-21 08:32:59,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 08:32:59,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 08:32:59,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 08:32:59,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 08:32:59,959 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 84 [2023-12-21 08:32:59,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 08:32:59,959 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 08:32:59,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 2.0833333333333335) internal successors, (50), 24 states have internal predecessors, (50), 21 states have call successors, (24), 3 states have call predecessors, (24), 1 states have return successors, (22), 21 states have call predecessors, (22), 21 states have call successors, (22) [2023-12-21 08:32:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 08:32:59,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 08:32:59,961 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 08:32:59,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-21 08:33:00,166 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-21 08:33:00,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 08:33:00,586 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 08:33:00,586 INFO L895 garLoopResultBuilder]: At program point L29(line 29) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= (+ |ULTIMATE.start_main_~y~0#1| .cse0) (+ |ULTIMATE.start_main_~c~0#1| .cse1)) (= (+ (* 5 |ULTIMATE.start_main_~c~0#1|) .cse1) (+ (* 5 |ULTIMATE.start_main_~y~0#1|) .cse0)) (or (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse0) (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15))))) [2023-12-21 08:33:00,586 INFO L899 garLoopResultBuilder]: For program point L29-1(lines 28 37) no Hoare annotation was computed. [2023-12-21 08:33:00,586 INFO L902 garLoopResultBuilder]: At program point L21(line 21) the Hoare annotation is: true [2023-12-21 08:33:00,587 INFO L902 garLoopResultBuilder]: At program point L21-1(line 21) the Hoare annotation is: true [2023-12-21 08:33:00,587 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 08:33:00,587 INFO L899 garLoopResultBuilder]: For program point L40(line 40) no Hoare annotation was computed. [2023-12-21 08:33:00,587 INFO L895 garLoopResultBuilder]: At program point L28-2(lines 28 37) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= (+ |ULTIMATE.start_main_~y~0#1| .cse0) (+ |ULTIMATE.start_main_~c~0#1| .cse1)) (= (+ (* 5 |ULTIMATE.start_main_~c~0#1|) .cse1) (+ (* 5 |ULTIMATE.start_main_~y~0#1|) .cse0)) (or (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse0) (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15))))) [2023-12-21 08:33:00,587 INFO L895 garLoopResultBuilder]: At program point L28-3(lines 28 37) the Hoare annotation is: (and (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))) [2023-12-21 08:33:00,587 INFO L899 garLoopResultBuilder]: For program point L22(line 22) no Hoare annotation was computed. [2023-12-21 08:33:00,587 INFO L895 garLoopResultBuilder]: At program point L39(line 39) the Hoare annotation is: (and (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (= (+ (* 30 |ULTIMATE.start_main_~x~0#1|) |ULTIMATE.start_main_~y~0#1|) (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 10) (* (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|) 15)))) [2023-12-21 08:33:00,587 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 6 8) the Hoare annotation is: true [2023-12-21 08:33:00,587 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2023-12-21 08:33:00,587 INFO L899 garLoopResultBuilder]: For program point L7-2(lines 6 8) no Hoare annotation was computed. [2023-12-21 08:33:00,587 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 6 8) no Hoare annotation was computed. [2023-12-21 08:33:00,588 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2023-12-21 08:33:00,588 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2023-12-21 08:33:00,588 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2023-12-21 08:33:00,588 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 15) the Hoare annotation is: true [2023-12-21 08:33:00,588 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2023-12-21 08:33:00,588 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2023-12-21 08:33:00,591 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1] [2023-12-21 08:33:00,593 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 08:33:00,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 08:33:00 BoogieIcfgContainer [2023-12-21 08:33:00,603 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 08:33:00,603 INFO L158 Benchmark]: Toolchain (without parser) took 561263.66ms. Allocated memory is still 263.2MB. Free memory was 212.7MB in the beginning and 148.1MB in the end (delta: 64.5MB). Peak memory consumption was 65.1MB. Max. memory is 8.0GB. [2023-12-21 08:33:00,603 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 206.6MB. Free memory is still 157.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 08:33:00,604 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.74ms. Allocated memory is still 263.2MB. Free memory was 212.7MB in the beginning and 201.4MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 08:33:00,604 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.33ms. Allocated memory is still 263.2MB. Free memory was 201.4MB in the beginning and 200.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 08:33:00,604 INFO L158 Benchmark]: Boogie Preprocessor took 51.18ms. Allocated memory is still 263.2MB. Free memory was 200.0MB in the beginning and 198.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 08:33:00,604 INFO L158 Benchmark]: RCFGBuilder took 207.42ms. Allocated memory is still 263.2MB. Free memory was 198.3MB in the beginning and 187.5MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-21 08:33:00,605 INFO L158 Benchmark]: TraceAbstraction took 560777.32ms. Allocated memory is still 263.2MB. Free memory was 186.7MB in the beginning and 148.1MB in the end (delta: 38.6MB). Peak memory consumption was 38.9MB. Max. memory is 8.0GB. [2023-12-21 08:33:00,606 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.09ms. Allocated memory is still 206.6MB. Free memory is still 157.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.74ms. Allocated memory is still 263.2MB. Free memory was 212.7MB in the beginning and 201.4MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 29.33ms. Allocated memory is still 263.2MB. Free memory was 201.4MB in the beginning and 200.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 51.18ms. Allocated memory is still 263.2MB. Free memory was 200.0MB in the beginning and 198.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 207.42ms. Allocated memory is still 263.2MB. Free memory was 198.3MB in the beginning and 187.5MB in the end (delta: 10.8MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 560777.32ms. Allocated memory is still 263.2MB. Free memory was 186.7MB in the beginning and 148.1MB in the end (delta: 38.6MB). Peak memory consumption was 38.9MB. 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 - PositiveResult [Line: 12]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 560.7s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 52.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 82 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 77 mSDsluCounter, 1292 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 696 IncrementalHoareTripleChecker+Unchecked, 1138 mSDsCounter, 55 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 832 IncrementalHoareTripleChecker+Invalid, 1583 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 55 mSolverCounterUnsat, 154 mSDtfsCounter, 832 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 568 GetRequests, 428 SyntacticMatches, 13 SemanticMatches, 127 ConstructedPredicates, 18 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 190.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=6, InterpolantAutomatonStates: 77, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 40 PreInvPairs, 77 NumberOfFragments, 208 HoareAnnotationTreeSize, 40 FormulaSimplifications, 1105 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FormulaSimplificationsInter, 706 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 59.8s SatisfiabilityAnalysisTime, 445.9s InterpolantComputationTime, 299 NumberOfCodeBlocks, 286 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 518 ConstructedInterpolants, 9 QuantifiedInterpolants, 3163 SizeOfPredicates, 26 NumberOfNonLiveVariables, 695 ConjunctsInSsa, 158 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 724/1082 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: (((((y + (y * y)) == (c + (c * y))) && (((5 * c) + (c * y)) == ((5 * y) + (y * y)))) && (((k * y) == (y * y)) || (c < k))) && (((30 * x) + y) == (((6 * ((((y * y) * y) * y) * y)) + (((y * y) * y) * 10)) + ((((y * y) * y) * y) * 15)))) RESULT: Ultimate proved your program to be correct! [2023-12-21 08:33:00,703 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...