/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation true -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-19 20:09:34,636 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-19 20:09:34,674 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-19 20:09:34,677 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-19 20:09:34,677 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-19 20:09:34,696 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-19 20:09:34,697 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-19 20:09:34,697 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-19 20:09:34,698 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-19 20:09:34,700 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-19 20:09:34,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-19 20:09:34,701 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-19 20:09:34,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-19 20:09:34,701 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-19 20:09:34,701 INFO L153 SettingsManager]: * Use SBE=true [2023-12-19 20:09:34,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-19 20:09:34,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-19 20:09:34,702 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-19 20:09:34,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-19 20:09:34,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-19 20:09:34,702 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-19 20:09:34,704 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-19 20:09:34,704 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-19 20:09:34,704 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-19 20:09:34,705 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-19 20:09:34,705 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-19 20:09:34,705 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-19 20:09:34,705 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-19 20:09:34,706 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-19 20:09:34,706 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-19 20:09:34,707 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-19 20:09:34,707 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-19 20:09:34,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 20:09:34,707 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-19 20:09:34,707 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-19 20:09:34,707 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-19 20:09:34,707 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-19 20:09:34,707 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-19 20:09:34,708 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-19 20:09:34,708 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-19 20:09:34,708 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-19 20:09:34,708 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-19 20:09:34,708 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-19 20:09:34,709 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> true [2023-12-19 20:09:34,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-19 20:09:34,907 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-19 20:09:34,909 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-19 20:09:34,909 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-19 20:09:34,910 INFO L274 PluginConnector]: CDTParser initialized [2023-12-19 20:09:34,911 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2023-12-19 20:09:35,984 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-19 20:09:36,144 INFO L384 CDTParser]: Found 1 translation units. [2023-12-19 20:09:36,145 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2023-12-19 20:09:36,150 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4913edc73/40560ac4e7c246749602ef008da3bc77/FLAG616bd04a5 [2023-12-19 20:09:36,160 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4913edc73/40560ac4e7c246749602ef008da3bc77 [2023-12-19 20:09:36,162 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-19 20:09:36,164 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-19 20:09:36,167 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-19 20:09:36,167 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-19 20:09:36,171 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-19 20:09:36,171 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 08:09:36" (1/1) ... [2023-12-19 20:09:36,172 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c235832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:09:36, skipping insertion in model container [2023-12-19 20:09:36,172 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 08:09:36" (1/1) ... [2023-12-19 20:09:36,189 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-19 20:09:36,302 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/fermat2-ll_unwindbound20.c[524,537] [2023-12-19 20:09:36,314 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 20:09:36,322 INFO L202 MainTranslator]: Completed pre-run [2023-12-19 20:09:36,330 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/fermat2-ll_unwindbound20.c[524,537] [2023-12-19 20:09:36,334 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-19 20:09:36,345 INFO L206 MainTranslator]: Completed translation [2023-12-19 20:09:36,345 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:09:36 WrapperNode [2023-12-19 20:09:36,345 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-19 20:09:36,346 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-19 20:09:36,346 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-19 20:09:36,346 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-19 20:09:36,351 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:09:36" (1/1) ... [2023-12-19 20:09:36,355 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:09:36" (1/1) ... [2023-12-19 20:09:36,374 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 47 [2023-12-19 20:09:36,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-19 20:09:36,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-19 20:09:36,375 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-19 20:09:36,375 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-19 20:09:36,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:09:36" (1/1) ... [2023-12-19 20:09:36,383 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:09:36" (1/1) ... [2023-12-19 20:09:36,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:09:36" (1/1) ... [2023-12-19 20:09:36,392 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-19 20:09:36,392 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:09:36" (1/1) ... [2023-12-19 20:09:36,392 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:09:36" (1/1) ... [2023-12-19 20:09:36,394 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:09:36" (1/1) ... [2023-12-19 20:09:36,396 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:09:36" (1/1) ... [2023-12-19 20:09:36,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:09:36" (1/1) ... [2023-12-19 20:09:36,397 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:09:36" (1/1) ... [2023-12-19 20:09:36,398 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-19 20:09:36,399 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-19 20:09:36,399 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-19 20:09:36,399 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-19 20:09:36,399 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:09:36" (1/1) ... [2023-12-19 20:09:36,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-19 20:09:36,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 20:09:36,437 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-19 20:09:36,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-19 20:09:36,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-19 20:09:36,465 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-19 20:09:36,465 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-19 20:09:36,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-19 20:09:36,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-19 20:09:36,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-19 20:09:36,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-19 20:09:36,467 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-19 20:09:36,513 INFO L241 CfgBuilder]: Building ICFG [2023-12-19 20:09:36,514 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-19 20:09:36,610 INFO L282 CfgBuilder]: Performing block encoding [2023-12-19 20:09:36,624 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-19 20:09:36,624 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-19 20:09:36,625 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 08:09:36 BoogieIcfgContainer [2023-12-19 20:09:36,625 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-19 20:09:36,626 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-19 20:09:36,626 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-19 20:09:36,628 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-19 20:09:36,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 08:09:36" (1/3) ... [2023-12-19 20:09:36,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a207b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 08:09:36, skipping insertion in model container [2023-12-19 20:09:36,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 08:09:36" (2/3) ... [2023-12-19 20:09:36,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a207b80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 08:09:36, skipping insertion in model container [2023-12-19 20:09:36,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 08:09:36" (3/3) ... [2023-12-19 20:09:36,630 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound20.c [2023-12-19 20:09:36,641 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-19 20:09:36,641 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-19 20:09:36,667 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-19 20:09:36,671 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;@8d7f507, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-19 20:09:36,671 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-19 20:09:36,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-19 20:09:36,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-19 20:09:36,685 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 20:09:36,685 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 20:09:36,686 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 20:09:36,689 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 20:09:36,689 INFO L85 PathProgramCache]: Analyzing trace with hash -1060579028, now seen corresponding path program 1 times [2023-12-19 20:09:36,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 20:09:36,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960589829] [2023-12-19 20:09:36,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 20:09:36,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 20:09:36,784 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 20:09:36,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [524675287] [2023-12-19 20:09:36,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 20:09:36,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 20:09:36,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 20:09:36,788 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 20:09:36,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-19 20:09:36,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 20:09:36,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-19 20:09:36,845 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 20:09:36,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-19 20:09:36,861 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 20:09:36,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 20:09:36,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960589829] [2023-12-19 20:09:36,862 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 20:09:36,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [524675287] [2023-12-19 20:09:36,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [524675287] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 20:09:36,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 20:09:36,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-19 20:09:36,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491952348] [2023-12-19 20:09:36,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 20:09:36,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-19 20:09:36,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 20:09:36,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-19 20:09:36,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 20:09:36,890 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.5) internal successors, (21), 15 states have internal predecessors, (21), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 20:09:36,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 20:09:36,921 INFO L93 Difference]: Finished difference Result 42 states and 59 transitions. [2023-12-19 20:09:36,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-19 20:09:36,923 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-12-19 20:09:36,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 20:09:36,927 INFO L225 Difference]: With dead ends: 42 [2023-12-19 20:09:36,927 INFO L226 Difference]: Without dead ends: 20 [2023-12-19 20:09:36,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-19 20:09:36,934 INFO L413 NwaCegarLoop]: 24 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, 24 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 20:09:36,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 24 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 20:09:36,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2023-12-19 20:09:36,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2023-12-19 20:09:36,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 20:09:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2023-12-19 20:09:36,961 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 17 [2023-12-19 20:09:36,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 20:09:36,962 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2023-12-19 20:09:36,962 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-19 20:09:36,962 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2023-12-19 20:09:36,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-19 20:09:36,964 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 20:09:36,964 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 20:09:36,973 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-12-19 20:09:37,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-19 20:09:37,165 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 20:09:37,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 20:09:37,167 INFO L85 PathProgramCache]: Analyzing trace with hash -778881514, now seen corresponding path program 1 times [2023-12-19 20:09:37,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 20:09:37,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797223285] [2023-12-19 20:09:37,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 20:09:37,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 20:09:37,197 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 20:09:37,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1060101732] [2023-12-19 20:09:37,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 20:09:37,200 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 20:09:37,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 20:09:37,202 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 20:09:37,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-19 20:09:37,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 20:09:37,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-19 20:09:37,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 20:09:37,353 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-19 20:09:37,353 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 20:09:37,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 20:09:37,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797223285] [2023-12-19 20:09:37,353 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 20:09:37,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060101732] [2023-12-19 20:09:37,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060101732] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 20:09:37,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 20:09:37,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-19 20:09:37,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469026878] [2023-12-19 20:09:37,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 20:09:37,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-19 20:09:37,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 20:09:37,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-19 20:09:37,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 20:09:37,355 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-19 20:09:37,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 20:09:37,369 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2023-12-19 20:09:37,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-19 20:09:37,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-19 20:09:37,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 20:09:37,370 INFO L225 Difference]: With dead ends: 29 [2023-12-19 20:09:37,370 INFO L226 Difference]: Without dead ends: 22 [2023-12-19 20:09:37,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-19 20:09:37,371 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 0 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 20:09:37,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 20:09:37,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-19 20:09:37,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2023-12-19 20:09:37,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 20:09:37,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2023-12-19 20:09:37,375 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 18 [2023-12-19 20:09:37,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 20:09:37,376 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2023-12-19 20:09:37,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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-19 20:09:37,377 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2023-12-19 20:09:37,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-19 20:09:37,377 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 20:09:37,377 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 20:09:37,381 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-19 20:09:37,581 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-19 20:09:37,581 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 20:09:37,582 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 20:09:37,582 INFO L85 PathProgramCache]: Analyzing trace with hash -777094054, now seen corresponding path program 1 times [2023-12-19 20:09:37,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 20:09:37,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384252421] [2023-12-19 20:09:37,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 20:09:37,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 20:09:37,590 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 20:09:37,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1296071474] [2023-12-19 20:09:37,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 20:09:37,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 20:09:37,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 20:09:37,592 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 20:09:37,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-19 20:09:37,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 20:09:37,650 INFO L262 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-19 20:09:37,652 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 20:09:37,908 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-19 20:09:37,909 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-19 20:09:37,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 20:09:37,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384252421] [2023-12-19 20:09:37,909 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 20:09:37,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1296071474] [2023-12-19 20:09:37,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1296071474] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-19 20:09:37,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-19 20:09:37,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-12-19 20:09:37,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131391464] [2023-12-19 20:09:37,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-19 20:09:37,910 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 20:09:37,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 20:09:37,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 20:09:37,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-12-19 20:09:37,912 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 8 states, 8 states have (on average 1.625) 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), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-19 20:09:38,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 20:09:38,533 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2023-12-19 20:09:38,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 20:09:38,533 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) 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), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2023-12-19 20:09:38,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 20:09:38,534 INFO L225 Difference]: With dead ends: 34 [2023-12-19 20:09:38,534 INFO L226 Difference]: Without dead ends: 32 [2023-12-19 20:09:38,534 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-19 20:09:38,535 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 18 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-19 20:09:38,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 76 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-19 20:09:38,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-12-19 20:09:38,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2023-12-19 20:09:38,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-19 20:09:38,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2023-12-19 20:09:38,543 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 18 [2023-12-19 20:09:38,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 20:09:38,543 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2023-12-19 20:09:38,543 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) 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), 2 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-19 20:09:38,543 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2023-12-19 20:09:38,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-19 20:09:38,544 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 20:09:38,544 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 20:09:38,553 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-12-19 20:09:38,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 20:09:38,749 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 20:09:38,749 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 20:09:38,749 INFO L85 PathProgramCache]: Analyzing trace with hash -331201790, now seen corresponding path program 1 times [2023-12-19 20:09:38,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 20:09:38,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799463924] [2023-12-19 20:09:38,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 20:09:38,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 20:09:38,767 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 20:09:38,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [563053723] [2023-12-19 20:09:38,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 20:09:38,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 20:09:38,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 20:09:38,769 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 20:09:38,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-19 20:09:38,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 20:09:38,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-19 20:09:38,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 20:09:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 20:09:38,867 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 20:09:38,988 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 20:09:38,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 20:09:38,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799463924] [2023-12-19 20:09:38,988 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 20:09:38,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563053723] [2023-12-19 20:09:38,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563053723] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 20:09:38,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 20:09:38,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2023-12-19 20:09:38,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823610838] [2023-12-19 20:09:38,989 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 20:09:38,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-12-19 20:09:38,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 20:09:38,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-12-19 20:09:38,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-19 20:09:38,992 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 11 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-19 20:09:39,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 20:09:39,111 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2023-12-19 20:09:39,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-19 20:09:39,112 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 24 [2023-12-19 20:09:39,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 20:09:39,114 INFO L225 Difference]: With dead ends: 38 [2023-12-19 20:09:39,115 INFO L226 Difference]: Without dead ends: 33 [2023-12-19 20:09:39,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2023-12-19 20:09:39,117 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 22 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 20:09:39,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 90 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 20:09:39,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-19 20:09:39,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2023-12-19 20:09:39,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-19 20:09:39,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2023-12-19 20:09:39,134 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 24 [2023-12-19 20:09:39,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 20:09:39,135 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2023-12-19 20:09:39,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.9) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2023-12-19 20:09:39,136 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2023-12-19 20:09:39,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-19 20:09:39,137 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 20:09:39,137 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 20:09:39,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-19 20:09:39,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 20:09:39,353 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 20:09:39,353 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 20:09:39,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1584280999, now seen corresponding path program 1 times [2023-12-19 20:09:39,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 20:09:39,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991564993] [2023-12-19 20:09:39,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 20:09:39,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 20:09:39,361 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 20:09:39,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [629081754] [2023-12-19 20:09:39,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 20:09:39,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 20:09:39,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 20:09:39,363 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 20:09:39,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-19 20:09:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-19 20:09:39,412 INFO L262 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-19 20:09:39,417 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 20:09:39,452 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 20:09:39,452 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 20:09:39,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 20:09:39,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 20:09:39,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991564993] [2023-12-19 20:09:39,495 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 20:09:39,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629081754] [2023-12-19 20:09:39,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629081754] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 20:09:39,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 20:09:39,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-19 20:09:39,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413800867] [2023-12-19 20:09:39,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 20:09:39,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-19 20:09:39,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 20:09:39,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-19 20:09:39,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-19 20:09:39,496 INFO L87 Difference]: Start difference. First operand 24 states and 26 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, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-19 20:09:39,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 20:09:39,549 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2023-12-19 20:09:39,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-19 20:09:39,550 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, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 27 [2023-12-19 20:09:39,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 20:09:39,551 INFO L225 Difference]: With dead ends: 56 [2023-12-19 20:09:39,551 INFO L226 Difference]: Without dead ends: 51 [2023-12-19 20:09:39,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-19 20:09:39,552 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 21 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 20:09:39,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 88 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 20:09:39,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-19 20:09:39,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-12-19 20:09:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-19 20:09:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 56 transitions. [2023-12-19 20:09:39,569 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 56 transitions. Word has length 27 [2023-12-19 20:09:39,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 20:09:39,569 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 56 transitions. [2023-12-19 20:09:39,569 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, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2023-12-19 20:09:39,569 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 56 transitions. [2023-12-19 20:09:39,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2023-12-19 20:09:39,571 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 20:09:39,571 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 20:09:39,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-12-19 20:09:39,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 20:09:39,776 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 20:09:39,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 20:09:39,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1262136106, now seen corresponding path program 2 times [2023-12-19 20:09:39,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 20:09:39,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822750662] [2023-12-19 20:09:39,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 20:09:39,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 20:09:39,784 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 20:09:39,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1679597332] [2023-12-19 20:09:39,785 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-19 20:09:39,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 20:09:39,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 20:09:39,786 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 20:09:39,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-19 20:09:39,826 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-19 20:09:39,826 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 20:09:39,827 INFO L262 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-19 20:09:39,828 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 20:09:39,893 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 20:09:39,893 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 20:09:39,970 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-19 20:09:39,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 20:09:39,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822750662] [2023-12-19 20:09:39,970 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 20:09:39,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679597332] [2023-12-19 20:09:39,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679597332] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 20:09:39,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 20:09:39,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-19 20:09:39,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383358279] [2023-12-19 20:09:39,970 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 20:09:39,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-19 20:09:39,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 20:09:39,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-19 20:09:39,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-12-19 20:09:39,972 INFO L87 Difference]: Start difference. First operand 51 states and 56 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, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-12-19 20:09:40,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 20:09:40,090 INFO L93 Difference]: Finished difference Result 110 states and 126 transitions. [2023-12-19 20:09:40,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-19 20:09:40,090 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, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 54 [2023-12-19 20:09:40,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 20:09:40,091 INFO L225 Difference]: With dead ends: 110 [2023-12-19 20:09:40,091 INFO L226 Difference]: Without dead ends: 105 [2023-12-19 20:09:40,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2023-12-19 20:09:40,092 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 49 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-19 20:09:40,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 132 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-19 20:09:40,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-19 20:09:40,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2023-12-19 20:09:40,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.1375) internal successors, (91), 80 states have internal predecessors, (91), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-19 20:09:40,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 116 transitions. [2023-12-19 20:09:40,110 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 116 transitions. Word has length 54 [2023-12-19 20:09:40,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 20:09:40,110 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 116 transitions. [2023-12-19 20:09:40,111 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, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2023-12-19 20:09:40,111 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 116 transitions. [2023-12-19 20:09:40,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-19 20:09:40,112 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 20:09:40,112 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 20:09:40,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-19 20:09:40,320 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 20:09:40,321 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 20:09:40,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 20:09:40,321 INFO L85 PathProgramCache]: Analyzing trace with hash -254685450, now seen corresponding path program 3 times [2023-12-19 20:09:40,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 20:09:40,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756464730] [2023-12-19 20:09:40,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 20:09:40,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 20:09:40,329 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 20:09:40,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1317834399] [2023-12-19 20:09:40,330 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-19 20:09:40,330 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 20:09:40,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 20:09:40,331 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 20:09:40,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-12-19 20:09:40,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-12-19 20:09:40,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-19 20:09:40,498 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-19 20:09:40,501 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-19 20:09:40,700 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-19 20:09:40,701 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-19 20:09:40,947 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2023-12-19 20:09:40,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-19 20:09:40,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756464730] [2023-12-19 20:09:40,947 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-19 20:09:40,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1317834399] [2023-12-19 20:09:40,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1317834399] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-19 20:09:40,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-19 20:09:40,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2023-12-19 20:09:40,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353581960] [2023-12-19 20:09:40,948 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-19 20:09:40,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-19 20:09:40,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-19 20:09:40,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-19 20:09:40,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2023-12-19 20:09:40,950 INFO L87 Difference]: Start difference. First operand 105 states and 116 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, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2023-12-19 20:09:41,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-19 20:09:41,239 INFO L93 Difference]: Finished difference Result 200 states and 230 transitions. [2023-12-19 20:09:41,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-19 20:09:41,239 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, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) Word has length 108 [2023-12-19 20:09:41,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-19 20:09:41,240 INFO L225 Difference]: With dead ends: 200 [2023-12-19 20:09:41,241 INFO L226 Difference]: Without dead ends: 195 [2023-12-19 20:09:41,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 190 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 247 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2023-12-19 20:09:41,242 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 135 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-19 20:09:41,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 188 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-19 20:09:41,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2023-12-19 20:09:41,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2023-12-19 20:09:41,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 150 states have (on average 1.14) internal successors, (171), 150 states have internal predecessors, (171), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-19 20:09:41,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 216 transitions. [2023-12-19 20:09:41,268 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 216 transitions. Word has length 108 [2023-12-19 20:09:41,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-19 20:09:41,269 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 216 transitions. [2023-12-19 20:09:41,269 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, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2023-12-19 20:09:41,269 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 216 transitions. [2023-12-19 20:09:41,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2023-12-19 20:09:41,271 INFO L187 NwaCegarLoop]: Found error trace [2023-12-19 20:09:41,271 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-19 20:09:41,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-12-19 20:09:41,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 20:09:41,488 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-19 20:09:41,488 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-19 20:09:41,488 INFO L85 PathProgramCache]: Analyzing trace with hash 351932374, now seen corresponding path program 4 times [2023-12-19 20:09:41,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-19 20:09:41,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323434715] [2023-12-19 20:09:41,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-19 20:09:41,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-19 20:09:41,498 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-19 20:09:41,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [162423210] [2023-12-19 20:09:41,498 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-19 20:09:41,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-19 20:09:41,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-19 20:09:41,499 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-19 20:09:41,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-12-19 20:09:41,619 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-19 20:09:41,619 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-12-19 20:09:41,619 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-19 20:09:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-19 20:09:41,765 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-19 20:09:41,765 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-19 20:09:41,766 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-19 20:09:41,777 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-12-19 20:09:41,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2023-12-19 20:09:41,980 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2023-12-19 20:09:41,983 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-19 20:09:42,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 08:09:42 BoogieIcfgContainer [2023-12-19 20:09:42,035 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-19 20:09:42,035 INFO L158 Benchmark]: Toolchain (without parser) took 5870.61ms. Allocated memory is still 349.2MB. Free memory was 301.5MB in the beginning and 209.7MB in the end (delta: 91.8MB). Peak memory consumption was 93.2MB. Max. memory is 8.0GB. [2023-12-19 20:09:42,035 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 213.9MB. Free memory is still 165.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-19 20:09:42,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.10ms. Allocated memory is still 349.2MB. Free memory was 301.5MB in the beginning and 290.4MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-19 20:09:42,035 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.68ms. Allocated memory is still 349.2MB. Free memory was 290.4MB in the beginning and 288.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-19 20:09:42,036 INFO L158 Benchmark]: Boogie Preprocessor took 22.98ms. Allocated memory is still 349.2MB. Free memory was 288.9MB in the beginning and 287.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-19 20:09:42,036 INFO L158 Benchmark]: RCFGBuilder took 226.11ms. Allocated memory is still 349.2MB. Free memory was 287.2MB in the beginning and 275.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-19 20:09:42,036 INFO L158 Benchmark]: TraceAbstraction took 5408.54ms. Allocated memory is still 349.2MB. Free memory was 275.0MB in the beginning and 209.7MB in the end (delta: 65.4MB). Peak memory consumption was 66.9MB. Max. memory is 8.0GB. [2023-12-19 20:09:42,037 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.13ms. Allocated memory is still 213.9MB. Free memory is still 165.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 178.10ms. Allocated memory is still 349.2MB. Free memory was 301.5MB in the beginning and 290.4MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 28.68ms. Allocated memory is still 349.2MB. Free memory was 290.4MB in the beginning and 288.9MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 22.98ms. Allocated memory is still 349.2MB. Free memory was 288.9MB in the beginning and 287.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 226.11ms. Allocated memory is still 349.2MB. Free memory was 287.2MB in the beginning and 275.7MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 5408.54ms. Allocated memory is still 349.2MB. Free memory was 275.0MB in the beginning and 209.7MB in the end (delta: 65.4MB). Peak memory consumption was 66.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [A=274233601, R=16561, counter=0] [L28] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L28] RET assume_abort_if_not(A % 2 == 1) VAL [A=274233601, R=16561, counter=0] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [A=274233601, R=16561, counter=0, r=33120, u=33123, v=1] [L34] EXPR counter++ VAL [A=274233601, R=16561, counter=1, r=33120, u=33123, v=1] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=274233601, R=16561, counter=1, r=33120, u=33123, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=274233601, R=16561, counter=1, r=33120, u=33123, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274233601, R=16561, counter=1, r=33119, u=33123, v=3] [L34] EXPR counter++ VAL [A=274233601, R=16561, counter=2, r=33119, u=33123, v=3] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=274233601, R=16561, counter=2, r=33119, u=33123, v=3] [L36] COND FALSE !(!(r != 0)) VAL [A=274233601, R=16561, counter=2, r=33119, u=33123, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274233601, R=16561, counter=2, r=33116, u=33123, v=5] [L34] EXPR counter++ VAL [A=274233601, R=16561, counter=3, r=33116, u=33123, v=5] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=274233601, R=16561, counter=3, r=33116, u=33123, v=5] [L36] COND FALSE !(!(r != 0)) VAL [A=274233601, R=16561, counter=3, r=33116, u=33123, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274233601, R=16561, counter=3, r=33111, u=33123, v=7] [L34] EXPR counter++ VAL [A=274233601, R=16561, counter=4, r=33111, u=33123, v=7] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=274233601, R=16561, counter=4, r=33111, u=33123, v=7] [L36] COND FALSE !(!(r != 0)) VAL [A=274233601, R=16561, counter=4, r=33111, u=33123, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274233601, R=16561, counter=4, r=33104, u=33123, v=9] [L34] EXPR counter++ VAL [A=274233601, R=16561, counter=5, r=33104, u=33123, v=9] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=274233601, R=16561, counter=5, r=33104, u=33123, v=9] [L36] COND FALSE !(!(r != 0)) VAL [A=274233601, R=16561, counter=5, r=33104, u=33123, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274233601, R=16561, counter=5, r=33095, u=33123, v=11] [L34] EXPR counter++ VAL [A=274233601, R=16561, counter=6, r=33095, u=33123, v=11] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=274233601, R=16561, counter=6, r=33095, u=33123, v=11] [L36] COND FALSE !(!(r != 0)) VAL [A=274233601, R=16561, counter=6, r=33095, u=33123, v=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274233601, R=16561, counter=6, r=33084, u=33123, v=13] [L34] EXPR counter++ VAL [A=274233601, R=16561, counter=7, r=33084, u=33123, v=13] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=274233601, R=16561, counter=7, r=33084, u=33123, v=13] [L36] COND FALSE !(!(r != 0)) VAL [A=274233601, R=16561, counter=7, r=33084, u=33123, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274233601, R=16561, counter=7, r=33071, u=33123, v=15] [L34] EXPR counter++ VAL [A=274233601, R=16561, counter=8, r=33071, u=33123, v=15] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=274233601, R=16561, counter=8, r=33071, u=33123, v=15] [L36] COND FALSE !(!(r != 0)) VAL [A=274233601, R=16561, counter=8, r=33071, u=33123, v=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274233601, R=16561, counter=8, r=33056, u=33123, v=17] [L34] EXPR counter++ VAL [A=274233601, R=16561, counter=9, r=33056, u=33123, v=17] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=274233601, R=16561, counter=9, r=33056, u=33123, v=17] [L36] COND FALSE !(!(r != 0)) VAL [A=274233601, R=16561, counter=9, r=33056, u=33123, v=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274233601, R=16561, counter=9, r=33039, u=33123, v=19] [L34] EXPR counter++ VAL [A=274233601, R=16561, counter=10, r=33039, u=33123, v=19] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=274233601, R=16561, counter=10, r=33039, u=33123, v=19] [L36] COND FALSE !(!(r != 0)) VAL [A=274233601, R=16561, counter=10, r=33039, u=33123, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274233601, R=16561, counter=10, r=33020, u=33123, v=21] [L34] EXPR counter++ VAL [A=274233601, R=16561, counter=11, r=33020, u=33123, v=21] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=274233601, R=16561, counter=11, r=33020, u=33123, v=21] [L36] COND FALSE !(!(r != 0)) VAL [A=274233601, R=16561, counter=11, r=33020, u=33123, v=21] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274233601, R=16561, counter=11, r=32999, u=33123, v=23] [L34] EXPR counter++ VAL [A=274233601, R=16561, counter=12, r=32999, u=33123, v=23] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=274233601, R=16561, counter=12, r=32999, u=33123, v=23] [L36] COND FALSE !(!(r != 0)) VAL [A=274233601, R=16561, counter=12, r=32999, u=33123, v=23] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274233601, R=16561, counter=12, r=32976, u=33123, v=25] [L34] EXPR counter++ VAL [A=274233601, R=16561, counter=13, r=32976, u=33123, v=25] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=274233601, R=16561, counter=13, r=32976, u=33123, v=25] [L36] COND FALSE !(!(r != 0)) VAL [A=274233601, R=16561, counter=13, r=32976, u=33123, v=25] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274233601, R=16561, counter=13, r=32951, u=33123, v=27] [L34] EXPR counter++ VAL [A=274233601, R=16561, counter=14, r=32951, u=33123, v=27] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=274233601, R=16561, counter=14, r=32951, u=33123, v=27] [L36] COND FALSE !(!(r != 0)) VAL [A=274233601, R=16561, counter=14, r=32951, u=33123, v=27] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274233601, R=16561, counter=14, r=32924, u=33123, v=29] [L34] EXPR counter++ VAL [A=274233601, R=16561, counter=15, r=32924, u=33123, v=29] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=274233601, R=16561, counter=15, r=32924, u=33123, v=29] [L36] COND FALSE !(!(r != 0)) VAL [A=274233601, R=16561, counter=15, r=32924, u=33123, v=29] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274233601, R=16561, counter=15, r=32895, u=33123, v=31] [L34] EXPR counter++ VAL [A=274233601, R=16561, counter=16, r=32895, u=33123, v=31] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=274233601, R=16561, counter=16, r=32895, u=33123, v=31] [L36] COND FALSE !(!(r != 0)) VAL [A=274233601, R=16561, counter=16, r=32895, u=33123, v=31] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274233601, R=16561, counter=16, r=32864, u=33123, v=33] [L34] EXPR counter++ VAL [A=274233601, R=16561, counter=17, r=32864, u=33123, v=33] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=274233601, R=16561, counter=17, r=32864, u=33123, v=33] [L36] COND FALSE !(!(r != 0)) VAL [A=274233601, R=16561, counter=17, r=32864, u=33123, v=33] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274233601, R=16561, counter=17, r=32831, u=33123, v=35] [L34] EXPR counter++ VAL [A=274233601, R=16561, counter=18, r=32831, u=33123, v=35] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=274233601, R=16561, counter=18, r=32831, u=33123, v=35] [L36] COND FALSE !(!(r != 0)) VAL [A=274233601, R=16561, counter=18, r=32831, u=33123, v=35] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274233601, R=16561, counter=18, r=32796, u=33123, v=37] [L34] EXPR counter++ VAL [A=274233601, R=16561, counter=19, r=32796, u=33123, v=37] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=274233601, R=16561, counter=19, r=32796, u=33123, v=37] [L36] COND FALSE !(!(r != 0)) VAL [A=274233601, R=16561, counter=19, r=32796, u=33123, v=37] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274233601, R=16561, counter=19, r=32759, u=33123, v=39] [L34] EXPR counter++ VAL [A=274233601, R=16561, counter=20, r=32759, u=33123, v=39] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=274233601, R=16561, counter=20, r=32759, u=33123, v=39] [L36] COND FALSE !(!(r != 0)) VAL [A=274233601, R=16561, counter=20, r=32759, u=33123, v=39] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=274233601, R=16561, counter=20, r=32720, u=33123, v=41] [L34] EXPR counter++ VAL [A=274233601, R=16561, counter=21, r=32720, u=33123, v=41] [L34] COND FALSE !(counter++<20) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=21] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=21] [L14] reach_error() VAL [\old(cond)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 22 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 247 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 652 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 519 mSDsCounter, 24 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 309 IncrementalHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 24 mSolverCounterUnsat, 133 mSDtfsCounter, 309 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 504 GetRequests, 409 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 326 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=195occurred in iteration=7, InterpolantAutomatonStates: 96, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 464 NumberOfCodeBlocks, 464 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 468 ConstructedInterpolants, 0 QuantifiedInterpolants, 1248 SizeOfPredicates, 21 NumberOfNonLiveVariables, 762 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 310/1086 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2023-12-19 20:09:42,049 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...