/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/bresenham-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-15 22:09:35,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-15 22:09:35,656 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-15 22:09:35,659 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-15 22:09:35,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-15 22:09:35,672 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-15 22:09:35,673 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-15 22:09:35,673 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-15 22:09:35,673 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-15 22:09:35,673 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-15 22:09:35,674 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-15 22:09:35,674 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-15 22:09:35,674 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-15 22:09:35,674 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-15 22:09:35,675 INFO L153 SettingsManager]: * Use SBE=true [2023-12-15 22:09:35,675 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-15 22:09:35,675 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-15 22:09:35,675 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-15 22:09:35,675 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-15 22:09:35,676 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-15 22:09:35,676 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-15 22:09:35,676 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-15 22:09:35,676 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-15 22:09:35,677 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-15 22:09:35,677 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-15 22:09:35,677 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-15 22:09:35,677 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-15 22:09:35,677 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-15 22:09:35,678 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-15 22:09:35,678 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-15 22:09:35,678 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-15 22:09:35,678 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-15 22:09:35,678 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:09:35,678 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-15 22:09:35,679 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-15 22:09:35,679 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-15 22:09:35,679 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-15 22:09:35,679 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-15 22:09:35,679 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-15 22:09:35,679 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-15 22:09:35,679 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-15 22:09:35,680 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-15 22:09:35,680 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-15 22:09:35,680 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-15 22:09:35,856 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-15 22:09:35,872 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-15 22:09:35,874 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-15 22:09:35,875 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-15 22:09:35,876 INFO L274 PluginConnector]: CDTParser initialized [2023-12-15 22:09:35,876 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound20.c [2023-12-15 22:09:36,869 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-15 22:09:37,026 INFO L384 CDTParser]: Found 1 translation units. [2023-12-15 22:09:37,027 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound20.c [2023-12-15 22:09:37,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d7a9109/cdb345f33c6845c08f6350db9242e1a8/FLAG0e55358ad [2023-12-15 22:09:37,054 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/75d7a9109/cdb345f33c6845c08f6350db9242e1a8 [2023-12-15 22:09:37,056 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-15 22:09:37,057 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-15 22:09:37,058 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-15 22:09:37,058 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-15 22:09:37,061 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-15 22:09:37,062 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:09:37" (1/1) ... [2023-12-15 22:09:37,062 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@204ca83c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:09:37, skipping insertion in model container [2023-12-15 22:09:37,062 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 10:09:37" (1/1) ... [2023-12-15 22:09:37,080 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-15 22:09:37,193 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound20.c[597,610] [2023-12-15 22:09:37,206 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:09:37,213 INFO L202 MainTranslator]: Completed pre-run [2023-12-15 22:09:37,221 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/bresenham-ll_unwindbound20.c[597,610] [2023-12-15 22:09:37,225 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-15 22:09:37,234 INFO L206 MainTranslator]: Completed translation [2023-12-15 22:09:37,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:09:37 WrapperNode [2023-12-15 22:09:37,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-15 22:09:37,237 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-15 22:09:37,237 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-15 22:09:37,237 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-15 22:09:37,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:09:37" (1/1) ... [2023-12-15 22:09:37,247 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:09:37" (1/1) ... [2023-12-15 22:09:37,258 INFO L138 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 55 [2023-12-15 22:09:37,258 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-15 22:09:37,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-15 22:09:37,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-15 22:09:37,259 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-15 22:09:37,269 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:09:37" (1/1) ... [2023-12-15 22:09:37,269 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:09:37" (1/1) ... [2023-12-15 22:09:37,270 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:09:37" (1/1) ... [2023-12-15 22:09:37,276 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-15 22:09:37,277 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:09:37" (1/1) ... [2023-12-15 22:09:37,277 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:09:37" (1/1) ... [2023-12-15 22:09:37,279 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:09:37" (1/1) ... [2023-12-15 22:09:37,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:09:37" (1/1) ... [2023-12-15 22:09:37,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:09:37" (1/1) ... [2023-12-15 22:09:37,281 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:09:37" (1/1) ... [2023-12-15 22:09:37,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-15 22:09:37,283 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-15 22:09:37,283 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-15 22:09:37,283 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-15 22:09:37,283 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:09:37" (1/1) ... [2023-12-15 22:09:37,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-15 22:09:37,297 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:09:37,321 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-15 22:09:37,343 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-15 22:09:37,349 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-15 22:09:37,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-15 22:09:37,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-15 22:09:37,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-15 22:09:37,349 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-15 22:09:37,349 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-15 22:09:37,391 INFO L241 CfgBuilder]: Building ICFG [2023-12-15 22:09:37,392 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-15 22:09:37,489 INFO L282 CfgBuilder]: Performing block encoding [2023-12-15 22:09:37,505 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-15 22:09:37,505 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-15 22:09:37,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:09:37 BoogieIcfgContainer [2023-12-15 22:09:37,506 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-15 22:09:37,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-15 22:09:37,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-15 22:09:37,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-15 22:09:37,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.12 10:09:37" (1/3) ... [2023-12-15 22:09:37,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e3ad67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:09:37, skipping insertion in model container [2023-12-15 22:09:37,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 10:09:37" (2/3) ... [2023-12-15 22:09:37,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37e3ad67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.12 10:09:37, skipping insertion in model container [2023-12-15 22:09:37,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 10:09:37" (3/3) ... [2023-12-15 22:09:37,511 INFO L112 eAbstractionObserver]: Analyzing ICFG bresenham-ll_unwindbound20.c [2023-12-15 22:09:37,528 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-15 22:09:37,528 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-15 22:09:37,558 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-15 22:09:37,563 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;@3c05eb1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-15 22:09:37,563 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-15 22:09:37,577 INFO L276 IsEmpty]: Start isEmpty. Operand has 17 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 22:09:37,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-15 22:09:37,581 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:09:37,581 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:09:37,582 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:09:37,585 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:09:37,585 INFO L85 PathProgramCache]: Analyzing trace with hash -26250642, now seen corresponding path program 1 times [2023-12-15 22:09:37,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:09:37,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970935232] [2023-12-15 22:09:37,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:09:37,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:09:37,673 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 22:09:37,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1955694579] [2023-12-15 22:09:37,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:09:37,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:09:37,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:09:37,684 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-15 22:09:37,692 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-15 22:09:37,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:09:37,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-15 22:09:37,741 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:09:37,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 22:09:37,834 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-15 22:09:37,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:09:37,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970935232] [2023-12-15 22:09:37,835 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 22:09:37,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1955694579] [2023-12-15 22:09:37,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1955694579] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-15 22:09:37,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-15 22:09:37,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-15 22:09:37,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124826822] [2023-12-15 22:09:37,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-15 22:09:37,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-15 22:09:37,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:09:37,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-15 22:09:37,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-12-15 22:09:37,857 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 22:09:37,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:09:37,935 INFO L93 Difference]: Finished difference Result 46 states and 66 transitions. [2023-12-15 22:09:37,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-15 22:09:37,936 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-15 22:09:37,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:09:37,941 INFO L225 Difference]: With dead ends: 46 [2023-12-15 22:09:37,941 INFO L226 Difference]: Without dead ends: 24 [2023-12-15 22:09:37,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-15 22:09:37,947 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 12 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:09:37,948 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 41 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:09:37,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-15 22:09:37,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2023-12-15 22:09:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 22:09:37,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2023-12-15 22:09:37,992 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 7 [2023-12-15 22:09:37,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:09:37,992 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2023-12-15 22:09:37,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.2) internal successors, (6), 4 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-15 22:09:37,993 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2023-12-15 22:09:37,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-15 22:09:37,993 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:09:37,993 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:09:38,001 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-15 22:09:38,198 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-15 22:09:38,200 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:09:38,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:09:38,200 INFO L85 PathProgramCache]: Analyzing trace with hash -479331439, now seen corresponding path program 1 times [2023-12-15 22:09:38,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:09:38,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653852066] [2023-12-15 22:09:38,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:09:38,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:09:38,209 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 22:09:38,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1295129246] [2023-12-15 22:09:38,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:09:38,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:09:38,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:09:38,211 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-15 22:09:38,220 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-15 22:09:38,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:09:38,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 20 conjunts are in the unsatisfiable core [2023-12-15 22:09:38,252 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:09:38,440 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 22:09:38,441 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:09:38,547 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-15 22:09:38,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:09:38,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653852066] [2023-12-15 22:09:38,548 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 22:09:38,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1295129246] [2023-12-15 22:09:38,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1295129246] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:09:38,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 22:09:38,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2023-12-15 22:09:38,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099165651] [2023-12-15 22:09:38,549 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 22:09:38,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-12-15 22:09:38,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:09:38,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-12-15 22:09:38,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2023-12-15 22:09:38,552 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 22:09:38,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:09:38,750 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2023-12-15 22:09:38,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-15 22:09:38,760 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2023-12-15 22:09:38,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:09:38,761 INFO L225 Difference]: With dead ends: 40 [2023-12-15 22:09:38,761 INFO L226 Difference]: Without dead ends: 33 [2023-12-15 22:09:38,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=220, Unknown=0, NotChecked=0, Total=272 [2023-12-15 22:09:38,763 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 24 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:09:38,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 83 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:09:38,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-15 22:09:38,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2023-12-15 22:09:38,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 22:09:38,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2023-12-15 22:09:38,769 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 17 [2023-12-15 22:09:38,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:09:38,770 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2023-12-15 22:09:38,770 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 22:09:38,770 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2023-12-15 22:09:38,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2023-12-15 22:09:38,771 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:09:38,771 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:09:38,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-15 22:09:38,982 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-15 22:09:38,982 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:09:38,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:09:38,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1366888132, now seen corresponding path program 1 times [2023-12-15 22:09:38,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:09:38,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996749671] [2023-12-15 22:09:38,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:09:38,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:09:38,993 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 22:09:38,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1260995434] [2023-12-15 22:09:38,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:09:38,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:09:38,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:09:38,996 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-15 22:09:39,071 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-15 22:09:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:09:39,074 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-15 22:09:39,076 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:09:39,118 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 22:09:39,118 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:09:39,151 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 22:09:39,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:09:39,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996749671] [2023-12-15 22:09:39,151 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 22:09:39,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1260995434] [2023-12-15 22:09:39,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1260995434] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:09:39,152 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 22:09:39,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-15 22:09:39,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838138309] [2023-12-15 22:09:39,152 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 22:09:39,152 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-15 22:09:39,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:09:39,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-15 22:09:39,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-12-15 22:09:39,154 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 22:09:39,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:09:39,207 INFO L93 Difference]: Finished difference Result 72 states and 80 transitions. [2023-12-15 22:09:39,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 22:09:39,207 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2023-12-15 22:09:39,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:09:39,209 INFO L225 Difference]: With dead ends: 72 [2023-12-15 22:09:39,209 INFO L226 Difference]: Without dead ends: 66 [2023-12-15 22:09:39,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2023-12-15 22:09:39,212 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 34 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:09:39,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 93 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:09:39,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-15 22:09:39,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2023-12-15 22:09:39,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 43 states have (on average 1.186046511627907) internal successors, (51), 43 states have internal predecessors, (51), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-15 22:09:39,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2023-12-15 22:09:39,235 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 18 [2023-12-15 22:09:39,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:09:39,236 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2023-12-15 22:09:39,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-15 22:09:39,236 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2023-12-15 22:09:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-12-15 22:09:39,237 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:09:39,237 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:09:39,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-15 22:09:39,441 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-15 22:09:39,442 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:09:39,443 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:09:39,443 INFO L85 PathProgramCache]: Analyzing trace with hash -382706270, now seen corresponding path program 1 times [2023-12-15 22:09:39,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:09:39,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957364319] [2023-12-15 22:09:39,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:09:39,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:09:39,449 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 22:09:39,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1485613035] [2023-12-15 22:09:39,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:09:39,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:09:39,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:09:39,452 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-15 22:09:39,453 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-15 22:09:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:09:39,496 INFO L262 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 34 conjunts are in the unsatisfiable core [2023-12-15 22:09:39,498 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:09:39,660 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-15 22:09:39,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:09:39,898 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-12-15 22:09:39,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:09:39,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957364319] [2023-12-15 22:09:39,898 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 22:09:39,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485613035] [2023-12-15 22:09:39,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485613035] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:09:39,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 22:09:39,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 23 [2023-12-15 22:09:39,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202010075] [2023-12-15 22:09:39,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 22:09:39,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-15 22:09:39,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:09:39,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-15 22:09:39,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2023-12-15 22:09:39,912 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 23 states, 19 states have (on average 1.736842105263158) internal successors, (33), 20 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-15 22:09:40,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:09:40,368 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2023-12-15 22:09:40,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2023-12-15 22:09:40,369 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 1.736842105263158) internal successors, (33), 20 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 24 [2023-12-15 22:09:40,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:09:40,369 INFO L225 Difference]: With dead ends: 64 [2023-12-15 22:09:40,369 INFO L226 Difference]: Without dead ends: 56 [2023-12-15 22:09:40,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=261, Invalid=1299, Unknown=0, NotChecked=0, Total=1560 [2023-12-15 22:09:40,371 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 51 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:09:40,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 107 Invalid, 256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:09:40,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2023-12-15 22:09:40,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 49. [2023-12-15 22:09:40,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-15 22:09:40,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 53 transitions. [2023-12-15 22:09:40,383 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 53 transitions. Word has length 24 [2023-12-15 22:09:40,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:09:40,383 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 53 transitions. [2023-12-15 22:09:40,383 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 1.736842105263158) internal successors, (33), 20 states have internal predecessors, (33), 6 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-12-15 22:09:40,383 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 53 transitions. [2023-12-15 22:09:40,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2023-12-15 22:09:40,384 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:09:40,385 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2023-12-15 22:09:40,392 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-15 22:09:40,589 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-15 22:09:40,589 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:09:40,589 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:09:40,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2080125809, now seen corresponding path program 1 times [2023-12-15 22:09:40,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:09:40,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465703013] [2023-12-15 22:09:40,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:09:40,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:09:40,597 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 22:09:40,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [120010532] [2023-12-15 22:09:40,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:09:40,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:09:40,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:09:40,604 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-15 22:09:40,607 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-15 22:09:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-15 22:09:40,662 INFO L262 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-15 22:09:40,663 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:09:40,720 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 22:09:40,721 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:09:40,794 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 8 proven. 44 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-15 22:09:40,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:09:40,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465703013] [2023-12-15 22:09:40,794 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 22:09:40,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120010532] [2023-12-15 22:09:40,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120010532] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:09:40,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 22:09:40,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-15 22:09:40,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116845516] [2023-12-15 22:09:40,795 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 22:09:40,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-15 22:09:40,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:09:40,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-15 22:09:40,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2023-12-15 22:09:40,796 INFO L87 Difference]: Start difference. First operand 49 states and 53 transitions. Second operand has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-15 22:09:40,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:09:40,904 INFO L93 Difference]: Finished difference Result 115 states and 130 transitions. [2023-12-15 22:09:40,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-12-15 22:09:40,904 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Word has length 48 [2023-12-15 22:09:40,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:09:40,905 INFO L225 Difference]: With dead ends: 115 [2023-12-15 22:09:40,905 INFO L226 Difference]: Without dead ends: 109 [2023-12-15 22:09:40,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2023-12-15 22:09:40,913 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 44 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-15 22:09:40,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 124 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-15 22:09:40,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-12-15 22:09:40,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-12-15 22:09:40,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 87 states have (on average 1.1264367816091954) internal successors, (98), 87 states have internal predecessors, (98), 11 states have call successors, (11), 11 states have call predecessors, (11), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-15 22:09:40,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 119 transitions. [2023-12-15 22:09:40,939 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 119 transitions. Word has length 48 [2023-12-15 22:09:40,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:09:40,940 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 119 transitions. [2023-12-15 22:09:40,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.642857142857143) internal successors, (65), 14 states have internal predecessors, (65), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-15 22:09:40,942 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 119 transitions. [2023-12-15 22:09:40,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2023-12-15 22:09:40,948 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:09:40,948 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2023-12-15 22:09:40,954 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-15 22:09:41,154 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-15 22:09:41,155 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:09:41,155 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:09:41,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1893266719, now seen corresponding path program 2 times [2023-12-15 22:09:41,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:09:41,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687477228] [2023-12-15 22:09:41,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:09:41,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:09:41,164 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 22:09:41,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1326345432] [2023-12-15 22:09:41,164 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-15 22:09:41,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:09:41,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:09:41,168 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-15 22:09:41,182 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-15 22:09:41,231 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-15 22:09:41,231 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 22:09:41,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 23 conjunts are in the unsatisfiable core [2023-12-15 22:09:41,235 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:09:41,433 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-15 22:09:41,433 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:09:41,692 INFO L134 CoverageAnalysis]: Checked inductivity of 490 backedges. 20 proven. 290 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2023-12-15 22:09:41,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:09:41,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687477228] [2023-12-15 22:09:41,693 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 22:09:41,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326345432] [2023-12-15 22:09:41,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326345432] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:09:41,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 22:09:41,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2023-12-15 22:09:41,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519311801] [2023-12-15 22:09:41,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 22:09:41,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-15 22:09:41,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:09:41,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-15 22:09:41,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2023-12-15 22:09:41,696 INFO L87 Difference]: Start difference. First operand 109 states and 119 transitions. Second operand has 24 states, 24 states have (on average 5.75) internal successors, (138), 24 states have internal predecessors, (138), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2023-12-15 22:09:41,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:09:41,998 INFO L93 Difference]: Finished difference Result 215 states and 244 transitions. [2023-12-15 22:09:41,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-12-15 22:09:41,998 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.75) internal successors, (138), 24 states have internal predecessors, (138), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) Word has length 108 [2023-12-15 22:09:41,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:09:41,999 INFO L225 Difference]: With dead ends: 215 [2023-12-15 22:09:41,999 INFO L226 Difference]: Without dead ends: 209 [2023-12-15 22:09:42,000 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-15 22:09:42,001 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 118 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:09:42,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 184 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:09:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2023-12-15 22:09:42,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2023-12-15 22:09:42,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 209 states, 167 states have (on average 1.125748502994012) internal successors, (188), 167 states have internal predecessors, (188), 21 states have call successors, (21), 21 states have call predecessors, (21), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2023-12-15 22:09:42,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 229 transitions. [2023-12-15 22:09:42,022 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 229 transitions. Word has length 108 [2023-12-15 22:09:42,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:09:42,022 INFO L495 AbstractCegarLoop]: Abstraction has 209 states and 229 transitions. [2023-12-15 22:09:42,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.75) internal successors, (138), 24 states have internal predecessors, (138), 20 states have call successors, (21), 12 states have call predecessors, (21), 11 states have return successors, (20), 19 states have call predecessors, (20), 19 states have call successors, (20) [2023-12-15 22:09:42,022 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 229 transitions. [2023-12-15 22:09:42,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2023-12-15 22:09:42,024 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:09:42,024 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1] [2023-12-15 22:09:42,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-12-15 22:09:42,228 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-15 22:09:42,231 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:09:42,231 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:09:42,231 INFO L85 PathProgramCache]: Analyzing trace with hash -211551935, now seen corresponding path program 3 times [2023-12-15 22:09:42,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:09:42,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589393795] [2023-12-15 22:09:42,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:09:42,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:09:42,242 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 22:09:42,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [711740903] [2023-12-15 22:09:42,242 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-15 22:09:42,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:09:42,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:09:42,246 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-15 22:09:42,260 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-15 22:09:42,299 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-12-15 22:09:42,299 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-15 22:09:42,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-15 22:09:42,312 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-15 22:09:42,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 212 proven. 1 refuted. 0 times theorem prover too weak. 1767 trivial. 0 not checked. [2023-12-15 22:09:42,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-15 22:09:42,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 96 proven. 117 refuted. 0 times theorem prover too weak. 1767 trivial. 0 not checked. [2023-12-15 22:09:42,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-15 22:09:42,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589393795] [2023-12-15 22:09:42,786 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-15 22:09:42,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711740903] [2023-12-15 22:09:42,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711740903] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-15 22:09:42,786 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-15 22:09:42,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 18 [2023-12-15 22:09:42,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592236070] [2023-12-15 22:09:42,786 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-15 22:09:42,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-15 22:09:42,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-15 22:09:42,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-15 22:09:42,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2023-12-15 22:09:42,787 INFO L87 Difference]: Start difference. First operand 209 states and 229 transitions. Second operand has 18 states, 14 states have (on average 2.357142857142857) internal successors, (33), 17 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 22:09:42,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-15 22:09:42,947 INFO L93 Difference]: Finished difference Result 408 states and 447 transitions. [2023-12-15 22:09:42,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-15 22:09:42,947 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 14 states have (on average 2.357142857142857) internal successors, (33), 17 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 208 [2023-12-15 22:09:42,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-15 22:09:42,949 INFO L225 Difference]: With dead ends: 408 [2023-12-15 22:09:42,949 INFO L226 Difference]: Without dead ends: 402 [2023-12-15 22:09:42,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 418 GetRequests, 397 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=383, Unknown=0, NotChecked=0, Total=462 [2023-12-15 22:09:42,950 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 23 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-15 22:09:42,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 61 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-15 22:09:42,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2023-12-15 22:09:42,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 399. [2023-12-15 22:09:42,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 319 states have (on average 1.1253918495297806) internal successors, (359), 319 states have internal predecessors, (359), 40 states have call successors, (40), 40 states have call predecessors, (40), 39 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2023-12-15 22:09:42,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 438 transitions. [2023-12-15 22:09:42,989 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 438 transitions. Word has length 208 [2023-12-15 22:09:42,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-15 22:09:42,989 INFO L495 AbstractCegarLoop]: Abstraction has 399 states and 438 transitions. [2023-12-15 22:09:42,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 14 states have (on average 2.357142857142857) internal successors, (33), 17 states have internal predecessors, (33), 5 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-15 22:09:42,989 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 438 transitions. [2023-12-15 22:09:42,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2023-12-15 22:09:42,991 INFO L187 NwaCegarLoop]: Found error trace [2023-12-15 22:09:42,991 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 1, 1, 1, 1, 1, 1, 1] [2023-12-15 22:09:43,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-12-15 22:09:43,195 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-15 22:09:43,196 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-15 22:09:43,196 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-15 22:09:43,196 INFO L85 PathProgramCache]: Analyzing trace with hash 468506435, now seen corresponding path program 1 times [2023-12-15 22:09:43,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-15 22:09:43,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087070913] [2023-12-15 22:09:43,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:09:43,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-15 22:09:43,207 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-15 22:09:43,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1352835321] [2023-12-15 22:09:43,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-15 22:09:43,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-15 22:09:43,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-15 22:09:43,208 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-15 22:09:43,240 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-15 22:09:43,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 22:09:43,317 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-12-15 22:09:43,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-12-15 22:09:43,425 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-12-15 22:09:43,426 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-12-15 22:09:43,426 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-15 22:09:43,448 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-12-15 22:09:43,646 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-15 22:09:43,649 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1] [2023-12-15 22:09:43,651 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-15 22:09:43,708 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.12 10:09:43 BoogieIcfgContainer [2023-12-15 22:09:43,708 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-15 22:09:43,708 INFO L158 Benchmark]: Toolchain (without parser) took 6651.16ms. Allocated memory was 225.4MB in the beginning and 288.4MB in the end (delta: 62.9MB). Free memory was 184.4MB in the beginning and 162.8MB in the end (delta: 21.6MB). Peak memory consumption was 84.7MB. Max. memory is 8.0GB. [2023-12-15 22:09:43,709 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 225.4MB. Free memory was 176.7MB in the beginning and 176.5MB in the end (delta: 161.8kB). There was no memory consumed. Max. memory is 8.0GB. [2023-12-15 22:09:43,709 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.71ms. Allocated memory is still 225.4MB. Free memory was 184.4MB in the beginning and 173.2MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-15 22:09:43,709 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.68ms. Allocated memory is still 225.4MB. Free memory was 173.2MB in the beginning and 171.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-15 22:09:43,709 INFO L158 Benchmark]: Boogie Preprocessor took 23.90ms. Allocated memory is still 225.4MB. Free memory was 171.8MB in the beginning and 170.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-15 22:09:43,709 INFO L158 Benchmark]: RCFGBuilder took 223.19ms. Allocated memory is still 225.4MB. Free memory was 169.7MB in the beginning and 158.5MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-15 22:09:43,709 INFO L158 Benchmark]: TraceAbstraction took 6200.88ms. Allocated memory was 225.4MB in the beginning and 288.4MB in the end (delta: 62.9MB). Free memory was 157.9MB in the beginning and 162.8MB in the end (delta: -4.9MB). Peak memory consumption was 58.5MB. Max. memory is 8.0GB. [2023-12-15 22:09:43,710 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.10ms. Allocated memory is still 225.4MB. Free memory was 176.7MB in the beginning and 176.5MB in the end (delta: 161.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 178.71ms. Allocated memory is still 225.4MB. Free memory was 184.4MB in the beginning and 173.2MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 20.68ms. Allocated memory is still 225.4MB. Free memory was 173.2MB in the beginning and 171.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.90ms. Allocated memory is still 225.4MB. Free memory was 171.8MB in the beginning and 170.1MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 223.19ms. Allocated memory is still 225.4MB. Free memory was 169.7MB in the beginning and 158.5MB in the end (delta: 11.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6200.88ms. Allocated memory was 225.4MB in the beginning and 288.4MB in the end (delta: 62.9MB). Free memory was 157.9MB in the beginning and 162.8MB in the end (delta: -4.9MB). Peak memory consumption was 58.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 16]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L21] int counter = 0; [L23] int X, Y; [L24] long long x, y, v, xy, yx; [L25] X = __VERIFIER_nondet_int() [L26] Y = __VERIFIER_nondet_int() [L27] v = ((long long) 2 * Y) - X [L28] y = 0 [L29] x = 0 VAL [X=2147483647, Y=56512727, counter=0, v=-2034458193, x=0, y=0] [L31] EXPR counter++ VAL [X=2147483647, Y=56512727, counter=1, v=-2034458193, x=0, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483647, Y=56512727, counter=1, v=-2034458193, x=0, x=0, x=0, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=1] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483647, Y=56512727, counter=1, v=-2034458193, x=0, x=0, x=0, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483647, Y=56512727, counter=1, v=-2034458193, x=0, x=0, x=0, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483647, Y=56512727, counter=1, v=-1921432739, x=0, x=0, x=0, y=0] [L45] x++ VAL [X=2147483647, Y=56512727, counter=1, v=-1921432739, x=0, x=0, x=1, y=0] [L31] EXPR counter++ VAL [X=2147483647, Y=56512727, counter=2, v=-1921432739, x=0, x=0, x=1, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483647, Y=56512727, counter=2, v=-1921432739, x=0, x=1, x=56512727, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=2] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483647, Y=56512727, counter=2, v=-1921432739, x=0, x=1, x=56512727, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483647, Y=56512727, counter=2, v=-1921432739, x=0, x=1, x=56512727, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483647, Y=56512727, counter=2, v=-1808407285, x=0, x=1, x=56512727, y=0] [L45] x++ VAL [X=2147483647, Y=56512727, counter=2, v=-1808407285, x=0, x=2, x=56512727, y=0] [L31] EXPR counter++ VAL [X=2147483647, Y=56512727, counter=3, v=-1808407285, x=0, x=2, x=56512727, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483647, Y=56512727, counter=3, v=-1808407285, x=0, x=113025454, x=2, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=3] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483647, Y=56512727, counter=3, v=-1808407285, x=0, x=113025454, x=2, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483647, Y=56512727, counter=3, v=-1808407285, x=0, x=113025454, x=2, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483647, Y=56512727, counter=3, v=-1695381831, x=0, x=113025454, x=2, y=0] [L45] x++ VAL [X=2147483647, Y=56512727, counter=3, v=-1695381831, x=0, x=113025454, x=3, y=0] [L31] EXPR counter++ VAL [X=2147483647, Y=56512727, counter=4, v=-1695381831, x=0, x=113025454, x=3, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483647, Y=56512727, counter=4, v=-1695381831, x=0, x=169538181, x=3, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=4] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483647, Y=56512727, counter=4, v=-1695381831, x=0, x=169538181, x=3, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483647, Y=56512727, counter=4, v=-1695381831, x=0, x=169538181, x=3, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483647, Y=56512727, counter=4, v=-1582356377, x=0, x=169538181, x=3, y=0] [L45] x++ VAL [X=2147483647, Y=56512727, counter=4, v=-1582356377, x=0, x=169538181, x=4, y=0] [L31] EXPR counter++ VAL [X=2147483647, Y=56512727, counter=5, v=-1582356377, x=0, x=169538181, x=4, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483647, Y=56512727, counter=5, v=-1582356377, x=0, x=226050908, x=4, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=5] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483647, Y=56512727, counter=5, v=-1582356377, x=0, x=226050908, x=4, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483647, Y=56512727, counter=5, v=-1582356377, x=0, x=226050908, x=4, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483647, Y=56512727, counter=5, v=-1469330923, x=0, x=226050908, x=4, y=0] [L45] x++ VAL [X=2147483647, Y=56512727, counter=5, v=-1469330923, x=0, x=226050908, x=5, y=0] [L31] EXPR counter++ VAL [X=2147483647, Y=56512727, counter=6, v=-1469330923, x=0, x=226050908, x=5, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483647, Y=56512727, counter=6, v=-1469330923, x=0, x=282563635, x=5, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=6] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483647, Y=56512727, counter=6, v=-1469330923, x=0, x=282563635, x=5, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483647, Y=56512727, counter=6, v=-1469330923, x=0, x=282563635, x=5, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483647, Y=56512727, counter=6, v=-1356305469, x=0, x=282563635, x=5, y=0] [L45] x++ VAL [X=2147483647, Y=56512727, counter=6, v=-1356305469, x=0, x=282563635, x=6, y=0] [L31] EXPR counter++ VAL [X=2147483647, Y=56512727, counter=7, v=-1356305469, x=0, x=282563635, x=6, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483647, Y=56512727, counter=7, v=-1356305469, x=0, x=339076362, x=6, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=7] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483647, Y=56512727, counter=7, v=-1356305469, x=0, x=339076362, x=6, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483647, Y=56512727, counter=7, v=-1356305469, x=0, x=339076362, x=6, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483647, Y=56512727, counter=7, v=-1243280015, x=0, x=339076362, x=6, y=0] [L45] x++ VAL [X=2147483647, Y=56512727, counter=7, v=-1243280015, x=0, x=339076362, x=7, y=0] [L31] EXPR counter++ VAL [X=2147483647, Y=56512727, counter=8, v=-1243280015, x=0, x=339076362, x=7, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483647, Y=56512727, counter=8, v=-1243280015, x=0, x=395589089, x=7, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=8] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483647, Y=56512727, counter=8, v=-1243280015, x=0, x=395589089, x=7, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483647, Y=56512727, counter=8, v=-1243280015, x=0, x=395589089, x=7, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483647, Y=56512727, counter=8, v=-1130254561, x=0, x=395589089, x=7, y=0] [L45] x++ VAL [X=2147483647, Y=56512727, counter=8, v=-1130254561, x=0, x=395589089, x=8, y=0] [L31] EXPR counter++ VAL [X=2147483647, Y=56512727, counter=9, v=-1130254561, x=0, x=395589089, x=8, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483647, Y=56512727, counter=9, v=-1130254561, x=0, x=452101816, x=8, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=9] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483647, Y=56512727, counter=9, v=-1130254561, x=0, x=452101816, x=8, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483647, Y=56512727, counter=9, v=-1130254561, x=0, x=452101816, x=8, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483647, Y=56512727, counter=9, v=-1017229107, x=0, x=452101816, x=8, y=0] [L45] x++ VAL [X=2147483647, Y=56512727, counter=9, v=-1017229107, x=0, x=452101816, x=9, y=0] [L31] EXPR counter++ VAL [X=2147483647, Y=56512727, counter=10, v=-1017229107, x=0, x=452101816, x=9, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483647, Y=56512727, counter=10, v=-1017229107, x=0, x=508614543, x=9, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=10] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483647, Y=56512727, counter=10, v=-1017229107, x=0, x=508614543, x=9, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483647, Y=56512727, counter=10, v=-1017229107, x=0, x=508614543, x=9, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483647, Y=56512727, counter=10, v=-904203653, x=0, x=508614543, x=9, y=0] [L45] x++ VAL [X=2147483647, Y=56512727, counter=10, v=-904203653, x=0, x=10, x=508614543, y=0] [L31] EXPR counter++ VAL [X=2147483647, Y=56512727, counter=11, v=-904203653, x=0, x=10, x=508614543, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483647, Y=56512727, counter=11, v=-904203653, x=0, x=10, x=565127270, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=11] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483647, Y=56512727, counter=11, v=-904203653, x=0, x=10, x=565127270, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483647, Y=56512727, counter=11, v=-904203653, x=0, x=10, x=565127270, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483647, Y=56512727, counter=11, v=-791178199, x=0, x=10, x=565127270, y=0] [L45] x++ VAL [X=2147483647, Y=56512727, counter=11, v=-791178199, x=0, x=11, x=565127270, y=0] [L31] EXPR counter++ VAL [X=2147483647, Y=56512727, counter=12, v=-791178199, x=0, x=11, x=565127270, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483647, Y=56512727, counter=12, v=-791178199, x=0, x=11, x=621639997, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=12] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483647, Y=56512727, counter=12, v=-791178199, x=0, x=11, x=621639997, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483647, Y=56512727, counter=12, v=-791178199, x=0, x=11, x=621639997, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483647, Y=56512727, counter=12, v=-678152745, x=0, x=11, x=621639997, y=0] [L45] x++ VAL [X=2147483647, Y=56512727, counter=12, v=-678152745, x=0, x=12, x=621639997, y=0] [L31] EXPR counter++ VAL [X=2147483647, Y=56512727, counter=13, v=-678152745, x=0, x=12, x=621639997, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483647, Y=56512727, counter=13, v=-678152745, x=0, x=12, x=678152724, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=13] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483647, Y=56512727, counter=13, v=-678152745, x=0, x=12, x=678152724, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483647, Y=56512727, counter=13, v=-678152745, x=0, x=12, x=678152724, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483647, Y=56512727, counter=13, v=-565127291, x=0, x=12, x=678152724, y=0] [L45] x++ VAL [X=2147483647, Y=56512727, counter=13, v=-565127291, x=0, x=13, x=678152724, y=0] [L31] EXPR counter++ VAL [X=2147483647, Y=56512727, counter=14, v=-565127291, x=0, x=13, x=678152724, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483647, Y=56512727, counter=14, v=-565127291, x=0, x=13, x=734665451, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=14] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483647, Y=56512727, counter=14, v=-565127291, x=0, x=13, x=734665451, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483647, Y=56512727, counter=14, v=-565127291, x=0, x=13, x=734665451, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483647, Y=56512727, counter=14, v=-452101837, x=0, x=13, x=734665451, y=0] [L45] x++ VAL [X=2147483647, Y=56512727, counter=14, v=-452101837, x=0, x=14, x=734665451, y=0] [L31] EXPR counter++ VAL [X=2147483647, Y=56512727, counter=15, v=-452101837, x=0, x=14, x=734665451, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483647, Y=56512727, counter=15, v=-452101837, x=0, x=14, x=791178178, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=15] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483647, Y=56512727, counter=15, v=-452101837, x=0, x=14, x=791178178, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483647, Y=56512727, counter=15, v=-452101837, x=0, x=14, x=791178178, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483647, Y=56512727, counter=15, v=-339076383, x=0, x=14, x=791178178, y=0] [L45] x++ VAL [X=2147483647, Y=56512727, counter=15, v=-339076383, x=0, x=15, x=791178178, y=0] [L31] EXPR counter++ VAL [X=2147483647, Y=56512727, counter=16, v=-339076383, x=0, x=15, x=791178178, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483647, Y=56512727, counter=16, v=-339076383, x=0, x=15, x=847690905, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=16] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483647, Y=56512727, counter=16, v=-339076383, x=0, x=15, x=847690905, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483647, Y=56512727, counter=16, v=-339076383, x=0, x=15, x=847690905, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483647, Y=56512727, counter=16, v=-226050929, x=0, x=15, x=847690905, y=0] [L45] x++ VAL [X=2147483647, Y=56512727, counter=16, v=-226050929, x=0, x=16, x=847690905, y=0] [L31] EXPR counter++ VAL [X=2147483647, Y=56512727, counter=17, v=-226050929, x=0, x=16, x=847690905, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483647, Y=56512727, counter=17, v=-226050929, x=0, x=16, x=904203632, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=17] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483647, Y=56512727, counter=17, v=-226050929, x=0, x=16, x=904203632, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483647, Y=56512727, counter=17, v=-226050929, x=0, x=16, x=904203632, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483647, Y=56512727, counter=17, v=-113025475, x=0, x=16, x=904203632, y=0] [L45] x++ VAL [X=2147483647, Y=56512727, counter=17, v=-113025475, x=0, x=17, x=904203632, y=0] [L31] EXPR counter++ VAL [X=2147483647, Y=56512727, counter=18, v=-113025475, x=0, x=17, x=904203632, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483647, Y=56512727, counter=18, v=-113025475, x=0, x=17, x=960716359, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=18] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483647, Y=56512727, counter=18, v=-113025475, x=0, x=17, x=960716359, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483647, Y=56512727, counter=18, v=-113025475, x=0, x=17, x=960716359, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483647, Y=56512727, counter=18, v=-21, x=0, x=17, x=960716359, y=0] [L45] x++ VAL [X=2147483647, Y=56512727, counter=18, v=-21, x=0, x=18, x=960716359, y=0] [L31] EXPR counter++ VAL [X=2147483647, Y=56512727, counter=19, v=-21, x=0, x=18, x=960716359, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483647, Y=56512727, counter=19, v=-21, x=0, x=1017229086, x=18, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=19] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483647, Y=56512727, counter=19, v=-21, x=0, x=1017229086, x=18, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483647, Y=56512727, counter=19, v=-21, x=0, x=1017229086, x=18, y=0] [L39] COND TRUE v < 0 [L40] v = v + (long long) 2 * Y VAL [X=2147483647, Y=56512727, counter=19, v=113025433, x=0, x=1017229086, x=18, y=0] [L45] x++ VAL [X=2147483647, Y=56512727, counter=19, v=113025433, x=0, x=1017229086, x=19, y=0] [L31] EXPR counter++ VAL [X=2147483647, Y=56512727, counter=20, v=113025433, x=0, x=1017229086, x=19, y=0] [L31] COND TRUE counter++<20 [L32] yx = (long long) Y*x [L33] xy = (long long) X*y VAL [X=2147483647, Y=56512727, counter=20, v=113025433, x=0, x=1073741813, x=19, y=0] [L34] CALL __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [\old(cond)=1, counter=20] [L14] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L34] RET __VERIFIER_assert( 2*yx - 2*xy - X + (long long) 2*Y - v == 0) VAL [X=2147483647, Y=56512727, counter=20, v=113025433, x=0, x=1073741813, x=19, y=0] [L35] COND FALSE !(!(x <= X)) VAL [X=2147483647, Y=56512727, counter=20, v=113025433, x=0, x=1073741813, x=19, y=0] [L39] COND FALSE !(v < 0) [L42] v = v + 2 * ((long long) Y - X) [L43] y++ VAL [X=2147483647, Y=56512727, counter=20, v=-4068916407, x=0, x=1073741813, x=19, y=1] [L45] x++ VAL [X=2147483647, Y=56512727, counter=20, v=-4068916407, x=0, x=1073741813, x=20, y=1] [L31] EXPR counter++ VAL [X=2147483647, Y=56512727, counter=21, v=-4068916407, x=0, x=1073741813, x=20, y=1] [L31] COND FALSE !(counter++<20) [L47] xy = (long long) x*y [L48] yx = (long long) Y*x VAL [X=2147483647, Y=56512727, counter=21, v=-4068916407, x=1130254540, x=20, x=20, y=1] [L49] CALL __VERIFIER_assert(2*yx - 2*xy - X + (long long) 2*Y - v + 2*y == 0) VAL [\old(cond)=0, counter=21] [L14] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=21] [L16] reach_error() VAL [\old(cond)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 17 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.1s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 307 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 306 mSDsluCounter, 693 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 619 mSDsCounter, 67 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 717 IncrementalHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 67 mSolverCounterUnsat, 74 mSDtfsCounter, 717 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 898 GetRequests, 745 SyntacticMatches, 3 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 721 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=399occurred in iteration=7, InterpolantAutomatonStates: 130, 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, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 638 NumberOfCodeBlocks, 448 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 840 ConstructedInterpolants, 1 QuantifiedInterpolants, 2722 SizeOfPredicates, 39 NumberOfNonLiveVariables, 807 ConjunctsInSsa, 134 ConjunctsInUnsatCore, 13 InterpolantComputations, 1 PerfectInterpolantSequences, 4129/5134 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-15 22:09:43,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...