/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/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 01:43:31,883 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 01:43:31,940 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-24 01:43:31,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 01:43:31,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 01:43:31,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 01:43:31,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 01:43:31,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 01:43:31,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 01:43:31,975 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 01:43:31,975 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 01:43:31,975 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 01:43:31,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 01:43:31,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 01:43:31,977 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 01:43:31,977 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 01:43:31,977 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 01:43:31,978 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 01:43:31,978 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 01:43:31,978 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 01:43:31,978 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 01:43:31,979 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 01:43:31,979 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 01:43:31,979 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 01:43:31,979 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 01:43:31,979 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 01:43:31,979 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 01:43:31,980 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 01:43:31,980 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 01:43:31,980 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 01:43:31,981 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 01:43:31,981 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 01:43:31,981 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 01:43:31,981 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 01:43:31,981 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 01:43:31,981 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 01:43:31,981 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 01:43:31,982 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 01:43:31,982 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 01:43:31,982 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 01:43:31,982 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 01:43:31,982 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 01:43:31,983 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 01:43:31,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 01:43:31,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 01:43:31,983 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 01:43:31,983 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-24 01:43:32,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 01:43:32,185 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 01:43:32,188 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 01:43:32,188 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 01:43:32,189 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 01:43:32,190 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i [2023-12-24 01:43:33,306 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 01:43:33,456 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 01:43:33,457 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i [2023-12-24 01:43:33,472 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eacc5dc1/f4d519af1bed4dd4abdd6d95638cf3fb/FLAGb56d37779 [2023-12-24 01:43:33,487 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2eacc5dc1/f4d519af1bed4dd4abdd6d95638cf3fb [2023-12-24 01:43:33,489 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 01:43:33,490 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 01:43:33,491 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 01:43:33,491 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 01:43:33,498 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 01:43:33,498 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:43:33" (1/1) ... [2023-12-24 01:43:33,499 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5beb33b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:43:33, skipping insertion in model container [2023-12-24 01:43:33,499 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 01:43:33" (1/1) ... [2023-12-24 01:43:33,529 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 01:43:33,652 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i[915,928] [2023-12-24 01:43:33,672 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 01:43:33,681 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 01:43:33,689 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_loopvsstraightlinecode_25-while_file-41.i[915,928] [2023-12-24 01:43:33,703 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 01:43:33,714 INFO L206 MainTranslator]: Completed translation [2023-12-24 01:43:33,715 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:43:33 WrapperNode [2023-12-24 01:43:33,715 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 01:43:33,716 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 01:43:33,716 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 01:43:33,716 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 01:43:33,720 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:43:33" (1/1) ... [2023-12-24 01:43:33,728 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:43:33" (1/1) ... [2023-12-24 01:43:33,742 INFO L138 Inliner]: procedures = 27, calls = 29, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2023-12-24 01:43:33,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 01:43:33,743 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 01:43:33,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 01:43:33,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 01:43:33,751 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:43:33" (1/1) ... [2023-12-24 01:43:33,751 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:43:33" (1/1) ... [2023-12-24 01:43:33,753 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:43:33" (1/1) ... [2023-12-24 01:43:33,762 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-24 01:43:33,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:43:33" (1/1) ... [2023-12-24 01:43:33,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:43:33" (1/1) ... [2023-12-24 01:43:33,767 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:43:33" (1/1) ... [2023-12-24 01:43:33,769 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:43:33" (1/1) ... [2023-12-24 01:43:33,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:43:33" (1/1) ... [2023-12-24 01:43:33,771 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:43:33" (1/1) ... [2023-12-24 01:43:33,772 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 01:43:33,773 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 01:43:33,773 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 01:43:33,773 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 01:43:33,774 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:43:33" (1/1) ... [2023-12-24 01:43:33,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 01:43:33,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 01:43:33,797 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-24 01:43:33,804 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-24 01:43:33,833 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 01:43:33,833 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 01:43:33,833 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 01:43:33,835 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 01:43:33,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 01:43:33,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 01:43:33,894 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 01:43:33,896 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 01:43:34,096 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 01:43:34,130 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 01:43:34,131 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 01:43:34,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:43:34 BoogieIcfgContainer [2023-12-24 01:43:34,131 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 01:43:34,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 01:43:34,133 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 01:43:34,135 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 01:43:34,135 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 01:43:33" (1/3) ... [2023-12-24 01:43:34,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca5ac44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:43:34, skipping insertion in model container [2023-12-24 01:43:34,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 01:43:33" (2/3) ... [2023-12-24 01:43:34,136 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ca5ac44 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 01:43:34, skipping insertion in model container [2023-12-24 01:43:34,136 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 01:43:34" (3/3) ... [2023-12-24 01:43:34,137 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_25-while_file-41.i [2023-12-24 01:43:34,149 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 01:43:34,149 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 01:43:34,184 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 01:43:34,189 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;@1ee88108, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 01:43:34,190 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 01:43:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 01:43:34,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-24 01:43:34,200 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:43:34,201 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:43:34,201 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:43:34,205 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:43:34,205 INFO L85 PathProgramCache]: Analyzing trace with hash 1582176197, now seen corresponding path program 1 times [2023-12-24 01:43:34,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:43:34,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1037126444] [2023-12-24 01:43:34,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:43:34,215 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-24 01:43:34,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:43:34,217 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-24 01:43:34,220 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-24 01:43:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:43:34,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 01:43:34,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:43:34,428 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2023-12-24 01:43:34,428 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 01:43:34,429 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:43:34,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1037126444] [2023-12-24 01:43:34,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1037126444] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 01:43:34,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 01:43:34,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 01:43:34,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505621561] [2023-12-24 01:43:34,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:43:34,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 01:43:34,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:43:34,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 01:43:34,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 01:43:34,453 INFO L87 Difference]: Start difference. First operand has 45 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 27 states have internal predecessors, (37), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 01:43:34,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:43:34,477 INFO L93 Difference]: Finished difference Result 86 states and 150 transitions. [2023-12-24 01:43:34,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 01:43:34,480 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2023-12-24 01:43:34,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:43:34,484 INFO L225 Difference]: With dead ends: 86 [2023-12-24 01:43:34,484 INFO L226 Difference]: Without dead ends: 42 [2023-12-24 01:43:34,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 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-24 01:43:34,489 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 01:43:34,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 58 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 01:43:34,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-12-24 01:43:34,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-12-24 01:43:34,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2023-12-24 01:43:34,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 61 transitions. [2023-12-24 01:43:34,523 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 61 transitions. Word has length 99 [2023-12-24 01:43:34,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:43:34,523 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 61 transitions. [2023-12-24 01:43:34,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 1 states have call successors, (16), 1 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 01:43:34,524 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 61 transitions. [2023-12-24 01:43:34,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-24 01:43:34,528 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:43:34,528 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:43:34,532 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-24 01:43:34,733 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-24 01:43:34,734 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:43:34,734 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:43:34,734 INFO L85 PathProgramCache]: Analyzing trace with hash 509933509, now seen corresponding path program 1 times [2023-12-24 01:43:34,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:43:34,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [53509130] [2023-12-24 01:43:34,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:43:34,735 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-24 01:43:34,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:43:34,736 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-24 01:43:34,764 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-24 01:43:34,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:43:34,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-24 01:43:34,913 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:43:49,802 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 338 proven. 45 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-12-24 01:43:49,802 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:44:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 01:44:24,948 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:44:24,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [53509130] [2023-12-24 01:44:24,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [53509130] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 01:44:24,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 01:44:24,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [22] total 27 [2023-12-24 01:44:24,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106338470] [2023-12-24 01:44:24,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:44:24,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 01:44:24,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:44:24,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 01:44:24,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2023-12-24 01:44:24,951 INFO L87 Difference]: Start difference. First operand 42 states and 61 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 01:44:26,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:44:26,324 INFO L93 Difference]: Finished difference Result 103 states and 138 transitions. [2023-12-24 01:44:26,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 01:44:26,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2023-12-24 01:44:26,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:44:26,331 INFO L225 Difference]: With dead ends: 103 [2023-12-24 01:44:26,331 INFO L226 Difference]: Without dead ends: 101 [2023-12-24 01:44:26,332 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2023-12-24 01:44:26,334 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 75 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 01:44:26,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 324 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 01:44:26,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-24 01:44:26,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 83. [2023-12-24 01:44:26,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.2264150943396226) internal successors, (65), 55 states have internal predecessors, (65), 26 states have call successors, (26), 3 states have call predecessors, (26), 3 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2023-12-24 01:44:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 117 transitions. [2023-12-24 01:44:26,357 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 117 transitions. Word has length 99 [2023-12-24 01:44:26,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:44:26,358 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 117 transitions. [2023-12-24 01:44:26,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 01:44:26,358 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 117 transitions. [2023-12-24 01:44:26,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-24 01:44:26,359 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:44:26,359 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:44:26,364 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-24 01:44:26,560 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-24 01:44:26,562 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:44:26,563 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:44:26,563 INFO L85 PathProgramCache]: Analyzing trace with hash -2010026425, now seen corresponding path program 1 times [2023-12-24 01:44:26,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:44:26,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485201536] [2023-12-24 01:44:26,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:44:26,572 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-24 01:44:26,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:44:26,573 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-24 01:44:26,574 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-24 01:44:26,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:44:26,658 INFO L262 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 01:44:26,664 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:44:38,267 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 253 proven. 24 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2023-12-24 01:44:38,268 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:45:12,074 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-24 01:45:12,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:45:12,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485201536] [2023-12-24 01:45:12,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485201536] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 01:45:12,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 01:45:12,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2023-12-24 01:45:12,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586174796] [2023-12-24 01:45:12,085 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 01:45:12,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 01:45:12,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:45:12,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 01:45:12,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-24 01:45:12,087 INFO L87 Difference]: Start difference. First operand 83 states and 117 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-24 01:45:12,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:45:12,685 INFO L93 Difference]: Finished difference Result 201 states and 271 transitions. [2023-12-24 01:45:12,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-12-24 01:45:12,688 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 99 [2023-12-24 01:45:12,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:45:12,690 INFO L225 Difference]: With dead ends: 201 [2023-12-24 01:45:12,690 INFO L226 Difference]: Without dead ends: 119 [2023-12-24 01:45:12,691 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 184 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2023-12-24 01:45:12,692 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 109 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 01:45:12,692 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 269 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 01:45:12,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-12-24 01:45:12,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 88. [2023-12-24 01:45:12,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 56 states have internal predecessors, (62), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 01:45:12,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 118 transitions. [2023-12-24 01:45:12,718 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 118 transitions. Word has length 99 [2023-12-24 01:45:12,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:45:12,719 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 118 transitions. [2023-12-24 01:45:12,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-24 01:45:12,719 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 118 transitions. [2023-12-24 01:45:12,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-24 01:45:12,720 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:45:12,720 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:45:12,725 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 (4)] Forceful destruction successful, exit code 0 [2023-12-24 01:45:12,924 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-24 01:45:12,924 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:45:12,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:45:12,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1189991879, now seen corresponding path program 1 times [2023-12-24 01:45:12,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:45:12,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274461264] [2023-12-24 01:45:12,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:45:12,928 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-24 01:45:12,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:45:12,929 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-24 01:45:12,956 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-24 01:45:13,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:45:13,100 INFO L262 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 25 conjunts are in the unsatisfiable core [2023-12-24 01:45:13,103 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:45:57,457 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 338 proven. 45 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2023-12-24 01:45:57,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:46:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 01:46:38,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:46:38,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274461264] [2023-12-24 01:46:38,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274461264] provided 1 perfect and 1 imperfect interpolant sequences [2023-12-24 01:46:38,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-12-24 01:46:38,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [22] total 27 [2023-12-24 01:46:38,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406730471] [2023-12-24 01:46:38,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:46:38,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 01:46:38,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:46:38,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 01:46:38,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2023-12-24 01:46:38,121 INFO L87 Difference]: Start difference. First operand 88 states and 118 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 01:46:38,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:46:38,692 INFO L93 Difference]: Finished difference Result 108 states and 141 transitions. [2023-12-24 01:46:38,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-24 01:46:38,692 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 99 [2023-12-24 01:46:38,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:46:38,693 INFO L225 Difference]: With dead ends: 108 [2023-12-24 01:46:38,694 INFO L226 Difference]: Without dead ends: 106 [2023-12-24 01:46:38,694 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 262 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=168, Invalid=824, Unknown=0, NotChecked=0, Total=992 [2023-12-24 01:46:38,695 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 38 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 01:46:38,695 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 221 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 01:46:38,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2023-12-24 01:46:38,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 96. [2023-12-24 01:46:38,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 62 states have (on average 1.1612903225806452) internal successors, (72), 64 states have internal predecessors, (72), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 01:46:38,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 128 transitions. [2023-12-24 01:46:38,715 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 128 transitions. Word has length 99 [2023-12-24 01:46:38,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:46:38,715 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 128 transitions. [2023-12-24 01:46:38,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 01:46:38,715 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 128 transitions. [2023-12-24 01:46:38,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2023-12-24 01:46:38,717 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:46:38,717 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:46:38,735 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-24 01:46:38,921 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-24 01:46:38,921 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:46:38,922 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:46:38,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1329968055, now seen corresponding path program 1 times [2023-12-24 01:46:38,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:46:38,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [21077517] [2023-12-24 01:46:38,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:46:38,922 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-24 01:46:38,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:46:38,923 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-24 01:46:38,925 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-24 01:46:39,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:46:39,009 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-24 01:46:39,012 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:47:20,317 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 253 proven. 24 refuted. 0 times theorem prover too weak. 203 trivial. 0 not checked. [2023-12-24 01:47:20,317 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 01:47:57,722 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 21 proven. 24 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2023-12-24 01:47:57,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:47:57,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [21077517] [2023-12-24 01:47:57,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [21077517] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 01:47:57,724 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 01:47:57,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2023-12-24 01:47:57,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526573619] [2023-12-24 01:47:57,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 01:47:57,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-24 01:47:57,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:47:57,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-24 01:47:57,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2023-12-24 01:47:57,730 INFO L87 Difference]: Start difference. First operand 96 states and 128 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-24 01:47:58,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:47:58,136 INFO L93 Difference]: Finished difference Result 118 states and 150 transitions. [2023-12-24 01:47:58,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-24 01:47:58,136 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 99 [2023-12-24 01:47:58,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:47:58,141 INFO L225 Difference]: With dead ends: 118 [2023-12-24 01:47:58,141 INFO L226 Difference]: Without dead ends: 116 [2023-12-24 01:47:58,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2023-12-24 01:47:58,144 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 56 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-24 01:47:58,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 217 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-24 01:47:58,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-12-24 01:47:58,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 90. [2023-12-24 01:47:58,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 56 states have (on average 1.125) internal successors, (63), 58 states have internal predecessors, (63), 28 states have call successors, (28), 5 states have call predecessors, (28), 5 states have return successors, (28), 26 states have call predecessors, (28), 28 states have call successors, (28) [2023-12-24 01:47:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 119 transitions. [2023-12-24 01:47:58,184 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 119 transitions. Word has length 99 [2023-12-24 01:47:58,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:47:58,185 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 119 transitions. [2023-12-24 01:47:58,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2023-12-24 01:47:58,185 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 119 transitions. [2023-12-24 01:47:58,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2023-12-24 01:47:58,186 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 01:47:58,186 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-24 01:47:58,192 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-24 01:47:58,387 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-24 01:47:58,387 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 01:47:58,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 01:47:58,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1774404021, now seen corresponding path program 1 times [2023-12-24 01:47:58,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 01:47:58,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965841231] [2023-12-24 01:47:58,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 01:47:58,389 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-24 01:47:58,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 01:47:58,390 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-24 01:47:58,391 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-24 01:47:58,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 01:47:58,455 INFO L262 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-24 01:47:58,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 01:47:58,483 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2023-12-24 01:47:58,483 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 01:47:58,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 01:47:58,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965841231] [2023-12-24 01:47:58,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965841231] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 01:47:58,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 01:47:58,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 01:47:58,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083367935] [2023-12-24 01:47:58,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 01:47:58,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-24 01:47:58,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 01:47:58,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-24 01:47:58,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 01:47:58,484 INFO L87 Difference]: Start difference. First operand 90 states and 119 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 01:47:58,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 01:47:58,502 INFO L93 Difference]: Finished difference Result 157 states and 209 transitions. [2023-12-24 01:47:58,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-24 01:47:58,503 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 100 [2023-12-24 01:47:58,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 01:47:58,503 INFO L225 Difference]: With dead ends: 157 [2023-12-24 01:47:58,503 INFO L226 Difference]: Without dead ends: 0 [2023-12-24 01:47:58,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-24 01:47:58,507 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 1 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-24 01:47:58,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 102 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-24 01:47:58,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-24 01:47:58,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-24 01:47:58,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-24 01:47:58,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-24 01:47:58,508 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 100 [2023-12-24 01:47:58,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 01:47:58,508 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-24 01:47:58,508 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2023-12-24 01:47:58,508 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-24 01:47:58,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-24 01:47:58,510 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 01:47:58,528 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-24 01:47:58,711 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-24 01:47:58,713 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-24 01:47:59,528 INFO L895 garLoopResultBuilder]: At program point L64(line 64) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_9~0) (_ bv0 32)) [2023-12-24 01:47:59,528 INFO L895 garLoopResultBuilder]: At program point L64-1(line 64) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_9~0) (_ bv0 32)) [2023-12-24 01:47:59,529 INFO L895 garLoopResultBuilder]: At program point L97-2(lines 97 103) the Hoare annotation is: (let ((.cse0 (= ~var_1_9~0 (_ bv0 8))) (.cse3 (bvneg ~var_1_13~0)) (.cse2 (= ~var_1_8~0 (_ bv0 8))) (.cse1 (= (bvadd (_ bv2 32) ((_ sign_extend 24) ~var_1_7~0)) (_ bv0 32)))) (or (and .cse0 (= ~var_1_1~0 ~var_1_7~0) .cse1 .cse2 (= (bvadd .cse3 ~var_1_14~0) ~var_1_10~0)) (and (bvsle ((_ zero_extend 24) ~var_1_9~0) (_ bv0 32)) (= ~var_1_5~0 (_ bv0 8))) (and .cse0 (= ~var_1_10~0 (bvadd .cse3 ~var_1_11~0 ~var_1_12~0)) .cse2 (not .cse1)))) [2023-12-24 01:47:59,529 INFO L899 garLoopResultBuilder]: For program point L97-3(lines 97 103) no Hoare annotation was computed. [2023-12-24 01:47:59,529 INFO L895 garLoopResultBuilder]: At program point L85(line 85) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_9~0) (_ bv0 32)) [2023-12-24 01:47:59,529 INFO L895 garLoopResultBuilder]: At program point L85-1(line 85) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_9~0) (_ bv0 32)) [2023-12-24 01:47:59,529 INFO L899 garLoopResultBuilder]: For program point L52(lines 52 60) no Hoare annotation was computed. [2023-12-24 01:47:59,529 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-24 01:47:59,529 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-24 01:47:59,529 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-24 01:47:59,529 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-12-24 01:47:59,529 INFO L902 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: true [2023-12-24 01:47:59,529 INFO L902 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: true [2023-12-24 01:47:59,529 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 61) no Hoare annotation was computed. [2023-12-24 01:47:59,529 INFO L899 garLoopResultBuilder]: For program point L65(line 65) no Hoare annotation was computed. [2023-12-24 01:47:59,529 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-24 01:47:59,530 INFO L899 garLoopResultBuilder]: For program point L86(lines 62 87) no Hoare annotation was computed. [2023-12-24 01:47:59,530 INFO L899 garLoopResultBuilder]: For program point L53(lines 53 57) no Hoare annotation was computed. [2023-12-24 01:47:59,530 INFO L895 garLoopResultBuilder]: At program point L82(line 82) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_9~0) (_ bv0 32)) [2023-12-24 01:47:59,530 INFO L895 garLoopResultBuilder]: At program point L82-1(line 82) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_9~0) (_ bv0 32)) [2023-12-24 01:47:59,530 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-24 01:47:59,530 INFO L899 garLoopResultBuilder]: For program point L41(lines 41 45) no Hoare annotation was computed. [2023-12-24 01:47:59,530 INFO L899 garLoopResultBuilder]: For program point L41-2(lines 36 61) no Hoare annotation was computed. [2023-12-24 01:47:59,530 INFO L895 garLoopResultBuilder]: At program point L70(line 70) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_9~0) (_ bv0 32)) [2023-12-24 01:47:59,530 INFO L895 garLoopResultBuilder]: At program point L70-1(line 70) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_9~0) (_ bv0 32)) [2023-12-24 01:47:59,530 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 39) no Hoare annotation was computed. [2023-12-24 01:47:59,530 INFO L899 garLoopResultBuilder]: For program point L37-2(lines 37 39) no Hoare annotation was computed. [2023-12-24 01:47:59,530 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-24 01:47:59,530 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2023-12-24 01:47:59,530 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_9~0) (_ bv0 32)) [2023-12-24 01:47:59,530 INFO L895 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_9~0) (_ bv0 32)) [2023-12-24 01:47:59,530 INFO L899 garLoopResultBuilder]: For program point L46(lines 46 50) no Hoare annotation was computed. [2023-12-24 01:47:59,531 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-24 01:47:59,531 INFO L899 garLoopResultBuilder]: For program point L71(line 71) no Hoare annotation was computed. [2023-12-24 01:47:59,531 INFO L895 garLoopResultBuilder]: At program point L67(line 67) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_9~0) (_ bv0 32)) [2023-12-24 01:47:59,531 INFO L895 garLoopResultBuilder]: At program point L67-1(line 67) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_9~0) (_ bv0 32)) [2023-12-24 01:47:59,531 INFO L899 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2023-12-24 01:47:59,531 INFO L899 garLoopResultBuilder]: For program point L47(lines 47 49) no Hoare annotation was computed. [2023-12-24 01:47:59,531 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_9~0) (_ bv0 32)) [2023-12-24 01:47:59,531 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (bvsle ((_ zero_extend 24) ~var_1_9~0) (_ bv0 32)) [2023-12-24 01:47:59,531 INFO L899 garLoopResultBuilder]: For program point L68(line 68) no Hoare annotation was computed. [2023-12-24 01:47:59,531 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-24 01:47:59,531 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-24 01:47:59,531 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-24 01:47:59,531 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-24 01:47:59,533 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-24 01:47:59,535 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 01:47:59,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 01:47:59 BoogieIcfgContainer [2023-12-24 01:47:59,546 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 01:47:59,546 INFO L158 Benchmark]: Toolchain (without parser) took 266056.09ms. Allocated memory was 191.9MB in the beginning and 1.1GB in the end (delta: 923.8MB). Free memory was 145.3MB in the beginning and 947.1MB in the end (delta: -801.8MB). Peak memory consumption was 655.4MB. Max. memory is 8.0GB. [2023-12-24 01:47:59,546 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 191.9MB. Free memory is still 148.5MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 01:47:59,546 INFO L158 Benchmark]: CACSL2BoogieTranslator took 224.43ms. Allocated memory is still 191.9MB. Free memory was 145.0MB in the beginning and 132.0MB in the end (delta: 13.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-24 01:47:59,547 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.08ms. Allocated memory is still 191.9MB. Free memory was 132.0MB in the beginning and 130.3MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-24 01:47:59,547 INFO L158 Benchmark]: Boogie Preprocessor took 29.04ms. Allocated memory is still 191.9MB. Free memory was 130.3MB in the beginning and 127.8MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 01:47:59,547 INFO L158 Benchmark]: RCFGBuilder took 358.13ms. Allocated memory is still 191.9MB. Free memory was 127.8MB in the beginning and 109.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-24 01:47:59,547 INFO L158 Benchmark]: TraceAbstraction took 265412.80ms. Allocated memory was 191.9MB in the beginning and 1.1GB in the end (delta: 923.8MB). Free memory was 108.3MB in the beginning and 947.1MB in the end (delta: -838.8MB). Peak memory consumption was 618.7MB. Max. memory is 8.0GB. [2023-12-24 01:47:59,549 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.47ms. Allocated memory is still 191.9MB. Free memory is still 148.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 224.43ms. Allocated memory is still 191.9MB. Free memory was 145.0MB in the beginning and 132.0MB in the end (delta: 13.0MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.08ms. Allocated memory is still 191.9MB. Free memory was 132.0MB in the beginning and 130.3MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 29.04ms. Allocated memory is still 191.9MB. Free memory was 130.3MB in the beginning and 127.8MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 358.13ms. Allocated memory is still 191.9MB. Free memory was 127.8MB in the beginning and 109.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 265412.80ms. Allocated memory was 191.9MB in the beginning and 1.1GB in the end (delta: 923.8MB). Free memory was 108.3MB in the beginning and 947.1MB in the end (delta: -838.8MB). Peak memory consumption was 618.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 265.4s, OverallIterations: 6, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 301 SdHoareTripleChecker+Valid, 1.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 279 mSDsluCounter, 1191 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 839 mSDsCounter, 38 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1022 IncrementalHoareTripleChecker+Invalid, 1060 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 38 mSolverCounterUnsat, 352 mSDtfsCounter, 1022 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1012 GetRequests, 907 SyntacticMatches, 3 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 682 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=4, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 85 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 109 PreInvPairs, 133 NumberOfFragments, 111 HoareAnnotationTreeSize, 109 FormulaSimplifications, 11207 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 18 FormulaSimplificationsInter, 5329 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 259.3s InterpolantComputationTime, 595 NumberOfCodeBlocks, 595 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 981 ConstructedInterpolants, 8 QuantifiedInterpolants, 5158 SizeOfPredicates, 99 NumberOfNonLiveVariables, 972 ConjunctsInSsa, 77 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 4614/4800 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: (((((((var_1_9 == 0) && (var_1_1 == var_1_7)) && (((2 + var_1_7) % 4294967296) == 0)) && (var_1_8 == 0)) && (((-(var_1_13) + var_1_14) % 4294967296) == var_1_10)) || ((var_1_9 <= 0) && (var_1_5 == 0))) || ((((var_1_9 == 0) && (var_1_10 == ((-(var_1_13) + var_1_11) % 4294967296))) && (var_1_8 == 0)) && !((((2 + var_1_7) % 4294967296) == 0)))) RESULT: Ultimate proved your program to be correct! [2023-12-24 01:47:59,574 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...