/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/egcd-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 06:22:19,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 06:22:19,893 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 06:22:19,896 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 06:22:19,900 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 06:22:19,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 06:22:19,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 06:22:19,928 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 06:22:19,929 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 06:22:19,932 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 06:22:19,932 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 06:22:19,933 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 06:22:19,933 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 06:22:19,934 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 06:22:19,934 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 06:22:19,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 06:22:19,935 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 06:22:19,935 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 06:22:19,935 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 06:22:19,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 06:22:19,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 06:22:19,937 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 06:22:19,937 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 06:22:19,937 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 06:22:19,937 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 06:22:19,937 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 06:22:19,938 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 06:22:19,938 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 06:22:19,938 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 06:22:19,938 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 06:22:19,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 06:22:19,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 06:22:19,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 06:22:19,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 06:22:19,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 06:22:19,940 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 06:22:19,940 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 06:22:19,940 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 06:22:19,940 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 06:22:19,940 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 06:22:19,941 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 06:22:19,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 06:22:19,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 06:22:19,941 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 06:22:20,160 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 06:22:20,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 06:22:20,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 06:22:20,186 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 06:22:20,186 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 06:22:20,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound20.c [2023-12-21 06:22:21,239 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 06:22:21,408 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 06:22:21,409 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/egcd-ll_unwindbound20.c [2023-12-21 06:22:21,415 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8996b496/e9cf363f83e349bfb6a3b9d004ad6fc8/FLAGec38826df [2023-12-21 06:22:21,814 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a8996b496/e9cf363f83e349bfb6a3b9d004ad6fc8 [2023-12-21 06:22:21,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 06:22:21,820 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 06:22:21,821 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 06:22:21,821 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 06:22:21,825 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 06:22:21,826 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:22:21" (1/1) ... [2023-12-21 06:22:21,826 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66d8bb3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:22:21, skipping insertion in model container [2023-12-21 06:22:21,827 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 06:22:21" (1/1) ... [2023-12-21 06:22:21,844 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 06:22:21,951 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/egcd-ll_unwindbound20.c[489,502] [2023-12-21 06:22:21,963 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 06:22:21,969 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 06:22:21,978 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/egcd-ll_unwindbound20.c[489,502] [2023-12-21 06:22:21,983 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 06:22:21,992 INFO L206 MainTranslator]: Completed translation [2023-12-21 06:22:21,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:22:21 WrapperNode [2023-12-21 06:22:21,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 06:22:21,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 06:22:21,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 06:22:21,994 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 06:22:21,998 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:22:21" (1/1) ... [2023-12-21 06:22:22,005 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:22:21" (1/1) ... [2023-12-21 06:22:22,022 INFO L138 Inliner]: procedures = 14, calls = 16, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2023-12-21 06:22:22,022 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 06:22:22,023 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 06:22:22,023 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 06:22:22,023 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 06:22:22,030 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:22:21" (1/1) ... [2023-12-21 06:22:22,030 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:22:21" (1/1) ... [2023-12-21 06:22:22,031 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:22:21" (1/1) ... [2023-12-21 06:22:22,046 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 06:22:22,046 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:22:21" (1/1) ... [2023-12-21 06:22:22,046 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:22:21" (1/1) ... [2023-12-21 06:22:22,048 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:22:21" (1/1) ... [2023-12-21 06:22:22,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:22:21" (1/1) ... [2023-12-21 06:22:22,051 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:22:21" (1/1) ... [2023-12-21 06:22:22,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:22:21" (1/1) ... [2023-12-21 06:22:22,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 06:22:22,053 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 06:22:22,053 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 06:22:22,053 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 06:22:22,054 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:22:21" (1/1) ... [2023-12-21 06:22:22,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 06:22:22,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:22:22,080 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 06:22:22,096 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 06:22:22,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 06:22:22,109 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-21 06:22:22,109 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-21 06:22:22,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 06:22:22,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 06:22:22,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 06:22:22,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-21 06:22:22,111 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-21 06:22:22,156 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 06:22:22,159 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 06:22:22,323 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 06:22:22,337 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 06:22:22,337 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 06:22:22,337 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:22:22 BoogieIcfgContainer [2023-12-21 06:22:22,337 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 06:22:22,339 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 06:22:22,339 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 06:22:22,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 06:22:22,344 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 06:22:21" (1/3) ... [2023-12-21 06:22:22,345 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18e1992a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:22:22, skipping insertion in model container [2023-12-21 06:22:22,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 06:22:21" (2/3) ... [2023-12-21 06:22:22,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18e1992a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 06:22:22, skipping insertion in model container [2023-12-21 06:22:22,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 06:22:22" (3/3) ... [2023-12-21 06:22:22,347 INFO L112 eAbstractionObserver]: Analyzing ICFG egcd-ll_unwindbound20.c [2023-12-21 06:22:22,359 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 06:22:22,359 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 06:22:22,397 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 06:22:22,403 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;@2d068cff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 06:22:22,404 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 06:22:22,406 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-21 06:22:22,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-21 06:22:22,411 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:22:22,411 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:22:22,411 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:22:22,417 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:22:22,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2138951705, now seen corresponding path program 1 times [2023-12-21 06:22:22,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:22:22,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784055674] [2023-12-21 06:22:22,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:22:22,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:22:22,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:22:22,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 06:22:22,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:22:22,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 06:22:22,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:22:22,542 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 06:22:22,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:22:22,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784055674] [2023-12-21 06:22:22,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784055674] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 06:22:22,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 06:22:22,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 06:22:22,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509508648] [2023-12-21 06:22:22,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 06:22:22,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 06:22:22,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:22:22,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 06:22:22,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 06:22:22,573 INFO L87 Difference]: Start difference. First operand has 27 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 06:22:22,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:22:22,591 INFO L93 Difference]: Finished difference Result 52 states and 84 transitions. [2023-12-21 06:22:22,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 06:22:22,592 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-12-21 06:22:22,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:22:22,597 INFO L225 Difference]: With dead ends: 52 [2023-12-21 06:22:22,597 INFO L226 Difference]: Without dead ends: 25 [2023-12-21 06:22:22,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 06:22:22,601 INFO L413 NwaCegarLoop]: 34 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, 34 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 06:22:22,601 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 06:22:22,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2023-12-21 06:22:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2023-12-21 06:22:22,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 06:22:22,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2023-12-21 06:22:22,624 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 17 [2023-12-21 06:22:22,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:22:22,624 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2023-12-21 06:22:22,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 06:22:22,625 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2023-12-21 06:22:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-21 06:22:22,625 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:22:22,625 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:22:22,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-12-21 06:22:22,626 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:22:22,626 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:22:22,626 INFO L85 PathProgramCache]: Analyzing trace with hash -443127421, now seen corresponding path program 1 times [2023-12-21 06:22:22,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:22:22,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500609971] [2023-12-21 06:22:22,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:22:22,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:22:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:22:22,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-12-21 06:22:22,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:22:22,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-12-21 06:22:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:22:22,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-21 06:22:22,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:22:22,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500609971] [2023-12-21 06:22:22,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500609971] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 06:22:22,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 06:22:22,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-21 06:22:22,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596958571] [2023-12-21 06:22:22,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 06:22:22,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-21 06:22:22,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:22:22,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-21 06:22:22,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 06:22:22,756 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 06:22:22,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:22:22,787 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2023-12-21 06:22:22,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-21 06:22:22,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-12-21 06:22:22,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:22:22,788 INFO L225 Difference]: With dead ends: 37 [2023-12-21 06:22:22,788 INFO L226 Difference]: Without dead ends: 27 [2023-12-21 06:22:22,788 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-21 06:22:22,789 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 5 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 06:22:22,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 84 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 06:22:22,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-12-21 06:22:22,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-12-21 06:22:22,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-21 06:22:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2023-12-21 06:22:22,796 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 18 [2023-12-21 06:22:22,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:22:22,797 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2023-12-21 06:22:22,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-21 06:22:22,797 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2023-12-21 06:22:22,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-21 06:22:22,798 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:22:22,798 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:22:22,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-12-21 06:22:22,798 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:22:22,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:22:22,798 INFO L85 PathProgramCache]: Analyzing trace with hash -441459125, now seen corresponding path program 1 times [2023-12-21 06:22:22,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:22:22,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423199655] [2023-12-21 06:22:22,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:22:22,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:22:22,810 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:22:22,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [163687565] [2023-12-21 06:22:22,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:22:22,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:22:22,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:22:22,832 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 06:22:22,851 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 06:22:22,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:22:22,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-21 06:22:22,894 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:22:22,999 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 06:22:23,000 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 06:22:23,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:22:23,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423199655] [2023-12-21 06:22:23,000 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:22:23,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163687565] [2023-12-21 06:22:23,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163687565] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 06:22:23,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 06:22:23,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-21 06:22:23,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536128840] [2023-12-21 06:22:23,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 06:22:23,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 06:22:23,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:22:23,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 06:22:23,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-21 06:22:23,010 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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 06:22:23,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:22:23,122 INFO L93 Difference]: Finished difference Result 44 states and 61 transitions. [2023-12-21 06:22:23,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 06:22:23,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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 18 [2023-12-21 06:22:23,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:22:23,125 INFO L225 Difference]: With dead ends: 44 [2023-12-21 06:22:23,125 INFO L226 Difference]: Without dead ends: 42 [2023-12-21 06:22:23,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-21 06:22:23,128 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 06:22:23,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 165 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 06:22:23,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-21 06:22:23,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2023-12-21 06:22:23,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 24 states have internal predecessors, (29), 15 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 06:22:23,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 58 transitions. [2023-12-21 06:22:23,140 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 58 transitions. Word has length 18 [2023-12-21 06:22:23,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:22:23,140 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 58 transitions. [2023-12-21 06:22:23,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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 06:22:23,141 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 58 transitions. [2023-12-21 06:22:23,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-21 06:22:23,141 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:22:23,141 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:22:23,152 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 06:22:23,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:22:23,349 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:22:23,349 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:22:23,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1203735897, now seen corresponding path program 1 times [2023-12-21 06:22:23,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:22:23,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106196446] [2023-12-21 06:22:23,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:22:23,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:22:23,357 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:22:23,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [36857484] [2023-12-21 06:22:23,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:22:23,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:22:23,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:22:23,363 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 06:22:23,378 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 06:22:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:22:23,396 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-21 06:22:23,397 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:22:23,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-21 06:22:23,555 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 06:22:23,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:22:23,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106196446] [2023-12-21 06:22:23,661 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:22:23,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36857484] [2023-12-21 06:22:23,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36857484] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 06:22:23,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-21 06:22:23,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2023-12-21 06:22:23,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889887512] [2023-12-21 06:22:23,665 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-21 06:22:23,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-21 06:22:23,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:22:23,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-21 06:22:23,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2023-12-21 06:22:23,668 INFO L87 Difference]: Start difference. First operand 41 states and 58 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 06:22:23,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:22:23,821 INFO L93 Difference]: Finished difference Result 48 states and 64 transitions. [2023-12-21 06:22:23,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-21 06:22:23,821 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2023-12-21 06:22:23,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:22:23,823 INFO L225 Difference]: With dead ends: 48 [2023-12-21 06:22:23,823 INFO L226 Difference]: Without dead ends: 46 [2023-12-21 06:22:23,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=222, Unknown=0, NotChecked=0, Total=272 [2023-12-21 06:22:23,826 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 06:22:23,827 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 132 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 06:22:23,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-21 06:22:23,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2023-12-21 06:22:23,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 25 states have (on average 1.28) internal successors, (32), 27 states have internal predecessors, (32), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2023-12-21 06:22:23,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 61 transitions. [2023-12-21 06:22:23,846 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 61 transitions. Word has length 23 [2023-12-21 06:22:23,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:22:23,847 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 61 transitions. [2023-12-21 06:22:23,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 2 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2023-12-21 06:22:23,847 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 61 transitions. [2023-12-21 06:22:23,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-12-21 06:22:23,848 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:22:23,849 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:22:23,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-12-21 06:22:24,054 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,SelfDestructingSolverStorable3 [2023-12-21 06:22:24,054 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:22:24,055 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:22:24,055 INFO L85 PathProgramCache]: Analyzing trace with hash 705122187, now seen corresponding path program 1 times [2023-12-21 06:22:24,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:22:24,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149482091] [2023-12-21 06:22:24,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:22:24,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:22:24,064 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:22:24,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1689694161] [2023-12-21 06:22:24,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:22:24,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:22:24,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:22:24,066 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 06:22:24,074 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 06:22:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:22:24,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-21 06:22:24,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:22:24,199 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-12-21 06:22:24,199 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 06:22:24,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:22:24,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149482091] [2023-12-21 06:22:24,251 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:22:24,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689694161] [2023-12-21 06:22:24,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689694161] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 06:22:24,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-21 06:22:24,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2023-12-21 06:22:24,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959742146] [2023-12-21 06:22:24,252 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-21 06:22:24,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 06:22:24,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:22:24,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 06:22:24,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-21 06:22:24,253 INFO L87 Difference]: Start difference. First operand 45 states and 61 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-21 06:22:24,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:22:24,340 INFO L93 Difference]: Finished difference Result 70 states and 102 transitions. [2023-12-21 06:22:24,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 06:22:24,340 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2023-12-21 06:22:24,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:22:24,342 INFO L225 Difference]: With dead ends: 70 [2023-12-21 06:22:24,342 INFO L226 Difference]: Without dead ends: 66 [2023-12-21 06:22:24,343 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-21 06:22:24,343 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 06:22:24,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 87 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 06:22:24,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-21 06:22:24,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2023-12-21 06:22:24,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 34 states have (on average 1.3529411764705883) internal successors, (46), 38 states have internal predecessors, (46), 26 states have call successors, (26), 5 states have call predecessors, (26), 5 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2023-12-21 06:22:24,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 95 transitions. [2023-12-21 06:22:24,356 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 95 transitions. Word has length 28 [2023-12-21 06:22:24,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:22:24,357 INFO L495 AbstractCegarLoop]: Abstraction has 66 states and 95 transitions. [2023-12-21 06:22:24,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-21 06:22:24,357 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 95 transitions. [2023-12-21 06:22:24,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-12-21 06:22:24,358 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:22:24,358 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:22:24,377 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 06:22:24,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:22:24,564 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:22:24,564 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:22:24,565 INFO L85 PathProgramCache]: Analyzing trace with hash -1795283768, now seen corresponding path program 1 times [2023-12-21 06:22:24,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:22:24,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739698473] [2023-12-21 06:22:24,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:22:24,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:22:24,593 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:22:24,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1035009147] [2023-12-21 06:22:24,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:22:24,594 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:22:24,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:22:24,603 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 06:22:24,604 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 06:22:24,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:22:24,645 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-21 06:22:24,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:22:24,662 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-21 06:22:24,662 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 06:22:24,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:22:24,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739698473] [2023-12-21 06:22:24,662 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:22:24,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1035009147] [2023-12-21 06:22:24,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1035009147] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 06:22:24,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 06:22:24,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 06:22:24,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737307269] [2023-12-21 06:22:24,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 06:22:24,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 06:22:24,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:22:24,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 06:22:24,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 06:22:24,664 INFO L87 Difference]: Start difference. First operand 66 states and 95 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-21 06:22:24,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:22:24,706 INFO L93 Difference]: Finished difference Result 82 states and 118 transitions. [2023-12-21 06:22:24,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 06:22:24,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 34 [2023-12-21 06:22:24,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:22:24,710 INFO L225 Difference]: With dead ends: 82 [2023-12-21 06:22:24,710 INFO L226 Difference]: Without dead ends: 80 [2023-12-21 06:22:24,711 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 06:22:24,711 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 5 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 06:22:24,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 127 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 06:22:24,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-12-21 06:22:24,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2023-12-21 06:22:24,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 44 states have internal predecessors, (49), 29 states have call successors, (29), 6 states have call predecessors, (29), 6 states have return successors, (26), 22 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-21 06:22:24,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 104 transitions. [2023-12-21 06:22:24,741 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 104 transitions. Word has length 34 [2023-12-21 06:22:24,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:22:24,741 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 104 transitions. [2023-12-21 06:22:24,741 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2023-12-21 06:22:24,741 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 104 transitions. [2023-12-21 06:22:24,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-21 06:22:24,743 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:22:24,743 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:22:24,749 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-12-21 06:22:24,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:22:24,944 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:22:24,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:22:24,945 INFO L85 PathProgramCache]: Analyzing trace with hash -427827123, now seen corresponding path program 1 times [2023-12-21 06:22:24,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:22:24,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198033382] [2023-12-21 06:22:24,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:22:24,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:22:24,955 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:22:24,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1486755857] [2023-12-21 06:22:24,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:22:24,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:22:24,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:22:24,961 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 06:22:24,978 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 06:22:25,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:22:25,006 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-21 06:22:25,010 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:22:25,057 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-21 06:22:25,057 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 06:22:25,098 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-21 06:22:25,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:22:25,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198033382] [2023-12-21 06:22:25,098 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:22:25,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1486755857] [2023-12-21 06:22:25,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1486755857] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 06:22:25,099 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 06:22:25,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-21 06:22:25,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080561982] [2023-12-21 06:22:25,099 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 06:22:25,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-21 06:22:25,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:22:25,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-21 06:22:25,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-21 06:22:25,100 INFO L87 Difference]: Start difference. First operand 73 states and 104 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-21 06:22:25,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:22:25,233 INFO L93 Difference]: Finished difference Result 217 states and 285 transitions. [2023-12-21 06:22:25,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-21 06:22:25,234 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 37 [2023-12-21 06:22:25,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:22:25,237 INFO L225 Difference]: With dead ends: 217 [2023-12-21 06:22:25,237 INFO L226 Difference]: Without dead ends: 195 [2023-12-21 06:22:25,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-21 06:22:25,239 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 56 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 06:22:25,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 147 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 06:22:25,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-12-21 06:22:25,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 189. [2023-12-21 06:22:25,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 107 states have (on average 1.2242990654205608) internal successors, (131), 118 states have internal predecessors, (131), 61 states have call successors, (61), 21 states have call predecessors, (61), 20 states have return successors, (54), 49 states have call predecessors, (54), 54 states have call successors, (54) [2023-12-21 06:22:25,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 246 transitions. [2023-12-21 06:22:25,275 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 246 transitions. Word has length 37 [2023-12-21 06:22:25,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:22:25,275 INFO L495 AbstractCegarLoop]: Abstraction has 189 states and 246 transitions. [2023-12-21 06:22:25,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-21 06:22:25,275 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 246 transitions. [2023-12-21 06:22:25,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-21 06:22:25,280 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:22:25,281 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, 1, 1] [2023-12-21 06:22:25,308 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 06:22:25,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:22:25,492 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:22:25,493 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:22:25,493 INFO L85 PathProgramCache]: Analyzing trace with hash -426158827, now seen corresponding path program 1 times [2023-12-21 06:22:25,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:22:25,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756264788] [2023-12-21 06:22:25,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:22:25,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:22:25,500 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:22:25,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [793966578] [2023-12-21 06:22:25,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:22:25,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:22:25,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:22:25,517 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 06:22:25,548 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 06:22:25,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:22:25,592 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-21 06:22:25,594 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:22:25,664 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2023-12-21 06:22:25,665 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 06:22:25,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:22:25,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756264788] [2023-12-21 06:22:25,756 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:22:25,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793966578] [2023-12-21 06:22:25,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793966578] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-21 06:22:25,756 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2023-12-21 06:22:25,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2023-12-21 06:22:25,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867817689] [2023-12-21 06:22:25,757 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2023-12-21 06:22:25,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-21 06:22:25,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:22:25,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-21 06:22:25,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-12-21 06:22:25,758 INFO L87 Difference]: Start difference. First operand 189 states and 246 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 06:22:25,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:22:25,833 INFO L93 Difference]: Finished difference Result 203 states and 259 transitions. [2023-12-21 06:22:25,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-21 06:22:25,834 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 37 [2023-12-21 06:22:25,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:22:25,835 INFO L225 Difference]: With dead ends: 203 [2023-12-21 06:22:25,835 INFO L226 Difference]: Without dead ends: 198 [2023-12-21 06:22:25,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2023-12-21 06:22:25,836 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 14 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 06:22:25,836 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 93 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 06:22:25,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2023-12-21 06:22:25,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 198. [2023-12-21 06:22:25,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 116 states have (on average 1.206896551724138) internal successors, (140), 127 states have internal predecessors, (140), 58 states have call successors, (58), 24 states have call predecessors, (58), 23 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2023-12-21 06:22:25,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 249 transitions. [2023-12-21 06:22:25,855 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 249 transitions. Word has length 37 [2023-12-21 06:22:25,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:22:25,855 INFO L495 AbstractCegarLoop]: Abstraction has 198 states and 249 transitions. [2023-12-21 06:22:25,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2023-12-21 06:22:25,856 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 249 transitions. [2023-12-21 06:22:25,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-12-21 06:22:25,856 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:22:25,856 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:22:25,877 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 06:22:26,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:22:26,062 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:22:26,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:22:26,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1298990710, now seen corresponding path program 1 times [2023-12-21 06:22:26,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:22:26,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798925049] [2023-12-21 06:22:26,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:22:26,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:22:26,079 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:22:26,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [553514435] [2023-12-21 06:22:26,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:22:26,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:22:26,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:22:26,097 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 06:22:26,124 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 06:22:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:22:26,145 INFO L262 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-21 06:22:26,146 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:22:26,205 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-21 06:22:26,205 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 06:22:26,294 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-21 06:22:26,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:22:26,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798925049] [2023-12-21 06:22:26,295 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:22:26,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [553514435] [2023-12-21 06:22:26,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [553514435] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 06:22:26,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 06:22:26,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2023-12-21 06:22:26,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008990163] [2023-12-21 06:22:26,295 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 06:22:26,296 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-21 06:22:26,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:22:26,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-21 06:22:26,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-12-21 06:22:26,297 INFO L87 Difference]: Start difference. First operand 198 states and 249 transitions. Second operand has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-21 06:22:26,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:22:26,419 INFO L93 Difference]: Finished difference Result 227 states and 285 transitions. [2023-12-21 06:22:26,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 06:22:26,419 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 39 [2023-12-21 06:22:26,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:22:26,422 INFO L225 Difference]: With dead ends: 227 [2023-12-21 06:22:26,422 INFO L226 Difference]: Without dead ends: 211 [2023-12-21 06:22:26,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-12-21 06:22:26,432 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 21 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 06:22:26,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 126 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 06:22:26,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2023-12-21 06:22:26,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2023-12-21 06:22:26,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 126 states have (on average 1.1666666666666667) internal successors, (147), 137 states have internal predecessors, (147), 57 states have call successors, (57), 25 states have call predecessors, (57), 25 states have return successors, (53), 46 states have call predecessors, (53), 53 states have call successors, (53) [2023-12-21 06:22:26,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 257 transitions. [2023-12-21 06:22:26,448 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 257 transitions. Word has length 39 [2023-12-21 06:22:26,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:22:26,449 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 257 transitions. [2023-12-21 06:22:26,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 5 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2023-12-21 06:22:26,449 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 257 transitions. [2023-12-21 06:22:26,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2023-12-21 06:22:26,449 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:22:26,449 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:22:26,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-21 06:22:26,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:22:26,650 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:22:26,651 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:22:26,651 INFO L85 PathProgramCache]: Analyzing trace with hash -1786533347, now seen corresponding path program 2 times [2023-12-21 06:22:26,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:22:26,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530489962] [2023-12-21 06:22:26,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:22:26,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:22:26,656 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:22:26,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1936546210] [2023-12-21 06:22:26,656 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 06:22:26,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:22:26,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:22:26,657 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 06:22:26,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-21 06:22:26,696 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 06:22:26,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 06:22:26,697 INFO L262 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 29 conjunts are in the unsatisfiable core [2023-12-21 06:22:26,698 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:22:26,817 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 13 proven. 8 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-21 06:22:26,817 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 06:22:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2023-12-21 06:22:26,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:22:26,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530489962] [2023-12-21 06:22:26,918 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:22:26,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1936546210] [2023-12-21 06:22:26,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1936546210] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 06:22:26,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 06:22:26,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2023-12-21 06:22:26,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121505743] [2023-12-21 06:22:26,919 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 06:22:26,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-21 06:22:26,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:22:26,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-21 06:22:26,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2023-12-21 06:22:26,920 INFO L87 Difference]: Start difference. First operand 209 states and 257 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-21 06:22:27,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:22:27,691 INFO L93 Difference]: Finished difference Result 248 states and 309 transitions. [2023-12-21 06:22:27,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-21 06:22:27,692 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 42 [2023-12-21 06:22:27,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:22:27,693 INFO L225 Difference]: With dead ends: 248 [2023-12-21 06:22:27,693 INFO L226 Difference]: Without dead ends: 224 [2023-12-21 06:22:27,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2023-12-21 06:22:27,694 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 27 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-21 06:22:27,694 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 218 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-21 06:22:27,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-12-21 06:22:27,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 205. [2023-12-21 06:22:27,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 132 states have (on average 1.128787878787879) internal successors, (149), 140 states have internal predecessors, (149), 45 states have call successors, (45), 27 states have call predecessors, (45), 27 states have return successors, (41), 37 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-21 06:22:27,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 235 transitions. [2023-12-21 06:22:27,724 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 235 transitions. Word has length 42 [2023-12-21 06:22:27,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:22:27,724 INFO L495 AbstractCegarLoop]: Abstraction has 205 states and 235 transitions. [2023-12-21 06:22:27,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 5 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-21 06:22:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 235 transitions. [2023-12-21 06:22:27,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2023-12-21 06:22:27,725 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:22:27,725 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:22:27,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-21 06:22:27,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-12-21 06:22:27,931 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:22:27,931 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:22:27,931 INFO L85 PathProgramCache]: Analyzing trace with hash -882918259, now seen corresponding path program 1 times [2023-12-21 06:22:27,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:22:27,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923559488] [2023-12-21 06:22:27,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:22:27,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:22:27,942 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:22:27,942 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1211283578] [2023-12-21 06:22:27,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:22:27,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:22:27,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:22:27,945 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 06:22:27,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-12-21 06:22:28,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 06:22:28,004 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-21 06:22:28,006 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:22:28,193 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 12 proven. 16 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2023-12-21 06:22:28,193 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 06:22:28,387 INFO L134 CoverageAnalysis]: Checked inductivity of 89 backedges. 18 proven. 7 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2023-12-21 06:22:28,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:22:28,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923559488] [2023-12-21 06:22:28,388 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:22:28,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211283578] [2023-12-21 06:22:28,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211283578] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 06:22:28,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 06:22:28,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2023-12-21 06:22:28,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847791566] [2023-12-21 06:22:28,388 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 06:22:28,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-21 06:22:28,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:22:28,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-21 06:22:28,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2023-12-21 06:22:28,389 INFO L87 Difference]: Start difference. First operand 205 states and 235 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 14 states have internal predecessors, (37), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-21 06:22:28,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:22:28,711 INFO L93 Difference]: Finished difference Result 217 states and 251 transitions. [2023-12-21 06:22:28,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-21 06:22:28,712 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 14 states have internal predecessors, (37), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) Word has length 56 [2023-12-21 06:22:28,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:22:28,713 INFO L225 Difference]: With dead ends: 217 [2023-12-21 06:22:28,713 INFO L226 Difference]: Without dead ends: 190 [2023-12-21 06:22:28,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=443, Unknown=0, NotChecked=0, Total=552 [2023-12-21 06:22:28,714 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 42 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 06:22:28,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 319 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 06:22:28,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2023-12-21 06:22:28,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 184. [2023-12-21 06:22:28,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 123 states have (on average 1.113821138211382) internal successors, (137), 127 states have internal predecessors, (137), 36 states have call successors, (36), 24 states have call predecessors, (36), 24 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-21 06:22:28,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 207 transitions. [2023-12-21 06:22:28,739 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 207 transitions. Word has length 56 [2023-12-21 06:22:28,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:22:28,739 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 207 transitions. [2023-12-21 06:22:28,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 14 states have internal predecessors, (37), 8 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 6 states have call successors, (16) [2023-12-21 06:22:28,739 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 207 transitions. [2023-12-21 06:22:28,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2023-12-21 06:22:28,741 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:22:28,741 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:22:28,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-12-21 06:22:28,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:22:28,944 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:22:28,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:22:28,945 INFO L85 PathProgramCache]: Analyzing trace with hash -11441917, now seen corresponding path program 2 times [2023-12-21 06:22:28,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:22:28,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819588443] [2023-12-21 06:22:28,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:22:28,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:22:28,951 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:22:28,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [87606990] [2023-12-21 06:22:28,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 06:22:28,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:22:28,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:22:28,953 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 06:22:28,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-12-21 06:22:29,008 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 06:22:29,009 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 06:22:29,010 INFO L262 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-21 06:22:29,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:22:29,142 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 266 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2023-12-21 06:22:29,142 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 06:22:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 24 proven. 50 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2023-12-21 06:22:29,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:22:29,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819588443] [2023-12-21 06:22:29,248 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:22:29,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87606990] [2023-12-21 06:22:29,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87606990] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 06:22:29,249 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 06:22:29,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-21 06:22:29,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275242371] [2023-12-21 06:22:29,249 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 06:22:29,249 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-21 06:22:29,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:22:29,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-21 06:22:29,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-12-21 06:22:29,250 INFO L87 Difference]: Start difference. First operand 184 states and 207 transitions. Second operand has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 11 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2023-12-21 06:22:29,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:22:29,493 INFO L93 Difference]: Finished difference Result 511 states and 600 transitions. [2023-12-21 06:22:29,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-21 06:22:29,494 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 11 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) Word has length 94 [2023-12-21 06:22:29,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:22:29,496 INFO L225 Difference]: With dead ends: 511 [2023-12-21 06:22:29,496 INFO L226 Difference]: Without dead ends: 502 [2023-12-21 06:22:29,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 174 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2023-12-21 06:22:29,497 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 61 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 06:22:29,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 135 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 06:22:29,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2023-12-21 06:22:29,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2023-12-21 06:22:29,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 502 states, 333 states have (on average 1.0960960960960962) internal successors, (365), 343 states have internal predecessors, (365), 102 states have call successors, (102), 66 states have call predecessors, (102), 66 states have return successors, (100), 92 states have call predecessors, (100), 100 states have call successors, (100) [2023-12-21 06:22:29,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 567 transitions. [2023-12-21 06:22:29,556 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 567 transitions. Word has length 94 [2023-12-21 06:22:29,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:22:29,557 INFO L495 AbstractCegarLoop]: Abstraction has 502 states and 567 transitions. [2023-12-21 06:22:29,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.571428571428571) internal successors, (64), 14 states have internal predecessors, (64), 11 states have call successors, (29), 7 states have call predecessors, (29), 6 states have return successors, (28), 10 states have call predecessors, (28), 10 states have call successors, (28) [2023-12-21 06:22:29,557 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 567 transitions. [2023-12-21 06:22:29,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2023-12-21 06:22:29,559 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:22:29,559 INFO L195 NwaCegarLoop]: trace histogram [31, 30, 30, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:22:29,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-12-21 06:22:29,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-12-21 06:22:29,766 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:22:29,766 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:22:29,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1428770883, now seen corresponding path program 3 times [2023-12-21 06:22:29,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:22:29,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408673555] [2023-12-21 06:22:29,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:22:29,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:22:29,776 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:22:29,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [422652565] [2023-12-21 06:22:29,777 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 06:22:29,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:22:29,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:22:29,797 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 06:22:29,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-12-21 06:22:29,938 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2023-12-21 06:22:29,938 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 06:22:29,940 INFO L262 TraceCheckSpWp]: Trace formula consists of 444 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-21 06:22:29,944 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 06:22:30,219 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 1955 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2023-12-21 06:22:30,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 06:22:30,502 INFO L134 CoverageAnalysis]: Checked inductivity of 2139 backedges. 60 proven. 335 refuted. 0 times theorem prover too weak. 1744 trivial. 0 not checked. [2023-12-21 06:22:30,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 06:22:30,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408673555] [2023-12-21 06:22:30,503 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 06:22:30,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422652565] [2023-12-21 06:22:30,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422652565] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 06:22:30,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 06:22:30,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2023-12-21 06:22:30,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543256905] [2023-12-21 06:22:30,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 06:22:30,504 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-21 06:22:30,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 06:22:30,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-21 06:22:30,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2023-12-21 06:22:30,505 INFO L87 Difference]: Start difference. First operand 502 states and 567 transitions. Second operand has 24 states, 24 states have (on average 5.25) internal successors, (126), 24 states have internal predecessors, (126), 21 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (64), 20 states have call predecessors, (64), 20 states have call successors, (64) [2023-12-21 06:22:30,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 06:22:30,990 INFO L93 Difference]: Finished difference Result 1041 states and 1216 transitions. [2023-12-21 06:22:30,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-21 06:22:30,991 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.25) internal successors, (126), 24 states have internal predecessors, (126), 21 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (64), 20 states have call predecessors, (64), 20 states have call successors, (64) Word has length 208 [2023-12-21 06:22:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 06:22:30,995 INFO L225 Difference]: With dead ends: 1041 [2023-12-21 06:22:30,995 INFO L226 Difference]: Without dead ends: 1032 [2023-12-21 06:22:30,995 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 390 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2023-12-21 06:22:30,996 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 118 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 06:22:30,996 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 213 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-21 06:22:30,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1032 states. [2023-12-21 06:22:31,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1032 to 1032. [2023-12-21 06:22:31,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1032 states, 683 states have (on average 1.0907759882869692) internal successors, (745), 703 states have internal predecessors, (745), 212 states have call successors, (212), 136 states have call predecessors, (212), 136 states have return successors, (210), 192 states have call predecessors, (210), 210 states have call successors, (210) [2023-12-21 06:22:31,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1032 states to 1032 states and 1167 transitions. [2023-12-21 06:22:31,087 INFO L78 Accepts]: Start accepts. Automaton has 1032 states and 1167 transitions. Word has length 208 [2023-12-21 06:22:31,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 06:22:31,088 INFO L495 AbstractCegarLoop]: Abstraction has 1032 states and 1167 transitions. [2023-12-21 06:22:31,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.25) internal successors, (126), 24 states have internal predecessors, (126), 21 states have call successors, (65), 13 states have call predecessors, (65), 12 states have return successors, (64), 20 states have call predecessors, (64), 20 states have call successors, (64) [2023-12-21 06:22:31,088 INFO L276 IsEmpty]: Start isEmpty. Operand 1032 states and 1167 transitions. [2023-12-21 06:22:31,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2023-12-21 06:22:31,093 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 06:22:31,093 INFO L195 NwaCegarLoop]: trace histogram [61, 60, 60, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:22:31,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-12-21 06:22:31,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-12-21 06:22:31,300 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 06:22:31,300 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 06:22:31,300 INFO L85 PathProgramCache]: Analyzing trace with hash -846928125, now seen corresponding path program 4 times [2023-12-21 06:22:31,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 06:22:31,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679580290] [2023-12-21 06:22:31,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 06:22:31,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 06:22:31,331 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 06:22:31,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1782008655] [2023-12-21 06:22:31,332 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-21 06:22:31,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 06:22:31,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 06:22:31,348 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 06:22:31,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-12-21 06:22:31,507 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-21 06:22:31,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-21 06:22:31,507 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-21 06:22:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-21 06:22:31,718 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-21 06:22:31,718 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-21 06:22:31,719 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 06:22:31,745 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-12-21 06:22:31,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-12-21 06:22:31,923 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 06:22:31,926 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 06:22:32,031 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 06:22:32 BoogieIcfgContainer [2023-12-21 06:22:32,032 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 06:22:32,032 INFO L158 Benchmark]: Toolchain (without parser) took 10216.00ms. Allocated memory was 206.6MB in the beginning and 314.6MB in the end (delta: 108.0MB). Free memory was 162.0MB in the beginning and 230.1MB in the end (delta: -68.1MB). Peak memory consumption was 40.9MB. Max. memory is 8.0GB. [2023-12-21 06:22:32,032 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 206.6MB. Free memory is still 162.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 06:22:32,032 INFO L158 Benchmark]: CACSL2BoogieTranslator took 172.13ms. Allocated memory is still 206.6MB. Free memory was 162.0MB in the beginning and 150.8MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 06:22:32,032 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.82ms. Allocated memory is still 206.6MB. Free memory was 150.8MB in the beginning and 149.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 06:22:32,033 INFO L158 Benchmark]: Boogie Preprocessor took 29.69ms. Allocated memory is still 206.6MB. Free memory was 149.1MB in the beginning and 147.3MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 06:22:32,033 INFO L158 Benchmark]: RCFGBuilder took 284.29ms. Allocated memory is still 206.6MB. Free memory was 147.3MB in the beginning and 135.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 06:22:32,033 INFO L158 Benchmark]: TraceAbstraction took 9693.03ms. Allocated memory was 206.6MB in the beginning and 314.6MB in the end (delta: 108.0MB). Free memory was 135.1MB in the beginning and 230.1MB in the end (delta: -95.0MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. [2023-12-21 06:22:32,034 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.51ms. Allocated memory is still 206.6MB. Free memory is still 162.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 172.13ms. Allocated memory is still 206.6MB. Free memory was 162.0MB in the beginning and 150.8MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.82ms. Allocated memory is still 206.6MB. Free memory was 150.8MB in the beginning and 149.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.69ms. Allocated memory is still 206.6MB. Free memory was 149.1MB in the beginning and 147.3MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 284.29ms. Allocated memory is still 206.6MB. Free memory was 147.3MB in the beginning and 135.8MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 9693.03ms. Allocated memory was 206.6MB in the beginning and 314.6MB in the end (delta: 108.0MB). Free memory was 135.1MB in the beginning and 230.1MB in the end (delta: -95.0MB). Peak memory consumption was 13.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L18] int counter = 0; [L20] long long a, b, p, q, r, s; [L21] int x, y; [L22] x = __VERIFIER_nondet_int() [L23] y = __VERIFIER_nondet_int() [L24] CALL assume_abort_if_not(x >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L24] RET assume_abort_if_not(x >= 1) VAL [counter=0, x=43, y=2] [L25] CALL assume_abort_if_not(y >= 1) VAL [\old(cond)=1, counter=0] [L8] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L25] RET assume_abort_if_not(y >= 1) VAL [counter=0, x=43, y=2] [L27] a = x [L28] b = y [L29] p = 1 [L30] q = 0 [L31] r = 0 [L32] s = 1 VAL [a=43, b=2, counter=0, p=1, q=0, r=0, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=43, b=2, counter=1, p=1, q=0, r=0, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=43, b=2, counter=1, p=1, q=0, r=0, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=43, b=2, counter=1, p=1, q=0, r=0, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=1] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=43, b=2, counter=1, p=1, q=0, r=0, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=43, b=2, counter=1, p=1, q=0, r=0, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=41, b=2, counter=1, p=1, q=0, r=-1, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=41, b=2, counter=2, p=1, q=0, r=-1, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=41, b=2, counter=2, p=1, q=0, r=-1, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=41, b=2, counter=2, p=1, q=0, r=-1, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=2] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=41, b=2, counter=2, p=1, q=0, r=-1, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=41, b=2, counter=2, p=1, q=0, r=-1, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=39, b=2, counter=2, p=1, q=0, r=-2, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=39, b=2, counter=3, p=1, q=0, r=-2, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=39, b=2, counter=3, p=1, q=0, r=-2, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=39, b=2, counter=3, p=1, q=0, r=-2, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=3] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=39, b=2, counter=3, p=1, q=0, r=-2, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=39, b=2, counter=3, p=1, q=0, r=-2, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=37, b=2, counter=3, p=1, q=0, r=-3, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=37, b=2, counter=4, p=1, q=0, r=-3, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=37, b=2, counter=4, p=1, q=0, r=-3, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=37, b=2, counter=4, p=1, q=0, r=-3, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=4] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=37, b=2, counter=4, p=1, q=0, r=-3, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=37, b=2, counter=4, p=1, q=0, r=-3, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=35, b=2, counter=4, p=1, q=0, r=-4, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=35, b=2, counter=5, p=1, q=0, r=-4, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=35, b=2, counter=5, p=1, q=0, r=-4, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=35, b=2, counter=5, p=1, q=0, r=-4, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=5] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=35, b=2, counter=5, p=1, q=0, r=-4, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=35, b=2, counter=5, p=1, q=0, r=-4, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=33, b=2, counter=5, p=1, q=0, r=-5, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=33, b=2, counter=6, p=1, q=0, r=-5, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=33, b=2, counter=6, p=1, q=0, r=-5, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=33, b=2, counter=6, p=1, q=0, r=-5, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=6] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=33, b=2, counter=6, p=1, q=0, r=-5, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=33, b=2, counter=6, p=1, q=0, r=-5, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=31, b=2, counter=6, p=1, q=0, r=-6, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=31, b=2, counter=7, p=1, q=0, r=-6, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=31, b=2, counter=7, p=1, q=0, r=-6, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=31, b=2, counter=7, p=1, q=0, r=-6, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=7] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=31, b=2, counter=7, p=1, q=0, r=-6, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=31, b=2, counter=7, p=1, q=0, r=-6, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=29, b=2, counter=7, p=1, q=0, r=-7, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=29, b=2, counter=8, p=1, q=0, r=-7, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=29, b=2, counter=8, p=1, q=0, r=-7, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=29, b=2, counter=8, p=1, q=0, r=-7, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=8] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=29, b=2, counter=8, p=1, q=0, r=-7, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=29, b=2, counter=8, p=1, q=0, r=-7, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=27, b=2, counter=8, p=1, q=0, r=-8, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=27, b=2, counter=9, p=1, q=0, r=-8, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=27, b=2, counter=9, p=1, q=0, r=-8, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=27, b=2, counter=9, p=1, q=0, r=-8, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=9] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=27, b=2, counter=9, p=1, q=0, r=-8, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=27, b=2, counter=9, p=1, q=0, r=-8, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=25, b=2, counter=9, p=1, q=0, r=-9, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=25, b=2, counter=10, p=1, q=0, r=-9, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=25, b=2, counter=10, p=1, q=0, r=-9, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=25, b=2, counter=10, p=1, q=0, r=-9, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=10] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=25, b=2, counter=10, p=1, q=0, r=-9, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=25, b=2, counter=10, p=1, q=0, r=-9, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=23, b=2, counter=10, p=1, q=0, r=-10, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=23, b=2, counter=11, p=1, q=0, r=-10, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=23, b=2, counter=11, p=1, q=0, r=-10, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=23, b=2, counter=11, p=1, q=0, r=-10, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=11] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=23, b=2, counter=11, p=1, q=0, r=-10, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=23, b=2, counter=11, p=1, q=0, r=-10, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=21, b=2, counter=11, p=1, q=0, r=-11, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=21, b=2, counter=12, p=1, q=0, r=-11, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=21, b=2, counter=12, p=1, q=0, r=-11, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=21, b=2, counter=12, p=1, q=0, r=-11, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=12] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=21, b=2, counter=12, p=1, q=0, r=-11, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=21, b=2, counter=12, p=1, q=0, r=-11, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=19, b=2, counter=12, p=1, q=0, r=-12, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=19, b=2, counter=13, p=1, q=0, r=-12, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=19, b=2, counter=13, p=1, q=0, r=-12, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=19, b=2, counter=13, p=1, q=0, r=-12, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=13] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=19, b=2, counter=13, p=1, q=0, r=-12, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=19, b=2, counter=13, p=1, q=0, r=-12, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=17, b=2, counter=13, p=1, q=0, r=-13, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=17, b=2, counter=14, p=1, q=0, r=-13, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=17, b=2, counter=14, p=1, q=0, r=-13, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=17, b=2, counter=14, p=1, q=0, r=-13, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=14] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=17, b=2, counter=14, p=1, q=0, r=-13, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=17, b=2, counter=14, p=1, q=0, r=-13, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=15, b=2, counter=14, p=1, q=0, r=-14, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=15, b=2, counter=15, p=1, q=0, r=-14, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=15, b=2, counter=15, p=1, q=0, r=-14, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=15, b=2, counter=15, p=1, q=0, r=-14, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=15] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=15, b=2, counter=15, p=1, q=0, r=-14, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=15, b=2, counter=15, p=1, q=0, r=-14, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=13, b=2, counter=15, p=1, q=0, r=-15, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=13, b=2, counter=16, p=1, q=0, r=-15, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=13, b=2, counter=16, p=1, q=0, r=-15, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=13, b=2, counter=16, p=1, q=0, r=-15, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=16] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=13, b=2, counter=16, p=1, q=0, r=-15, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=13, b=2, counter=16, p=1, q=0, r=-15, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=11, b=2, counter=16, p=1, q=0, r=-16, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=11, b=2, counter=17, p=1, q=0, r=-16, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=11, b=2, counter=17, p=1, q=0, r=-16, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=11, b=2, counter=17, p=1, q=0, r=-16, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=17] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=11, b=2, counter=17, p=1, q=0, r=-16, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=11, b=2, counter=17, p=1, q=0, r=-16, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=9, b=2, counter=17, p=1, q=0, r=-17, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=9, b=2, counter=18, p=1, q=0, r=-17, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=9, b=2, counter=18, p=1, q=0, r=-17, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=9, b=2, counter=18, p=1, q=0, r=-17, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=18] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=9, b=2, counter=18, p=1, q=0, r=-17, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=9, b=2, counter=18, p=1, q=0, r=-17, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=7, b=2, counter=18, p=1, q=0, r=-18, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=7, b=2, counter=19, p=1, q=0, r=-18, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=7, b=2, counter=19, p=1, q=0, r=-18, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=7, b=2, counter=19, p=1, q=0, r=-18, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=19] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=7, b=2, counter=19, p=1, q=0, r=-18, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=7, b=2, counter=19, p=1, q=0, r=-18, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=5, b=2, counter=19, p=1, q=0, r=-19, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=5, b=2, counter=20, p=1, q=0, r=-19, s=1, x=43, y=2] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(1 == p * s - r * q) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(1 == p * s - r * q) VAL [a=5, b=2, counter=20, p=1, q=0, r=-19, s=1, x=43, y=2] [L36] CALL __VERIFIER_assert(a == y * r + x * p) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L36] RET __VERIFIER_assert(a == y * r + x * p) VAL [a=5, b=2, counter=20, p=1, q=0, r=-19, s=1, x=43, y=2] [L37] CALL __VERIFIER_assert(b == x * q + y * s) VAL [\old(cond)=1, counter=20] [L11] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L37] RET __VERIFIER_assert(b == x * q + y * s) VAL [a=5, b=2, counter=20, p=1, q=0, r=-19, s=1, x=43, y=2] [L39] COND FALSE !(!(a != b)) VAL [a=5, b=2, counter=20, p=1, q=0, r=-19, s=1, x=43, y=2] [L42] COND TRUE a > b [L43] a = a - b [L44] p = p - q [L45] r = r - s VAL [a=3, b=2, counter=20, p=1, q=0, r=-20, s=1, x=43, y=2] [L34] EXPR counter++ VAL [a=3, b=2, counter=21, p=1, q=0, r=-20, s=1, x=43, y=2] [L34] COND FALSE !(counter++<20) [L53] CALL __VERIFIER_assert(a - b == 0) VAL [\old(cond)=0, counter=21] [L11] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=21] [L13] reach_error() VAL [\old(cond)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.5s, OverallIterations: 14, TraceHistogramMax: 61, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 431 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 399 mSDsluCounter, 1880 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1504 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1290 IncrementalHoareTripleChecker+Invalid, 1435 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 376 mSDtfsCounter, 1290 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1163 GetRequests, 994 SyntacticMatches, 3 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1032occurred in iteration=13, InterpolantAutomatonStates: 148, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 42 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1049 NumberOfCodeBlocks, 1034 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 1108 ConstructedInterpolants, 0 QuantifiedInterpolants, 3320 SizeOfPredicates, 45 NumberOfNonLiveVariables, 1617 ConjunctsInSsa, 202 ConjunctsInUnsatCore, 19 InterpolantComputations, 4 PerfectInterpolantSequences, 2756/5417 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-21 06:22:32,052 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...