/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.use.bitabs.translation false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench/ps6-ll.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-21 05:40:02,663 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-21 05:40:02,729 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2023-12-21 05:40:02,732 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-21 05:40:02,733 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-21 05:40:02,754 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-21 05:40:02,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-21 05:40:02,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-21 05:40:02,755 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-21 05:40:02,757 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-21 05:40:02,758 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-21 05:40:02,758 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-21 05:40:02,758 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-21 05:40:02,759 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-21 05:40:02,759 INFO L153 SettingsManager]: * Use SBE=true [2023-12-21 05:40:02,759 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-21 05:40:02,759 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-21 05:40:02,760 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-21 05:40:02,760 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-12-21 05:40:02,761 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-21 05:40:02,761 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-21 05:40:02,761 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-21 05:40:02,761 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-21 05:40:02,761 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-21 05:40:02,762 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-21 05:40:02,762 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-21 05:40:02,762 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-21 05:40:02,762 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-21 05:40:02,762 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-21 05:40:02,763 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-21 05:40:02,763 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-21 05:40:02,763 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-21 05:40:02,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 05:40:02,764 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-21 05:40:02,764 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-21 05:40:02,764 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-21 05:40:02,764 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-12-21 05:40:02,764 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-12-21 05:40:02,764 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-21 05:40:02,764 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-21 05:40:02,764 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-21 05:40:02,765 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-21 05:40:02,765 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-21 05:40:02,765 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Use bitabs translation -> false [2023-12-21 05:40:02,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-21 05:40:02,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-21 05:40:02,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-21 05:40:02,952 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-21 05:40:02,953 INFO L274 PluginConnector]: CDTParser initialized [2023-12-21 05:40:02,953 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/ps6-ll.c [2023-12-21 05:40:04,101 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-21 05:40:04,247 INFO L384 CDTParser]: Found 1 translation units. [2023-12-21 05:40:04,247 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/ps6-ll.c [2023-12-21 05:40:04,252 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da22aefc4/3e74908e015c45a891f01d55ee60b52c/FLAGd93f4235c [2023-12-21 05:40:04,264 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/da22aefc4/3e74908e015c45a891f01d55ee60b52c [2023-12-21 05:40:04,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-21 05:40:04,266 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-21 05:40:04,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-21 05:40:04,268 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-21 05:40:04,271 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-21 05:40:04,272 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:40:04" (1/1) ... [2023-12-21 05:40:04,272 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c1cc58a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:04, skipping insertion in model container [2023-12-21 05:40:04,272 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.12 05:40:04" (1/1) ... [2023-12-21 05:40:04,288 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-21 05:40:04,398 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/ps6-ll.c[458,471] [2023-12-21 05:40:04,418 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 05:40:04,424 INFO L202 MainTranslator]: Completed pre-run [2023-12-21 05:40:04,432 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/ps6-ll.c[458,471] [2023-12-21 05:40:04,447 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-21 05:40:04,456 INFO L206 MainTranslator]: Completed translation [2023-12-21 05:40:04,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:04 WrapperNode [2023-12-21 05:40:04,456 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-21 05:40:04,458 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-21 05:40:04,458 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-21 05:40:04,458 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-21 05:40:04,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:04" (1/1) ... [2023-12-21 05:40:04,466 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:04" (1/1) ... [2023-12-21 05:40:04,479 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 38 [2023-12-21 05:40:04,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-21 05:40:04,481 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-21 05:40:04,481 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-21 05:40:04,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-21 05:40:04,487 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:04" (1/1) ... [2023-12-21 05:40:04,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:04" (1/1) ... [2023-12-21 05:40:04,494 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:04" (1/1) ... [2023-12-21 05:40:04,505 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-21 05:40:04,505 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:04" (1/1) ... [2023-12-21 05:40:04,505 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:04" (1/1) ... [2023-12-21 05:40:04,510 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:04" (1/1) ... [2023-12-21 05:40:04,513 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:04" (1/1) ... [2023-12-21 05:40:04,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:04" (1/1) ... [2023-12-21 05:40:04,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:04" (1/1) ... [2023-12-21 05:40:04,518 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-21 05:40:04,519 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-21 05:40:04,520 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-21 05:40:04,520 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-21 05:40:04,520 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:04" (1/1) ... [2023-12-21 05:40:04,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-21 05:40:04,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:40:04,539 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-21 05:40:04,555 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-21 05:40:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-21 05:40:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-12-21 05:40:04,559 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-21 05:40:04,559 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-21 05:40:04,560 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-21 05:40:04,560 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-21 05:40:04,601 INFO L241 CfgBuilder]: Building ICFG [2023-12-21 05:40:04,602 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-21 05:40:04,697 INFO L282 CfgBuilder]: Performing block encoding [2023-12-21 05:40:04,712 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-21 05:40:04,712 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-21 05:40:04,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:40:04 BoogieIcfgContainer [2023-12-21 05:40:04,712 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-21 05:40:04,714 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-21 05:40:04,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-21 05:40:04,716 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-21 05:40:04,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.12 05:40:04" (1/3) ... [2023-12-21 05:40:04,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1401641c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:40:04, skipping insertion in model container [2023-12-21 05:40:04,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.12 05:40:04" (2/3) ... [2023-12-21 05:40:04,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1401641c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.12 05:40:04, skipping insertion in model container [2023-12-21 05:40:04,717 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.12 05:40:04" (3/3) ... [2023-12-21 05:40:04,717 INFO L112 eAbstractionObserver]: Analyzing ICFG ps6-ll.c [2023-12-21 05:40:04,728 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-21 05:40:04,728 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-21 05:40:04,757 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-21 05:40:04,761 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;@7d5fb7ce, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-21 05:40:04,761 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-21 05:40:04,763 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 05:40:04,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-21 05:40:04,772 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:40:04,772 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:40:04,773 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:40:04,777 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:40:04,777 INFO L85 PathProgramCache]: Analyzing trace with hash -959206418, now seen corresponding path program 1 times [2023-12-21 05:40:04,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:40:04,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097474956] [2023-12-21 05:40:04,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:40:04,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:40:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:40:04,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:40:04,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097474956] [2023-12-21 05:40:04,880 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unsupported non-linear arithmetic [2023-12-21 05:40:04,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [939165606] [2023-12-21 05:40:04,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:40:04,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:40:04,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:40:04,883 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 05:40:04,902 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-12-21 05:40:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:40:04,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-21 05:40:04,939 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:40:04,951 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-21 05:40:04,951 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 05:40:04,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [939165606] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 05:40:04,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 05:40:04,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-21 05:40:04,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892981660] [2023-12-21 05:40:04,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 05:40:04,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-21 05:40:04,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:40:04,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-21 05:40:04,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 05:40:04,974 INFO L87 Difference]: Start difference. First operand has 16 states, 10 states have (on average 1.6) internal successors, (16), 11 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-21 05:40:04,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:40:04,988 INFO L93 Difference]: Finished difference Result 30 states and 44 transitions. [2023-12-21 05:40:04,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-21 05:40:04,990 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 8 [2023-12-21 05:40:04,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:40:04,994 INFO L225 Difference]: With dead ends: 30 [2023-12-21 05:40:04,994 INFO L226 Difference]: Without dead ends: 14 [2023-12-21 05:40:04,996 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-21 05:40:05,000 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 05:40:05,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 05:40:05,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2023-12-21 05:40:05,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2023-12-21 05:40:05,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-12-21 05:40:05,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions. [2023-12-21 05:40:05,042 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 8 [2023-12-21 05:40:05,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:40:05,043 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions. [2023-12-21 05:40:05,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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-21 05:40:05,043 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions. [2023-12-21 05:40:05,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-21 05:40:05,044 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:40:05,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:40:05,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-12-21 05:40:05,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2023-12-21 05:40:05,249 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:40:05,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:40:05,251 INFO L85 PathProgramCache]: Analyzing trace with hash 817588404, now seen corresponding path program 1 times [2023-12-21 05:40:05,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:40:05,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561250153] [2023-12-21 05:40:05,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:40:05,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:40:05,267 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 05:40:05,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2009872569] [2023-12-21 05:40:05,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:40:05,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:40:05,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:40:05,274 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 05:40:05,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-12-21 05:40:05,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:40:05,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-21 05:40:05,316 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:40:05,381 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-21 05:40:05,381 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-21 05:40:05,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:40:05,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561250153] [2023-12-21 05:40:05,381 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 05:40:05,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2009872569] [2023-12-21 05:40:05,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2009872569] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-21 05:40:05,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-21 05:40:05,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-21 05:40:05,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855829813] [2023-12-21 05:40:05,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 05:40:05,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 05:40:05,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:40:05,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 05:40:05,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-21 05:40:05,383 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-21 05:40:05,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:40:05,765 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2023-12-21 05:40:05,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-21 05:40:05,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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 8 [2023-12-21 05:40:05,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:40:05,776 INFO L225 Difference]: With dead ends: 25 [2023-12-21 05:40:05,776 INFO L226 Difference]: Without dead ends: 21 [2023-12-21 05:40:05,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-12-21 05:40:05,777 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-21 05:40:05,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 38 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-21 05:40:05,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-12-21 05:40:05,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-12-21 05:40:05,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-12-21 05:40:05,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2023-12-21 05:40:05,782 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 8 [2023-12-21 05:40:05,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:40:05,782 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2023-12-21 05:40:05,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 4 states have internal predecessors, (7), 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-21 05:40:05,783 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2023-12-21 05:40:05,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-21 05:40:05,783 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:40:05,783 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:40:05,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-12-21 05:40:06,002 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2023-12-21 05:40:06,002 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:40:06,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:40:06,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1282095925, now seen corresponding path program 1 times [2023-12-21 05:40:06,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:40:06,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572877701] [2023-12-21 05:40:06,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:40:06,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:40:06,011 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 05:40:06,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1805238266] [2023-12-21 05:40:06,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:40:06,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:40:06,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:40:06,012 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 05:40:06,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-12-21 05:40:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:40:06,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 19 conjunts are in the unsatisfiable core [2023-12-21 05:40:06,065 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:40:06,139 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-21 05:40:06,139 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:40:06,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-12-21 05:40:06,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:40:06,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572877701] [2023-12-21 05:40:06,290 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 05:40:06,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805238266] [2023-12-21 05:40:06,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805238266] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-21 05:40:06,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-21 05:40:06,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2023-12-21 05:40:06,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315100990] [2023-12-21 05:40:06,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-21 05:40:06,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-21 05:40:06,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:40:06,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-21 05:40:06,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2023-12-21 05:40:06,295 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 05:40:06,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:40:06,335 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2023-12-21 05:40:06,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-21 05:40:06,336 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2023-12-21 05:40:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:40:06,336 INFO L225 Difference]: With dead ends: 27 [2023-12-21 05:40:06,337 INFO L226 Difference]: Without dead ends: 23 [2023-12-21 05:40:06,337 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2023-12-21 05:40:06,340 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 7 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-21 05:40:06,341 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 33 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-21 05:40:06,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2023-12-21 05:40:06,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2023-12-21 05:40:06,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 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-21 05:40:06,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2023-12-21 05:40:06,350 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 15 [2023-12-21 05:40:06,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:40:06,351 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2023-12-21 05:40:06,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-21 05:40:06,351 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2023-12-21 05:40:06,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-12-21 05:40:06,352 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:40:06,352 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:40:06,371 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-12-21 05:40:06,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:40:06,559 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:40:06,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:40:06,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1293644165, now seen corresponding path program 1 times [2023-12-21 05:40:06,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:40:06,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000789548] [2023-12-21 05:40:06,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:40:06,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:40:06,573 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 05:40:06,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [995268016] [2023-12-21 05:40:06,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:40:06,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:40:06,574 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:40:06,575 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 05:40:06,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-12-21 05:40:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-21 05:40:06,608 INFO L262 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-21 05:40:06,610 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:40:06,709 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 05:40:06,709 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:40:06,934 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-12-21 05:40:06,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:40:06,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000789548] [2023-12-21 05:40:06,934 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 05:40:06,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [995268016] [2023-12-21 05:40:06,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [995268016] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:40:06,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 05:40:06,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 16 [2023-12-21 05:40:06,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485074913] [2023-12-21 05:40:06,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 05:40:06,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-21 05:40:06,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:40:06,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-21 05:40:06,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2023-12-21 05:40:06,936 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 16 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 05:40:08,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2023-12-21 05:40:08,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:40:08,167 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2023-12-21 05:40:08,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-21 05:40:08,167 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 26 [2023-12-21 05:40:08,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:40:08,168 INFO L225 Difference]: With dead ends: 46 [2023-12-21 05:40:08,168 INFO L226 Difference]: Without dead ends: 36 [2023-12-21 05:40:08,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2023-12-21 05:40:08,169 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-12-21 05:40:08,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 90 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-12-21 05:40:08,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-12-21 05:40:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-12-21 05:40:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 7 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 05:40:08,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2023-12-21 05:40:08,178 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 26 [2023-12-21 05:40:08,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:40:08,178 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2023-12-21 05:40:08,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.0833333333333335) internal successors, (25), 13 states have internal predecessors, (25), 8 states have call successors, (8), 3 states have call predecessors, (8), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-21 05:40:08,178 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2023-12-21 05:40:08,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2023-12-21 05:40:08,179 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:40:08,179 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:40:08,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-12-21 05:40:08,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:40:08,384 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:40:08,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:40:08,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1936035506, now seen corresponding path program 2 times [2023-12-21 05:40:08,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:40:08,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233215745] [2023-12-21 05:40:08,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:40:08,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:40:08,406 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 05:40:08,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [399699316] [2023-12-21 05:40:08,407 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-21 05:40:08,407 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:40:08,407 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:40:08,415 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 05:40:08,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-12-21 05:40:08,492 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-21 05:40:08,492 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 05:40:08,494 INFO L262 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-21 05:40:08,496 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:40:08,655 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-21 05:40:08,656 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:40:08,837 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 30 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-21 05:40:08,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:40:08,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233215745] [2023-12-21 05:40:08,842 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 05:40:08,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399699316] [2023-12-21 05:40:08,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399699316] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:40:08,843 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 05:40:08,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 20 [2023-12-21 05:40:08,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793726772] [2023-12-21 05:40:08,843 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 05:40:08,844 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-21 05:40:08,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:40:08,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-21 05:40:08,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=313, Unknown=0, NotChecked=0, Total=380 [2023-12-21 05:40:08,846 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 20 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 05:40:09,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:40:09,275 INFO L93 Difference]: Finished difference Result 59 states and 73 transitions. [2023-12-21 05:40:09,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-12-21 05:40:09,275 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Word has length 47 [2023-12-21 05:40:09,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:40:09,276 INFO L225 Difference]: With dead ends: 59 [2023-12-21 05:40:09,276 INFO L226 Difference]: Without dead ends: 51 [2023-12-21 05:40:09,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=845, Unknown=0, NotChecked=0, Total=1056 [2023-12-21 05:40:09,277 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 31 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 157 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-21 05:40:09,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 212 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 157 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-21 05:40:09,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-12-21 05:40:09,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-12-21 05:40:09,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 35 states have (on average 1.0285714285714285) internal successors, (36), 35 states have internal predecessors, (36), 12 states have call successors, (12), 4 states have call predecessors, (12), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2023-12-21 05:40:09,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2023-12-21 05:40:09,292 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 47 [2023-12-21 05:40:09,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:40:09,292 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2023-12-21 05:40:09,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 1.8888888888888888) internal successors, (34), 18 states have internal predecessors, (34), 12 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-21 05:40:09,292 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2023-12-21 05:40:09,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2023-12-21 05:40:09,294 INFO L187 NwaCegarLoop]: Found error trace [2023-12-21 05:40:09,294 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-21 05:40:09,310 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-21 05:40:09,499 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:40:09,499 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-21 05:40:09,499 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-21 05:40:09,499 INFO L85 PathProgramCache]: Analyzing trace with hash -118276357, now seen corresponding path program 3 times [2023-12-21 05:40:09,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-12-21 05:40:09,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568480189] [2023-12-21 05:40:09,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-21 05:40:09,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-12-21 05:40:09,508 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-12-21 05:40:09,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1470433366] [2023-12-21 05:40:09,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-21 05:40:09,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:40:09,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-21 05:40:09,509 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-12-21 05:40:09,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-12-21 05:40:11,301 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 10 check-sat command(s) [2023-12-21 05:40:11,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-21 05:40:11,303 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 52 conjunts are in the unsatisfiable core [2023-12-21 05:40:11,306 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-21 05:40:11,501 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 36 proven. 151 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2023-12-21 05:40:11,502 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-21 05:40:19,730 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (+ (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~c~0#1| 4)) (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| 4))) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))))) is different from false [2023-12-21 05:40:31,363 WARN L293 SmtUtils]: Spent 11.57s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 05:40:43,376 WARN L293 SmtUtils]: Spent 8.01s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 05:40:51,387 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (forall ((|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42|))) (or (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_29|) (* |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_29| 4)) (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| 4))) (= (mod (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| 6) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| 10) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| 7)) 12) 0))))) is different from true [2023-12-21 05:41:04,366 WARN L293 SmtUtils]: Spent 8.94s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 05:41:20,388 WARN L293 SmtUtils]: Spent 8.00s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-21 05:41:28,410 WARN L876 $PredicateComparison]: unable to prove that (or (not (= |c___VERIFIER_assert_#in~cond| 0)) (= c___VERIFIER_assert_~cond 0) (forall ((|v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_29| Int) (|v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| Int)) (let ((.cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42|))) (or (= (+ (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_29|) (* |v_ULTIMATE.start_main_~c~0#1_BEFORE_CALL_29| 4)) (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| 4))) (= (mod (+ .cse0 (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| 6) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| 10) (* |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| |v_ULTIMATE.start_main_~y~0#1_BEFORE_CALL_42| 7)) 12) 0))))) is different from true [2023-12-21 05:41:40,532 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (+ (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~c~0#1| 5)) (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| 5))) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))))) is different from false [2023-12-21 05:41:56,709 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (+ (* |c_ULTIMATE.start_main_~c~0#1| 6) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|)) (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| 6))) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))))) is different from false [2023-12-21 05:42:12,742 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| 7)) (+ (* |c_ULTIMATE.start_main_~c~0#1| 7) (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))))) is different from false [2023-12-21 05:42:28,808 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| 8)) (+ (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~c~0#1| 8))) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))))) is different from false [2023-12-21 05:42:45,472 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1|))) (or (= (+ .cse0 (* |c_ULTIMATE.start_main_~y~0#1| 9)) (+ (* |c_ULTIMATE.start_main_~c~0#1| |c_ULTIMATE.start_main_~y~0#1|) (* |c_ULTIMATE.start_main_~c~0#1| 9))) (not (= 0 (mod (+ (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 10) (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 7) .cse0 (* |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| |c_ULTIMATE.start_main_~y~0#1| 6)) 12))))) is different from false [2023-12-21 05:42:53,494 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 36 proven. 22 refuted. 15 times theorem prover too weak. 190 trivial. 114 not checked. [2023-12-21 05:42:53,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-12-21 05:42:53,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568480189] [2023-12-21 05:42:53,494 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-12-21 05:42:53,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1470433366] [2023-12-21 05:42:53,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1470433366] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-21 05:42:53,495 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-21 05:42:53,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 32 [2023-12-21 05:42:53,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137642965] [2023-12-21 05:42:53,495 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-21 05:42:53,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-12-21 05:42:53,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-12-21 05:42:53,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-12-21 05:42:53,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=471, Unknown=8, NotChecked=408, Total=992 [2023-12-21 05:42:53,496 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 32 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 30 states have internal predecessors, (58), 22 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-21 05:42:54,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-21 05:42:54,099 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2023-12-21 05:42:54,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-21 05:42:54,100 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 30 states have internal predecessors, (58), 22 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Word has length 82 [2023-12-21 05:42:54,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-21 05:42:54,103 INFO L225 Difference]: With dead ends: 56 [2023-12-21 05:42:54,103 INFO L226 Difference]: Without dead ends: 0 [2023-12-21 05:42:54,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 132 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 33.2s TimeCoverageRelationStatistics Valid=230, Invalid=1200, Unknown=8, NotChecked=632, Total=2070 [2023-12-21 05:42:54,105 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 398 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 349 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-21 05:42:54,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 398 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 418 Invalid, 0 Unknown, 349 Unchecked, 0.2s Time] [2023-12-21 05:42:54,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-21 05:42:54,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-21 05:42:54,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-21 05:42:54,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-21 05:42:54,106 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 82 [2023-12-21 05:42:54,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-21 05:42:54,106 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-21 05:42:54,106 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.9333333333333333) internal successors, (58), 30 states have internal predecessors, (58), 22 states have call successors, (24), 3 states have call predecessors, (24), 3 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2023-12-21 05:42:54,107 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-21 05:42:54,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-21 05:42:54,108 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-21 05:42:54,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-12-21 05:42:54,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-12-21 05:42:54,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-21 05:42:54,974 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-21 05:42:54,974 INFO L895 garLoopResultBuilder]: At program point L27-2(lines 27 36) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= (+ |ULTIMATE.start_main_~y~0#1| .cse0) (+ |ULTIMATE.start_main_~c~0#1| .cse1)) (= (+ (* 2 |ULTIMATE.start_main_~c~0#1|) .cse1) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) .cse0)) (= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) .cse0)) (or (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse0) (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 256))) [2023-12-21 05:42:54,974 INFO L895 garLoopResultBuilder]: At program point L27-3(lines 27 36) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse0) (= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) .cse0)))) [2023-12-21 05:42:54,974 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-21 05:42:54,975 INFO L899 garLoopResultBuilder]: For program point L7(line 7) no Hoare annotation was computed. [2023-12-21 05:42:54,975 INFO L895 garLoopResultBuilder]: At program point L38(line 38) the Hoare annotation is: (let ((.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse0) (= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) .cse0)))) [2023-12-21 05:42:54,975 INFO L895 garLoopResultBuilder]: At program point L28(line 28) the Hoare annotation is: (let ((.cse1 (* |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~y~0#1|)) (.cse0 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (and (= (+ |ULTIMATE.start_main_~y~0#1| .cse0) (+ |ULTIMATE.start_main_~c~0#1| .cse1)) (= (+ (* 2 |ULTIMATE.start_main_~c~0#1|) .cse1) (+ (* 2 |ULTIMATE.start_main_~y~0#1|) .cse0)) (= (+ (* 6 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 2 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|)) (* 5 (* |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1| |ULTIMATE.start_main_~y~0#1|))) (+ (* |ULTIMATE.start_main_~x~0#1| 12) .cse0)) (or (= (* |ULTIMATE.start_main_~k~0#1| |ULTIMATE.start_main_~y~0#1|) .cse0) (< |ULTIMATE.start_main_~c~0#1| |ULTIMATE.start_main_~k~0#1|)) (<= |ULTIMATE.start_main_~k~0#1| 256))) [2023-12-21 05:42:54,975 INFO L899 garLoopResultBuilder]: For program point L28-1(lines 27 36) no Hoare annotation was computed. [2023-12-21 05:42:54,975 INFO L899 garLoopResultBuilder]: For program point L39(line 39) no Hoare annotation was computed. [2023-12-21 05:42:54,975 INFO L899 garLoopResultBuilder]: For program point L6(lines 6 8) no Hoare annotation was computed. [2023-12-21 05:42:54,975 INFO L899 garLoopResultBuilder]: For program point L11(lines 11 12) no Hoare annotation was computed. [2023-12-21 05:42:54,975 INFO L899 garLoopResultBuilder]: For program point L10(lines 10 13) no Hoare annotation was computed. [2023-12-21 05:42:54,975 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2023-12-21 05:42:54,975 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 9 15) the Hoare annotation is: true [2023-12-21 05:42:54,975 INFO L899 garLoopResultBuilder]: For program point L10-2(lines 9 15) no Hoare annotation was computed. [2023-12-21 05:42:54,975 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2023-12-21 05:42:54,977 INFO L445 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2023-12-21 05:42:54,978 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-21 05:42:54,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.12 05:42:54 BoogieIcfgContainer [2023-12-21 05:42:54,986 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-21 05:42:54,986 INFO L158 Benchmark]: Toolchain (without parser) took 170719.79ms. Allocated memory was 204.5MB in the beginning and 276.8MB in the end (delta: 72.4MB). Free memory was 160.7MB in the beginning and 216.4MB in the end (delta: -55.7MB). Peak memory consumption was 151.0MB. Max. memory is 8.0GB. [2023-12-21 05:42:54,986 INFO L158 Benchmark]: CDTParser took 0.40ms. Allocated memory is still 204.5MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-21 05:42:54,986 INFO L158 Benchmark]: CACSL2BoogieTranslator took 188.61ms. Allocated memory is still 204.5MB. Free memory was 160.4MB in the beginning and 149.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-21 05:42:54,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.52ms. Allocated memory is still 204.5MB. Free memory was 149.4MB in the beginning and 147.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-21 05:42:54,987 INFO L158 Benchmark]: Boogie Preprocessor took 37.89ms. Allocated memory is still 204.5MB. Free memory was 147.8MB in the beginning and 146.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-21 05:42:54,987 INFO L158 Benchmark]: RCFGBuilder took 192.84ms. Allocated memory is still 204.5MB. Free memory was 146.1MB in the beginning and 135.2MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-21 05:42:54,987 INFO L158 Benchmark]: TraceAbstraction took 170272.16ms. Allocated memory was 204.5MB in the beginning and 276.8MB in the end (delta: 72.4MB). Free memory was 134.6MB in the beginning and 216.4MB in the end (delta: -81.8MB). Peak memory consumption was 124.8MB. Max. memory is 8.0GB. [2023-12-21 05:42:54,988 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.40ms. Allocated memory is still 204.5MB. Free memory is still 151.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 188.61ms. Allocated memory is still 204.5MB. Free memory was 160.4MB in the beginning and 149.4MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 22.52ms. Allocated memory is still 204.5MB. Free memory was 149.4MB in the beginning and 147.8MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.89ms. Allocated memory is still 204.5MB. Free memory was 147.8MB in the beginning and 146.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 192.84ms. Allocated memory is still 204.5MB. Free memory was 146.1MB in the beginning and 135.2MB in the end (delta: 10.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 170272.16ms. Allocated memory was 204.5MB in the beginning and 276.8MB in the end (delta: 72.4MB). Free memory was 134.6MB in the beginning and 216.4MB in the end (delta: -81.8MB). Peak memory consumption was 124.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 12]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 170.2s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.7s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 79 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 75 mSDsluCounter, 787 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 349 IncrementalHoareTripleChecker+Unchecked, 691 mSDsCounter, 68 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 748 IncrementalHoareTripleChecker+Invalid, 1165 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 68 mSolverCounterUnsat, 96 mSDtfsCounter, 748 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 385 GetRequests, 273 SyntacticMatches, 3 SemanticMatches, 109 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 34.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51occurred in iteration=5, InterpolantAutomatonStates: 67, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 34 PreInvPairs, 72 NumberOfFragments, 231 HoareAnnotationTreeSize, 34 FormulaSimplifications, 1849 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 5 FormulaSimplificationsInter, 1210 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 163.2s InterpolantComputationTime, 194 NumberOfCodeBlocks, 194 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 346 ConstructedInterpolants, 3 QuantifiedInterpolants, 2780 SizeOfPredicates, 20 NumberOfNonLiveVariables, 576 ConjunctsInSsa, 138 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 636/1008 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: ((((((y + (y * y)) == (c + (c * y))) && (((2 * c) + (c * y)) == ((2 * y) + (y * y)))) && ((((6 * ((((y * y) * y) * y) * y)) + (2 * (((((y * y) * y) * y) * y) * y))) + (5 * (((y * y) * y) * y))) == ((x * 12) + (y * y)))) && (((k * y) == (y * y)) || (c < k))) && (k <= 256)) RESULT: Ultimate proved your program to be correct! [2023-12-21 05:42:55,012 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...