/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_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 05:10:44,412 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 05:10:44,476 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-25 05:10:44,479 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 05:10:44,479 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 05:10:44,494 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 05:10:44,495 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 05:10:44,495 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 05:10:44,495 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 05:10:44,498 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 05:10:44,498 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 05:10:44,499 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 05:10:44,499 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 05:10:44,500 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 05:10:44,500 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 05:10:44,501 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 05:10:44,501 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 05:10:44,501 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 05:10:44,501 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 05:10:44,501 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 05:10:44,501 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 05:10:44,502 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 05:10:44,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 05:10:44,502 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 05:10:44,502 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 05:10:44,502 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 05:10:44,503 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 05:10:44,503 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 05:10:44,503 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 05:10:44,503 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 05:10:44,504 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 05:10:44,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 05:10:44,504 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 05:10:44,504 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 05:10:44,504 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 05:10:44,504 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 05:10:44,504 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 05:10:44,505 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 05:10:44,505 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 05:10:44,505 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 05:10:44,505 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 05:10:44,505 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 05:10:44,505 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 05:10:44,505 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 05:10:44,506 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 05:10:44,506 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 05:10:44,506 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 [2023-12-25 05:10:44,710 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 05:10:44,730 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 05:10:44,732 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 05:10:44,732 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 05:10:44,733 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 05:10:44,734 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound5.c [2023-12-25 05:10:45,871 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 05:10:45,999 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 05:10:45,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound5.c [2023-12-25 05:10:46,005 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6995e2a95/4ee755c9f9d94352b7e84aa4d4b798eb/FLAGf415c38a5 [2023-12-25 05:10:46,018 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6995e2a95/4ee755c9f9d94352b7e84aa4d4b798eb [2023-12-25 05:10:46,020 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 05:10:46,021 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 05:10:46,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 05:10:46,023 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 05:10:46,027 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 05:10:46,027 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 05:10:46" (1/1) ... [2023-12-25 05:10:46,028 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54271b24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:10:46, skipping insertion in model container [2023-12-25 05:10:46,028 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 05:10:46" (1/1) ... [2023-12-25 05:10:46,045 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 05:10:46,148 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound5.c[520,533] [2023-12-25 05:10:46,160 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 05:10:46,168 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 05:10:46,193 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/sqrt1-ll_unwindbound5.c[520,533] [2023-12-25 05:10:46,198 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 05:10:46,210 INFO L206 MainTranslator]: Completed translation [2023-12-25 05:10:46,212 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:10:46 WrapperNode [2023-12-25 05:10:46,212 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 05:10:46,213 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 05:10:46,214 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 05:10:46,214 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 05:10:46,218 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:10:46" (1/1) ... [2023-12-25 05:10:46,233 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:10:46" (1/1) ... [2023-12-25 05:10:46,245 INFO L138 Inliner]: procedures = 14, calls = 13, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 41 [2023-12-25 05:10:46,246 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 05:10:46,246 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 05:10:46,246 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 05:10:46,246 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 05:10:46,253 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:10:46" (1/1) ... [2023-12-25 05:10:46,253 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:10:46" (1/1) ... [2023-12-25 05:10:46,256 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:10:46" (1/1) ... [2023-12-25 05:10:46,264 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-25 05:10:46,264 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:10:46" (1/1) ... [2023-12-25 05:10:46,264 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:10:46" (1/1) ... [2023-12-25 05:10:46,267 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:10:46" (1/1) ... [2023-12-25 05:10:46,270 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:10:46" (1/1) ... [2023-12-25 05:10:46,271 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:10:46" (1/1) ... [2023-12-25 05:10:46,271 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:10:46" (1/1) ... [2023-12-25 05:10:46,272 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 05:10:46,273 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 05:10:46,273 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 05:10:46,273 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 05:10:46,274 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:10:46" (1/1) ... [2023-12-25 05:10:46,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 05:10:46,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 05:10:46,307 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-25 05:10:46,317 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-25 05:10:46,332 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 05:10:46,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 05:10:46,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 05:10:46,333 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 05:10:46,333 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 05:10:46,334 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 05:10:46,387 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 05:10:46,391 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 05:10:46,546 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 05:10:46,565 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 05:10:46,565 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-25 05:10:46,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 05:10:46 BoogieIcfgContainer [2023-12-25 05:10:46,565 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 05:10:46,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 05:10:46,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 05:10:46,569 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 05:10:46,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 05:10:46" (1/3) ... [2023-12-25 05:10:46,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff0c6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 05:10:46, skipping insertion in model container [2023-12-25 05:10:46,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 05:10:46" (2/3) ... [2023-12-25 05:10:46,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ff0c6f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 05:10:46, skipping insertion in model container [2023-12-25 05:10:46,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 05:10:46" (3/3) ... [2023-12-25 05:10:46,571 INFO L112 eAbstractionObserver]: Analyzing ICFG sqrt1-ll_unwindbound5.c [2023-12-25 05:10:46,583 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 05:10:46,583 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 05:10:46,613 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 05:10:46,619 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;@6a042a13, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 05:10:46,620 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 05:10:46,623 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 05:10:46,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-25 05:10:46,627 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:10:46,628 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-25 05:10:46,628 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:10:46,634 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:10:46,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1811081999, now seen corresponding path program 1 times [2023-12-25 05:10:46,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:10:46,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [932904216] [2023-12-25 05:10:46,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:10:46,648 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:10:46,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:10:46,684 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:10:46,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-25 05:10:46,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:10:46,759 INFO L262 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 05:10:46,761 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:10:46,777 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-25 05:10:46,777 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:10:46,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:10:46,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [932904216] [2023-12-25 05:10:46,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [932904216] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:10:46,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:10:46,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 05:10:46,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963376960] [2023-12-25 05:10:46,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:10:46,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 05:10:46,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:10:46,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 05:10:46,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 05:10:46,812 INFO L87 Difference]: Start difference. First operand has 18 states, 9 states have (on average 1.5555555555555556) internal successors, (14), 10 states have internal predecessors, (14), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-25 05:10:46,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:10:46,839 INFO L93 Difference]: Finished difference Result 35 states and 57 transitions. [2023-12-25 05:10:46,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 05:10:46,841 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 6 [2023-12-25 05:10:46,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:10:46,846 INFO L225 Difference]: With dead ends: 35 [2023-12-25 05:10:46,846 INFO L226 Difference]: Without dead ends: 16 [2023-12-25 05:10:46,848 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 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-25 05:10:46,851 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 05:10:46,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 05:10:46,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-25 05:10:46,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-25 05:10:46,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 05:10:46,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 22 transitions. [2023-12-25 05:10:46,879 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 22 transitions. Word has length 6 [2023-12-25 05:10:46,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:10:46,879 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 22 transitions. [2023-12-25 05:10:46,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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-25 05:10:46,879 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 22 transitions. [2023-12-25 05:10:46,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-25 05:10:46,880 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:10:46,880 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:10:46,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-25 05:10:47,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:10:47,084 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:10:47,085 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:10:47,085 INFO L85 PathProgramCache]: Analyzing trace with hash -772994646, now seen corresponding path program 1 times [2023-12-25 05:10:47,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:10:47,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102037609] [2023-12-25 05:10:47,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:10:47,085 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:10:47,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:10:47,087 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:10:47,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-25 05:10:47,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:10:47,122 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 05:10:47,123 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:10:47,153 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-25 05:10:47,153 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:10:47,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:10:47,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102037609] [2023-12-25 05:10:47,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102037609] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:10:47,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:10:47,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 05:10:47,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232569824] [2023-12-25 05:10:47,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:10:47,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 05:10:47,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:10:47,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 05:10:47,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 05:10:47,156 INFO L87 Difference]: Start difference. First operand 16 states and 22 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 05:10:47,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:10:47,170 INFO L93 Difference]: Finished difference Result 27 states and 35 transitions. [2023-12-25 05:10:47,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 05:10:47,171 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-25 05:10:47,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:10:47,171 INFO L225 Difference]: With dead ends: 27 [2023-12-25 05:10:47,171 INFO L226 Difference]: Without dead ends: 18 [2023-12-25 05:10:47,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 05:10:47,172 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 05:10:47,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 05:10:47,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-12-25 05:10:47,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-12-25 05:10:47,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.3) internal successors, (13), 11 states have internal predecessors, (13), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-12-25 05:10:47,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 24 transitions. [2023-12-25 05:10:47,177 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 24 transitions. Word has length 7 [2023-12-25 05:10:47,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:10:47,177 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 24 transitions. [2023-12-25 05:10:47,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 05:10:47,177 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 24 transitions. [2023-12-25 05:10:47,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-25 05:10:47,178 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:10:47,178 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:10:47,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-25 05:10:47,382 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:10:47,383 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:10:47,384 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:10:47,384 INFO L85 PathProgramCache]: Analyzing trace with hash -771326350, now seen corresponding path program 1 times [2023-12-25 05:10:47,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:10:47,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2034808236] [2023-12-25 05:10:47,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:10:47,384 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:10:47,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:10:47,386 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:10:47,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-25 05:10:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:10:47,405 INFO L262 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 05:10:47,406 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:10:47,479 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-25 05:10:47,480 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:10:47,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:10:47,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2034808236] [2023-12-25 05:10:47,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2034808236] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:10:47,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:10:47,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 05:10:47,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926457793] [2023-12-25 05:10:47,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:10:47,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:10:47,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:10:47,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:10:47,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 05:10:47,482 INFO L87 Difference]: Start difference. First operand 18 states and 24 transitions. Second operand has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 05:10:47,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:10:47,676 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions. [2023-12-25 05:10:47,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 05:10:47,684 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-12-25 05:10:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:10:47,684 INFO L225 Difference]: With dead ends: 31 [2023-12-25 05:10:47,684 INFO L226 Difference]: Without dead ends: 29 [2023-12-25 05:10:47,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-25 05:10:47,686 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 6 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 05:10:47,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 60 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 05:10:47,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-12-25 05:10:47,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2023-12-25 05:10:47,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-25 05:10:47,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2023-12-25 05:10:47,699 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 7 [2023-12-25 05:10:47,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:10:47,699 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2023-12-25 05:10:47,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.2) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 05:10:47,700 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2023-12-25 05:10:47,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-12-25 05:10:47,701 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:10:47,701 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:10:47,703 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2023-12-25 05:10:47,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:10:47,903 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:10:47,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:10:47,908 INFO L85 PathProgramCache]: Analyzing trace with hash 1515882446, now seen corresponding path program 1 times [2023-12-25 05:10:47,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:10:47,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1959700340] [2023-12-25 05:10:47,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:10:47,909 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:10:47,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:10:47,910 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:10:47,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-25 05:10:47,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:10:47,964 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 05:10:47,966 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:10:48,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-25 05:10:48,036 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:10:48,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:10:48,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1959700340] [2023-12-25 05:10:48,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1959700340] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:10:48,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:10:48,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 05:10:48,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697572775] [2023-12-25 05:10:48,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:10:48,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:10:48,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:10:48,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:10:48,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 05:10:48,038 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-25 05:10:48,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:10:48,493 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2023-12-25 05:10:48,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 05:10:48,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 12 [2023-12-25 05:10:48,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:10:48,494 INFO L225 Difference]: With dead ends: 35 [2023-12-25 05:10:48,494 INFO L226 Difference]: Without dead ends: 33 [2023-12-25 05:10:48,495 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 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-25 05:10:48,495 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 05:10:48,496 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 62 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 05:10:48,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-12-25 05:10:48,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2023-12-25 05:10:48,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 19 states have internal predecessors, (21), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2023-12-25 05:10:48,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 42 transitions. [2023-12-25 05:10:48,502 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 42 transitions. Word has length 12 [2023-12-25 05:10:48,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:10:48,502 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 42 transitions. [2023-12-25 05:10:48,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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-25 05:10:48,502 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 42 transitions. [2023-12-25 05:10:48,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-12-25 05:10:48,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:10:48,503 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:10:48,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-25 05:10:48,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:10:48,706 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:10:48,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:10:48,707 INFO L85 PathProgramCache]: Analyzing trace with hash -549515342, now seen corresponding path program 1 times [2023-12-25 05:10:48,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:10:48,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966349558] [2023-12-25 05:10:48,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:10:48,708 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:10:48,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:10:48,709 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:10:48,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-25 05:10:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:10:48,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 05:10:48,807 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:10:48,887 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 05:10:48,887 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 05:10:48,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:10:48,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966349558] [2023-12-25 05:10:48,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966349558] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 05:10:48,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 05:10:48,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-25 05:10:48,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289075848] [2023-12-25 05:10:48,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:10:48,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:10:48,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:10:48,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:10:48,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 05:10:48,889 INFO L87 Difference]: Start difference. First operand 32 states and 42 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 05:10:49,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:10:49,256 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2023-12-25 05:10:49,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 05:10:49,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2023-12-25 05:10:49,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:10:49,257 INFO L225 Difference]: With dead ends: 39 [2023-12-25 05:10:49,257 INFO L226 Difference]: Without dead ends: 34 [2023-12-25 05:10:49,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 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-25 05:10:49,258 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-25 05:10:49,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 77 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-25 05:10:49,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-25 05:10:49,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2023-12-25 05:10:49,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2023-12-25 05:10:49,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2023-12-25 05:10:49,264 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 17 [2023-12-25 05:10:49,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:10:49,264 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2023-12-25 05:10:49,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 05:10:49,264 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2023-12-25 05:10:49,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-25 05:10:49,265 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:10:49,265 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:10:49,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-25 05:10:49,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:10:49,470 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:10:49,470 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:10:49,470 INFO L85 PathProgramCache]: Analyzing trace with hash 906206763, now seen corresponding path program 1 times [2023-12-25 05:10:49,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:10:49,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [863447937] [2023-12-25 05:10:49,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:10:49,471 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:10:49,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:10:49,472 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:10:49,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-25 05:10:49,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:10:49,559 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 05:10:49,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:10:49,617 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 05:10:49,617 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:10:49,692 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 05:10:49,692 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:10:49,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [863447937] [2023-12-25 05:10:49,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [863447937] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:10:49,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:10:49,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2023-12-25 05:10:49,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727526041] [2023-12-25 05:10:49,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:10:49,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-25 05:10:49,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:10:49,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-25 05:10:49,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-12-25 05:10:49,695 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 05:10:51,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:10:51,207 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2023-12-25 05:10:51,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-25 05:10:51,221 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) Word has length 25 [2023-12-25 05:10:51,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:10:51,222 INFO L225 Difference]: With dead ends: 75 [2023-12-25 05:10:51,222 INFO L226 Difference]: Without dead ends: 66 [2023-12-25 05:10:51,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2023-12-25 05:10:51,223 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 28 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-12-25 05:10:51,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 79 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-12-25 05:10:51,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2023-12-25 05:10:51,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2023-12-25 05:10:51,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 37 states have internal predecessors, (41), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-25 05:10:51,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2023-12-25 05:10:51,234 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 25 [2023-12-25 05:10:51,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:10:51,234 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2023-12-25 05:10:51,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 3 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (6), 2 states have call predecessors, (6), 2 states have call successors, (6) [2023-12-25 05:10:51,234 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2023-12-25 05:10:51,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-25 05:10:51,234 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:10:51,234 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:10:51,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-25 05:10:51,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:10:51,447 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:10:51,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:10:51,448 INFO L85 PathProgramCache]: Analyzing trace with hash 907875059, now seen corresponding path program 1 times [2023-12-25 05:10:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:10:51,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1474636495] [2023-12-25 05:10:51,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:10:51,449 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:10:51,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:10:51,451 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:10:51,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-25 05:10:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:10:51,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 05:10:51,560 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:10:51,638 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2023-12-25 05:10:51,639 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:10:51,735 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-12-25 05:10:51,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:10:51,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1474636495] [2023-12-25 05:10:51,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1474636495] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 05:10:51,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-25 05:10:51,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2023-12-25 05:10:51,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164121089] [2023-12-25 05:10:51,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:10:51,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:10:51,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:10:51,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:10:51,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-12-25 05:10:51,737 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 05:10:51,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:10:51,924 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2023-12-25 05:10:51,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 05:10:51,931 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 25 [2023-12-25 05:10:51,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:10:51,932 INFO L225 Difference]: With dead ends: 76 [2023-12-25 05:10:51,932 INFO L226 Difference]: Without dead ends: 74 [2023-12-25 05:10:51,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2023-12-25 05:10:51,933 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-25 05:10:51,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 50 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-25 05:10:51,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-12-25 05:10:51,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-12-25 05:10:51,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 43 states have (on average 1.1627906976744187) internal successors, (50), 46 states have internal predecessors, (50), 21 states have call successors, (21), 9 states have call predecessors, (21), 9 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2023-12-25 05:10:51,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 89 transitions. [2023-12-25 05:10:51,944 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 89 transitions. Word has length 25 [2023-12-25 05:10:51,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:10:51,944 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 89 transitions. [2023-12-25 05:10:51,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 05:10:51,944 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 89 transitions. [2023-12-25 05:10:51,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-12-25 05:10:51,945 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:10:51,945 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:10:51,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2023-12-25 05:10:52,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:10:52,150 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:10:52,150 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:10:52,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2103548909, now seen corresponding path program 2 times [2023-12-25 05:10:52,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:10:52,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866655879] [2023-12-25 05:10:52,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 05:10:52,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:10:52,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:10:52,154 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:10:52,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-12-25 05:10:52,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 05:10:52,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:10:52,291 INFO L262 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 05:10:52,292 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:10:52,391 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 05:10:52,391 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:10:56,518 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 05:10:56,519 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:10:56,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866655879] [2023-12-25 05:10:56,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1866655879] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:10:56,519 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:10:56,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-12-25 05:10:56,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209256862] [2023-12-25 05:10:56,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:10:56,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 05:10:56,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:10:56,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 05:10:56,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-12-25 05:10:56,521 INFO L87 Difference]: Start difference. First operand 74 states and 89 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 05:11:02,515 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:11:06,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:11:10,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:11:14,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:11:18,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:11:22,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:11:26,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:11:33,074 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:11:37,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:11:37,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:11:37,592 INFO L93 Difference]: Finished difference Result 91 states and 111 transitions. [2023-12-25 05:11:37,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 05:11:37,602 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 30 [2023-12-25 05:11:37,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:11:37,602 INFO L225 Difference]: With dead ends: 91 [2023-12-25 05:11:37,603 INFO L226 Difference]: Without dead ends: 86 [2023-12-25 05:11:37,603 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2023-12-25 05:11:37,603 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 27 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.9s IncrementalHoareTripleChecker+Time [2023-12-25 05:11:37,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 131 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 114 Invalid, 9 Unknown, 0 Unchecked, 39.9s Time] [2023-12-25 05:11:37,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-25 05:11:37,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2023-12-25 05:11:37,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.12) internal successors, (56), 53 states have internal predecessors, (56), 23 states have call successors, (23), 11 states have call predecessors, (23), 11 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2023-12-25 05:11:37,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 100 transitions. [2023-12-25 05:11:37,619 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 100 transitions. Word has length 30 [2023-12-25 05:11:37,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:11:37,619 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 100 transitions. [2023-12-25 05:11:37,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 4 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2023-12-25 05:11:37,620 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 100 transitions. [2023-12-25 05:11:37,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2023-12-25 05:11:37,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:11:37,621 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1] [2023-12-25 05:11:37,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-12-25 05:11:37,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:11:37,821 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:11:37,822 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:11:37,822 INFO L85 PathProgramCache]: Analyzing trace with hash -421695500, now seen corresponding path program 3 times [2023-12-25 05:11:37,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:11:37,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225912507] [2023-12-25 05:11:37,822 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 05:11:37,822 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:11:37,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:11:37,823 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:11:37,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-12-25 05:11:37,942 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-25 05:11:37,942 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:11:37,952 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-25 05:11:37,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:11:39,049 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 50 proven. 18 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2023-12-25 05:11:39,050 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:12:06,740 WARN L876 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~a~0#1| (_ BitVec 64))) (or (= (_ bv0 64) (bvadd (bvmul |c_ULTIMATE.start_main_~t~0#1| |c_ULTIMATE.start_main_~t~0#1|) (_ bv1 64) (bvneg (bvadd (bvmul |ULTIMATE.start_main_~a~0#1| (_ bv8 64)) (bvmul (_ bv4 64) (bvmul |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|)) (_ bv4 64))) (bvmul |c_ULTIMATE.start_main_~t~0#1| (_ bv2 64)))) (not (= |c_ULTIMATE.start_main_~t~0#1| (bvadd (bvmul |ULTIMATE.start_main_~a~0#1| (_ bv2 64)) (_ bv1 64)))))) is different from true [2023-12-25 05:12:06,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:12:06,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1225912507] [2023-12-25 05:12:06,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1225912507] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-25 05:12:06,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [243709857] [2023-12-25 05:12:06,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 05:12:06,741 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-25 05:12:06,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-25 05:12:06,785 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-25 05:12:06,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2023-12-25 05:12:06,888 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-12-25 05:12:06,888 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:12:06,890 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-25 05:12:06,892 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:12:07,708 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 16 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2023-12-25 05:12:07,708 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:12:14,943 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2023-12-25 05:12:14,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [243709857] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-25 05:12:14,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:12:14,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 7] total 16 [2023-12-25 05:12:14,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541252225] [2023-12-25 05:12:14,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 05:12:14,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 05:12:14,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:12:14,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 05:12:14,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=257, Unknown=1, NotChecked=32, Total=342 [2023-12-25 05:12:14,945 INFO L87 Difference]: Start difference. First operand 85 states and 100 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 05:12:16,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:12:16,928 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2023-12-25 05:12:16,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-25 05:12:16,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 53 [2023-12-25 05:12:16,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:12:16,938 INFO L225 Difference]: With dead ends: 95 [2023-12-25 05:12:16,938 INFO L226 Difference]: Without dead ends: 87 [2023-12-25 05:12:16,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 147 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=57, Invalid=288, Unknown=1, NotChecked=34, Total=380 [2023-12-25 05:12:16,939 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-25 05:12:16,939 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 56 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-25 05:12:16,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-12-25 05:12:16,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2023-12-25 05:12:16,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 57 states have internal predecessors, (59), 17 states have call successors, (17), 13 states have call predecessors, (17), 13 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-25 05:12:16,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2023-12-25 05:12:16,978 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 53 [2023-12-25 05:12:16,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:12:16,979 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2023-12-25 05:12:16,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-25 05:12:16,979 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2023-12-25 05:12:16,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-25 05:12:16,987 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:12:16,992 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:12:16,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Ended with exit code 0 [2023-12-25 05:12:17,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2023-12-25 05:12:17,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:12:17,396 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:12:17,397 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:12:17,397 INFO L85 PathProgramCache]: Analyzing trace with hash 240295122, now seen corresponding path program 1 times [2023-12-25 05:12:17,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:12:17,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322375401] [2023-12-25 05:12:17,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 05:12:17,397 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:12:17,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:12:17,398 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:12:17,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-12-25 05:12:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 05:12:17,724 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-25 05:12:17,726 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:12:17,889 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 72 proven. 260 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2023-12-25 05:12:17,889 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:12:18,089 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-25 05:12:18,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:12:18,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322375401] [2023-12-25 05:12:18,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322375401] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:12:18,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:12:18,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2023-12-25 05:12:18,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165176347] [2023-12-25 05:12:18,090 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:12:18,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-12-25 05:12:18,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:12:18,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-12-25 05:12:18,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2023-12-25 05:12:18,091 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2023-12-25 05:12:20,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:12:20,382 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2023-12-25 05:12:20,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-25 05:12:20,382 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) Word has length 84 [2023-12-25 05:12:20,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:12:20,383 INFO L225 Difference]: With dead ends: 109 [2023-12-25 05:12:20,383 INFO L226 Difference]: Without dead ends: 97 [2023-12-25 05:12:20,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2023-12-25 05:12:20,384 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 0 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-25 05:12:20,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 243 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-25 05:12:20,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-12-25 05:12:20,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-12-25 05:12:20,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 64 states have (on average 1.046875) internal successors, (67), 65 states have internal predecessors, (67), 17 states have call successors, (17), 15 states have call predecessors, (17), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-25 05:12:20,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 100 transitions. [2023-12-25 05:12:20,396 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 100 transitions. Word has length 84 [2023-12-25 05:12:20,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:12:20,397 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 100 transitions. [2023-12-25 05:12:20,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.5714285714285716) internal successors, (50), 14 states have internal predecessors, (50), 9 states have call successors, (27), 6 states have call predecessors, (27), 6 states have return successors, (26), 9 states have call predecessors, (26), 9 states have call successors, (26) [2023-12-25 05:12:20,397 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 100 transitions. [2023-12-25 05:12:20,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2023-12-25 05:12:20,397 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:12:20,397 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1] [2023-12-25 05:12:20,414 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-12-25 05:12:20,604 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:12:20,604 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:12:20,605 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:12:20,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2096340426, now seen corresponding path program 4 times [2023-12-25 05:12:20,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:12:20,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [329021965] [2023-12-25 05:12:20,605 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-25 05:12:20,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:12:20,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:12:20,606 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:12:20,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-12-25 05:12:20,911 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-25 05:12:20,912 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:12:20,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 05:12:20,949 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:12:21,286 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 26 proven. 52 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-25 05:12:21,286 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:12:34,818 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 26 proven. 52 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2023-12-25 05:12:34,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:12:34,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [329021965] [2023-12-25 05:12:34,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [329021965] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:12:34,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:12:34,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-12-25 05:12:34,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746322696] [2023-12-25 05:12:34,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:12:34,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 05:12:34,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:12:34,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 05:12:34,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-12-25 05:12:34,820 INFO L87 Difference]: Start difference. First operand 97 states and 100 transitions. Second operand has 16 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 10 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2023-12-25 05:12:58,991 WARN L293 SmtUtils]: Spent 20.42s on a formula simplification that was a NOOP. DAG size: 35 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:13:03,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:13:07,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:13:11,108 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:13:15,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:13:19,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:13:23,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:13:27,898 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:13:53,800 WARN L293 SmtUtils]: Spent 16.36s on a formula simplification that was a NOOP. DAG size: 28 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:13:57,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:14:01,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:14:05,964 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:14:10,040 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:14:14,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:14:18,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:14:22,101 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:14:26,171 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:14:30,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:14:34,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:14:38,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:14:42,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:14:46,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:14:50,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:14:54,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:14:58,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:15:24,957 WARN L293 SmtUtils]: Spent 8.49s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 05:15:28,994 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:15:33,000 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:15:37,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:15:41,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:15:45,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:15:49,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:15:53,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:15:57,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:16:01,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:16:05,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:16:09,267 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:16:13,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:16:17,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:16:21,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:16:25,457 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:16:29,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:16:33,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:16:37,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:16:41,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:16:45,635 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:16:49,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:16:53,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:16:57,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:17:01,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:17:05,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:17:34,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:17:38,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:17:42,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:17:46,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:17:50,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:17:54,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:17:58,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:18:02,986 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:18:06,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:18:11,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:18:15,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:18:19,093 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:18:23,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:18:27,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:18:31,145 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:18:35,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:18:39,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:18:43,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:18:47,204 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:18:51,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:18:55,331 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:18:59,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:19:03,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:19:07,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:19:11,499 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.09s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:19:15,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:19:19,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:19:23,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:19:27,566 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:19:31,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:19:35,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:19:39,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:19:43,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:19:47,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 05:19:50,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:19:50,195 INFO L93 Difference]: Finished difference Result 157 states and 192 transitions. [2023-12-25 05:19:50,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-25 05:19:50,202 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 10 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) Word has length 84 [2023-12-25 05:19:50,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:19:50,203 INFO L225 Difference]: With dead ends: 157 [2023-12-25 05:19:50,204 INFO L226 Difference]: Without dead ends: 143 [2023-12-25 05:19:50,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 108.0s TimeCoverageRelationStatistics Valid=114, Invalid=336, Unknown=12, NotChecked=0, Total=462 [2023-12-25 05:19:50,204 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 41 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 53 mSolverCounterUnsat, 82 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 334.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 82 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 335.7s IncrementalHoareTripleChecker+Time [2023-12-25 05:19:50,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 318 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 271 Invalid, 82 Unknown, 0 Unchecked, 335.7s Time] [2023-12-25 05:19:50,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-12-25 05:19:50,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2023-12-25 05:19:50,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 90 states have internal predecessors, (92), 35 states have call successors, (35), 18 states have call predecessors, (35), 18 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2023-12-25 05:19:50,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 161 transitions. [2023-12-25 05:19:50,229 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 161 transitions. Word has length 84 [2023-12-25 05:19:50,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:19:50,229 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 161 transitions. [2023-12-25 05:19:50,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.375) internal successors, (38), 14 states have internal predecessors, (38), 10 states have call successors, (28), 3 states have call predecessors, (28), 1 states have return successors, (26), 10 states have call predecessors, (26), 10 states have call successors, (26) [2023-12-25 05:19:50,229 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 161 transitions. [2023-12-25 05:19:50,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2023-12-25 05:19:50,231 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 05:19:50,231 INFO L195 NwaCegarLoop]: trace histogram [32, 31, 31, 11, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 05:19:50,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2023-12-25 05:19:50,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:19:50,434 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 05:19:50,434 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 05:19:50,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1629324980, now seen corresponding path program 2 times [2023-12-25 05:19:50,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 05:19:50,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880129263] [2023-12-25 05:19:50,441 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 05:19:50,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:19:50,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 05:19:50,442 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-25 05:19:50,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-12-25 05:19:51,111 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 05:19:51,111 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 05:19:51,203 INFO L262 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-25 05:19:51,207 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 05:19:51,599 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 1150 proven. 430 refuted. 0 times theorem prover too weak. 632 trivial. 0 not checked. [2023-12-25 05:19:51,599 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 05:19:52,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2212 backedges. 222 proven. 70 refuted. 0 times theorem prover too weak. 1920 trivial. 0 not checked. [2023-12-25 05:19:52,010 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 05:19:52,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880129263] [2023-12-25 05:19:52,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1880129263] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 05:19:52,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 05:19:52,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2023-12-25 05:19:52,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122772742] [2023-12-25 05:19:52,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 05:19:52,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-25 05:19:52,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 05:19:52,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-25 05:19:52,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2023-12-25 05:19:52,012 INFO L87 Difference]: Start difference. First operand 143 states and 161 transitions. Second operand has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 11 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) [2023-12-25 05:19:55,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 05:19:55,501 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2023-12-25 05:19:55,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-25 05:19:55,502 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 11 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) Word has length 192 [2023-12-25 05:19:55,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 05:19:55,502 INFO L225 Difference]: With dead ends: 147 [2023-12-25 05:19:55,502 INFO L226 Difference]: Without dead ends: 0 [2023-12-25 05:19:55,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 383 GetRequests, 368 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2023-12-25 05:19:55,503 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 0 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-25 05:19:55,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 315 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-25 05:19:55,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-25 05:19:55,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-25 05:19:55,504 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-25 05:19:55,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-25 05:19:55,504 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 192 [2023-12-25 05:19:55,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 05:19:55,504 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-25 05:19:55,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 3.9375) internal successors, (63), 16 states have internal predecessors, (63), 11 states have call successors, (39), 7 states have call predecessors, (39), 7 states have return successors, (38), 11 states have call predecessors, (38), 11 states have call successors, (38) [2023-12-25 05:19:55,504 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-25 05:19:55,504 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-25 05:19:55,506 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 05:19:55,557 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-12-25 05:19:55,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-25 05:19:55,709 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-25 05:20:33,445 WARN L293 SmtUtils]: Spent 37.64s on a formula simplification. DAG size of input: 69 DAG size of output: 20 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 05:21:14,005 WARN L293 SmtUtils]: Spent 38.07s on a formula simplification. DAG size of input: 69 DAG size of output: 20 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 05:21:45,680 WARN L293 SmtUtils]: Spent 31.67s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2023-12-25 05:21:45,683 INFO L899 garLoopResultBuilder]: For program point L33(lines 30 42) no Hoare annotation was computed. [2023-12-25 05:21:45,683 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-25 05:21:45,683 INFO L895 garLoopResultBuilder]: At program point L31(line 31) the Hoare annotation is: (or (and (= (_ bv2 32) ~counter~0) (= |ULTIMATE.start_main_~s~0#1| (_ bv4 64)) (= (_ bv3 64) |ULTIMATE.start_main_~t~0#1|) (= |ULTIMATE.start_main_~a~0#1| (_ bv1 64))) (and (= ~counter~0 (_ bv5 32)) (= |ULTIMATE.start_main_~s~0#1| (_ bv25 64)) (= |ULTIMATE.start_main_~t~0#1| (_ bv9 64)) (= |ULTIMATE.start_main_~a~0#1| (_ bv4 64))) (and (= |ULTIMATE.start_main_~t~0#1| (_ bv7 64)) (= |ULTIMATE.start_main_~s~0#1| (_ bv16 64)) (= (_ bv4 32) ~counter~0) (= (_ bv3 64) |ULTIMATE.start_main_~a~0#1|)) (and (= |ULTIMATE.start_main_~a~0#1| (_ bv0 64)) (= ~counter~0 (_ bv1 32)) (= |ULTIMATE.start_main_~s~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~t~0#1| (_ bv1 64))) (and (= |ULTIMATE.start_main_~t~0#1| (_ bv5 64)) (= (_ bv3 32) ~counter~0) (= |ULTIMATE.start_main_~s~0#1| (_ bv9 64)) (= |ULTIMATE.start_main_~a~0#1| (_ bv2 64)))) [2023-12-25 05:21:45,683 INFO L895 garLoopResultBuilder]: At program point L31-1(line 31) the Hoare annotation is: (or (and (= (_ bv2 32) ~counter~0) (= |ULTIMATE.start_main_~s~0#1| (_ bv4 64)) (= (_ bv3 64) |ULTIMATE.start_main_~t~0#1|) (= |ULTIMATE.start_main_~a~0#1| (_ bv1 64))) (and (= ~counter~0 (_ bv5 32)) (= |ULTIMATE.start_main_~s~0#1| (_ bv25 64)) (= |ULTIMATE.start_main_~t~0#1| (_ bv9 64)) (= |ULTIMATE.start_main_~a~0#1| (_ bv4 64))) (and (= |ULTIMATE.start_main_~t~0#1| (_ bv7 64)) (= |ULTIMATE.start_main_~s~0#1| (_ bv16 64)) (= (_ bv4 32) ~counter~0) (= (_ bv3 64) |ULTIMATE.start_main_~a~0#1|)) (and (= |ULTIMATE.start_main_~a~0#1| (_ bv0 64)) (= ~counter~0 (_ bv1 32)) (= |ULTIMATE.start_main_~s~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~t~0#1| (_ bv1 64))) (and (= |ULTIMATE.start_main_~t~0#1| (_ bv5 64)) (= (_ bv3 32) ~counter~0) (= |ULTIMATE.start_main_~s~0#1| (_ bv9 64)) (= |ULTIMATE.start_main_~a~0#1| (_ bv2 64)))) [2023-12-25 05:21:45,683 INFO L899 garLoopResultBuilder]: For program point L46(line 46) no Hoare annotation was computed. [2023-12-25 05:21:45,683 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (let ((.cse0 (bvmul |ULTIMATE.start_main_~a~0#1| (_ bv2 64)))) (and (= |ULTIMATE.start_main_~t~0#1| (bvadd .cse0 (_ bv1 64))) (= (bvadd .cse0 (_ bv1 64) (bvmul |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~s~0#1|) (= (bvadd (bvmul |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~t~0#1|) (_ bv1 64) (bvneg (bvmul |ULTIMATE.start_main_~s~0#1| (_ bv4 64))) (bvmul |ULTIMATE.start_main_~t~0#1| (_ bv2 64))) (_ bv0 64)))) [2023-12-25 05:21:45,684 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-25 05:21:45,684 INFO L895 garLoopResultBuilder]: At program point L32(line 32) the Hoare annotation is: (or (and (= (_ bv2 32) ~counter~0) (= |ULTIMATE.start_main_~s~0#1| (_ bv4 64)) (= (_ bv3 64) |ULTIMATE.start_main_~t~0#1|) (= |ULTIMATE.start_main_~a~0#1| (_ bv1 64))) (and (= ~counter~0 (_ bv5 32)) (= |ULTIMATE.start_main_~s~0#1| (_ bv25 64)) (= |ULTIMATE.start_main_~t~0#1| (_ bv9 64)) (= |ULTIMATE.start_main_~a~0#1| (_ bv4 64))) (and (= |ULTIMATE.start_main_~t~0#1| (_ bv7 64)) (= |ULTIMATE.start_main_~s~0#1| (_ bv16 64)) (= (_ bv4 32) ~counter~0) (= (_ bv3 64) |ULTIMATE.start_main_~a~0#1|)) (and (= |ULTIMATE.start_main_~a~0#1| (_ bv0 64)) (= ~counter~0 (_ bv1 32)) (= |ULTIMATE.start_main_~s~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~t~0#1| (_ bv1 64))) (and (= |ULTIMATE.start_main_~t~0#1| (_ bv5 64)) (= (_ bv3 32) ~counter~0) (= |ULTIMATE.start_main_~s~0#1| (_ bv9 64)) (= |ULTIMATE.start_main_~a~0#1| (_ bv2 64)))) [2023-12-25 05:21:45,684 INFO L899 garLoopResultBuilder]: For program point L30-1(lines 30 42) no Hoare annotation was computed. [2023-12-25 05:21:45,684 INFO L895 garLoopResultBuilder]: At program point L30-3(lines 30 42) the Hoare annotation is: (or (and (= |ULTIMATE.start_main_~a~0#1| (_ bv0 64)) (= |ULTIMATE.start_main_~s~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~t~0#1| (_ bv1 64)) (= ~counter~0 (_ bv0 32))) (and (= |ULTIMATE.start_main_~s~0#1| (_ bv25 64)) (= (_ bv4 32) ~counter~0) (= |ULTIMATE.start_main_~t~0#1| (_ bv9 64)) (= |ULTIMATE.start_main_~a~0#1| (_ bv4 64))) (let ((.cse1 (bvmul |ULTIMATE.start_main_~a~0#1| (_ bv2 64))) (.cse2 (bvmul |ULTIMATE.start_main_~t~0#1| (_ bv2 64))) (.cse0 (bvmul |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|))) (and (= (bvadd |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~s~0#1|) (bvadd (_ bv2 64) (bvmul |ULTIMATE.start_main_~a~0#1| (_ bv4 64)) .cse0)) (= ~counter~0 (_ bv5 32)) (= |ULTIMATE.start_main_~t~0#1| (bvadd .cse1 (_ bv1 64))) (= (bvadd |ULTIMATE.start_main_~s~0#1| (bvmul |ULTIMATE.start_main_~t~0#1| (_ bv4 64))) (bvadd (bvmul (_ bv10 64) |ULTIMATE.start_main_~a~0#1|) .cse0 (_ bv5 64))) (= (bvadd .cse1 (_ bv1 64) .cse0) |ULTIMATE.start_main_~s~0#1|) (= (bvadd |ULTIMATE.start_main_~s~0#1| (bvmul (_ bv3 64) |ULTIMATE.start_main_~t~0#1|)) (bvadd (bvmul |ULTIMATE.start_main_~a~0#1| (_ bv8 64)) (_ bv4 64) .cse0)) (= (bvadd (bvmul |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~t~0#1|) (_ bv1 64) (bvneg (bvmul |ULTIMATE.start_main_~s~0#1| (_ bv4 64))) .cse2) (_ bv0 64)) (= (bvadd |ULTIMATE.start_main_~s~0#1| .cse2) (bvadd (_ bv3 64) (bvmul |ULTIMATE.start_main_~a~0#1| (_ bv6 64)) .cse0)))) (and (= |ULTIMATE.start_main_~s~0#1| (_ bv4 64)) (= (_ bv3 64) |ULTIMATE.start_main_~t~0#1|) (= ~counter~0 (_ bv1 32)) (= |ULTIMATE.start_main_~a~0#1| (_ bv1 64))) (and (= |ULTIMATE.start_main_~t~0#1| (_ bv7 64)) (= (_ bv3 32) ~counter~0) (= |ULTIMATE.start_main_~s~0#1| (_ bv16 64)) (= (_ bv3 64) |ULTIMATE.start_main_~a~0#1|)) (and (= (_ bv2 32) ~counter~0) (= |ULTIMATE.start_main_~t~0#1| (_ bv5 64)) (= |ULTIMATE.start_main_~s~0#1| (_ bv9 64)) (= |ULTIMATE.start_main_~a~0#1| (_ bv2 64)))) [2023-12-25 05:21:45,684 INFO L895 garLoopResultBuilder]: At program point L30-4(lines 30 42) the Hoare annotation is: (let ((.cse0 (bvmul |ULTIMATE.start_main_~a~0#1| (_ bv2 64)))) (and (= |ULTIMATE.start_main_~t~0#1| (bvadd .cse0 (_ bv1 64))) (= (bvadd .cse0 (_ bv1 64) (bvmul |ULTIMATE.start_main_~a~0#1| |ULTIMATE.start_main_~a~0#1|)) |ULTIMATE.start_main_~s~0#1|) (= (bvadd (bvmul |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~t~0#1|) (_ bv1 64) (bvneg (bvmul |ULTIMATE.start_main_~s~0#1| (_ bv4 64))) (bvmul |ULTIMATE.start_main_~t~0#1| (_ bv2 64))) (_ bv0 64)))) [2023-12-25 05:21:45,684 INFO L895 garLoopResultBuilder]: At program point L45(line 45) the Hoare annotation is: (or (and (= |ULTIMATE.start_main_~t~0#1| (bvadd (bvmul |ULTIMATE.start_main_~a~0#1| (_ bv2 64)) (_ bv1 64))) (= (bvadd (bvmul |ULTIMATE.start_main_~t~0#1| |ULTIMATE.start_main_~t~0#1|) (_ bv1 64) (bvneg (bvmul |ULTIMATE.start_main_~s~0#1| (_ bv4 64))) (bvmul |ULTIMATE.start_main_~t~0#1| (_ bv2 64))) (_ bv0 64))) (and (= |ULTIMATE.start_main_~s~0#1| (_ bv1 64)) (= |ULTIMATE.start_main_~t~0#1| (_ bv1 64)))) [2023-12-25 05:21:45,684 INFO L899 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2023-12-25 05:21:45,684 INFO L899 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2023-12-25 05:21:45,684 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2023-12-25 05:21:45,684 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2023-12-25 05:21:45,684 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(lines 11 17) the Hoare annotation is: true [2023-12-25 05:21:45,684 INFO L899 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2023-12-25 05:21:45,686 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 1, 1, 1, 1, 1, 1] [2023-12-25 05:21:45,687 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 05:21:45,702 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 05:21:45 BoogieIcfgContainer [2023-12-25 05:21:45,702 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 05:21:45,705 INFO L158 Benchmark]: Toolchain (without parser) took 659681.44ms. Allocated memory is still 302.0MB. Free memory was 255.3MB in the beginning and 205.1MB in the end (delta: 50.2MB). Peak memory consumption was 51.2MB. Max. memory is 8.0GB. [2023-12-25 05:21:45,705 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 203.4MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 05:21:45,705 INFO L158 Benchmark]: CACSL2BoogieTranslator took 189.03ms. Allocated memory is still 302.0MB. Free memory was 254.8MB in the beginning and 243.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 05:21:45,705 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.22ms. Allocated memory is still 302.0MB. Free memory was 243.2MB in the beginning and 242.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 05:21:45,706 INFO L158 Benchmark]: Boogie Preprocessor took 26.51ms. Allocated memory is still 302.0MB. Free memory was 242.2MB in the beginning and 240.1MB in the end (delta: 2.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-25 05:21:45,706 INFO L158 Benchmark]: RCFGBuilder took 292.39ms. Allocated memory is still 302.0MB. Free memory was 240.1MB in the beginning and 227.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 05:21:45,708 INFO L158 Benchmark]: TraceAbstraction took 659135.56ms. Allocated memory is still 302.0MB. Free memory was 226.5MB in the beginning and 205.1MB in the end (delta: 21.3MB). Peak memory consumption was 22.9MB. Max. memory is 8.0GB. [2023-12-25 05:21:45,712 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.14ms. Allocated memory is still 203.4MB. Free memory is still 157.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 189.03ms. Allocated memory is still 302.0MB. Free memory was 254.8MB in the beginning and 243.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.22ms. Allocated memory is still 302.0MB. Free memory was 243.2MB in the beginning and 242.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.51ms. Allocated memory is still 302.0MB. Free memory was 242.2MB in the beginning and 240.1MB in the end (delta: 2.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 292.39ms. Allocated memory is still 302.0MB. Free memory was 240.1MB in the beginning and 227.5MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 659135.56ms. Allocated memory is still 302.0MB. Free memory was 226.5MB in the beginning and 205.1MB in the end (delta: 21.3MB). Peak memory consumption was 22.9MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 14]: 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, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 659.1s, OverallIterations: 12, TraceHistogramMax: 32, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 487.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 110.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 91 mSolverCounterUnknown, 135 SdHoareTripleChecker+Valid, 385.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 112 mSDsluCounter, 1469 SdHoareTripleChecker+Invalid, 382.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1165 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1061 IncrementalHoareTripleChecker+Invalid, 1260 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 304 mSDtfsCounter, 1061 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1102 GetRequests, 988 SyntacticMatches, 2 SemanticMatches, 112 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 127.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=11, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 12 MinimizatonAttempts, 8 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 80 PreInvPairs, 123 NumberOfFragments, 448 HoareAnnotationTreeSize, 80 FormulaSimplifications, 756 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FormulaSimplificationsInter, 1049 FormulaSimplificationTreeSizeReductionInter, 109.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 56.9s InterpolantComputationTime, 595 NumberOfCodeBlocks, 565 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1068 ConstructedInterpolants, 1 QuantifiedInterpolants, 3087 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1058 ConjunctsInSsa, 103 ConjunctsInUnsatCore, 20 InterpolantComputations, 7 PerfectInterpolantSequences, 5607/6564 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: 30]: Loop Invariant Derived loop invariant: (((((((((a == 0) && (s == 1)) && (t == 1)) && (counter == 0)) || ((((s == 25) && (4 == counter)) && (t == 9)) && (a == 4))) || ((((((((((t + s) % 1) == ((2 + (a * 4)) % 1)) && (counter == 5)) && (t == (((a * 2) + 1) % 1))) && (((s + (t * 4)) % 1) == (((10 * a) + (a * a)) % 1))) && ((((a * 2) + 1) % 1) == s)) && (((s + (3 * t)) % 1) == (((a * 8) + 4) % 1))) && ((((t * t) + 1) % 1) == 0)) && (((s + (t * 2)) % 1) == ((3 + (a * 6)) % 1)))) || ((((s == 4) && (3 == t)) && (counter == 1)) && (a == 1))) || ((((t == 7) && (3 == counter)) && (s == 16)) && (3 == a))) || ((((2 == counter) && (t == 5)) && (s == 9)) && (a == 2))) RESULT: Ultimate proved your program to be correct! [2023-12-25 05:21:45,919 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-25 05:21:45,930 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 137 Received shutdown request...