/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/loops/count_up_down-1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 16:23:59,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 16:23:59,087 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-16 16:23:59,090 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 16:23:59,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 16:23:59,104 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 16:23:59,104 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 16:23:59,104 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 16:23:59,105 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 16:23:59,105 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 16:23:59,105 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 16:23:59,105 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 16:23:59,106 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 16:23:59,106 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 16:23:59,106 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 16:23:59,107 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 16:23:59,107 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 16:23:59,107 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 16:23:59,107 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 16:23:59,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 16:23:59,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 16:23:59,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 16:23:59,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 16:23:59,108 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 16:23:59,109 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 16:23:59,109 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 16:23:59,109 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 16:23:59,109 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 16:23:59,109 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 16:23:59,109 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 16:23:59,110 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 16:23:59,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 16:23:59,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 16:23:59,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 16:23:59,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:23:59,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 16:23:59,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 16:23:59,111 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 16:23:59,111 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 16:23:59,111 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 16:23:59,111 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 16:23:59,112 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 16:23:59,112 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 16:23:59,112 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 16:23:59,112 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 16:23:59,112 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 16:23:59,112 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-16 16:23:59,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 16:23:59,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 16:23:59,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 16:23:59,326 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 16:23:59,326 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 16:23:59,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/count_up_down-1.c [2023-12-16 16:24:00,547 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 16:24:00,718 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 16:24:00,719 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/count_up_down-1.c [2023-12-16 16:24:00,723 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca8efe4a1/3c07486fc7b549b187ec0ca41e61e702/FLAG3002f8fa8 [2023-12-16 16:24:00,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca8efe4a1/3c07486fc7b549b187ec0ca41e61e702 [2023-12-16 16:24:00,745 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 16:24:00,746 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 16:24:00,747 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 16:24:00,747 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 16:24:00,757 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 16:24:00,757 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:24:00" (1/1) ... [2023-12-16 16:24:00,758 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@47f2bf25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:00, skipping insertion in model container [2023-12-16 16:24:00,758 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 04:24:00" (1/1) ... [2023-12-16 16:24:00,771 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 16:24:00,883 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/count_up_down-1.c[327,340] [2023-12-16 16:24:00,894 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:24:00,903 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 16:24:00,912 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/count_up_down-1.c[327,340] [2023-12-16 16:24:00,914 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 16:24:00,928 INFO L206 MainTranslator]: Completed translation [2023-12-16 16:24:00,928 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:00 WrapperNode [2023-12-16 16:24:00,928 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 16:24:00,929 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 16:24:00,929 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 16:24:00,929 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 16:24:00,934 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:00" (1/1) ... [2023-12-16 16:24:00,940 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:00" (1/1) ... [2023-12-16 16:24:00,953 INFO L138 Inliner]: procedures = 13, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 31 [2023-12-16 16:24:00,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 16:24:00,954 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 16:24:00,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 16:24:00,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 16:24:00,961 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:00" (1/1) ... [2023-12-16 16:24:00,961 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:00" (1/1) ... [2023-12-16 16:24:00,962 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:00" (1/1) ... [2023-12-16 16:24:00,976 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-16 16:24:00,976 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:00" (1/1) ... [2023-12-16 16:24:00,976 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:00" (1/1) ... [2023-12-16 16:24:00,979 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:00" (1/1) ... [2023-12-16 16:24:00,981 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:00" (1/1) ... [2023-12-16 16:24:00,982 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:00" (1/1) ... [2023-12-16 16:24:00,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:00" (1/1) ... [2023-12-16 16:24:00,983 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 16:24:00,984 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 16:24:00,984 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 16:24:00,984 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 16:24:00,985 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:00" (1/1) ... [2023-12-16 16:24:00,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 16:24:00,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 16:24:01,009 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-16 16:24:01,014 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-16 16:24:01,032 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 16:24:01,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 16:24:01,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 16:24:01,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 16:24:01,074 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 16:24:01,076 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 16:24:01,192 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 16:24:01,214 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 16:24:01,214 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 16:24:01,214 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:24:01 BoogieIcfgContainer [2023-12-16 16:24:01,215 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 16:24:01,217 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 16:24:01,217 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 16:24:01,220 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 16:24:01,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 04:24:00" (1/3) ... [2023-12-16 16:24:01,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374ac6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:24:01, skipping insertion in model container [2023-12-16 16:24:01,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 04:24:00" (2/3) ... [2023-12-16 16:24:01,221 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@374ac6f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 04:24:01, skipping insertion in model container [2023-12-16 16:24:01,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 04:24:01" (3/3) ... [2023-12-16 16:24:01,222 INFO L112 eAbstractionObserver]: Analyzing ICFG count_up_down-1.c [2023-12-16 16:24:01,234 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 16:24:01,234 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 16:24:01,272 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 16:24:01,277 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;@64476f53, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 16:24:01,277 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 16:24:01,281 INFO L276 IsEmpty]: Start isEmpty. Operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:24:01,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2023-12-16 16:24:01,286 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:24:01,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2023-12-16 16:24:01,287 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:24:01,292 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:24:01,292 INFO L85 PathProgramCache]: Analyzing trace with hash 57541414, now seen corresponding path program 1 times [2023-12-16 16:24:01,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:24:01,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [340593231] [2023-12-16 16:24:01,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:24:01,301 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-16 16:24:01,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:24:01,303 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-16 16:24:01,304 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-16 16:24:01,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:24:01,355 INFO L262 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 16:24:01,362 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:24:01,541 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-16 16:24:01,541 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 16:24:01,542 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:24:01,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [340593231] [2023-12-16 16:24:01,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [340593231] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 16:24:01,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 16:24:01,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-16 16:24:01,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664130132] [2023-12-16 16:24:01,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 16:24:01,549 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-16 16:24:01,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:24:01,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-16 16:24:01,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-12-16 16:24:01,575 INFO L87 Difference]: Start difference. First operand has 8 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:24:01,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:24:01,638 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2023-12-16 16:24:01,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-16 16:24:01,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2023-12-16 16:24:01,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:24:01,647 INFO L225 Difference]: With dead ends: 18 [2023-12-16 16:24:01,648 INFO L226 Difference]: Without dead ends: 7 [2023-12-16 16:24:01,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 16:24:01,654 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 6 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:24:01,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 10 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:24:01,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2023-12-16 16:24:01,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2023-12-16 16:24:01,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:24:01,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2023-12-16 16:24:01,676 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2023-12-16 16:24:01,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:24:01,677 INFO L495 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2023-12-16 16:24:01,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.0) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:24:01,677 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2023-12-16 16:24:01,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-12-16 16:24:01,678 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:24:01,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-12-16 16:24:01,687 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 (2)] Ended with exit code 0 [2023-12-16 16:24:01,880 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-16 16:24:01,881 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:24:01,881 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:24:01,881 INFO L85 PathProgramCache]: Analyzing trace with hash 1785449205, now seen corresponding path program 1 times [2023-12-16 16:24:01,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:24:01,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874662356] [2023-12-16 16:24:01,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 16:24:01,882 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-16 16:24:01,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:24:01,883 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-16 16:24:01,887 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-16 16:24:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 16:24:01,912 INFO L262 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-16 16:24:01,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:24:02,003 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:24:02,004 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:24:02,084 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:24:02,085 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:24:02,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874662356] [2023-12-16 16:24:02,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1874662356] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:24:02,085 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:24:02,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2023-12-16 16:24:02,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298898] [2023-12-16 16:24:02,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:24:02,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-16 16:24:02,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:24:02,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-16 16:24:02,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2023-12-16 16:24:02,087 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:24:02,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:24:02,208 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2023-12-16 16:24:02,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-16 16:24:02,210 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-12-16 16:24:02,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:24:02,211 INFO L225 Difference]: With dead ends: 16 [2023-12-16 16:24:02,211 INFO L226 Difference]: Without dead ends: 10 [2023-12-16 16:24:02,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2023-12-16 16:24:02,212 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 10 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:24:02,213 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 10 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 16:24:02,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2023-12-16 16:24:02,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2023-12-16 16:24:02,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:24:02,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2023-12-16 16:24:02,216 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2023-12-16 16:24:02,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:24:02,216 INFO L495 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2023-12-16 16:24:02,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.1) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:24:02,216 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2023-12-16 16:24:02,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-12-16 16:24:02,217 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:24:02,217 INFO L195 NwaCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2023-12-16 16:24:02,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 16:24:02,418 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-16 16:24:02,419 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:24:02,419 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:24:02,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1198981402, now seen corresponding path program 2 times [2023-12-16 16:24:02,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:24:02,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [98066319] [2023-12-16 16:24:02,420 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 16:24:02,420 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-16 16:24:02,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:24:02,421 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-16 16:24:02,428 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-16 16:24:02,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 16:24:02,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:24:02,443 INFO L262 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 15 conjunts are in the unsatisfiable core [2023-12-16 16:24:02,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:24:02,616 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:24:02,616 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:24:02,813 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:24:02,813 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:24:02,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [98066319] [2023-12-16 16:24:02,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [98066319] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:24:02,814 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:24:02,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-12-16 16:24:02,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188487580] [2023-12-16 16:24:02,814 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:24:02,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-12-16 16:24:02,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:24:02,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-12-16 16:24:02,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2023-12-16 16:24:02,816 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 16 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:24:03,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:24:03,173 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2023-12-16 16:24:03,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 16:24:03,174 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-12-16 16:24:03,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:24:03,174 INFO L225 Difference]: With dead ends: 22 [2023-12-16 16:24:03,174 INFO L226 Difference]: Without dead ends: 16 [2023-12-16 16:24:03,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2023-12-16 16:24:03,176 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 32 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 16:24:03,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 16 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 16:24:03,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2023-12-16 16:24:03,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2023-12-16 16:24:03,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:24:03,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2023-12-16 16:24:03,180 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2023-12-16 16:24:03,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:24:03,181 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2023-12-16 16:24:03,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.0625) internal successors, (17), 15 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:24:03,181 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2023-12-16 16:24:03,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-12-16 16:24:03,181 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:24:03,181 INFO L195 NwaCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2023-12-16 16:24:03,185 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-16 16:24:03,382 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-16 16:24:03,382 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:24:03,382 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:24:03,382 INFO L85 PathProgramCache]: Analyzing trace with hash 533804166, now seen corresponding path program 3 times [2023-12-16 16:24:03,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:24:03,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966571854] [2023-12-16 16:24:03,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 16:24:03,383 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-16 16:24:03,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:24:03,385 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-16 16:24:03,388 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 16:24:03,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-12-16 16:24:03,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:24:03,442 WARN L260 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-16 16:24:03,444 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:24:03,731 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:24:03,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:24:04,277 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:24:04,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:24:04,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966571854] [2023-12-16 16:24:04,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966571854] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:24:04,278 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:24:04,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2023-12-16 16:24:04,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954409138] [2023-12-16 16:24:04,278 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:24:04,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-12-16 16:24:04,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:24:04,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-12-16 16:24:04,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=578, Unknown=0, NotChecked=0, Total=756 [2023-12-16 16:24:04,280 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:24:06,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:24:06,274 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2023-12-16 16:24:06,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-12-16 16:24:06,275 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-12-16 16:24:06,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:24:06,276 INFO L225 Difference]: With dead ends: 34 [2023-12-16 16:24:06,276 INFO L226 Difference]: Without dead ends: 28 [2023-12-16 16:24:06,276 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=555, Invalid=1251, Unknown=0, NotChecked=0, Total=1806 [2023-12-16 16:24:06,277 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 111 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 16:24:06,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 32 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 16:24:06,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2023-12-16 16:24:06,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2023-12-16 16:24:06,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:24:06,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2023-12-16 16:24:06,288 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 15 [2023-12-16 16:24:06,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:24:06,288 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2023-12-16 16:24:06,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:24:06,288 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2023-12-16 16:24:06,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-12-16 16:24:06,289 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:24:06,289 INFO L195 NwaCegarLoop]: trace histogram [22, 1, 1, 1, 1, 1] [2023-12-16 16:24:06,293 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-16 16:24:06,491 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-16 16:24:06,491 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:24:06,492 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:24:06,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1731758138, now seen corresponding path program 4 times [2023-12-16 16:24:06,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:24:06,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424801110] [2023-12-16 16:24:06,492 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 16:24:06,492 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-16 16:24:06,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:24:06,493 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-16 16:24:06,494 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-16 16:24:06,539 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 16:24:06,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:24:06,542 WARN L260 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 50 conjunts are in the unsatisfiable core [2023-12-16 16:24:06,544 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:24:07,334 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:24:07,334 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:24:08,938 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:24:08,939 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:24:08,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424801110] [2023-12-16 16:24:08,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424801110] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:24:08,939 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:24:08,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 51 [2023-12-16 16:24:08,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31052798] [2023-12-16 16:24:08,939 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:24:08,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2023-12-16 16:24:08,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:24:08,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2023-12-16 16:24:08,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=634, Invalid=2018, Unknown=0, NotChecked=0, Total=2652 [2023-12-16 16:24:08,942 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 52 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:24:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 16:24:19,415 INFO L93 Difference]: Finished difference Result 58 states and 81 transitions. [2023-12-16 16:24:19,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2023-12-16 16:24:19,418 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-12-16 16:24:19,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 16:24:19,418 INFO L225 Difference]: With dead ends: 58 [2023-12-16 16:24:19,419 INFO L226 Difference]: Without dead ends: 52 [2023-12-16 16:24:19,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=1947, Invalid=4215, Unknown=0, NotChecked=0, Total=6162 [2023-12-16 16:24:19,421 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 354 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-12-16 16:24:19,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [354 Valid, 14 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-12-16 16:24:19,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2023-12-16 16:24:19,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2023-12-16 16:24:19,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0196078431372548) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:24:19,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2023-12-16 16:24:19,456 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 27 [2023-12-16 16:24:19,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 16:24:19,457 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2023-12-16 16:24:19,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 51 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 16:24:19,457 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2023-12-16 16:24:19,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2023-12-16 16:24:19,458 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 16:24:19,458 INFO L195 NwaCegarLoop]: trace histogram [46, 1, 1, 1, 1, 1] [2023-12-16 16:24:19,463 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-16 16:24:19,658 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-16 16:24:19,659 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 16:24:19,659 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 16:24:19,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1667456582, now seen corresponding path program 5 times [2023-12-16 16:24:19,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 16:24:19,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67802859] [2023-12-16 16:24:19,659 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 16:24:19,660 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-16 16:24:19,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 16:24:19,661 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-16 16:24:19,662 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-16 16:24:19,783 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 24 check-sat command(s) [2023-12-16 16:24:19,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 16:24:19,787 WARN L260 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 98 conjunts are in the unsatisfiable core [2023-12-16 16:24:19,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 16:24:21,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:24:21,918 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 16:24:27,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1081 backedges. 0 proven. 1081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 16:24:27,742 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 16:24:27,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67802859] [2023-12-16 16:24:27,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67802859] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 16:24:27,742 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 16:24:27,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 50] total 99 [2023-12-16 16:24:27,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876674861] [2023-12-16 16:24:27,743 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 16:24:27,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 100 states [2023-12-16 16:24:27,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 16:24:27,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2023-12-16 16:24:27,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2410, Invalid=7490, Unknown=0, NotChecked=0, Total=9900 [2023-12-16 16:24:27,749 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 100 states, 100 states have (on average 1.01) internal successors, (101), 99 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Received shutdown request... [2023-12-16 16:25:17,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2023-12-16 16:25:17,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 461 ImplicationChecksByTransitivity, 54.8s TimeCoverageRelationStatistics Valid=4523, Invalid=10483, Unknown=0, NotChecked=0, Total=15006 [2023-12-16 16:25:17,958 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 766 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2568 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 2741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 2568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-12-16 16:25:17,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 0 Invalid, 2741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 2568 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-12-16 16:25:17,960 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 16:25:17,963 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 (7)] Ended with exit code 0 [2023-12-16 16:25:17,982 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-16 16:25:17,982 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 (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 16:25:18,164 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-16 16:25:18,164 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (52states) and FLOYD_HOARE automaton (currently 72 states, 100 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 123 known predicates. [2023-12-16 16:25:18,168 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1] [2023-12-16 16:25:18,170 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 16:25:18,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 04:25:18 BoogieIcfgContainer [2023-12-16 16:25:18,172 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 16:25:18,172 INFO L158 Benchmark]: Toolchain (without parser) took 77425.99ms. Allocated memory was 309.3MB in the beginning and 386.9MB in the end (delta: 77.6MB). Free memory was 253.8MB in the beginning and 251.3MB in the end (delta: 2.5MB). Peak memory consumption was 80.7MB. Max. memory is 8.0GB. [2023-12-16 16:25:18,173 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 201.3MB. Free memory is still 148.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 16:25:18,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.27ms. Allocated memory is still 309.3MB. Free memory was 253.2MB in the beginning and 242.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-16 16:25:18,173 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.19ms. Allocated memory is still 309.3MB. Free memory was 242.2MB in the beginning and 241.1MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 16:25:18,173 INFO L158 Benchmark]: Boogie Preprocessor took 29.51ms. Allocated memory is still 309.3MB. Free memory was 241.1MB in the beginning and 239.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 16:25:18,173 INFO L158 Benchmark]: RCFGBuilder took 230.73ms. Allocated memory is still 309.3MB. Free memory was 239.1MB in the beginning and 228.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2023-12-16 16:25:18,174 INFO L158 Benchmark]: TraceAbstraction took 76954.70ms. Allocated memory was 309.3MB in the beginning and 386.9MB in the end (delta: 77.6MB). Free memory was 227.6MB in the beginning and 251.3MB in the end (delta: -23.7MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. [2023-12-16 16:25:18,175 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.15ms. Allocated memory is still 201.3MB. Free memory is still 148.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 181.27ms. Allocated memory is still 309.3MB. Free memory was 253.2MB in the beginning and 242.8MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 24.19ms. Allocated memory is still 309.3MB. Free memory was 242.2MB in the beginning and 241.1MB in the end (delta: 1.1MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.51ms. Allocated memory is still 309.3MB. Free memory was 241.1MB in the beginning and 239.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 230.73ms. Allocated memory is still 309.3MB. Free memory was 239.1MB in the beginning and 228.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 76954.70ms. Allocated memory was 309.3MB in the beginning and 386.9MB in the end (delta: 77.6MB). Free memory was 227.6MB in the beginning and 251.3MB in the end (delta: -23.7MB). Peak memory consumption was 54.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: 7]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 7). Cancelled while NwaCegarLoop was constructing difference of abstraction (52states) and FLOYD_HOARE automaton (currently 72 states, 100 states before enhancement),while PredicateComparison was comparing new predicate (quantifier-free) to 123 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 8 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 76.9s, OverallIterations: 6, TraceHistogramMax: 46, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 63.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1279 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1279 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 537 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3618 IncrementalHoareTripleChecker+Invalid, 4155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 537 mSolverCounterUnsat, 10 mSDtfsCounter, 3618 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 292 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1211 ImplicationChecksByTransitivity, 69.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=5, InterpolantAutomatonStates: 115, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 11.9s InterpolantComputationTime, 113 NumberOfCodeBlocks, 113 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 210 ConstructedInterpolants, 0 QuantifiedInterpolants, 1864 SizeOfPredicates, 24 NumberOfNonLiveVariables, 363 ConjunctsInSsa, 203 ConjunctsInUnsatCore, 11 InterpolantComputations, 1 PerfectInterpolantSequences, 0/2800 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