/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/cohendiv-ll_unwindbound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-25 00:49:25,171 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-25 00:49:25,206 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 00:49:25,208 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-25 00:49:25,209 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-25 00:49:25,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-25 00:49:25,223 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-25 00:49:25,223 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-25 00:49:25,224 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-25 00:49:25,224 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-25 00:49:25,224 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-25 00:49:25,224 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-25 00:49:25,225 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-25 00:49:25,225 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-25 00:49:25,225 INFO L153 SettingsManager]: * Use SBE=true [2023-12-25 00:49:25,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-25 00:49:25,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-25 00:49:25,226 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-25 00:49:25,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-25 00:49:25,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-25 00:49:25,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-25 00:49:25,227 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-25 00:49:25,227 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-25 00:49:25,227 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-25 00:49:25,227 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-25 00:49:25,227 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-25 00:49:25,228 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-25 00:49:25,232 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-25 00:49:25,232 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-25 00:49:25,232 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-25 00:49:25,233 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-25 00:49:25,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-25 00:49:25,233 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-25 00:49:25,233 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-25 00:49:25,233 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:49:25,233 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-25 00:49:25,233 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-25 00:49:25,233 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-25 00:49:25,234 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-25 00:49:25,234 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-25 00:49:25,234 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-25 00:49:25,234 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-25 00:49:25,234 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-25 00:49:25,234 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-25 00:49:25,235 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-25 00:49:25,235 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-25 00:49:25,235 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 00:49:25,400 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-25 00:49:25,418 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-25 00:49:25,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-25 00:49:25,420 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-25 00:49:25,420 INFO L274 PluginConnector]: CDTParser initialized [2023-12-25 00:49:25,422 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound10.c [2023-12-25 00:49:26,393 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-25 00:49:26,566 INFO L384 CDTParser]: Found 1 translation units. [2023-12-25 00:49:26,567 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/cohendiv-ll_unwindbound10.c [2023-12-25 00:49:26,572 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04b11e713/885d30c60d0e49198d1931decf66d83d/FLAGd048f4e9f [2023-12-25 00:49:26,587 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/04b11e713/885d30c60d0e49198d1931decf66d83d [2023-12-25 00:49:26,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-25 00:49:26,590 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-25 00:49:26,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-25 00:49:26,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-25 00:49:26,599 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-25 00:49:26,600 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:49:26" (1/1) ... [2023-12-25 00:49:26,600 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e7af141 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:49:26, skipping insertion in model container [2023-12-25 00:49:26,600 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.12 12:49:26" (1/1) ... [2023-12-25 00:49:26,617 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-25 00:49:26,722 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/cohendiv-ll_unwindbound10.c[576,589] [2023-12-25 00:49:26,739 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:49:26,748 INFO L202 MainTranslator]: Completed pre-run [2023-12-25 00:49:26,758 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/cohendiv-ll_unwindbound10.c[576,589] [2023-12-25 00:49:26,763 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-25 00:49:26,775 INFO L206 MainTranslator]: Completed translation [2023-12-25 00:49:26,777 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:49:26 WrapperNode [2023-12-25 00:49:26,777 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-25 00:49:26,778 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-25 00:49:26,778 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-25 00:49:26,778 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-25 00:49:26,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:49:26" (1/1) ... [2023-12-25 00:49:26,789 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:49:26" (1/1) ... [2023-12-25 00:49:26,802 INFO L138 Inliner]: procedures = 14, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2023-12-25 00:49:26,802 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-25 00:49:26,803 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-25 00:49:26,803 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-25 00:49:26,803 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-25 00:49:26,809 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:49:26" (1/1) ... [2023-12-25 00:49:26,809 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:49:26" (1/1) ... [2023-12-25 00:49:26,811 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:49:26" (1/1) ... [2023-12-25 00:49:26,818 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 00:49:26,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:49:26" (1/1) ... [2023-12-25 00:49:26,818 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:49:26" (1/1) ... [2023-12-25 00:49:26,821 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:49:26" (1/1) ... [2023-12-25 00:49:26,824 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:49:26" (1/1) ... [2023-12-25 00:49:26,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:49:26" (1/1) ... [2023-12-25 00:49:26,825 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:49:26" (1/1) ... [2023-12-25 00:49:26,826 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-25 00:49:26,827 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-25 00:49:26,827 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-25 00:49:26,827 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-25 00:49:26,828 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:49:26" (1/1) ... [2023-12-25 00:49:26,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-25 00:49:26,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-25 00:49:26,852 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 00:49:26,872 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 00:49:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-25 00:49:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-25 00:49:26,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-25 00:49:26,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-25 00:49:26,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2023-12-25 00:49:26,889 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2023-12-25 00:49:26,939 INFO L241 CfgBuilder]: Building ICFG [2023-12-25 00:49:26,943 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-25 00:49:27,121 INFO L282 CfgBuilder]: Performing block encoding [2023-12-25 00:49:27,148 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-25 00:49:27,148 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-25 00:49:27,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:49:27 BoogieIcfgContainer [2023-12-25 00:49:27,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-25 00:49:27,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-25 00:49:27,150 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-25 00:49:27,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-25 00:49:27,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.12 12:49:26" (1/3) ... [2023-12-25 00:49:27,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b6c721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:49:27, skipping insertion in model container [2023-12-25 00:49:27,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.12 12:49:26" (2/3) ... [2023-12-25 00:49:27,156 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70b6c721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.12 12:49:27, skipping insertion in model container [2023-12-25 00:49:27,156 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.12 12:49:27" (3/3) ... [2023-12-25 00:49:27,157 INFO L112 eAbstractionObserver]: Analyzing ICFG cohendiv-ll_unwindbound10.c [2023-12-25 00:49:27,168 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-25 00:49:27,169 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-25 00:49:27,204 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-25 00:49:27,208 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;@294883ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-25 00:49:27,208 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-25 00:49:27,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 00:49:27,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-12-25 00:49:27,218 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:49:27,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:49:27,219 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:49:27,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:49:27,223 INFO L85 PathProgramCache]: Analyzing trace with hash 753274055, now seen corresponding path program 1 times [2023-12-25 00:49:27,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:49:27,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703306958] [2023-12-25 00:49:27,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:49:27,235 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 00:49:27,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:49:27,237 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 00:49:27,258 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 00:49:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:49:27,308 INFO L262 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-25 00:49:27,311 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:49:27,323 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 00:49:27,323 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:49:27,324 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:49:27,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703306958] [2023-12-25 00:49:27,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703306958] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:49:27,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:49:27,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-25 00:49:27,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336049516] [2023-12-25 00:49:27,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:49:27,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-25 00:49:27,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:49:27,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-25 00:49:27,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 00:49:27,347 INFO L87 Difference]: Start difference. First operand has 26 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:49:27,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:49:27,368 INFO L93 Difference]: Finished difference Result 50 states and 82 transitions. [2023-12-25 00:49:27,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-25 00:49:27,382 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-12-25 00:49:27,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:49:27,387 INFO L225 Difference]: With dead ends: 50 [2023-12-25 00:49:27,387 INFO L226 Difference]: Without dead ends: 24 [2023-12-25 00:49:27,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-25 00:49:27,391 INFO L413 NwaCegarLoop]: 33 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, 33 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 00:49:27,392 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 00:49:27,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-12-25 00:49:27,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-12-25 00:49:27,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 00:49:27,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 33 transitions. [2023-12-25 00:49:27,418 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 33 transitions. Word has length 8 [2023-12-25 00:49:27,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:49:27,418 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 33 transitions. [2023-12-25 00:49:27,419 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-25 00:49:27,419 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 33 transitions. [2023-12-25 00:49:27,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 00:49:27,419 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:49:27,420 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:49:27,424 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 00:49:27,624 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 00:49:27,624 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:49:27,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:49:27,625 INFO L85 PathProgramCache]: Analyzing trace with hash -79941692, now seen corresponding path program 1 times [2023-12-25 00:49:27,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:49:27,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1687571322] [2023-12-25 00:49:27,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:49:27,626 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 00:49:27,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:49:27,627 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 00:49:27,628 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 00:49:27,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:49:27,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-25 00:49:27,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:49:27,723 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 00:49:27,723 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:49:27,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:49:27,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1687571322] [2023-12-25 00:49:27,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1687571322] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:49:27,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:49:27,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-25 00:49:27,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583933045] [2023-12-25 00:49:27,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:49:27,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-25 00:49:27,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:49:27,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-25 00:49:27,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-25 00:49:27,730 INFO L87 Difference]: Start difference. First operand 24 states and 33 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 00:49:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:49:27,753 INFO L93 Difference]: Finished difference Result 33 states and 42 transitions. [2023-12-25 00:49:27,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-25 00:49:27,754 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 9 [2023-12-25 00:49:27,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:49:27,754 INFO L225 Difference]: With dead ends: 33 [2023-12-25 00:49:27,755 INFO L226 Difference]: Without dead ends: 26 [2023-12-25 00:49:27,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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 00:49:27,756 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:49:27,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-25 00:49:27,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2023-12-25 00:49:27,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2023-12-25 00:49:27,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 7 states have call successors, (7), 1 states have call predecessors, (7), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-12-25 00:49:27,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2023-12-25 00:49:27,762 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 9 [2023-12-25 00:49:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:49:27,762 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2023-12-25 00:49:27,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 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 00:49:27,762 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2023-12-25 00:49:27,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-25 00:49:27,763 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:49:27,763 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:49:27,768 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 (3)] Ended with exit code 0 [2023-12-25 00:49:27,966 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 00:49:27,967 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:49:27,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:49:27,967 INFO L85 PathProgramCache]: Analyzing trace with hash -78452142, now seen corresponding path program 1 times [2023-12-25 00:49:27,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:49:27,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [55336522] [2023-12-25 00:49:27,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:49:27,968 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 00:49:27,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:49:27,969 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 00:49:27,981 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 00:49:28,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:49:28,022 INFO L262 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 00:49:28,024 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:49:28,151 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 00:49:28,152 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:49:28,152 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:49:28,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [55336522] [2023-12-25 00:49:28,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [55336522] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:49:28,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:49:28,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-12-25 00:49:28,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751953113] [2023-12-25 00:49:28,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:49:28,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 00:49:28,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:49:28,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 00:49:28,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-25 00:49:28,153 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 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 00:49:28,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:49:28,968 INFO L93 Difference]: Finished difference Result 36 states and 47 transitions. [2023-12-25 00:49:28,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 00:49:28,968 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 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 9 [2023-12-25 00:49:28,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:49:28,969 INFO L225 Difference]: With dead ends: 36 [2023-12-25 00:49:28,969 INFO L226 Difference]: Without dead ends: 34 [2023-12-25 00:49:28,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-25 00:49:28,970 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 21 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 00:49:28,970 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 107 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 00:49:28,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2023-12-25 00:49:28,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2023-12-25 00:49:28,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 20 states have (on average 1.25) internal successors, (25), 22 states have internal predecessors, (25), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2023-12-25 00:49:29,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2023-12-25 00:49:29,000 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 9 [2023-12-25 00:49:29,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:49:29,001 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2023-12-25 00:49:29,002 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 5 states have internal predecessors, (8), 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 00:49:29,002 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2023-12-25 00:49:29,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-12-25 00:49:29,002 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:49:29,002 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:49:29,008 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 00:49:29,205 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 00:49:29,208 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:49:29,208 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:49:29,208 INFO L85 PathProgramCache]: Analyzing trace with hash 921583882, now seen corresponding path program 1 times [2023-12-25 00:49:29,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:49:29,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1240117885] [2023-12-25 00:49:29,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:49:29,209 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 00:49:29,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:49:29,210 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 00:49:29,212 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 00:49:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:49:29,330 INFO L262 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 00:49:29,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:49:29,434 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 00:49:29,434 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:49:29,434 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:49:29,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1240117885] [2023-12-25 00:49:29,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1240117885] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:49:29,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:49:29,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 00:49:29,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593385113] [2023-12-25 00:49:29,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:49:29,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 00:49:29,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:49:29,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 00:49:29,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-25 00:49:29,436 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 00:49:30,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:49:30,519 INFO L93 Difference]: Finished difference Result 49 states and 65 transitions. [2023-12-25 00:49:30,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 00:49:30,526 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2023-12-25 00:49:30,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:49:30,528 INFO L225 Difference]: With dead ends: 49 [2023-12-25 00:49:30,528 INFO L226 Difference]: Without dead ends: 46 [2023-12-25 00:49:30,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-25 00:49:30,529 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 35 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:49:30,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 102 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-25 00:49:30,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-25 00:49:30,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2023-12-25 00:49:30,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.25) internal successors, (35), 29 states have internal predecessors, (35), 13 states have call successors, (13), 3 states have call predecessors, (13), 3 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2023-12-25 00:49:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2023-12-25 00:49:30,536 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 14 [2023-12-25 00:49:30,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:49:30,536 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2023-12-25 00:49:30,537 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 6 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2023-12-25 00:49:30,537 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2023-12-25 00:49:30,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-12-25 00:49:30,537 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:49:30,537 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:49:30,548 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 (5)] Forceful destruction successful, exit code 0 [2023-12-25 00:49:30,741 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 00:49:30,742 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:49:30,742 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:49:30,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1948965363, now seen corresponding path program 1 times [2023-12-25 00:49:30,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:49:30,743 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1117149258] [2023-12-25 00:49:30,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:49:30,743 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 00:49:30,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:49:30,745 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 00:49:30,748 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 00:49:30,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:49:30,858 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-25 00:49:30,860 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:49:30,960 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 00:49:30,960 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:49:30,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:49:30,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1117149258] [2023-12-25 00:49:30,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1117149258] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:49:30,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:49:30,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 00:49:30,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77071525] [2023-12-25 00:49:30,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:49:30,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 00:49:30,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:49:30,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 00:49:30,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-12-25 00:49:30,961 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 00:49:31,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:49:31,880 INFO L93 Difference]: Finished difference Result 74 states and 104 transitions. [2023-12-25 00:49:31,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 00:49:31,886 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2023-12-25 00:49:31,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:49:31,887 INFO L225 Difference]: With dead ends: 74 [2023-12-25 00:49:31,887 INFO L226 Difference]: Without dead ends: 72 [2023-12-25 00:49:31,888 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-25 00:49:31,888 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 24 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-25 00:49:31,888 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 134 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-25 00:49:31,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2023-12-25 00:49:31,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2023-12-25 00:49:31,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 40 states have (on average 1.3) internal successors, (52), 42 states have internal predecessors, (52), 20 states have call successors, (20), 4 states have call predecessors, (20), 4 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-25 00:49:31,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 91 transitions. [2023-12-25 00:49:31,911 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 91 transitions. Word has length 22 [2023-12-25 00:49:31,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:49:31,912 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 91 transitions. [2023-12-25 00:49:31,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 00:49:31,912 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 91 transitions. [2023-12-25 00:49:31,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-12-25 00:49:31,913 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:49:31,913 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:49:31,923 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 00:49:32,123 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 00:49:32,123 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:49:32,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:49:32,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1914041250, now seen corresponding path program 1 times [2023-12-25 00:49:32,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:49:32,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [708494081] [2023-12-25 00:49:32,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:49:32,124 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 00:49:32,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:49:32,125 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 00:49:32,125 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 00:49:32,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:49:32,236 INFO L262 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-25 00:49:32,238 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:49:32,278 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-25 00:49:32,278 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:49:32,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:49:32,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [708494081] [2023-12-25 00:49:32,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [708494081] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:49:32,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:49:32,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-25 00:49:32,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312395425] [2023-12-25 00:49:32,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:49:32,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-25 00:49:32,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:49:32,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-25 00:49:32,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 00:49:32,280 INFO L87 Difference]: Start difference. First operand 65 states and 91 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 00:49:32,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:49:32,578 INFO L93 Difference]: Finished difference Result 104 states and 144 transitions. [2023-12-25 00:49:32,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-25 00:49:32,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 25 [2023-12-25 00:49:32,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:49:32,581 INFO L225 Difference]: With dead ends: 104 [2023-12-25 00:49:32,581 INFO L226 Difference]: Without dead ends: 69 [2023-12-25 00:49:32,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-25 00:49:32,584 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-25 00:49:32,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-25 00:49:32,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2023-12-25 00:49:32,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2023-12-25 00:49:32,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 43 states have (on average 1.255813953488372) internal successors, (54), 45 states have internal predecessors, (54), 20 states have call successors, (20), 5 states have call predecessors, (20), 5 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-25 00:49:32,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 93 transitions. [2023-12-25 00:49:32,605 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 93 transitions. Word has length 25 [2023-12-25 00:49:32,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:49:32,605 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 93 transitions. [2023-12-25 00:49:32,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2023-12-25 00:49:32,605 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 93 transitions. [2023-12-25 00:49:32,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-12-25 00:49:32,606 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:49:32,606 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:49:32,614 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 00:49:32,806 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 00:49:32,806 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:49:32,807 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:49:32,807 INFO L85 PathProgramCache]: Analyzing trace with hash -531579021, now seen corresponding path program 1 times [2023-12-25 00:49:32,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:49:32,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1815361944] [2023-12-25 00:49:32,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:49:32,807 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 00:49:32,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:49:32,808 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 00:49:32,810 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 00:49:32,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:49:32,949 INFO L262 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 00:49:32,950 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:49:33,078 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-25 00:49:33,079 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-25 00:49:33,079 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:49:33,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1815361944] [2023-12-25 00:49:33,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1815361944] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-25 00:49:33,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-25 00:49:33,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-25 00:49:33,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228456692] [2023-12-25 00:49:33,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-25 00:49:33,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-25 00:49:33,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:49:33,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-25 00:49:33,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-12-25 00:49:33,080 INFO L87 Difference]: Start difference. First operand 69 states and 93 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 00:49:33,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:49:33,887 INFO L93 Difference]: Finished difference Result 75 states and 98 transitions. [2023-12-25 00:49:33,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-12-25 00:49:33,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 32 [2023-12-25 00:49:33,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:49:33,890 INFO L225 Difference]: With dead ends: 75 [2023-12-25 00:49:33,890 INFO L226 Difference]: Without dead ends: 73 [2023-12-25 00:49:33,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 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 00:49:33,891 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-12-25 00:49:33,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 116 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-12-25 00:49:33,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2023-12-25 00:49:33,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2023-12-25 00:49:33,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2391304347826086) internal successors, (57), 48 states have internal predecessors, (57), 20 states have call successors, (20), 6 states have call predecessors, (20), 6 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2023-12-25 00:49:33,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 96 transitions. [2023-12-25 00:49:33,904 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 96 transitions. Word has length 32 [2023-12-25 00:49:33,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:49:33,905 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 96 transitions. [2023-12-25 00:49:33,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2023-12-25 00:49:33,905 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 96 transitions. [2023-12-25 00:49:33,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-12-25 00:49:33,906 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:49:33,906 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:49:33,916 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 (8)] Forceful destruction successful, exit code 0 [2023-12-25 00:49:34,111 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 00:49:34,112 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:49:34,112 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:49:34,113 INFO L85 PathProgramCache]: Analyzing trace with hash -2026419203, now seen corresponding path program 1 times [2023-12-25 00:49:34,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:49:34,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288445560] [2023-12-25 00:49:34,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:49:34,113 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 00:49:34,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:49:34,114 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 00:49:34,114 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 00:49:34,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:49:34,251 INFO L262 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 16 conjunts are in the unsatisfiable core [2023-12-25 00:49:34,253 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:49:34,579 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 00:49:34,579 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:49:53,929 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 23 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2023-12-25 00:49:53,929 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:49:53,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288445560] [2023-12-25 00:49:53,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288445560] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:49:53,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:49:53,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 21 [2023-12-25 00:49:53,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193957037] [2023-12-25 00:49:53,930 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:49:53,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-12-25 00:49:53,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:49:53,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-12-25 00:49:53,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2023-12-25 00:49:53,931 INFO L87 Difference]: Start difference. First operand 73 states and 96 transitions. Second operand has 21 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 7 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 00:50:02,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:50:06,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:50:08,080 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:50:11,224 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:50:13,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:50:18,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:50:18,549 INFO L93 Difference]: Finished difference Result 107 states and 139 transitions. [2023-12-25 00:50:18,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 00:50:18,555 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 7 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 38 [2023-12-25 00:50:18,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:50:18,556 INFO L225 Difference]: With dead ends: 107 [2023-12-25 00:50:18,556 INFO L226 Difference]: Without dead ends: 105 [2023-12-25 00:50:18,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=179, Invalid=633, Unknown=0, NotChecked=0, Total=812 [2023-12-25 00:50:18,557 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 110 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 65 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.7s IncrementalHoareTripleChecker+Time [2023-12-25 00:50:18,557 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 160 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 228 Invalid, 2 Unknown, 0 Unchecked, 19.7s Time] [2023-12-25 00:50:18,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2023-12-25 00:50:18,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 95. [2023-12-25 00:50:18,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 63 states have internal predecessors, (72), 26 states have call successors, (26), 9 states have call predecessors, (26), 9 states have return successors, (25), 22 states have call predecessors, (25), 25 states have call successors, (25) [2023-12-25 00:50:18,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 123 transitions. [2023-12-25 00:50:18,571 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 123 transitions. Word has length 38 [2023-12-25 00:50:18,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:50:18,571 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 123 transitions. [2023-12-25 00:50:18,571 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 1.7222222222222223) internal successors, (31), 17 states have internal predecessors, (31), 7 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2023-12-25 00:50:18,571 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 123 transitions. [2023-12-25 00:50:18,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2023-12-25 00:50:18,572 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:50:18,572 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:50:18,580 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 00:50:18,778 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 00:50:18,779 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:50:18,779 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:50:18,779 INFO L85 PathProgramCache]: Analyzing trace with hash -369399342, now seen corresponding path program 1 times [2023-12-25 00:50:18,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:50:18,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [207012727] [2023-12-25 00:50:18,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:50:18,780 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 00:50:18,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:50:18,781 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 00:50:18,781 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 00:50:18,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:50:18,910 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 00:50:18,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:50:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 26 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2023-12-25 00:50:19,023 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:50:19,119 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-12-25 00:50:19,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:50:19,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [207012727] [2023-12-25 00:50:19,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [207012727] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:50:19,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:50:19,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2023-12-25 00:50:19,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004431246] [2023-12-25 00:50:19,119 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:50:19,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 00:50:19,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:50:19,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 00:50:19,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-25 00:50:19,120 INFO L87 Difference]: Start difference. First operand 95 states and 123 transitions. Second operand has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-25 00:50:22,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:50:22,691 INFO L93 Difference]: Finished difference Result 250 states and 306 transitions. [2023-12-25 00:50:22,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 00:50:22,698 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 41 [2023-12-25 00:50:22,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:50:22,699 INFO L225 Difference]: With dead ends: 250 [2023-12-25 00:50:22,699 INFO L226 Difference]: Without dead ends: 243 [2023-12-25 00:50:22,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2023-12-25 00:50:22,701 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 89 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-25 00:50:22,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 212 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-25 00:50:22,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2023-12-25 00:50:22,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 227. [2023-12-25 00:50:22,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 146 states have (on average 1.1986301369863013) internal successors, (175), 155 states have internal predecessors, (175), 55 states have call successors, (55), 25 states have call predecessors, (55), 25 states have return successors, (51), 46 states have call predecessors, (51), 51 states have call successors, (51) [2023-12-25 00:50:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 281 transitions. [2023-12-25 00:50:22,733 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 281 transitions. Word has length 41 [2023-12-25 00:50:22,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:50:22,734 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 281 transitions. [2023-12-25 00:50:22,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.6) internal successors, (36), 10 states have internal predecessors, (36), 5 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2023-12-25 00:50:22,734 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 281 transitions. [2023-12-25 00:50:22,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2023-12-25 00:50:22,737 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:50:22,737 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:50:22,746 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 (10)] Forceful destruction successful, exit code 0 [2023-12-25 00:50:22,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 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 00:50:22,943 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:50:22,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:50:22,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1199104068, now seen corresponding path program 1 times [2023-12-25 00:50:22,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:50:22,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2100579116] [2023-12-25 00:50:22,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:50:22,944 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 00:50:22,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:50:22,945 INFO L229 MonitoredProcess]: Starting monitored process 11 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 00:50:22,947 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 (11)] Waiting until timeout for monitored process [2023-12-25 00:50:23,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:50:23,232 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 17 conjunts are in the unsatisfiable core [2023-12-25 00:50:23,233 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:50:23,899 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 23 proven. 8 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-25 00:50:23,899 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:50:47,590 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 27 proven. 4 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-12-25 00:50:47,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:50:47,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2100579116] [2023-12-25 00:50:47,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2100579116] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:50:47,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:50:47,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 19 [2023-12-25 00:50:47,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719191605] [2023-12-25 00:50:47,591 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:50:47,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-12-25 00:50:47,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:50:47,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-12-25 00:50:47,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=277, Unknown=0, NotChecked=0, Total=342 [2023-12-25 00:50:47,592 INFO L87 Difference]: Start difference. First operand 227 states and 281 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2023-12-25 00:50:59,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:51:03,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:51:07,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 00:51:11,887 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 00:51:15,895 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 00:51:19,998 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 00:51:26,748 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 00:51:30,752 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 00:51:34,754 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 00:51:38,756 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 00:51:42,759 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 00:51:46,762 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 00:51:50,768 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 00:51:54,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 00:51:58,779 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 00:52:02,781 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 00:52:06,783 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 00:52:11,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:52:19,297 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 00:52:23,304 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 00:52:27,354 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 00:52:30,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.98s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:52:33,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.75s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:52:36,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:52:42,430 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 00:52:46,440 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 00:52:50,451 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 00:52:52,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.45s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:52:55,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:52:56,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:53:00,753 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 00:53:04,762 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 00:53:08,771 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 00:53:15,088 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 00:53:19,096 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 00:53:23,162 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 00:53:27,765 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 00:53:31,773 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 00:53:35,783 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 00:53:40,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:53:44,155 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.40s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:53:48,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.78s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:53:52,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result VALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:53:54,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:53:54,430 INFO L93 Difference]: Finished difference Result 293 states and 354 transitions. [2023-12-25 00:53:54,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-25 00:53:54,444 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) Word has length 46 [2023-12-25 00:53:54,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:53:54,445 INFO L225 Difference]: With dead ends: 293 [2023-12-25 00:53:54,446 INFO L226 Difference]: Without dead ends: 285 [2023-12-25 00:53:54,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 29.0s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2023-12-25 00:53:54,447 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 162 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 140 mSolverCounterUnsat, 31 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 173.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 31 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 174.2s IncrementalHoareTripleChecker+Time [2023-12-25 00:53:54,447 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 199 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 224 Invalid, 31 Unknown, 0 Unchecked, 174.2s Time] [2023-12-25 00:53:54,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2023-12-25 00:53:54,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 269. [2023-12-25 00:53:54,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 175 states have (on average 1.1371428571428572) internal successors, (199), 185 states have internal predecessors, (199), 60 states have call successors, (60), 33 states have call predecessors, (60), 33 states have return successors, (59), 50 states have call predecessors, (59), 59 states have call successors, (59) [2023-12-25 00:53:54,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 318 transitions. [2023-12-25 00:53:54,476 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 318 transitions. Word has length 46 [2023-12-25 00:53:54,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:53:54,477 INFO L495 AbstractCegarLoop]: Abstraction has 269 states and 318 transitions. [2023-12-25 00:53:54,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 17 states have internal predecessors, (37), 6 states have call successors, (14), 3 states have call predecessors, (14), 2 states have return successors, (12), 7 states have call predecessors, (12), 6 states have call successors, (12) [2023-12-25 00:53:54,477 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 318 transitions. [2023-12-25 00:53:54,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-12-25 00:53:54,477 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:53:54,477 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:53:54,486 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 (11)] Forceful destruction successful, exit code 0 [2023-12-25 00:53:54,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 00:53:54,684 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:53:54,684 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:53:54,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1161546193, now seen corresponding path program 1 times [2023-12-25 00:53:54,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:53:54,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617353056] [2023-12-25 00:53:54,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:53:54,685 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 00:53:54,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:53:54,685 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 00:53:54,686 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 00:53:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:53:54,830 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-25 00:53:54,831 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:53:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 15 proven. 34 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-12-25 00:53:54,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:53:55,036 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 00:53:55,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:53:55,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617353056] [2023-12-25 00:53:55,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1617353056] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:53:55,036 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:53:55,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 10 [2023-12-25 00:53:55,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288666426] [2023-12-25 00:53:55,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:53:55,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-25 00:53:55,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:53:55,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-25 00:53:55,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-25 00:53:55,038 INFO L87 Difference]: Start difference. First operand 269 states and 318 transitions. Second operand has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-25 00:53:57,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:53:57,890 INFO L93 Difference]: Finished difference Result 396 states and 463 transitions. [2023-12-25 00:53:57,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-25 00:53:57,899 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) Word has length 49 [2023-12-25 00:53:57,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:53:57,901 INFO L225 Difference]: With dead ends: 396 [2023-12-25 00:53:57,901 INFO L226 Difference]: Without dead ends: 287 [2023-12-25 00:53:57,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2023-12-25 00:53:57,902 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 64 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-12-25 00:53:57,902 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 165 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-12-25 00:53:57,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2023-12-25 00:53:57,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 279. [2023-12-25 00:53:57,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 185 states have (on average 1.1027027027027028) internal successors, (204), 190 states have internal predecessors, (204), 59 states have call successors, (59), 34 states have call predecessors, (59), 34 states have return successors, (58), 54 states have call predecessors, (58), 58 states have call successors, (58) [2023-12-25 00:53:57,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 321 transitions. [2023-12-25 00:53:57,929 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 321 transitions. Word has length 49 [2023-12-25 00:53:57,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:53:57,929 INFO L495 AbstractCegarLoop]: Abstraction has 279 states and 321 transitions. [2023-12-25 00:53:57,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 5 states have call successors, (13), 4 states have call predecessors, (13), 3 states have return successors, (12), 4 states have call predecessors, (12), 4 states have call successors, (12) [2023-12-25 00:53:57,930 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 321 transitions. [2023-12-25 00:53:57,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-12-25 00:53:57,932 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:53:57,932 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:53:57,956 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 00:53:58,140 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 00:53:58,140 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:53:58,141 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:53:58,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1684004353, now seen corresponding path program 1 times [2023-12-25 00:53:58,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:53:58,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [89138583] [2023-12-25 00:53:58,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:53:58,141 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 00:53:58,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:53:58,142 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 00:53:58,142 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 00:53:58,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:53:58,288 INFO L262 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-25 00:53:58,290 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:54:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 41 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-12-25 00:54:00,088 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:54:01,580 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 41 proven. 7 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2023-12-25 00:54:01,581 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:54:01,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [89138583] [2023-12-25 00:54:01,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [89138583] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:54:01,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:54:01,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2023-12-25 00:54:01,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224872789] [2023-12-25 00:54:01,581 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:54:01,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-25 00:54:01,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:54:01,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-25 00:54:01,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2023-12-25 00:54:01,582 INFO L87 Difference]: Start difference. First operand 279 states and 321 transitions. Second operand has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-25 00:54:07,367 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 00:54:07,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:54:07,784 INFO L93 Difference]: Finished difference Result 293 states and 334 transitions. [2023-12-25 00:54:07,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-12-25 00:54:07,789 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 65 [2023-12-25 00:54:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:54:07,793 INFO L225 Difference]: With dead ends: 293 [2023-12-25 00:54:07,793 INFO L226 Difference]: Without dead ends: 291 [2023-12-25 00:54:07,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2023-12-25 00:54:07,793 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:54:07,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 81 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2023-12-25 00:54:07,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2023-12-25 00:54:07,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 275. [2023-12-25 00:54:07,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 182 states have (on average 1.1043956043956045) internal successors, (201), 185 states have internal predecessors, (201), 57 states have call successors, (57), 35 states have call predecessors, (57), 35 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-25 00:54:07,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 314 transitions. [2023-12-25 00:54:07,817 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 314 transitions. Word has length 65 [2023-12-25 00:54:07,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:54:07,818 INFO L495 AbstractCegarLoop]: Abstraction has 275 states and 314 transitions. [2023-12-25 00:54:07,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-25 00:54:07,818 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 314 transitions. [2023-12-25 00:54:07,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-12-25 00:54:07,818 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:54:07,818 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:54:07,827 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 (13)] Forceful destruction successful, exit code 0 [2023-12-25 00:54:08,024 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 00:54:08,024 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:54:08,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:54:08,025 INFO L85 PathProgramCache]: Analyzing trace with hash -421565199, now seen corresponding path program 1 times [2023-12-25 00:54:08,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:54:08,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1588023794] [2023-12-25 00:54:08,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:54:08,025 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 00:54:08,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:54:08,026 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 00:54:08,026 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 00:54:08,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:54:08,239 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 18 conjunts are in the unsatisfiable core [2023-12-25 00:54:08,242 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:54:09,152 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 31 proven. 30 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-12-25 00:54:09,152 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:54:21,243 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 45 proven. 16 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2023-12-25 00:54:21,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:54:21,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1588023794] [2023-12-25 00:54:21,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1588023794] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:54:21,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:54:21,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2023-12-25 00:54:21,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212525081] [2023-12-25 00:54:21,243 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:54:21,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-12-25 00:54:21,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:54:21,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-12-25 00:54:21,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2023-12-25 00:54:21,244 INFO L87 Difference]: Start difference. First operand 275 states and 314 transitions. Second operand has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 20 states have internal predecessors, (45), 12 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 12 states have call predecessors, (20), 10 states have call successors, (20) [2023-12-25 00:54:28,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.49s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:54:32,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.58s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:54:37,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.46s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:54:42,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:54:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:54:43,320 INFO L93 Difference]: Finished difference Result 301 states and 340 transitions. [2023-12-25 00:54:43,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-25 00:54:43,329 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 20 states have internal predecessors, (45), 12 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 12 states have call predecessors, (20), 10 states have call successors, (20) Word has length 70 [2023-12-25 00:54:43,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:54:43,330 INFO L225 Difference]: With dead ends: 301 [2023-12-25 00:54:43,330 INFO L226 Difference]: Without dead ends: 299 [2023-12-25 00:54:43,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=188, Invalid=682, Unknown=0, NotChecked=0, Total=870 [2023-12-25 00:54:43,331 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 66 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 45 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2023-12-25 00:54:43,331 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 315 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 411 Invalid, 4 Unknown, 0 Unchecked, 19.4s Time] [2023-12-25 00:54:43,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2023-12-25 00:54:43,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 291. [2023-12-25 00:54:43,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 194 states have (on average 1.097938144329897) internal successors, (213), 197 states have internal predecessors, (213), 57 states have call successors, (57), 39 states have call predecessors, (57), 39 states have return successors, (56), 54 states have call predecessors, (56), 56 states have call successors, (56) [2023-12-25 00:54:43,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 326 transitions. [2023-12-25 00:54:43,370 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 326 transitions. Word has length 70 [2023-12-25 00:54:43,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:54:43,371 INFO L495 AbstractCegarLoop]: Abstraction has 291 states and 326 transitions. [2023-12-25 00:54:43,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 20 states have internal predecessors, (45), 12 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (20), 12 states have call predecessors, (20), 10 states have call successors, (20) [2023-12-25 00:54:43,371 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 326 transitions. [2023-12-25 00:54:43,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2023-12-25 00:54:43,372 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:54:43,372 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:54:43,383 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 00:54:43,580 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 00:54:43,580 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:54:43,581 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:54:43,581 INFO L85 PathProgramCache]: Analyzing trace with hash -82697477, now seen corresponding path program 2 times [2023-12-25 00:54:43,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:54:43,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1820965529] [2023-12-25 00:54:43,581 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 00:54:43,581 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 00:54:43,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:54:43,582 INFO L229 MonitoredProcess]: Starting monitored process 15 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 00:54:43,583 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 (15)] Waiting until timeout for monitored process [2023-12-25 00:54:43,760 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 00:54:43,760 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 00:54:43,778 INFO L262 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 21 conjunts are in the unsatisfiable core [2023-12-25 00:54:43,780 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:54:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 63 proven. 51 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2023-12-25 00:54:44,648 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:55:39,838 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 63 proven. 51 refuted. 0 times theorem prover too weak. 246 trivial. 0 not checked. [2023-12-25 00:55:39,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:55:39,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1820965529] [2023-12-25 00:55:39,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1820965529] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:55:39,838 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:55:39,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 27 [2023-12-25 00:55:39,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468186904] [2023-12-25 00:55:39,838 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:55:39,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-12-25 00:55:39,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:55:39,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-12-25 00:55:39,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=561, Unknown=0, NotChecked=0, Total=702 [2023-12-25 00:55:39,840 INFO L87 Difference]: Start difference. First operand 291 states and 326 transitions. Second operand has 27 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 15 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 12 states have call predecessors, (26), 13 states have call successors, (26) [2023-12-25 00:55:40,925 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-12-25 00:55:57,605 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 [0] [2023-12-25 00:56:01,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:56:16,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:56:24,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.59s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:56:46,074 WARN L293 SmtUtils]: Spent 7.77s on a formula simplification that was a NOOP. DAG size: 42 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 00:56:48,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-25 00:57:18,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:57:18,434 INFO L93 Difference]: Finished difference Result 344 states and 408 transitions. [2023-12-25 00:57:18,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2023-12-25 00:57:18,440 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 15 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 12 states have call predecessors, (26), 13 states have call successors, (26) Word has length 86 [2023-12-25 00:57:18,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:57:18,441 INFO L225 Difference]: With dead ends: 344 [2023-12-25 00:57:18,441 INFO L226 Difference]: Without dead ends: 342 [2023-12-25 00:57:18,442 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 84.6s TimeCoverageRelationStatistics Valid=538, Invalid=1718, Unknown=0, NotChecked=0, Total=2256 [2023-12-25 00:57:18,442 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 122 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 107 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.1s IncrementalHoareTripleChecker+Time [2023-12-25 00:57:18,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 399 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 485 Invalid, 3 Unknown, 0 Unchecked, 44.1s Time] [2023-12-25 00:57:18,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2023-12-25 00:57:18,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 329. [2023-12-25 00:57:18,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 211 states have (on average 1.1184834123222749) internal successors, (236), 216 states have internal predecessors, (236), 77 states have call successors, (77), 40 states have call predecessors, (77), 40 states have return successors, (76), 72 states have call predecessors, (76), 76 states have call successors, (76) [2023-12-25 00:57:18,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 389 transitions. [2023-12-25 00:57:18,498 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 389 transitions. Word has length 86 [2023-12-25 00:57:18,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:57:18,498 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 389 transitions. [2023-12-25 00:57:18,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 1.88) internal successors, (47), 25 states have internal predecessors, (47), 15 states have call successors, (28), 3 states have call predecessors, (28), 2 states have return successors, (26), 12 states have call predecessors, (26), 13 states have call successors, (26) [2023-12-25 00:57:18,498 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 389 transitions. [2023-12-25 00:57:18,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2023-12-25 00:57:18,499 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:57:18,499 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:57:18,512 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 (15)] Forceful destruction successful, exit code 0 [2023-12-25 00:57:18,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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 00:57:18,708 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:57:18,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:57:18,709 INFO L85 PathProgramCache]: Analyzing trace with hash 539000671, now seen corresponding path program 1 times [2023-12-25 00:57:18,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:57:18,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51371539] [2023-12-25 00:57:18,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-25 00:57:18,709 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 00:57:18,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:57:18,710 INFO L229 MonitoredProcess]: Starting monitored process 16 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 00:57:18,711 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 (16)] Waiting until timeout for monitored process [2023-12-25 00:57:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-25 00:57:19,068 INFO L262 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-25 00:57:19,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:57:19,318 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 40 proven. 460 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2023-12-25 00:57:19,318 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:57:19,598 INFO L134 CoverageAnalysis]: Checked inductivity of 560 backedges. 40 proven. 40 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-25 00:57:19,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:57:19,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51371539] [2023-12-25 00:57:19,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51371539] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:57:19,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:57:19,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2023-12-25 00:57:19,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479732419] [2023-12-25 00:57:19,599 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:57:19,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-12-25 00:57:19,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:57:19,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-12-25 00:57:19,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2023-12-25 00:57:19,600 INFO L87 Difference]: Start difference. First operand 329 states and 389 transitions. Second operand has 18 states, 18 states have (on average 4.388888888888889) internal successors, (79), 18 states have internal predecessors, (79), 13 states have call successors, (33), 8 states have call predecessors, (33), 7 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) [2023-12-25 00:57:26,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 00:57:26,945 INFO L93 Difference]: Finished difference Result 746 states and 908 transitions. [2023-12-25 00:57:26,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-25 00:57:26,954 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.388888888888889) internal successors, (79), 18 states have internal predecessors, (79), 13 states have call successors, (33), 8 states have call predecessors, (33), 7 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) Word has length 113 [2023-12-25 00:57:26,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 00:57:26,957 INFO L225 Difference]: With dead ends: 746 [2023-12-25 00:57:26,957 INFO L226 Difference]: Without dead ends: 669 [2023-12-25 00:57:26,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=564, Unknown=0, NotChecked=0, Total=756 [2023-12-25 00:57:26,959 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 159 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2023-12-25 00:57:26,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 682 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2023-12-25 00:57:26,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2023-12-25 00:57:27,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 661. [2023-12-25 00:57:27,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 424 states have (on average 1.1061320754716981) internal successors, (469), 429 states have internal predecessors, (469), 157 states have call successors, (157), 79 states have call predecessors, (157), 79 states have return successors, (156), 152 states have call predecessors, (156), 156 states have call successors, (156) [2023-12-25 00:57:27,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 782 transitions. [2023-12-25 00:57:27,043 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 782 transitions. Word has length 113 [2023-12-25 00:57:27,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 00:57:27,044 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 782 transitions. [2023-12-25 00:57:27,044 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.388888888888889) internal successors, (79), 18 states have internal predecessors, (79), 13 states have call successors, (33), 8 states have call predecessors, (33), 7 states have return successors, (32), 12 states have call predecessors, (32), 12 states have call successors, (32) [2023-12-25 00:57:27,044 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 782 transitions. [2023-12-25 00:57:27,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-25 00:57:27,046 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 00:57:27,046 INFO L195 NwaCegarLoop]: trace histogram [23, 22, 22, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 00:57:27,061 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 (16)] Forceful destruction successful, exit code 0 [2023-12-25 00:57:27,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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 00:57:27,259 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 00:57:27,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 00:57:27,259 INFO L85 PathProgramCache]: Analyzing trace with hash -780131924, now seen corresponding path program 2 times [2023-12-25 00:57:27,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 00:57:27,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [961081310] [2023-12-25 00:57:27,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-25 00:57:27,260 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 00:57:27,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 00:57:27,261 INFO L229 MonitoredProcess]: Starting monitored process 17 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 00:57:27,262 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 (17)] Waiting until timeout for monitored process [2023-12-25 00:57:27,563 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-25 00:57:27,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 00:57:27,594 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 32 conjunts are in the unsatisfiable core [2023-12-25 00:57:27,597 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 00:57:28,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1042 backedges. 584 proven. 26 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2023-12-25 00:57:28,466 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-25 00:58:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 1042 backedges. 199 proven. 174 refuted. 0 times theorem prover too weak. 669 trivial. 0 not checked. [2023-12-25 00:58:38,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-25 00:58:38,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [961081310] [2023-12-25 00:58:38,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [961081310] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-25 00:58:38,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-25 00:58:38,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 28 [2023-12-25 00:58:38,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510912126] [2023-12-25 00:58:38,520 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-25 00:58:38,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-25 00:58:38,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-25 00:58:38,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-25 00:58:38,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=654, Unknown=0, NotChecked=0, Total=756 [2023-12-25 00:58:38,521 INFO L87 Difference]: Start difference. First operand 661 states and 782 transitions. Second operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 22 states have internal predecessors, (57), 14 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (36), 19 states have call predecessors, (36), 14 states have call successors, (36) [2023-12-25 00:58:59,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-25 00:59:33,939 WARN L293 SmtUtils]: Spent 6.08s on a formula simplification. DAG size of input: 80 DAG size of output: 76 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:00:15,939 WARN L293 SmtUtils]: Spent 7.06s on a formula simplification. DAG size of input: 70 DAG size of output: 68 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:00:28,365 WARN L293 SmtUtils]: Spent 5.44s on a formula simplification. DAG size of input: 68 DAG size of output: 64 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:01:20,595 WARN L293 SmtUtils]: Spent 11.75s on a formula simplification. DAG size of input: 73 DAG size of output: 71 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:01:34,122 WARN L293 SmtUtils]: Spent 6.51s on a formula simplification. DAG size of input: 62 DAG size of output: 58 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-12-25 01:01:43,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-25 01:01:43,367 INFO L93 Difference]: Finished difference Result 1117 states and 1344 transitions. [2023-12-25 01:01:43,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-12-25 01:01:43,377 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 22 states have internal predecessors, (57), 14 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (36), 19 states have call predecessors, (36), 14 states have call successors, (36) Word has length 142 [2023-12-25 01:01:43,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-25 01:01:43,380 INFO L225 Difference]: With dead ends: 1117 [2023-12-25 01:01:43,380 INFO L226 Difference]: Without dead ends: 660 [2023-12-25 01:01:43,381 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 185.7s TimeCoverageRelationStatistics Valid=392, Invalid=2058, Unknown=0, NotChecked=0, Total=2450 [2023-12-25 01:01:43,381 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 198 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 535 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.7s IncrementalHoareTripleChecker+Time [2023-12-25 01:01:43,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 535 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 42.7s Time] [2023-12-25 01:01:43,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2023-12-25 01:01:43,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 643. [2023-12-25 01:01:43,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 409 states have (on average 1.1051344743276283) internal successors, (452), 414 states have internal predecessors, (452), 166 states have call successors, (166), 67 states have call predecessors, (166), 67 states have return successors, (165), 161 states have call predecessors, (165), 165 states have call successors, (165) [2023-12-25 01:01:43,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 783 transitions. [2023-12-25 01:01:43,485 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 783 transitions. Word has length 142 [2023-12-25 01:01:43,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-25 01:01:43,485 INFO L495 AbstractCegarLoop]: Abstraction has 643 states and 783 transitions. [2023-12-25 01:01:43,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 22 states have internal predecessors, (57), 14 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (36), 19 states have call predecessors, (36), 14 states have call successors, (36) [2023-12-25 01:01:43,485 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 783 transitions. [2023-12-25 01:01:43,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2023-12-25 01:01:43,487 INFO L187 NwaCegarLoop]: Found error trace [2023-12-25 01:01:43,487 INFO L195 NwaCegarLoop]: trace histogram [30, 29, 29, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:01:43,514 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 (17)] Forceful destruction successful, exit code 0 [2023-12-25 01:01:43,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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 01:01:43,704 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-25 01:01:43,705 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-25 01:01:43,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1565013239, now seen corresponding path program 3 times [2023-12-25 01:01:43,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-25 01:01:43,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [444226569] [2023-12-25 01:01:43,705 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-25 01:01:43,705 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 01:01:43,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-25 01:01:43,706 INFO L229 MonitoredProcess]: Starting monitored process 18 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 01:01:43,707 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 (18)] Waiting until timeout for monitored process [2023-12-25 01:01:45,173 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2023-12-25 01:01:45,173 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-25 01:01:45,217 INFO L262 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-25 01:01:45,220 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-25 01:01:47,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1844 backedges. 215 proven. 167 refuted. 0 times theorem prover too weak. 1462 trivial. 0 not checked. [2023-12-25 01:01:47,339 INFO L327 TraceCheckSpWp]: Computing backward predicates... Received shutdown request... [2023-12-25 01:04:07,026 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 01:04:07,035 WARN L340 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 (18)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-25 01:04:07,279 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-25 01:04:07,295 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 (18)] Forceful destruction successful, exit code 0 [2023-12-25 01:04:07,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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 01:04:07,480 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 183 with TraceHistMax 30,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 31 known predicates. [2023-12-25 01:04:07,484 INFO L445 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-25 01:04:07,485 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-25 01:04:07,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.12 01:04:07 BoogieIcfgContainer [2023-12-25 01:04:07,488 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-25 01:04:07,488 INFO L158 Benchmark]: Toolchain (without parser) took 880897.77ms. Allocated memory was 202.4MB in the beginning and 243.3MB in the end (delta: 40.9MB). Free memory was 162.4MB in the beginning and 160.4MB in the end (delta: 2.0MB). Peak memory consumption was 43.9MB. Max. memory is 8.0GB. [2023-12-25 01:04:07,488 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 202.4MB. Free memory is still 154.0MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-25 01:04:07,490 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.81ms. Allocated memory is still 202.4MB. Free memory was 162.1MB in the beginning and 150.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2023-12-25 01:04:07,491 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.22ms. Allocated memory is still 202.4MB. Free memory was 150.5MB in the beginning and 148.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 01:04:07,491 INFO L158 Benchmark]: Boogie Preprocessor took 23.92ms. Allocated memory is still 202.4MB. Free memory was 148.8MB in the beginning and 147.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-25 01:04:07,491 INFO L158 Benchmark]: RCFGBuilder took 321.73ms. Allocated memory is still 202.4MB. Free memory was 147.0MB in the beginning and 134.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-25 01:04:07,491 INFO L158 Benchmark]: TraceAbstraction took 880337.80ms. Allocated memory was 202.4MB in the beginning and 243.3MB in the end (delta: 40.9MB). Free memory was 133.4MB in the beginning and 160.4MB in the end (delta: -27.0MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. [2023-12-25 01:04:07,492 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 202.4MB. Free memory is still 154.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 185.81ms. Allocated memory is still 202.4MB. Free memory was 162.1MB in the beginning and 150.5MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.22ms. Allocated memory is still 202.4MB. Free memory was 150.5MB in the beginning and 148.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.92ms. Allocated memory is still 202.4MB. Free memory was 148.8MB in the beginning and 147.0MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 321.73ms. Allocated memory is still 202.4MB. Free memory was 147.0MB in the beginning and 134.1MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 880337.80ms. Allocated memory was 202.4MB in the beginning and 243.3MB in the end (delta: 40.9MB). Free memory was 133.4MB in the beginning and 160.4MB in the end (delta: -27.0MB). Peak memory consumption was 14.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 17]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 17). Cancelled while NwaCegarLoop was analyzing trace of length 183 with TraceHistMax 30,while TraceCheckSpWp was constructing backward predicates,while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 31 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 880.3s, OverallIterations: 17, TraceHistogramMax: 30, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 541.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 41 mSolverCounterUnknown, 1161 SdHoareTripleChecker+Valid, 323.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1088 mSDsluCounter, 3435 SdHoareTripleChecker+Invalid, 315.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2886 mSDsCounter, 815 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3081 IncrementalHoareTripleChecker+Invalid, 3937 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 815 mSolverCounterUnsat, 549 mSDtfsCounter, 3081 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1501 GetRequests, 1230 SyntacticMatches, 0 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1629 ImplicationChecksByTransitivity, 330.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=661occurred in iteration=15, InterpolantAutomatonStates: 210, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 123 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.1s SatisfiabilityAnalysisTime, 189.0s InterpolantComputationTime, 769 NumberOfCodeBlocks, 769 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1394 ConstructedInterpolants, 80 QuantifiedInterpolants, 7524 SizeOfPredicates, 67 NumberOfNonLiveVariables, 1373 ConjunctsInSsa, 179 ConjunctsInUnsatCore, 25 InterpolantComputations, 7 PerfectInterpolantSequences, 4308/5256 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown