/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_floatingpointinfluence_no-floats_file-64.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-23 20:22:44,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-23 20:22:44,536 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-23 20:22:44,539 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-23 20:22:44,539 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-23 20:22:44,559 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-23 20:22:44,559 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-23 20:22:44,560 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-23 20:22:44,560 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-23 20:22:44,560 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-23 20:22:44,561 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-23 20:22:44,561 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-23 20:22:44,561 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-23 20:22:44,561 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-23 20:22:44,562 INFO L153 SettingsManager]: * Use SBE=true [2023-12-23 20:22:44,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-23 20:22:44,562 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-23 20:22:44,562 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-23 20:22:44,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-23 20:22:44,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-23 20:22:44,563 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-23 20:22:44,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-23 20:22:44,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-23 20:22:44,572 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-23 20:22:44,572 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-23 20:22:44,572 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-23 20:22:44,572 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-23 20:22:44,572 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-23 20:22:44,572 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-23 20:22:44,573 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-23 20:22:44,573 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-23 20:22:44,573 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-23 20:22:44,573 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-23 20:22:44,573 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-23 20:22:44,573 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 20:22:44,573 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-23 20:22:44,574 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-23 20:22:44,574 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-23 20:22:44,574 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-23 20:22:44,574 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-23 20:22:44,574 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-23 20:22:44,575 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-23 20:22:44,575 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-23 20:22:44,575 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-23 20:22:44,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-23 20:22:44,575 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-23 20:22:44,575 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-23 20:22:44,757 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-23 20:22:44,776 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-23 20:22:44,778 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-23 20:22:44,779 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-23 20:22:44,779 INFO L274 PluginConnector]: CDTParser initialized [2023-12-23 20:22:44,781 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-64.i [2023-12-23 20:22:45,869 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-23 20:22:46,023 INFO L384 CDTParser]: Found 1 translation units. [2023-12-23 20:22:46,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_floatingpointinfluence_no-floats_file-64.i [2023-12-23 20:22:46,029 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/482cb43cf/336c49f10bea4b71b2171a5cc7f86dfb/FLAGf296d2763 [2023-12-23 20:22:46,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/482cb43cf/336c49f10bea4b71b2171a5cc7f86dfb [2023-12-23 20:22:46,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-23 20:22:46,041 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-23 20:22:46,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-23 20:22:46,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-23 20:22:46,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-23 20:22:46,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 08:22:46" (1/1) ... [2023-12-23 20:22:46,047 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d9f67a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:22:46, skipping insertion in model container [2023-12-23 20:22:46,047 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.12 08:22:46" (1/1) ... [2023-12-23 20:22:46,063 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-23 20:22:46,153 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_floatingpointinfluence_no-floats_file-64.i[916,929] [2023-12-23 20:22:46,177 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 20:22:46,187 INFO L202 MainTranslator]: Completed pre-run [2023-12-23 20:22:46,195 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_floatingpointinfluence_no-floats_file-64.i[916,929] [2023-12-23 20:22:46,209 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-23 20:22:46,225 INFO L206 MainTranslator]: Completed translation [2023-12-23 20:22:46,225 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:22:46 WrapperNode [2023-12-23 20:22:46,226 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-23 20:22:46,226 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-23 20:22:46,227 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-23 20:22:46,227 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-23 20:22:46,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:22:46" (1/1) ... [2023-12-23 20:22:46,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:22:46" (1/1) ... [2023-12-23 20:22:46,253 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 126 [2023-12-23 20:22:46,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-23 20:22:46,254 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-23 20:22:46,254 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-23 20:22:46,254 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-23 20:22:46,261 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:22:46" (1/1) ... [2023-12-23 20:22:46,262 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:22:46" (1/1) ... [2023-12-23 20:22:46,264 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:22:46" (1/1) ... [2023-12-23 20:22:46,272 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-23 20:22:46,273 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:22:46" (1/1) ... [2023-12-23 20:22:46,273 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:22:46" (1/1) ... [2023-12-23 20:22:46,278 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:22:46" (1/1) ... [2023-12-23 20:22:46,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:22:46" (1/1) ... [2023-12-23 20:22:46,281 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:22:46" (1/1) ... [2023-12-23 20:22:46,282 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:22:46" (1/1) ... [2023-12-23 20:22:46,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-23 20:22:46,285 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-23 20:22:46,285 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-23 20:22:46,285 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-23 20:22:46,286 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:22:46" (1/1) ... [2023-12-23 20:22:46,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-23 20:22:46,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-23 20:22:46,315 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-23 20:22:46,328 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-23 20:22:46,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-23 20:22:46,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-23 20:22:46,335 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-23 20:22:46,337 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-23 20:22:46,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-23 20:22:46,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-23 20:22:46,417 INFO L241 CfgBuilder]: Building ICFG [2023-12-23 20:22:46,418 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-23 20:22:46,740 INFO L282 CfgBuilder]: Performing block encoding [2023-12-23 20:22:46,784 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-23 20:22:46,785 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-23 20:22:46,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 08:22:46 BoogieIcfgContainer [2023-12-23 20:22:46,785 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-23 20:22:46,787 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-23 20:22:46,787 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-23 20:22:46,789 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-23 20:22:46,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.12 08:22:46" (1/3) ... [2023-12-23 20:22:46,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52360eee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 08:22:46, skipping insertion in model container [2023-12-23 20:22:46,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.12 08:22:46" (2/3) ... [2023-12-23 20:22:46,790 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52360eee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.12 08:22:46, skipping insertion in model container [2023-12-23 20:22:46,790 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.12 08:22:46" (3/3) ... [2023-12-23 20:22:46,791 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_no-floats_file-64.i [2023-12-23 20:22:46,807 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-23 20:22:46,807 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-23 20:22:46,839 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-23 20:22:46,845 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;@63b503d2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-23 20:22:46,845 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-23 20:22:46,852 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-23 20:22:46,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-23 20:22:46,901 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 20:22:46,902 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 20:22:46,903 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 20:22:46,927 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 20:22:46,930 INFO L85 PathProgramCache]: Analyzing trace with hash 918318190, now seen corresponding path program 1 times [2023-12-23 20:22:46,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 20:22:46,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678965254] [2023-12-23 20:22:46,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 20:22:46,940 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-23 20:22:46,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 20:22:46,941 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-23 20:22:46,944 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-23 20:22:47,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 20:22:47,153 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-23 20:22:47,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 20:22:47,190 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 286 proven. 0 refuted. 0 times theorem prover too weak. 818 trivial. 0 not checked. [2023-12-23 20:22:47,190 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 20:22:47,191 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 20:22:47,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678965254] [2023-12-23 20:22:47,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678965254] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 20:22:47,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 20:22:47,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-23 20:22:47,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652793389] [2023-12-23 20:22:47,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 20:22:47,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-23 20:22:47,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 20:22:47,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-23 20:22:47,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-23 20:22:47,222 INFO L87 Difference]: Start difference. First operand has 57 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-23 20:22:47,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 20:22:47,274 INFO L93 Difference]: Finished difference Result 111 states and 204 transitions. [2023-12-23 20:22:47,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-23 20:22:47,284 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 141 [2023-12-23 20:22:47,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 20:22:47,292 INFO L225 Difference]: With dead ends: 111 [2023-12-23 20:22:47,292 INFO L226 Difference]: Without dead ends: 55 [2023-12-23 20:22:47,295 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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-23 20:22:47,299 INFO L413 NwaCegarLoop]: 82 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, 82 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-23 20:22:47,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 82 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-23 20:22:47,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2023-12-23 20:22:47,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2023-12-23 20:22:47,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2023-12-23 20:22:47,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 85 transitions. [2023-12-23 20:22:47,341 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 85 transitions. Word has length 141 [2023-12-23 20:22:47,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 20:22:47,342 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 85 transitions. [2023-12-23 20:22:47,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 14.0) internal successors, (28), 2 states have internal predecessors, (28), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-12-23 20:22:47,342 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 85 transitions. [2023-12-23 20:22:47,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-12-23 20:22:47,350 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 20:22:47,350 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 20:22:47,359 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-23 20:22:47,558 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-23 20:22:47,559 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 20:22:47,559 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 20:22:47,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1690443700, now seen corresponding path program 1 times [2023-12-23 20:22:47,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 20:22:47,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1104413784] [2023-12-23 20:22:47,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 20:22:47,561 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-23 20:22:47,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 20:22:47,562 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-23 20:22:47,563 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-23 20:22:47,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 20:22:47,725 INFO L262 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 11 conjunts are in the unsatisfiable core [2023-12-23 20:22:47,732 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 20:22:56,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-23 20:22:56,921 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 20:22:56,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 20:22:56,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1104413784] [2023-12-23 20:22:56,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1104413784] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 20:22:56,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 20:22:56,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-12-23 20:22:56,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667944057] [2023-12-23 20:22:56,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 20:22:56,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-23 20:22:56,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 20:22:56,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-23 20:22:56,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-12-23 20:22:56,924 INFO L87 Difference]: Start difference. First operand 55 states and 85 transitions. Second operand has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-23 20:22:57,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 20:22:57,481 INFO L93 Difference]: Finished difference Result 172 states and 265 transitions. [2023-12-23 20:22:57,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-23 20:22:57,482 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 141 [2023-12-23 20:22:57,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 20:22:57,484 INFO L225 Difference]: With dead ends: 172 [2023-12-23 20:22:57,484 INFO L226 Difference]: Without dead ends: 118 [2023-12-23 20:22:57,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-12-23 20:22:57,486 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 71 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-23 20:22:57,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 345 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-23 20:22:57,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-12-23 20:22:57,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 110. [2023-12-23 20:22:57,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 59 states have internal predecessors, (72), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2023-12-23 20:22:57,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 168 transitions. [2023-12-23 20:22:57,501 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 168 transitions. Word has length 141 [2023-12-23 20:22:57,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 20:22:57,502 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 168 transitions. [2023-12-23 20:22:57,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.0) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-23 20:22:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 168 transitions. [2023-12-23 20:22:57,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-12-23 20:22:57,503 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 20:22:57,504 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 20:22:57,513 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-23 20:22:57,708 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-23 20:22:57,709 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 20:22:57,709 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 20:22:57,709 INFO L85 PathProgramCache]: Analyzing trace with hash -210127823, now seen corresponding path program 1 times [2023-12-23 20:22:57,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 20:22:57,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340149] [2023-12-23 20:22:57,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 20:22:57,710 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-23 20:22:57,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 20:22:57,711 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-23 20:22:57,713 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-23 20:22:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 20:22:57,822 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-23 20:22:57,827 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 20:23:08,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2023-12-23 20:23:08,765 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-23 20:23:08,765 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 20:23:08,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340149] [2023-12-23 20:23:08,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340149] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-23 20:23:08,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-23 20:23:08,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-12-23 20:23:08,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247286744] [2023-12-23 20:23:08,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-23 20:23:08,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-23 20:23:08,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 20:23:08,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-23 20:23:08,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-12-23 20:23:08,767 INFO L87 Difference]: Start difference. First operand 110 states and 168 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-23 20:23:09,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 20:23:09,053 INFO L93 Difference]: Finished difference Result 200 states and 304 transitions. [2023-12-23 20:23:09,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-23 20:23:09,053 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 142 [2023-12-23 20:23:09,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 20:23:09,060 INFO L225 Difference]: With dead ends: 200 [2023-12-23 20:23:09,060 INFO L226 Difference]: Without dead ends: 146 [2023-12-23 20:23:09,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2023-12-23 20:23:09,062 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 55 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-23 20:23:09,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 274 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-23 20:23:09,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2023-12-23 20:23:09,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 133. [2023-12-23 20:23:09,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 69 states have internal predecessors, (76), 61 states have call successors, (61), 3 states have call predecessors, (61), 3 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2023-12-23 20:23:09,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 198 transitions. [2023-12-23 20:23:09,080 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 198 transitions. Word has length 142 [2023-12-23 20:23:09,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 20:23:09,081 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 198 transitions. [2023-12-23 20:23:09,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2023-12-23 20:23:09,081 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 198 transitions. [2023-12-23 20:23:09,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2023-12-23 20:23:09,082 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 20:23:09,082 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 24, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-23 20:23:09,092 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-23 20:23:09,289 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-23 20:23:09,289 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 20:23:09,290 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 20:23:09,290 INFO L85 PathProgramCache]: Analyzing trace with hash 2108408509, now seen corresponding path program 1 times [2023-12-23 20:23:09,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 20:23:09,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2135303503] [2023-12-23 20:23:09,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 20:23:09,291 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-23 20:23:09,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 20:23:09,293 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-23 20:23:09,294 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-23 20:23:09,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 20:23:09,416 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 8 conjunts are in the unsatisfiable core [2023-12-23 20:23:09,419 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 20:23:09,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 428 proven. 111 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2023-12-23 20:23:09,779 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 20:23:13,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 20:23:13,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2135303503] [2023-12-23 20:23:13,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2135303503] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 20:23:13,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1096011583] [2023-12-23 20:23:13,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 20:23:13,057 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-23 20:23:13,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-23 20:23:13,093 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-23 20:23:13,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2023-12-23 20:23:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 20:23:13,267 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 9 conjunts are in the unsatisfiable core [2023-12-23 20:23:13,270 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 20:23:13,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 428 proven. 111 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2023-12-23 20:23:13,589 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 20:23:14,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1096011583] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-23 20:23:14,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 20:23:14,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2023-12-23 20:23:14,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523224919] [2023-12-23 20:23:14,991 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 20:23:14,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-23 20:23:14,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 20:23:14,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-23 20:23:14,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-12-23 20:23:14,993 INFO L87 Difference]: Start difference. First operand 133 states and 198 transitions. Second operand has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-12-23 20:23:15,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 20:23:15,651 INFO L93 Difference]: Finished difference Result 250 states and 348 transitions. [2023-12-23 20:23:15,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-12-23 20:23:15,660 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 143 [2023-12-23 20:23:15,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 20:23:15,663 INFO L225 Difference]: With dead ends: 250 [2023-12-23 20:23:15,663 INFO L226 Difference]: Without dead ends: 166 [2023-12-23 20:23:15,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2023-12-23 20:23:15,669 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 55 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-12-23 20:23:15,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 94 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-12-23 20:23:15,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-12-23 20:23:15,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 156. [2023-12-23 20:23:15,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 86 states have internal predecessors, (91), 61 states have call successors, (61), 9 states have call predecessors, (61), 9 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2023-12-23 20:23:15,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 213 transitions. [2023-12-23 20:23:15,686 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 213 transitions. Word has length 143 [2023-12-23 20:23:15,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 20:23:15,686 INFO L495 AbstractCegarLoop]: Abstraction has 156 states and 213 transitions. [2023-12-23 20:23:15,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.222222222222222) internal successors, (38), 9 states have internal predecessors, (38), 3 states have call successors, (24), 3 states have call predecessors, (24), 5 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2023-12-23 20:23:15,687 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 213 transitions. [2023-12-23 20:23:15,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2023-12-23 20:23:15,689 INFO L187 NwaCegarLoop]: Found error trace [2023-12-23 20:23:15,689 INFO L195 NwaCegarLoop]: trace histogram [48, 48, 48, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2023-12-23 20:23:15,701 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-23 20:23:15,900 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2023-12-23 20:23:16,096 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,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2023-12-23 20:23:16,096 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-23 20:23:16,097 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-23 20:23:16,097 INFO L85 PathProgramCache]: Analyzing trace with hash 598930869, now seen corresponding path program 1 times [2023-12-23 20:23:16,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-23 20:23:16,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1124582348] [2023-12-23 20:23:16,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-23 20:23:16,098 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-23 20:23:16,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-23 20:23:16,099 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-23 20:23:16,104 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-23 20:23:16,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-23 20:23:16,309 INFO L262 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-23 20:23:16,314 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-23 20:23:16,691 INFO L134 CoverageAnalysis]: Checked inductivity of 4555 backedges. 2536 proven. 63 refuted. 0 times theorem prover too weak. 1956 trivial. 0 not checked. [2023-12-23 20:23:16,691 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-23 20:23:16,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4555 backedges. 43 proven. 135 refuted. 0 times theorem prover too weak. 4377 trivial. 0 not checked. [2023-12-23 20:23:16,921 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-23 20:23:16,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1124582348] [2023-12-23 20:23:16,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1124582348] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-23 20:23:16,922 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-23 20:23:16,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 12 [2023-12-23 20:23:16,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453406152] [2023-12-23 20:23:16,922 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-23 20:23:16,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-23 20:23:16,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-23 20:23:16,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-23 20:23:16,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2023-12-23 20:23:16,924 INFO L87 Difference]: Start difference. First operand 156 states and 213 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 5 states have call successors, (96), 4 states have call predecessors, (96), 6 states have return successors, (96), 5 states have call predecessors, (96), 5 states have call successors, (96) [2023-12-23 20:23:17,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-23 20:23:17,596 INFO L93 Difference]: Finished difference Result 239 states and 320 transitions. [2023-12-23 20:23:17,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-12-23 20:23:17,600 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 5 states have call successors, (96), 4 states have call predecessors, (96), 6 states have return successors, (96), 5 states have call predecessors, (96), 5 states have call successors, (96) Word has length 281 [2023-12-23 20:23:17,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-23 20:23:17,600 INFO L225 Difference]: With dead ends: 239 [2023-12-23 20:23:17,600 INFO L226 Difference]: Without dead ends: 0 [2023-12-23 20:23:17,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 551 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=128, Invalid=292, Unknown=0, NotChecked=0, Total=420 [2023-12-23 20:23:17,602 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 109 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-12-23 20:23:17,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 205 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-12-23 20:23:17,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2023-12-23 20:23:17,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2023-12-23 20:23:17,603 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-23 20:23:17,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2023-12-23 20:23:17,603 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281 [2023-12-23 20:23:17,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-23 20:23:17,603 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2023-12-23 20:23:17,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 12 states have internal predecessors, (68), 5 states have call successors, (96), 4 states have call predecessors, (96), 6 states have return successors, (96), 5 states have call predecessors, (96), 5 states have call successors, (96) [2023-12-23 20:23:17,603 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2023-12-23 20:23:17,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2023-12-23 20:23:17,605 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-23 20:23:17,616 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-23 20:23:17,808 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-23 20:23:17,812 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2023-12-23 20:23:18,682 INFO L899 garLoopResultBuilder]: For program point L93(line 93) no Hoare annotation was computed. [2023-12-23 20:23:18,682 INFO L895 garLoopResultBuilder]: At program point L118-2(lines 118 124) the Hoare annotation is: (let ((.cse0 (not (= ~var_1_5~0 (_ bv0 32)))) (.cse1 (= ~var_1_10~0 (_ bv0 8))) (.cse2 (bvuge ~var_1_3~0 (_ bv2147483647 32)))) (or (and .cse0 .cse1 .cse2 (= ~var_1_9~0 ~var_1_1~0) (= ~var_1_16~0 ~var_1_18~0)) (and .cse0 .cse1 .cse2 (= ~var_1_16~0 (_ bv10 8)) (= ~last_1_var_1_16~0 (_ bv10 8))))) [2023-12-23 20:23:18,683 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 52 54) no Hoare annotation was computed. [2023-12-23 20:23:18,683 INFO L899 garLoopResultBuilder]: For program point L19(line 19) no Hoare annotation was computed. [2023-12-23 20:23:18,683 INFO L899 garLoopResultBuilder]: For program point L118-3(lines 118 124) no Hoare annotation was computed. [2023-12-23 20:23:18,683 INFO L899 garLoopResultBuilder]: For program point L19-1(line 19) no Hoare annotation was computed. [2023-12-23 20:23:18,683 INFO L899 garLoopResultBuilder]: For program point L19-3(line 19) no Hoare annotation was computed. [2023-12-23 20:23:18,683 INFO L899 garLoopResultBuilder]: For program point L77(line 77) no Hoare annotation was computed. [2023-12-23 20:23:18,683 INFO L899 garLoopResultBuilder]: For program point L44(lines 44 50) no Hoare annotation was computed. [2023-12-23 20:23:18,683 INFO L895 garLoopResultBuilder]: At program point L102(line 102) the Hoare annotation is: (and (not (= ~var_1_5~0 (_ bv0 32))) (= ~var_1_10~0 (_ bv0 8)) (bvuge ~var_1_3~0 (_ bv2147483647 32))) [2023-12-23 20:23:18,683 INFO L895 garLoopResultBuilder]: At program point L86(line 86) the Hoare annotation is: (let ((.cse0 (not (= ~var_1_5~0 (_ bv0 32)))) (.cse1 (= ~var_1_10~0 (_ bv0 8))) (.cse2 (bvuge ~var_1_3~0 (_ bv2147483647 32)))) (or (and .cse0 .cse1 .cse2 (= ~var_1_9~0 ~var_1_1~0) (= ~var_1_16~0 ~var_1_18~0)) (and .cse0 .cse1 .cse2 (= ~var_1_16~0 (_ bv10 8)) (= ~last_1_var_1_16~0 (_ bv10 8))))) [2023-12-23 20:23:18,683 INFO L895 garLoopResultBuilder]: At program point L86-1(line 86) the Hoare annotation is: (let ((.cse0 (not (= ~var_1_5~0 (_ bv0 32)))) (.cse1 (= ~var_1_10~0 (_ bv0 8))) (.cse2 (bvuge ~var_1_3~0 (_ bv2147483647 32)))) (or (and .cse0 .cse1 .cse2 (= ~var_1_9~0 ~var_1_1~0) (= ~var_1_16~0 ~var_1_18~0)) (and .cse0 .cse1 .cse2 (= ~var_1_16~0 (_ bv10 8)) (= ~last_1_var_1_16~0 (_ bv10 8))))) [2023-12-23 20:23:18,683 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 47) no Hoare annotation was computed. [2023-12-23 20:23:18,684 INFO L899 garLoopResultBuilder]: For program point L103(line 103) no Hoare annotation was computed. [2023-12-23 20:23:18,684 INFO L895 garLoopResultBuilder]: At program point L95(line 95) the Hoare annotation is: (and (not (= ~var_1_5~0 (_ bv0 32))) (= ~var_1_10~0 (_ bv0 8)) (bvuge ~var_1_3~0 (_ bv2147483647 32))) [2023-12-23 20:23:18,684 INFO L895 garLoopResultBuilder]: At program point L95-1(line 95) the Hoare annotation is: (and (not (= ~var_1_5~0 (_ bv0 32))) (= ~var_1_10~0 (_ bv0 8)) (bvuge ~var_1_3~0 (_ bv2147483647 32))) [2023-12-23 20:23:18,684 INFO L899 garLoopResultBuilder]: For program point L87(line 87) no Hoare annotation was computed. [2023-12-23 20:23:18,684 INFO L895 garLoopResultBuilder]: At program point L79(line 79) the Hoare annotation is: (let ((.cse0 (= ~var_1_10~0 (_ bv0 8))) (.cse1 (bvuge ~var_1_3~0 (_ bv2147483647 32)))) (or (and .cse0 .cse1 (= ~var_1_16~0 (_ bv10 8)) (= ~last_1_var_1_16~0 (_ bv10 8))) (and .cse0 .cse1 (= ~var_1_9~0 ~var_1_1~0) (= ~var_1_16~0 ~var_1_18~0)))) [2023-12-23 20:23:18,684 INFO L895 garLoopResultBuilder]: At program point L79-1(line 79) the Hoare annotation is: (let ((.cse0 (= ~var_1_10~0 (_ bv0 8))) (.cse1 (bvuge ~var_1_3~0 (_ bv2147483647 32)))) (or (and .cse0 .cse1 (= ~var_1_16~0 (_ bv10 8)) (= ~last_1_var_1_16~0 (_ bv10 8))) (and .cse0 .cse1 (= ~var_1_9~0 ~var_1_1~0) (= ~var_1_16~0 ~var_1_18~0)))) [2023-12-23 20:23:18,684 INFO L899 garLoopResultBuilder]: For program point $Ultimate##0(line -1) no Hoare annotation was computed. [2023-12-23 20:23:18,684 INFO L899 garLoopResultBuilder]: For program point L96(line 96) no Hoare annotation was computed. [2023-12-23 20:23:18,684 INFO L895 garLoopResultBuilder]: At program point L80(line 80) the Hoare annotation is: (let ((.cse0 (= ~var_1_10~0 (_ bv0 8))) (.cse1 (bvuge ~var_1_3~0 (_ bv2147483647 32)))) (or (and .cse0 .cse1 (= ~var_1_16~0 (_ bv10 8)) (= ~last_1_var_1_16~0 (_ bv10 8))) (and .cse0 .cse1 (= ~var_1_9~0 ~var_1_1~0) (= ~var_1_16~0 ~var_1_18~0)))) [2023-12-23 20:23:18,684 INFO L895 garLoopResultBuilder]: At program point L105(line 105) the Hoare annotation is: (and (not (= ~var_1_5~0 (_ bv0 32))) (= ~var_1_10~0 (_ bv0 8)) (bvuge ~var_1_3~0 (_ bv2147483647 32))) [2023-12-23 20:23:18,684 INFO L895 garLoopResultBuilder]: At program point L105-1(line 105) the Hoare annotation is: (and (not (= ~var_1_5~0 (_ bv0 32))) (= ~var_1_10~0 (_ bv0 8)) (bvuge ~var_1_3~0 (_ bv2147483647 32))) [2023-12-23 20:23:18,685 INFO L895 garLoopResultBuilder]: At program point L89(line 89) the Hoare annotation is: (let ((.cse0 (not (= ~var_1_5~0 (_ bv0 32)))) (.cse1 (= ~var_1_10~0 (_ bv0 8))) (.cse2 (bvuge ~var_1_3~0 (_ bv2147483647 32)))) (or (and .cse0 .cse1 .cse2 (= ~var_1_9~0 ~var_1_1~0) (= ~var_1_16~0 ~var_1_18~0)) (and .cse0 .cse1 .cse2 (= ~var_1_16~0 (_ bv10 8)) (= ~last_1_var_1_16~0 (_ bv10 8))))) [2023-12-23 20:23:18,685 INFO L895 garLoopResultBuilder]: At program point L89-1(line 89) the Hoare annotation is: (let ((.cse0 (not (= ~var_1_5~0 (_ bv0 32)))) (.cse1 (= ~var_1_10~0 (_ bv0 8))) (.cse2 (bvuge ~var_1_3~0 (_ bv2147483647 32)))) (or (and .cse0 .cse1 .cse2 (= ~var_1_9~0 ~var_1_1~0) (= ~var_1_16~0 ~var_1_18~0)) (and .cse0 .cse1 .cse2 (= ~var_1_16~0 (_ bv10 8)) (= ~last_1_var_1_16~0 (_ bv10 8))))) [2023-12-23 20:23:18,685 INFO L899 garLoopResultBuilder]: For program point L56(lines 56 64) no Hoare annotation was computed. [2023-12-23 20:23:18,686 INFO L899 garLoopResultBuilder]: For program point L56-1(lines 40 70) no Hoare annotation was computed. [2023-12-23 20:23:18,686 INFO L899 garLoopResultBuilder]: For program point L81(line 81) no Hoare annotation was computed. [2023-12-23 20:23:18,686 INFO L899 garLoopResultBuilder]: For program point L106(lines 71 107) no Hoare annotation was computed. [2023-12-23 20:23:18,686 INFO L895 garLoopResultBuilder]: At program point L73(line 73) the Hoare annotation is: (let ((.cse0 (not (= ~var_1_5~0 (_ bv0 32)))) (.cse1 (= ~var_1_10~0 (_ bv0 8))) (.cse2 (bvuge ~var_1_3~0 (_ bv2147483647 32)))) (or (and .cse0 .cse1 .cse2 (= ~var_1_9~0 ~var_1_1~0) (= ~var_1_16~0 ~var_1_18~0)) (and .cse0 .cse1 .cse2 (= ~var_1_16~0 (_ bv10 8)) (= ~last_1_var_1_16~0 (_ bv10 8))))) [2023-12-23 20:23:18,686 INFO L895 garLoopResultBuilder]: At program point L73-1(line 73) the Hoare annotation is: (let ((.cse0 (not (= ~var_1_5~0 (_ bv0 32)))) (.cse1 (= ~var_1_10~0 (_ bv0 8))) (.cse2 (bvuge ~var_1_3~0 (_ bv2147483647 32)))) (or (and .cse0 .cse1 .cse2 (= ~var_1_9~0 ~var_1_1~0) (= ~var_1_16~0 ~var_1_18~0)) (and .cse0 .cse1 .cse2 (= ~var_1_16~0 (_ bv10 8)) (= ~last_1_var_1_16~0 (_ bv10 8))))) [2023-12-23 20:23:18,686 INFO L899 garLoopResultBuilder]: For program point L40(lines 40 70) no Hoare annotation was computed. [2023-12-23 20:23:18,686 INFO L895 garLoopResultBuilder]: At program point L98(line 98) the Hoare annotation is: (and (not (= ~var_1_5~0 (_ bv0 32))) (= ~var_1_10~0 (_ bv0 8)) (bvuge ~var_1_3~0 (_ bv2147483647 32))) [2023-12-23 20:23:18,686 INFO L895 garLoopResultBuilder]: At program point L98-1(line 98) the Hoare annotation is: (and (not (= ~var_1_5~0 (_ bv0 32))) (= ~var_1_10~0 (_ bv0 8)) (bvuge ~var_1_3~0 (_ bv2147483647 32))) [2023-12-23 20:23:18,687 INFO L899 garLoopResultBuilder]: For program point L90(line 90) no Hoare annotation was computed. [2023-12-23 20:23:18,687 INFO L899 garLoopResultBuilder]: For program point L57(lines 57 61) no Hoare annotation was computed. [2023-12-23 20:23:18,687 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) no Hoare annotation was computed. [2023-12-23 20:23:18,687 INFO L899 garLoopResultBuilder]: For program point L74(line 74) no Hoare annotation was computed. [2023-12-23 20:23:18,687 INFO L899 garLoopResultBuilder]: For program point L99(line 99) no Hoare annotation was computed. [2023-12-23 20:23:18,687 INFO L899 garLoopResultBuilder]: For program point L66(lines 66 68) no Hoare annotation was computed. [2023-12-23 20:23:18,687 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2023-12-23 20:23:18,687 INFO L895 garLoopResultBuilder]: At program point L83(line 83) the Hoare annotation is: (let ((.cse0 (not (= ~var_1_5~0 (_ bv0 32)))) (.cse1 (= ~var_1_10~0 (_ bv0 8))) (.cse2 (bvuge ~var_1_3~0 (_ bv2147483647 32)))) (or (and .cse0 .cse1 .cse2 (= ~var_1_9~0 ~var_1_1~0) (= ~var_1_16~0 ~var_1_18~0)) (and .cse0 .cse1 .cse2 (= ~var_1_16~0 (_ bv10 8)) (= ~last_1_var_1_16~0 (_ bv10 8))))) [2023-12-23 20:23:18,687 INFO L895 garLoopResultBuilder]: At program point L83-1(line 83) the Hoare annotation is: (let ((.cse0 (not (= ~var_1_5~0 (_ bv0 32)))) (.cse1 (= ~var_1_10~0 (_ bv0 8))) (.cse2 (bvuge ~var_1_3~0 (_ bv2147483647 32)))) (or (and .cse0 .cse1 .cse2 (= ~var_1_9~0 ~var_1_1~0) (= ~var_1_16~0 ~var_1_18~0)) (and .cse0 .cse1 .cse2 (= ~var_1_16~0 (_ bv10 8)) (= ~last_1_var_1_16~0 (_ bv10 8))))) [2023-12-23 20:23:18,687 INFO L895 garLoopResultBuilder]: At program point L92(line 92) the Hoare annotation is: (and (not (= ~var_1_5~0 (_ bv0 32))) (= ~var_1_10~0 (_ bv0 8)) (bvuge ~var_1_3~0 (_ bv2147483647 32))) [2023-12-23 20:23:18,687 INFO L895 garLoopResultBuilder]: At program point L92-1(line 92) the Hoare annotation is: (and (not (= ~var_1_5~0 (_ bv0 32))) (= ~var_1_10~0 (_ bv0 8)) (bvuge ~var_1_3~0 (_ bv2147483647 32))) [2023-12-23 20:23:18,687 INFO L899 garLoopResultBuilder]: For program point L84(line 84) no Hoare annotation was computed. [2023-12-23 20:23:18,688 INFO L895 garLoopResultBuilder]: At program point L76(line 76) the Hoare annotation is: (let ((.cse0 (= ~var_1_10~0 (_ bv0 8)))) (or (and .cse0 (= ~var_1_16~0 (_ bv10 8)) (= ~last_1_var_1_16~0 (_ bv10 8))) (and .cse0 (= ~var_1_9~0 ~var_1_1~0) (= ~var_1_16~0 ~var_1_18~0)))) [2023-12-23 20:23:18,688 INFO L895 garLoopResultBuilder]: At program point L76-1(line 76) the Hoare annotation is: (let ((.cse0 (= ~var_1_10~0 (_ bv0 8))) (.cse1 (bvuge ~var_1_3~0 (_ bv2147483647 32)))) (or (and .cse0 .cse1 (= ~var_1_16~0 (_ bv10 8)) (= ~last_1_var_1_16~0 (_ bv10 8))) (and .cse0 .cse1 (= ~var_1_9~0 ~var_1_1~0) (= ~var_1_16~0 ~var_1_18~0)))) [2023-12-23 20:23:18,688 INFO L899 garLoopResultBuilder]: For program point L43(lines 43 51) no Hoare annotation was computed. [2023-12-23 20:23:18,688 INFO L899 garLoopResultBuilder]: For program point L43-1(lines 40 70) no Hoare annotation was computed. [2023-12-23 20:23:18,688 INFO L895 garLoopResultBuilder]: At program point L101(line 101) the Hoare annotation is: (and (not (= ~var_1_5~0 (_ bv0 32))) (= ~var_1_10~0 (_ bv0 8)) (bvuge ~var_1_3~0 (_ bv2147483647 32))) [2023-12-23 20:23:18,688 INFO L895 garLoopResultBuilder]: At program point L101-1(line 101) the Hoare annotation is: (and (not (= ~var_1_5~0 (_ bv0 32))) (= ~var_1_10~0 (_ bv0 8)) (bvuge ~var_1_3~0 (_ bv2147483647 32))) [2023-12-23 20:23:18,688 INFO L902 garLoopResultBuilder]: At program point $Ultimate##0(line 20) the Hoare annotation is: true [2023-12-23 20:23:18,688 INFO L899 garLoopResultBuilder]: For program point L20(line 20) no Hoare annotation was computed. [2023-12-23 20:23:18,688 INFO L899 garLoopResultBuilder]: For program point L20-2(line 20) no Hoare annotation was computed. [2023-12-23 20:23:18,688 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(line 20) no Hoare annotation was computed. [2023-12-23 20:23:18,690 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-23 20:23:18,692 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-23 20:23:18,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.12 08:23:18 BoogieIcfgContainer [2023-12-23 20:23:18,699 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-23 20:23:18,699 INFO L158 Benchmark]: Toolchain (without parser) took 32658.08ms. Allocated memory was 218.1MB in the beginning and 822.1MB in the end (delta: 604.0MB). Free memory was 167.0MB in the beginning and 494.1MB in the end (delta: -327.1MB). Peak memory consumption was 278.1MB. Max. memory is 8.0GB. [2023-12-23 20:23:18,699 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 218.1MB. Free memory is still 164.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-23 20:23:18,700 INFO L158 Benchmark]: CACSL2BoogieTranslator took 183.72ms. Allocated memory is still 218.1MB. Free memory was 167.0MB in the beginning and 153.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2023-12-23 20:23:18,700 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.30ms. Allocated memory is still 218.1MB. Free memory was 153.3MB in the beginning and 151.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-23 20:23:18,700 INFO L158 Benchmark]: Boogie Preprocessor took 30.11ms. Allocated memory is still 218.1MB. Free memory was 151.2MB in the beginning and 148.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-23 20:23:18,700 INFO L158 Benchmark]: RCFGBuilder took 500.43ms. Allocated memory is still 218.1MB. Free memory was 148.8MB in the beginning and 129.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-23 20:23:18,700 INFO L158 Benchmark]: TraceAbstraction took 31911.82ms. Allocated memory was 218.1MB in the beginning and 822.1MB in the end (delta: 604.0MB). Free memory was 129.2MB in the beginning and 494.1MB in the end (delta: -364.8MB). Peak memory consumption was 240.4MB. Max. memory is 8.0GB. [2023-12-23 20:23:18,701 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 218.1MB. Free memory is still 164.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 183.72ms. Allocated memory is still 218.1MB. Free memory was 167.0MB in the beginning and 153.3MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 27.30ms. Allocated memory is still 218.1MB. Free memory was 153.3MB in the beginning and 151.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.11ms. Allocated memory is still 218.1MB. Free memory was 151.2MB in the beginning and 148.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 500.43ms. Allocated memory is still 218.1MB. Free memory was 148.8MB in the beginning and 129.9MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * TraceAbstraction took 31911.82ms. Allocated memory was 218.1MB in the beginning and 822.1MB in the end (delta: 604.0MB). Free memory was 129.2MB in the beginning and 494.1MB in the end (delta: -364.8MB). Peak memory consumption was 240.4MB. 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, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 31.9s, OverallIterations: 5, TraceHistogramMax: 48, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 292 SdHoareTripleChecker+Valid, 1.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 290 mSDsluCounter, 1000 SdHoareTripleChecker+Invalid, 1.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 648 mSDsCounter, 195 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 962 IncrementalHoareTripleChecker+Invalid, 1157 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 195 mSolverCounterUnsat, 352 mSDtfsCounter, 962 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1312 GetRequests, 1262 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=156occurred in iteration=4, InterpolantAutomatonStates: 47, 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, 31 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 26 LocationsWithAnnotation, 221 PreInvPairs, 274 NumberOfFragments, 566 HoareAnnotationTreeSize, 221 FormulaSimplifications, 662 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 26 FormulaSimplificationsInter, 1074 FormulaSimplificationTreeSizeReductionInter, 0.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 26.2s InterpolantComputationTime, 991 NumberOfCodeBlocks, 991 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1265 ConstructedInterpolants, 0 QuantifiedInterpolants, 4921 SizeOfPredicates, 55 NumberOfNonLiveVariables, 1537 ConjunctsInSsa, 44 ConjunctsInUnsatCore, 7 InterpolantComputations, 3 PerfectInterpolantSequences, 14210/14630 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: 118]: Loop Invariant Derived loop invariant: (((((!((var_1_5 == 0)) && (var_1_10 == 0)) && (var_1_3 >= 2147483647)) && (var_1_9 == var_1_1)) && (var_1_16 == var_1_18)) || ((((!((var_1_5 == 0)) && (var_1_10 == 0)) && (var_1_3 >= 2147483647)) && (var_1_16 == 10)) && (last_1_var_1_16 == 10))) RESULT: Ultimate proved your program to be correct! [2023-12-23 20:23:18,722 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...