/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_operatoramount_amount100_file-51.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 05:20:37,023 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 05:20:37,084 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 05:20:37,088 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 05:20:37,088 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 05:20:37,109 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 05:20:37,109 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 05:20:37,109 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 05:20:37,110 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 05:20:37,112 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 05:20:37,112 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 05:20:37,113 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 05:20:37,113 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 05:20:37,114 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 05:20:37,114 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 05:20:37,114 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 05:20:37,114 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 05:20:37,115 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 05:20:37,115 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 05:20:37,116 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 05:20:37,116 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 05:20:37,116 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 05:20:37,116 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 05:20:37,116 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 05:20:37,117 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 05:20:37,117 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 05:20:37,117 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 05:20:37,117 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 05:20:37,117 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 05:20:37,117 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 05:20:37,118 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 05:20:37,118 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 05:20:37,118 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 05:20:37,118 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 05:20:37,118 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 05:20:37,118 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 05:20:37,119 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 05:20:37,119 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 05:20:37,119 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 05:20:37,119 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 05:20:37,119 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 05:20:37,119 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 05:20:37,119 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 05:20:37,119 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 05:20:37,120 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 05:20:37,120 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 05:20:37,120 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 05:20:37,297 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 05:20:37,310 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 05:20:37,312 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 05:20:37,313 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 05:20:37,313 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 05:20:37,313 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-51.i [2023-12-24 05:20:38,260 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 05:20:38,386 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 05:20:38,387 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_operatoramount_amount100_file-51.i [2023-12-24 05:20:38,396 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8970ec7fd/80057bf5d9e540da87841faac2bdafd8/FLAGb90e8a0ef [2023-12-24 05:20:38,809 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8970ec7fd/80057bf5d9e540da87841faac2bdafd8 [2023-12-24 05:20:38,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 05:20:38,811 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 05:20:38,812 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 05:20:38,812 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 05:20:38,818 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 05:20:38,818 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 05:20:38" (1/1) ... [2023-12-24 05:20:38,819 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e709791 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:20:38, skipping insertion in model container [2023-12-24 05:20:38,819 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 05:20:38" (1/1) ... [2023-12-24 05:20:38,849 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 05:20:38,937 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_operatoramount_amount100_file-51.i[916,929] [2023-12-24 05:20:39,012 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 05:20:39,021 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 05:20:39,029 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_operatoramount_amount100_file-51.i[916,929] [2023-12-24 05:20:39,070 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 05:20:39,095 INFO L206 MainTranslator]: Completed translation [2023-12-24 05:20:39,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:20:39 WrapperNode [2023-12-24 05:20:39,096 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 05:20:39,097 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 05:20:39,097 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 05:20:39,097 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 05:20:39,102 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:20:39" (1/1) ... [2023-12-24 05:20:39,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:20:39" (1/1) ... [2023-12-24 05:20:39,153 INFO L138 Inliner]: procedures = 27, calls = 45, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 206 [2023-12-24 05:20:39,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 05:20:39,155 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 05:20:39,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 05:20:39,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 05:20:39,162 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:20:39" (1/1) ... [2023-12-24 05:20:39,162 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:20:39" (1/1) ... [2023-12-24 05:20:39,175 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:20:39" (1/1) ... [2023-12-24 05:20:39,194 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 05:20:39,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:20:39" (1/1) ... [2023-12-24 05:20:39,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:20:39" (1/1) ... [2023-12-24 05:20:39,202 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:20:39" (1/1) ... [2023-12-24 05:20:39,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:20:39" (1/1) ... [2023-12-24 05:20:39,206 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:20:39" (1/1) ... [2023-12-24 05:20:39,207 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:20:39" (1/1) ... [2023-12-24 05:20:39,209 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 05:20:39,210 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 05:20:39,210 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 05:20:39,210 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 05:20:39,211 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:20:39" (1/1) ... [2023-12-24 05:20:39,214 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 05:20:39,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 05:20:39,241 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 05:20:39,243 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 05:20:39,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 05:20:39,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 05:20:39,258 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-24 05:20:39,258 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-24 05:20:39,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 05:20:39,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 05:20:39,318 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 05:20:39,320 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 05:20:54,317 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 05:20:54,359 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 05:20:54,359 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-24 05:20:54,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 05:20:54 BoogieIcfgContainer [2023-12-24 05:20:54,360 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 05:20:54,361 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 05:20:54,361 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 05:20:54,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 05:20:54,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 05:20:38" (1/3) ... [2023-12-24 05:20:54,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9db0bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 05:20:54, skipping insertion in model container [2023-12-24 05:20:54,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 05:20:39" (2/3) ... [2023-12-24 05:20:54,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9db0bc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 05:20:54, skipping insertion in model container [2023-12-24 05:20:54,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 05:20:54" (3/3) ... [2023-12-24 05:20:54,365 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-51.i [2023-12-24 05:20:54,375 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 05:20:54,375 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-24 05:20:54,427 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 05:20:54,431 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;@21e551a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 05:20:54,431 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-24 05:20:54,435 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 05:20:54,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-12-24 05:20:54,450 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 05:20:54,451 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:20:54,451 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 05:20:54,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 05:20:54,456 INFO L85 PathProgramCache]: Analyzing trace with hash 400712563, now seen corresponding path program 1 times [2023-12-24 05:20:54,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 05:20:54,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1410797492] [2023-12-24 05:20:54,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 05:20:54,465 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 05:20:54,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 05:20:54,467 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 05:20:54,472 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 05:20:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 05:20:55,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 05:20:55,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 05:20:55,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 854 proven. 0 refuted. 0 times theorem prover too weak. 1130 trivial. 0 not checked. [2023-12-24 05:20:55,366 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 05:20:55,366 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 05:20:55,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1410797492] [2023-12-24 05:20:55,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1410797492] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 05:20:55,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 05:20:55,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 05:20:55,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290547938] [2023-12-24 05:20:55,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 05:20:55,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 05:20:55,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 05:20:55,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 05:20:55,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 05:20:55,401 INFO L87 Difference]: Start difference. First operand has 88 states, 53 states have (on average 1.471698113207547) internal successors, (78), 54 states have internal predecessors, (78), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-24 05:21:00,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.18s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:21:00,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 05:21:00,637 INFO L93 Difference]: Finished difference Result 173 states and 314 transitions. [2023-12-24 05:21:01,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 05:21:01,092 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 199 [2023-12-24 05:21:01,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 05:21:01,097 INFO L225 Difference]: With dead ends: 173 [2023-12-24 05:21:01,097 INFO L226 Difference]: Without dead ends: 86 [2023-12-24 05:21:01,099 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 198 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 05:21:01,102 INFO L413 NwaCegarLoop]: 134 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-12-24 05:21:01,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 1 Unknown, 0 Unchecked, 5.2s Time] [2023-12-24 05:21:01,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2023-12-24 05:21:01,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2023-12-24 05:21:01,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 52 states have (on average 1.4038461538461537) internal successors, (73), 52 states have internal predecessors, (73), 32 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 05:21:01,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 137 transitions. [2023-12-24 05:21:01,149 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 137 transitions. Word has length 199 [2023-12-24 05:21:01,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 05:21:01,150 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 137 transitions. [2023-12-24 05:21:01,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2023-12-24 05:21:01,150 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 137 transitions. [2023-12-24 05:21:01,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-12-24 05:21:01,160 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 05:21:01,160 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:21:01,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 05:21:01,380 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 05:21:01,381 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 05:21:01,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 05:21:01,382 INFO L85 PathProgramCache]: Analyzing trace with hash 282027703, now seen corresponding path program 1 times [2023-12-24 05:21:01,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 05:21:01,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [761079837] [2023-12-24 05:21:01,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 05:21:01,383 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 05:21:01,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 05:21:01,384 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 05:21:01,395 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 05:21:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 05:21:02,168 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 05:21:02,174 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 05:21:04,974 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1011 proven. 51 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2023-12-24 05:21:04,975 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 05:21:06,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2023-12-24 05:21:06,668 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 05:21:06,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [761079837] [2023-12-24 05:21:06,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [761079837] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 05:21:06,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 05:21:06,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-12-24 05:21:06,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697396559] [2023-12-24 05:21:06,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 05:21:06,670 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-24 05:21:06,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 05:21:06,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-24 05:21:06,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-24 05:21:06,671 INFO L87 Difference]: Start difference. First operand 86 states and 137 transitions. Second operand has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2023-12-24 05:21:14,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:21:18,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:21:22,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:21:22,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 05:21:22,566 INFO L93 Difference]: Finished difference Result 179 states and 280 transitions. [2023-12-24 05:21:23,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-24 05:21:23,033 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) Word has length 199 [2023-12-24 05:21:23,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 05:21:23,035 INFO L225 Difference]: With dead ends: 179 [2023-12-24 05:21:23,035 INFO L226 Difference]: Without dead ends: 94 [2023-12-24 05:21:23,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 390 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-24 05:21:23,037 INFO L413 NwaCegarLoop]: 97 mSDtfsCounter, 125 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 34 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.5s IncrementalHoareTripleChecker+Time [2023-12-24 05:21:23,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 222 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 180 Invalid, 3 Unknown, 0 Unchecked, 15.5s Time] [2023-12-24 05:21:23,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-12-24 05:21:23,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 90. [2023-12-24 05:21:23,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 55 states have internal predecessors, (75), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 05:21:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2023-12-24 05:21:23,047 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 139 transitions. Word has length 199 [2023-12-24 05:21:23,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 05:21:23,048 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 139 transitions. [2023-12-24 05:21:23,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.285714285714286) internal successors, (51), 7 states have internal predecessors, (51), 2 states have call successors, (49), 2 states have call predecessors, (49), 4 states have return successors, (50), 2 states have call predecessors, (50), 2 states have call successors, (50) [2023-12-24 05:21:23,049 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2023-12-24 05:21:23,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-12-24 05:21:23,050 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 05:21:23,050 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:21:23,076 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 05:21:23,260 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 05:21:23,261 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 05:21:23,261 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 05:21:23,261 INFO L85 PathProgramCache]: Analyzing trace with hash -729089547, now seen corresponding path program 1 times [2023-12-24 05:21:23,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 05:21:23,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283888474] [2023-12-24 05:21:23,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 05:21:23,262 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 05:21:23,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 05:21:23,265 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 05:21:23,272 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 05:21:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 05:21:24,054 INFO L262 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-24 05:21:24,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 05:21:33,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1984 trivial. 0 not checked. [2023-12-24 05:21:33,410 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 05:21:33,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 05:21:33,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283888474] [2023-12-24 05:21:33,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1283888474] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 05:21:33,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 05:21:33,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-24 05:21:33,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487800836] [2023-12-24 05:21:33,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 05:21:33,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 05:21:33,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 05:21:33,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 05:21:33,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 05:21:33,412 INFO L87 Difference]: Start difference. First operand 90 states and 139 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-24 05:21:39,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:21:43,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:21:47,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:21:53,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:21:57,577 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:22:01,610 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:22:05,628 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:22:09,663 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:22:10,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 05:22:10,138 INFO L93 Difference]: Finished difference Result 269 states and 416 transitions. [2023-12-24 05:22:10,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-12-24 05:22:10,138 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) Word has length 199 [2023-12-24 05:22:10,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 05:22:10,140 INFO L225 Difference]: With dead ends: 269 [2023-12-24 05:22:10,140 INFO L226 Difference]: Without dead ends: 180 [2023-12-24 05:22:10,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 05:22:10,142 INFO L413 NwaCegarLoop]: 132 mSDtfsCounter, 33 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 4 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.6s IncrementalHoareTripleChecker+Time [2023-12-24 05:22:10,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 316 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 93 Invalid, 8 Unknown, 0 Unchecked, 36.6s Time] [2023-12-24 05:22:10,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2023-12-24 05:22:10,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2023-12-24 05:22:10,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 108 states have (on average 1.3333333333333333) internal successors, (144), 108 states have internal predecessors, (144), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 64 states have call predecessors, (64), 64 states have call successors, (64) [2023-12-24 05:22:10,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 272 transitions. [2023-12-24 05:22:10,162 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 272 transitions. Word has length 199 [2023-12-24 05:22:10,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 05:22:10,168 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 272 transitions. [2023-12-24 05:22:10,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 1 states have call successors, (32), 1 states have call predecessors, (32), 1 states have return successors, (32), 1 states have call predecessors, (32), 1 states have call successors, (32) [2023-12-24 05:22:10,168 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 272 transitions. [2023-12-24 05:22:10,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2023-12-24 05:22:10,169 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 05:22:10,170 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:22:10,190 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 05:22:10,370 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 05:22:10,370 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 05:22:10,371 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 05:22:10,371 INFO L85 PathProgramCache]: Analyzing trace with hash 550774131, now seen corresponding path program 1 times [2023-12-24 05:22:10,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 05:22:10,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172766943] [2023-12-24 05:22:10,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 05:22:10,372 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 05:22:10,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 05:22:10,372 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 05:22:10,373 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 05:22:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 05:22:11,152 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-24 05:22:11,155 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 05:22:18,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 1011 proven. 51 refuted. 0 times theorem prover too weak. 922 trivial. 0 not checked. [2023-12-24 05:22:18,639 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 05:22:22,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 42 proven. 51 refuted. 0 times theorem prover too weak. 1891 trivial. 0 not checked. [2023-12-24 05:22:22,131 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 05:22:22,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172766943] [2023-12-24 05:22:22,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1172766943] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-24 05:22:22,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 05:22:22,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 10 [2023-12-24 05:22:22,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676642119] [2023-12-24 05:22:22,132 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 05:22:22,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-12-24 05:22:22,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 05:22:22,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-12-24 05:22:22,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-12-24 05:22:22,133 INFO L87 Difference]: Start difference. First operand 177 states and 272 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) [2023-12-24 05:22:31,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:22:35,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:22:39,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:22:43,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:22:43,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 05:22:43,797 INFO L93 Difference]: Finished difference Result 274 states and 418 transitions. [2023-12-24 05:22:44,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-12-24 05:22:44,237 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) Word has length 199 [2023-12-24 05:22:44,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 05:22:44,239 INFO L225 Difference]: With dead ends: 274 [2023-12-24 05:22:44,239 INFO L226 Difference]: Without dead ends: 185 [2023-12-24 05:22:44,240 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 388 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2023-12-24 05:22:44,241 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 168 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 125 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2023-12-24 05:22:44,241 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 252 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 271 Invalid, 4 Unknown, 0 Unchecked, 20.5s Time] [2023-12-24 05:22:44,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2023-12-24 05:22:44,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 90. [2023-12-24 05:22:44,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 55 states have (on average 1.290909090909091) internal successors, (71), 55 states have internal predecessors, (71), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2023-12-24 05:22:44,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 135 transitions. [2023-12-24 05:22:44,253 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 135 transitions. Word has length 199 [2023-12-24 05:22:44,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 05:22:44,254 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 135 transitions. [2023-12-24 05:22:44,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 10 states have internal predecessors, (54), 2 states have call successors, (64), 3 states have call predecessors, (64), 5 states have return successors, (64), 2 states have call predecessors, (64), 2 states have call successors, (64) [2023-12-24 05:22:44,254 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 135 transitions. [2023-12-24 05:22:44,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2023-12-24 05:22:44,255 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 05:22:44,255 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:22:44,275 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 05:22:44,468 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 05:22:44,468 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 05:22:44,469 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 05:22:44,469 INFO L85 PathProgramCache]: Analyzing trace with hash -1127982028, now seen corresponding path program 1 times [2023-12-24 05:22:44,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 05:22:44,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [406781557] [2023-12-24 05:22:44,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 05:22:44,469 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 05:22:44,469 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 05:22:44,470 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 05:22:44,471 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 05:22:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 05:22:45,262 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-24 05:22:45,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 05:22:52,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 841 proven. 66 refuted. 0 times theorem prover too weak. 1077 trivial. 0 not checked. [2023-12-24 05:22:52,914 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 05:22:53,430 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 05:22:53,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [406781557] [2023-12-24 05:22:53,431 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [406781557] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 05:22:53,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [677275263] [2023-12-24 05:22:53,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 05:22:53,431 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2023-12-24 05:22:53,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2023-12-24 05:22:53,433 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2023-12-24 05:22:53,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2023-12-24 05:22:54,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 05:22:54,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 13 conjunts are in the unsatisfiable core [2023-12-24 05:22:54,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 05:23:09,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1984 backedges. 849 proven. 39 refuted. 0 times theorem prover too weak. 1096 trivial. 0 not checked. [2023-12-24 05:23:09,752 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-24 05:23:13,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [677275263] provided 0 perfect and 1 imperfect interpolant sequences [2023-12-24 05:23:13,128 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-24 05:23:13,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11] total 16 [2023-12-24 05:23:13,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999176002] [2023-12-24 05:23:13,128 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-24 05:23:13,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-12-24 05:23:13,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 05:23:13,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-12-24 05:23:13,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=359, Unknown=0, NotChecked=0, Total=420 [2023-12-24 05:23:13,130 INFO L87 Difference]: Start difference. First operand 90 states and 135 transitions. Second operand has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 16 states have internal predecessors, (93), 5 states have call successors, (64), 5 states have call predecessors, (64), 8 states have return successors, (64), 5 states have call predecessors, (64), 5 states have call successors, (64) [2023-12-24 05:23:32,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:23:36,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 05:23:40,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:23:44,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:23:48,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:23:52,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:23:56,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 05:24:00,463 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:24:04,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:24:08,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:24:12,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:24:18,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.17s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:24:22,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 05:24:26,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:24:30,754 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:24:34,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:24:38,460 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 05:24:47,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:24:51,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 05:24:55,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:24:59,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:25:03,182 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:25:07,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:25:11,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 05:25:15,269 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:25:19,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:25:23,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:25:27,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:25:31,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:25:35,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 05:25:39,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:25:43,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:25:47,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:25:51,368 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 05:25:55,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:25:59,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:26:03,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:26:07,445 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:26:11,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:26:15,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 05:26:19,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:26:23,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:26:27,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:26:31,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:26:35,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:26:37,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 05:26:39,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 05:26:41,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2023-12-24 05:26:51,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 5.20s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:26:55,973 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:27:00,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-24 05:27:00,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 05:27:00,032 INFO L93 Difference]: Finished difference Result 422 states and 612 transitions. [2023-12-24 05:27:00,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-12-24 05:27:00,516 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 16 states have internal predecessors, (93), 5 states have call successors, (64), 5 states have call predecessors, (64), 8 states have return successors, (64), 5 states have call predecessors, (64), 5 states have call successors, (64) Word has length 200 [2023-12-24 05:27:00,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 05:27:00,519 INFO L225 Difference]: With dead ends: 422 [2023-12-24 05:27:00,519 INFO L226 Difference]: Without dead ends: 333 [2023-12-24 05:27:00,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 465 GetRequests, 423 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 439 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=414, Invalid=1478, Unknown=0, NotChecked=0, Total=1892 [2023-12-24 05:27:00,520 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 408 mSDsluCounter, 1238 mSDsCounter, 0 mSdLazyCounter, 847 mSolverCounterSat, 350 mSolverCounterUnsat, 47 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 217.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 1341 SdHoareTripleChecker+Invalid, 1244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 847 IncrementalHoareTripleChecker+Invalid, 47 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 218.8s IncrementalHoareTripleChecker+Time [2023-12-24 05:27:00,520 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 1341 Invalid, 1244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 847 Invalid, 47 Unknown, 0 Unchecked, 218.8s Time] [2023-12-24 05:27:00,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2023-12-24 05:27:00,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 261. [2023-12-24 05:27:00,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 154 states have (on average 1.2272727272727273) internal successors, (189), 155 states have internal predecessors, (189), 96 states have call successors, (96), 10 states have call predecessors, (96), 10 states have return successors, (96), 95 states have call predecessors, (96), 96 states have call successors, (96) [2023-12-24 05:27:00,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 381 transitions. [2023-12-24 05:27:00,568 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 381 transitions. Word has length 200 [2023-12-24 05:27:00,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 05:27:00,568 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 381 transitions. [2023-12-24 05:27:00,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.470588235294118) internal successors, (93), 16 states have internal predecessors, (93), 5 states have call successors, (64), 5 states have call predecessors, (64), 8 states have return successors, (64), 5 states have call predecessors, (64), 5 states have call successors, (64) [2023-12-24 05:27:00,569 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 381 transitions. [2023-12-24 05:27:00,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2023-12-24 05:27:00,570 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 05:27:00,570 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:27:00,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2023-12-24 05:27:00,804 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 05:27:00,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,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 05:27:00,982 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 05:27:00,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 05:27:00,983 INFO L85 PathProgramCache]: Analyzing trace with hash 984172406, now seen corresponding path program 1 times [2023-12-24 05:27:00,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 05:27:00,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [913487739] [2023-12-24 05:27:00,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 05:27:00,983 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 05:27:00,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 05:27:00,984 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 05:27:00,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-12-24 05:27:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 05:27:02,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 26 conjunts are in the unsatisfiable core [2023-12-24 05:27:02,718 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 05:28:00,730 WARN L293 SmtUtils]: Spent 9.71s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:28:10,500 WARN L293 SmtUtils]: Spent 9.77s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:28:20,229 WARN L293 SmtUtils]: Spent 9.73s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:28:29,939 WARN L293 SmtUtils]: Spent 9.71s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:28:39,681 WARN L293 SmtUtils]: Spent 9.74s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:28:49,443 WARN L293 SmtUtils]: Spent 9.76s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:28:59,135 WARN L293 SmtUtils]: Spent 9.69s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:29:08,850 WARN L293 SmtUtils]: Spent 9.71s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:29:18,513 WARN L293 SmtUtils]: Spent 9.66s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:29:28,239 WARN L293 SmtUtils]: Spent 9.73s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:29:37,936 WARN L293 SmtUtils]: Spent 9.70s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:29:47,632 WARN L293 SmtUtils]: Spent 9.70s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:29:57,276 WARN L293 SmtUtils]: Spent 9.64s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:30:06,932 WARN L293 SmtUtils]: Spent 9.66s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:30:16,634 WARN L293 SmtUtils]: Spent 9.70s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:30:26,305 WARN L293 SmtUtils]: Spent 9.67s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:30:35,958 WARN L293 SmtUtils]: Spent 9.65s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:30:45,658 WARN L293 SmtUtils]: Spent 9.70s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:30:54,572 WARN L293 SmtUtils]: Spent 8.91s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:31:04,235 WARN L293 SmtUtils]: Spent 9.66s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:31:13,909 WARN L293 SmtUtils]: Spent 9.67s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:31:18,427 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ zero_extend 16) c_~last_1_var_1_31~0))) (let ((.cse1 ((_ sign_extend 24) (_ bv0 8))) (.cse2 ((_ zero_extend 16) c_~var_1_28~0)) (.cse0 (bvugt .cse4 c_~var_1_16~0)) (.cse3 (fp.neg c_~var_1_3~0))) (and (or .cse0 (not (bvugt c_~last_1_var_1_13~0 c_~var_1_16~0))) (not (fp.lt c_~var_1_34~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_5~0) c_~var_1_35~0))) (= ((_ extract 15 0) (bvadd ((_ zero_extend 24) c_~var_1_25~0) ((_ zero_extend 24) c_~var_1_19~0))) c_~var_1_28~0) (= c_~var_1_19~0 c_~var_1_18~0) (= ((_ extract 15 0) (bvadd ((_ zero_extend 16) c_~var_1_32~0) (bvneg .cse1) (_ bv25454 32))) c_~var_1_31~0) (= .cse2 c_~var_1_13~0) (not (fp.leq .cse3 (fp.sub c_currentRoundingMode c_~var_1_4~0 c_~var_1_5~0))) (bvsge (bvsdiv (bvmul ((_ sign_extend 24) c_~var_1_6~0) .cse1) (_ bv4294967232 32)) .cse2) (= c_~var_1_22~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) c_~var_1_21~0) (_ bv0 32)) (or (not .cse0) (not (bvugt c_~last_1_var_1_13~0 .cse4))) (or (fp.leq c_~var_1_5~0 .cse3) (and (fp.leq c_~var_1_5~0 (fp.neg c_~var_1_4~0)) (fp.lt c_~var_1_4~0 c_~var_1_3~0))) (not (fp.eq c_~var_1_4~0 c_~var_1_5~0)) (= c_~var_1_7~0 c_~var_1_6~0) (= c_~var_1_23~0 c_~var_1_27~0) (= c_~var_1_1~0 (_ bv0 8)) (= c_~var_1_33~0 ((_ zero_extend 16) c_~var_1_30~0))))) is different from false [2023-12-24 05:31:22,873 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ zero_extend 16) c_~last_1_var_1_31~0))) (let ((.cse1 ((_ sign_extend 24) (_ bv0 8))) (.cse2 ((_ zero_extend 16) c_~var_1_28~0)) (.cse0 (bvugt .cse4 c_~var_1_16~0)) (.cse3 (fp.neg c_~var_1_3~0))) (and (or .cse0 (not (bvugt c_~last_1_var_1_13~0 c_~var_1_16~0))) (not (fp.lt c_~var_1_34~0 (fp.div c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode c_~var_1_5~0) c_~var_1_35~0))) (= ((_ extract 15 0) (bvadd ((_ zero_extend 24) c_~var_1_25~0) ((_ zero_extend 24) c_~var_1_19~0))) c_~var_1_28~0) (= c_~var_1_19~0 c_~var_1_18~0) (= ((_ extract 15 0) (bvadd ((_ zero_extend 16) c_~var_1_32~0) (bvneg .cse1) (_ bv25454 32))) c_~var_1_31~0) (= .cse2 c_~var_1_13~0) (not (fp.leq .cse3 (fp.sub c_currentRoundingMode c_~var_1_4~0 c_~var_1_5~0))) (bvsge (bvsdiv (bvmul ((_ sign_extend 24) c_~var_1_6~0) .cse1) (_ bv4294967232 32)) .cse2) (= c_~var_1_22~0 (_ bv0 8)) (bvsle ((_ zero_extend 24) c_~var_1_21~0) (_ bv0 32)) (or (not .cse0) (not (bvugt c_~last_1_var_1_13~0 .cse4))) (or (fp.leq c_~var_1_5~0 .cse3) (and (fp.leq c_~var_1_5~0 (fp.neg c_~var_1_4~0)) (fp.lt c_~var_1_4~0 c_~var_1_3~0))) (not (fp.eq c_~var_1_4~0 c_~var_1_5~0)) (= c_~var_1_7~0 c_~var_1_6~0) (= c_~var_1_23~0 c_~var_1_27~0) (= c_~var_1_1~0 (_ bv0 8)) (= c_~var_1_33~0 ((_ zero_extend 16) c_~var_1_30~0))))) is different from true [2023-12-24 05:31:32,703 WARN L293 SmtUtils]: Spent 9.82s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:31:42,344 WARN L293 SmtUtils]: Spent 9.64s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:31:52,020 WARN L293 SmtUtils]: Spent 9.68s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:32:01,756 WARN L293 SmtUtils]: Spent 9.74s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:32:11,499 WARN L293 SmtUtils]: Spent 9.74s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:32:21,236 WARN L293 SmtUtils]: Spent 9.74s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:32:30,942 WARN L293 SmtUtils]: Spent 9.71s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:32:40,673 WARN L293 SmtUtils]: Spent 9.73s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:32:50,502 WARN L293 SmtUtils]: Spent 9.83s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:33:00,277 WARN L293 SmtUtils]: Spent 9.77s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:33:10,045 WARN L293 SmtUtils]: Spent 9.77s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:33:19,773 WARN L293 SmtUtils]: Spent 9.73s on a formula simplification that was a NOOP. DAG size: 10 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:33:29,567 WARN L293 SmtUtils]: Spent 9.79s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:33:39,343 WARN L293 SmtUtils]: Spent 9.77s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:33:49,047 WARN L293 SmtUtils]: Spent 9.70s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:33:58,752 WARN L293 SmtUtils]: Spent 9.70s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:34:08,458 WARN L293 SmtUtils]: Spent 9.71s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:34:18,201 WARN L293 SmtUtils]: Spent 9.74s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:34:27,156 WARN L293 SmtUtils]: Spent 8.95s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:34:36,879 WARN L293 SmtUtils]: Spent 9.72s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:34:46,617 WARN L293 SmtUtils]: Spent 9.74s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:34:56,383 WARN L293 SmtUtils]: Spent 9.75s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:35:06,153 WARN L293 SmtUtils]: Spent 9.77s on a formula simplification that was a NOOP. DAG size: 5 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-24 05:35:15,927 WARN L293 SmtUtils]: Spent 9.77s on a formula simplification that was a NOOP. DAG size: 4 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2023-12-24 05:35:21,754 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 05:35:21,754 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 05:35:22,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-12-24 05:35:22,961 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-24 05:35:23,097 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-24 05:35:23,098 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 202 with TraceHistMax 32,while TraceCheckSpWp was constructing forward predicates,while executing Executor. [2023-12-24 05:35:23,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-24 05:35:23,101 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-24 05:35:23,103 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 05:35:23,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 05:35:23 BoogieIcfgContainer [2023-12-24 05:35:23,104 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 05:35:23,104 INFO L158 Benchmark]: Toolchain (without parser) took 884292.88ms. Allocated memory was 183.5MB in the beginning and 286.3MB in the end (delta: 102.8MB). Free memory was 144.2MB in the beginning and 184.3MB in the end (delta: -40.2MB). Peak memory consumption was 63.3MB. Max. memory is 8.0GB. [2023-12-24 05:35:23,104 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 183.5MB. Free memory is still 135.6MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 05:35:23,105 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.48ms. Allocated memory is still 183.5MB. Free memory was 143.8MB in the beginning and 126.0MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2023-12-24 05:35:23,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.01ms. Allocated memory is still 183.5MB. Free memory was 126.0MB in the beginning and 123.2MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-24 05:35:23,105 INFO L158 Benchmark]: Boogie Preprocessor took 54.89ms. Allocated memory is still 183.5MB. Free memory was 123.2MB in the beginning and 118.7MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-24 05:35:23,105 INFO L158 Benchmark]: RCFGBuilder took 15149.76ms. Allocated memory is still 183.5MB. Free memory was 118.7MB in the beginning and 89.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. [2023-12-24 05:35:23,105 INFO L158 Benchmark]: TraceAbstraction took 868742.93ms. Allocated memory was 183.5MB in the beginning and 286.3MB in the end (delta: 102.8MB). Free memory was 88.6MB in the beginning and 184.3MB in the end (delta: -95.7MB). Peak memory consumption was 7.7MB. Max. memory is 8.0GB. [2023-12-24 05:35:23,106 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.41ms. Allocated memory is still 183.5MB. Free memory is still 135.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 284.48ms. Allocated memory is still 183.5MB. Free memory was 143.8MB in the beginning and 126.0MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 56.01ms. Allocated memory is still 183.5MB. Free memory was 126.0MB in the beginning and 123.2MB in the end (delta: 2.7MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 54.89ms. Allocated memory is still 183.5MB. Free memory was 123.2MB in the beginning and 118.7MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 15149.76ms. Allocated memory is still 183.5MB. Free memory was 118.7MB in the beginning and 89.3MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 8.0GB. * TraceAbstraction took 868742.93ms. Allocated memory was 183.5MB in the beginning and 286.3MB in the end (delta: 102.8MB). Free memory was 88.6MB in the beginning and 184.3MB in the end (delta: -95.7MB). Peak memory consumption was 7.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 - TimeoutResultAtElement [Line: 19]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 19). Cancelled while NwaCegarLoop was analyzing trace of length 202 with TraceHistMax 32,while TraceCheckSpWp was constructing forward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 88 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 868.7s, OverallIterations: 6, TraceHistogramMax: 32, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 308.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 63 mSolverCounterUnknown, 749 SdHoareTripleChecker+Valid, 296.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 734 mSDsluCounter, 2265 SdHoareTripleChecker+Invalid, 293.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1711 mSDsCounter, 513 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1393 IncrementalHoareTripleChecker+Invalid, 1969 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 513 mSolverCounterUnsat, 554 mSDtfsCounter, 1393 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1667 GetRequests, 1595 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 17.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=261occurred in iteration=5, InterpolantAutomatonStates: 53, 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, 174 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 4.7s SatisfiabilityAnalysisTime, 51.7s InterpolantComputationTime, 1196 NumberOfCodeBlocks, 1196 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 1586 ConstructedInterpolants, 8 QuantifiedInterpolants, 7199 SizeOfPredicates, 25 NumberOfNonLiveVariables, 1947 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 15563/15872 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown