/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_fillercode_fillercodestructure_filler-pe-co_file-91.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 12:06:27,121 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 12:06:27,184 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 12:06:27,187 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 12:06:27,187 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 12:06:27,208 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 12:06:27,209 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 12:06:27,209 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 12:06:27,210 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 12:06:27,213 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 12:06:27,213 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 12:06:27,213 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 12:06:27,213 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 12:06:27,214 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 12:06:27,214 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 12:06:27,215 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 12:06:27,215 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 12:06:27,215 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 12:06:27,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 12:06:27,215 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 12:06:27,216 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 12:06:27,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 12:06:27,216 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 12:06:27,216 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 12:06:27,217 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 12:06:27,217 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 12:06:27,217 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 12:06:27,217 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 12:06:27,217 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 12:06:27,217 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 12:06:27,218 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 12:06:27,218 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 12:06:27,218 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 12:06:27,219 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 12:06:27,219 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 12:06:27,219 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 12:06:27,219 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 12:06:27,219 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 12:06:27,219 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 12:06:27,219 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 12:06:27,219 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 12:06:27,220 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 12:06:27,220 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 12:06:27,220 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 12:06:27,220 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 12:06:27,220 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 12:06:27,220 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 12:06:27,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 12:06:27,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 12:06:27,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 12:06:27,440 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 12:06:27,440 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 12:06:27,441 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-91.i [2023-12-16 12:06:28,622 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 12:06:28,749 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 12:06:28,749 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-co_file-91.i [2023-12-16 12:06:28,758 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8eef75c1/bdacbdb58cd14fcba8d9e48d8ad01c60/FLAG8cc5c6dcb [2023-12-16 12:06:28,770 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8eef75c1/bdacbdb58cd14fcba8d9e48d8ad01c60 [2023-12-16 12:06:28,772 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 12:06:28,773 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 12:06:28,774 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 12:06:28,774 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 12:06:28,777 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 12:06:28,778 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:06:28" (1/1) ... [2023-12-16 12:06:28,779 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e51cebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:06:28, skipping insertion in model container [2023-12-16 12:06:28,779 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 12:06:28" (1/1) ... [2023-12-16 12:06:28,813 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 12:06:28,944 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_fillercode_fillercodestructure_filler-pe-co_file-91.i[919,932] [2023-12-16 12:06:28,998 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 12:06:29,013 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 12:06:29,021 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_fillercode_fillercodestructure_filler-pe-co_file-91.i[919,932] [2023-12-16 12:06:29,047 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 12:06:29,060 INFO L206 MainTranslator]: Completed translation [2023-12-16 12:06:29,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:06:29 WrapperNode [2023-12-16 12:06:29,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 12:06:29,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 12:06:29,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 12:06:29,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 12:06:29,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:06:29" (1/1) ... [2023-12-16 12:06:29,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:06:29" (1/1) ... [2023-12-16 12:06:29,099 INFO L138 Inliner]: procedures = 27, calls = 54, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 245 [2023-12-16 12:06:29,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 12:06:29,100 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 12:06:29,100 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 12:06:29,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 12:06:29,114 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:06:29" (1/1) ... [2023-12-16 12:06:29,115 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:06:29" (1/1) ... [2023-12-16 12:06:29,121 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:06:29" (1/1) ... [2023-12-16 12:06:29,138 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2023-12-16 12:06:29,139 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:06:29" (1/1) ... [2023-12-16 12:06:29,139 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:06:29" (1/1) ... [2023-12-16 12:06:29,148 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:06:29" (1/1) ... [2023-12-16 12:06:29,151 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:06:29" (1/1) ... [2023-12-16 12:06:29,153 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:06:29" (1/1) ... [2023-12-16 12:06:29,154 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:06:29" (1/1) ... [2023-12-16 12:06:29,157 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 12:06:29,158 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 12:06:29,158 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 12:06:29,158 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 12:06:29,159 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:06:29" (1/1) ... [2023-12-16 12:06:29,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 12:06:29,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 12:06:29,182 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 12:06:29,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 12:06:29,202 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 12:06:29,202 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 12:06:29,202 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 12:06:29,202 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 12:06:29,202 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 12:06:29,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 12:06:29,268 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 12:06:29,270 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 12:06:38,043 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 12:06:38,116 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 12:06:38,116 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 12:06:38,117 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:06:38 BoogieIcfgContainer [2023-12-16 12:06:38,117 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 12:06:38,119 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 12:06:38,120 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 12:06:38,122 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 12:06:38,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 12:06:28" (1/3) ... [2023-12-16 12:06:38,123 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b499f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:06:38, skipping insertion in model container [2023-12-16 12:06:38,123 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 12:06:29" (2/3) ... [2023-12-16 12:06:38,124 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b499f93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 12:06:38, skipping insertion in model container [2023-12-16 12:06:38,124 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 12:06:38" (3/3) ... [2023-12-16 12:06:38,124 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-co_file-91.i [2023-12-16 12:06:38,136 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 12:06:38,136 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 12:06:38,180 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 12:06:38,184 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;@540efdab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 12:06:38,184 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 12:06:38,187 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 60 states have internal predecessors, (82), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-16 12:06:38,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2023-12-16 12:06:38,215 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:06:38,217 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:06:38,217 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:06:38,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:06:38,223 INFO L85 PathProgramCache]: Analyzing trace with hash -235603460, now seen corresponding path program 1 times [2023-12-16 12:06:38,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:06:38,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1264849375] [2023-12-16 12:06:38,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:06:38,235 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:06:38,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:06:38,250 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 12:06:38,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 12:06:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:06:38,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 12:06:38,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:06:38,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 780 proven. 0 refuted. 0 times theorem prover too weak. 2500 trivial. 0 not checked. [2023-12-16 12:06:38,922 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 12:06:38,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:06:38,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1264849375] [2023-12-16 12:06:38,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1264849375] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 12:06:38,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 12:06:38,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 12:06:38,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280157326] [2023-12-16 12:06:38,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 12:06:38,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 12:06:38,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:06:38,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 12:06:38,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 12:06:38,954 INFO L87 Difference]: Start difference. First operand has 103 states, 59 states have (on average 1.3898305084745763) internal successors, (82), 60 states have internal predecessors, (82), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2023-12-16 12:06:39,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 12:06:39,101 INFO L93 Difference]: Finished difference Result 203 states and 367 transitions. [2023-12-16 12:06:39,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 12:06:39,113 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 254 [2023-12-16 12:06:39,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 12:06:39,119 INFO L225 Difference]: With dead ends: 203 [2023-12-16 12:06:39,119 INFO L226 Difference]: Without dead ends: 101 [2023-12-16 12:06:39,122 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 253 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-16 12:06:39,124 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 12:06:39,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 12:06:39,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-12-16 12:06:39,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2023-12-16 12:06:39,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 58 states have (on average 1.293103448275862) internal successors, (75), 58 states have internal predecessors, (75), 41 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-16 12:06:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 157 transitions. [2023-12-16 12:06:39,160 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 157 transitions. Word has length 254 [2023-12-16 12:06:39,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 12:06:39,160 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 157 transitions. [2023-12-16 12:06:39,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2023-12-16 12:06:39,160 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 157 transitions. [2023-12-16 12:06:39,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2023-12-16 12:06:39,163 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:06:39,164 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:06:39,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-12-16 12:06:39,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-16 12:06:39,381 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:06:39,381 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:06:39,381 INFO L85 PathProgramCache]: Analyzing trace with hash 108006528, now seen corresponding path program 1 times [2023-12-16 12:06:39,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:06:39,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [80909936] [2023-12-16 12:06:39,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:06:39,382 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:06:39,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:06:39,386 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 12:06:39,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 12:06:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:06:39,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 12:06:39,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:06:40,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 1674 proven. 63 refuted. 0 times theorem prover too weak. 1543 trivial. 0 not checked. [2023-12-16 12:06:40,980 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 12:06:41,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 57 proven. 63 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2023-12-16 12:06:41,651 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:06:41,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [80909936] [2023-12-16 12:06:41,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [80909936] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 12:06:41,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 12:06:41,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-12-16 12:06:41,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940243473] [2023-12-16 12:06:41,652 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 12:06:41,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 12:06:41,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:06:41,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 12:06:41,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-16 12:06:41,654 INFO L87 Difference]: Start difference. First operand 101 states and 157 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2023-12-16 12:06:44,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 12:06:44,319 INFO L93 Difference]: Finished difference Result 293 states and 447 transitions. [2023-12-16 12:06:44,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 12:06:44,319 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) Word has length 255 [2023-12-16 12:06:44,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 12:06:44,322 INFO L225 Difference]: With dead ends: 293 [2023-12-16 12:06:44,322 INFO L226 Difference]: Without dead ends: 193 [2023-12-16 12:06:44,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 520 GetRequests, 502 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2023-12-16 12:06:44,324 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 240 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 479 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 479 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2023-12-16 12:06:44,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 447 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 479 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2023-12-16 12:06:44,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2023-12-16 12:06:44,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 104. [2023-12-16 12:06:44,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 60 states have (on average 1.2166666666666666) internal successors, (73), 60 states have internal predecessors, (73), 41 states have call successors, (41), 2 states have call predecessors, (41), 2 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2023-12-16 12:06:44,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 155 transitions. [2023-12-16 12:06:44,341 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 155 transitions. Word has length 255 [2023-12-16 12:06:44,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 12:06:44,341 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 155 transitions. [2023-12-16 12:06:44,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (62), 2 states have call predecessors, (62), 4 states have return successors, (63), 2 states have call predecessors, (63), 2 states have call successors, (63) [2023-12-16 12:06:44,342 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 155 transitions. [2023-12-16 12:06:44,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-12-16 12:06:44,344 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:06:44,344 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:06:44,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-16 12:06:44,550 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:06:44,556 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:06:44,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:06:44,557 INFO L85 PathProgramCache]: Analyzing trace with hash 1684964288, now seen corresponding path program 1 times [2023-12-16 12:06:44,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:06:44,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [988191043] [2023-12-16 12:06:44,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:06:44,558 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:06:44,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:06:44,562 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 12:06:44,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 12:06:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:06:45,087 INFO L262 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 7 conjunts are in the unsatisfiable core [2023-12-16 12:06:45,093 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:06:46,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 1754 proven. 99 refuted. 0 times theorem prover too weak. 1427 trivial. 0 not checked. [2023-12-16 12:06:46,922 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 12:06:48,122 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 135 proven. 102 refuted. 0 times theorem prover too weak. 3043 trivial. 0 not checked. [2023-12-16 12:06:48,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:06:48,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [988191043] [2023-12-16 12:06:48,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [988191043] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 12:06:48,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 12:06:48,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2023-12-16 12:06:48,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210039998] [2023-12-16 12:06:48,123 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 12:06:48,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 12:06:48,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:06:48,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 12:06:48,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-12-16 12:06:48,125 INFO L87 Difference]: Start difference. First operand 104 states and 155 transitions. Second operand has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (59), 3 states have call predecessors, (59), 7 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) [2023-12-16 12:06:50,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 12:06:50,779 INFO L93 Difference]: Finished difference Result 267 states and 390 transitions. [2023-12-16 12:06:50,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-12-16 12:06:50,780 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (59), 3 states have call predecessors, (59), 7 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) Word has length 256 [2023-12-16 12:06:50,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 12:06:50,782 INFO L225 Difference]: With dead ends: 267 [2023-12-16 12:06:50,782 INFO L226 Difference]: Without dead ends: 164 [2023-12-16 12:06:50,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 499 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2023-12-16 12:06:50,784 INFO L413 NwaCegarLoop]: 146 mSDtfsCounter, 145 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 570 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-12-16 12:06:50,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 379 Invalid, 657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 570 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-12-16 12:06:50,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-12-16 12:06:50,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 150. [2023-12-16 12:06:50,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 81 states have (on average 1.1481481481481481) internal successors, (93), 82 states have internal predecessors, (93), 63 states have call successors, (63), 5 states have call predecessors, (63), 5 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2023-12-16 12:06:50,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 219 transitions. [2023-12-16 12:06:50,799 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 219 transitions. Word has length 256 [2023-12-16 12:06:50,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 12:06:50,800 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 219 transitions. [2023-12-16 12:06:50,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.0) internal successors, (72), 12 states have internal predecessors, (72), 3 states have call successors, (59), 3 states have call predecessors, (59), 7 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) [2023-12-16 12:06:50,800 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 219 transitions. [2023-12-16 12:06:50,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-12-16 12:06:50,802 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:06:50,802 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:06:50,817 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-16 12:06:51,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:06:51,016 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:06:51,017 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:06:51,017 INFO L85 PathProgramCache]: Analyzing trace with hash 983899710, now seen corresponding path program 1 times [2023-12-16 12:06:51,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:06:51,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1404333886] [2023-12-16 12:06:51,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:06:51,018 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:06:51,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:06:51,033 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 12:06:51,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 12:06:51,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:06:51,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 4 conjunts are in the unsatisfiable core [2023-12-16 12:06:51,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:06:52,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 1374 proven. 33 refuted. 0 times theorem prover too weak. 1873 trivial. 0 not checked. [2023-12-16 12:06:52,276 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 12:06:52,902 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 87 proven. 33 refuted. 0 times theorem prover too weak. 3160 trivial. 0 not checked. [2023-12-16 12:06:52,904 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:06:52,904 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1404333886] [2023-12-16 12:06:52,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1404333886] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 12:06:52,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 12:06:52,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2023-12-16 12:06:52,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865817845] [2023-12-16 12:06:52,905 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 12:06:52,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-12-16 12:06:52,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:06:52,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-12-16 12:06:52,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-12-16 12:06:52,906 INFO L87 Difference]: Start difference. First operand 150 states and 219 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2023-12-16 12:06:54,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 12:06:54,086 INFO L93 Difference]: Finished difference Result 275 states and 391 transitions. [2023-12-16 12:06:54,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-12-16 12:06:54,097 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) Word has length 256 [2023-12-16 12:06:54,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 12:06:54,100 INFO L225 Difference]: With dead ends: 275 [2023-12-16 12:06:54,100 INFO L226 Difference]: Without dead ends: 164 [2023-12-16 12:06:54,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 514 GetRequests, 504 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2023-12-16 12:06:54,101 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 72 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-12-16 12:06:54,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 227 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-12-16 12:06:54,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-12-16 12:06:54,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 154. [2023-12-16 12:06:54,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 84 states have (on average 1.130952380952381) internal successors, (95), 85 states have internal predecessors, (95), 63 states have call successors, (63), 6 states have call predecessors, (63), 6 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2023-12-16 12:06:54,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 221 transitions. [2023-12-16 12:06:54,116 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 221 transitions. Word has length 256 [2023-12-16 12:06:54,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 12:06:54,116 INFO L495 AbstractCegarLoop]: Abstraction has 154 states and 221 transitions. [2023-12-16 12:06:54,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2023-12-16 12:06:54,117 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 221 transitions. [2023-12-16 12:06:54,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2023-12-16 12:06:54,118 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 12:06:54,118 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 12:06:54,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2023-12-16 12:06:54,332 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:06:54,333 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 12:06:54,333 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 12:06:54,333 INFO L85 PathProgramCache]: Analyzing trace with hash 174553084, now seen corresponding path program 1 times [2023-12-16 12:06:54,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 12:06:54,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [958090614] [2023-12-16 12:06:54,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 12:06:54,334 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:06:54,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 12:06:54,335 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 12:06:54,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 12:06:54,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 12:06:54,820 INFO L262 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 12:06:54,823 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 12:07:04,530 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-16 12:07:12,675 WARN L293 SmtUtils]: Spent 8.13s 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-16 12:07:16,814 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.lt c_~var_1_17~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (or (and (not .cse0) (exists ((~var_1_51~0 (_ FloatingPoint 11 53)) (~var_1_53~0 (_ FloatingPoint 11 53)) (~var_1_54~0 (_ FloatingPoint 11 53))) (fp.geq (fp.sub roundNearestTiesToEven ~var_1_53~0 ~var_1_54~0) (fp.mul roundNearestTiesToEven (fp.neg ~var_1_51~0) ((_ to_fp 11 53) roundNearestTiesToEven c_~var_1_17~0))))) (and (exists ((~var_1_51~0 (_ FloatingPoint 11 53)) (~var_1_53~0 (_ FloatingPoint 11 53)) (~var_1_54~0 (_ FloatingPoint 11 53))) (fp.geq (fp.sub roundNearestTiesToEven ~var_1_53~0 ~var_1_54~0) (fp.mul roundNearestTiesToEven (fp.neg ~var_1_51~0) ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg c_~var_1_17~0))))) .cse0))) is different from false [2023-12-16 12:07:25,154 WARN L293 SmtUtils]: Spent 8.14s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 731] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2023-12-16 12:07:33,343 WARN L293 SmtUtils]: Spent 8.16s 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-16 12:07:33,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3280 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3280 trivial. 0 not checked. [2023-12-16 12:07:33,747 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 12:07:33,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 12:07:33,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [958090614] [2023-12-16 12:07:33,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [958090614] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 12:07:33,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 12:07:33,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 12:07:33,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407115067] [2023-12-16 12:07:33,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 12:07:33,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-16 12:07:33,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 12:07:33,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-16 12:07:33,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=4, Unknown=1, NotChecked=2, Total=12 [2023-12-16 12:07:33,749 INFO L87 Difference]: Start difference. First operand 154 states and 221 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 3 states have internal predecessors, (54), 1 states have call successors, (41), 1 states have call predecessors, (41), 1 states have return successors, (41), 1 states have call predecessors, (41), 1 states have call successors, (41) [2023-12-16 12:07:38,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 12:07:42,394 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse0 (fp.lt c_~var_1_17~0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv0 32))))) (or (and (not .cse0) (exists ((~var_1_51~0 (_ FloatingPoint 11 53)) (~var_1_53~0 (_ FloatingPoint 11 53)) (~var_1_54~0 (_ FloatingPoint 11 53))) (fp.geq (fp.sub roundNearestTiesToEven ~var_1_53~0 ~var_1_54~0) (fp.mul roundNearestTiesToEven (fp.neg ~var_1_51~0) ((_ to_fp 11 53) roundNearestTiesToEven c_~var_1_17~0))))) (and (exists ((~var_1_51~0 (_ FloatingPoint 11 53)) (~var_1_53~0 (_ FloatingPoint 11 53)) (~var_1_54~0 (_ FloatingPoint 11 53))) (fp.geq (fp.sub roundNearestTiesToEven ~var_1_53~0 ~var_1_54~0) (fp.mul roundNearestTiesToEven (fp.neg ~var_1_51~0) ((_ to_fp 11 53) roundNearestTiesToEven (fp.neg c_~var_1_17~0))))) .cse0))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false Received shutdown request... [2023-12-16 12:07:46,346 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 12:07:46,379 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 (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 12:07:46,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-12-16 12:07:46,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-16 12:07:46,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=7, Invalid=5, Unknown=2, NotChecked=6, Total=20 [2023-12-16 12:07:46,638 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 12 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2023-12-16 12:07:46,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 193 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 2 Unknown, 75 Unchecked, 8.6s Time] [2023-12-16 12:07:46,640 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 12:07:46,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-12-16 12:07:46,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 12:07:46,842 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was constructing difference of abstraction (154states) and FLOYD_HOARE automaton (currently 4 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (109 states constructed, input type IntersectNwa). [2023-12-16 12:07:46,845 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-16 12:07:46,846 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 12:07:46,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 12:07:46 BoogieIcfgContainer [2023-12-16 12:07:46,848 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 12:07:46,848 INFO L158 Benchmark]: Toolchain (without parser) took 78075.46ms. Allocated memory is still 278.9MB. Free memory was 226.9MB in the beginning and 159.8MB in the end (delta: 67.1MB). Peak memory consumption was 67.7MB. Max. memory is 8.0GB. [2023-12-16 12:07:46,848 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 180.4MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 12:07:46,848 INFO L158 Benchmark]: CACSL2BoogieTranslator took 286.72ms. Allocated memory is still 278.9MB. Free memory was 226.9MB in the beginning and 209.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2023-12-16 12:07:46,849 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.83ms. Allocated memory is still 278.9MB. Free memory was 209.8MB in the beginning and 207.0MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 12:07:46,849 INFO L158 Benchmark]: Boogie Preprocessor took 57.31ms. Allocated memory is still 278.9MB. Free memory was 207.0MB in the beginning and 202.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2023-12-16 12:07:46,849 INFO L158 Benchmark]: RCFGBuilder took 8958.63ms. Allocated memory is still 278.9MB. Free memory was 202.8MB in the beginning and 231.9MB in the end (delta: -29.1MB). Peak memory consumption was 24.4MB. Max. memory is 8.0GB. [2023-12-16 12:07:46,849 INFO L158 Benchmark]: TraceAbstraction took 68728.41ms. Allocated memory is still 278.9MB. Free memory was 231.4MB in the beginning and 159.8MB in the end (delta: 71.6MB). Peak memory consumption was 71.6MB. Max. memory is 8.0GB. [2023-12-16 12:07:46,852 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 180.4MB. Free memory is still 129.4MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 286.72ms. Allocated memory is still 278.9MB. Free memory was 226.9MB in the beginning and 209.8MB in the end (delta: 17.1MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 38.83ms. Allocated memory is still 278.9MB. Free memory was 209.8MB in the beginning and 207.0MB in the end (delta: 2.8MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 57.31ms. Allocated memory is still 278.9MB. Free memory was 207.0MB in the beginning and 202.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * RCFGBuilder took 8958.63ms. Allocated memory is still 278.9MB. Free memory was 202.8MB in the beginning and 231.9MB in the end (delta: -29.1MB). Peak memory consumption was 24.4MB. Max. memory is 8.0GB. * TraceAbstraction took 68728.41ms. Allocated memory is still 278.9MB. Free memory was 231.4MB in the beginning and 159.8MB in the end (delta: 71.6MB). Peak memory consumption was 71.6MB. 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 constructing difference of abstraction (154states) and FLOYD_HOARE automaton (currently 4 states, 4 states before enhancement),while ReachableStatesComputation was computing reachable states (109 states constructed, input type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 68.7s, OverallIterations: 5, TraceHistogramMax: 41, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 19.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 562 SdHoareTripleChecker+Valid, 14.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 469 mSDsluCounter, 1400 SdHoareTripleChecker+Invalid, 13.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 75 IncrementalHoareTripleChecker+Unchecked, 688 mSDsCounter, 263 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1287 IncrementalHoareTripleChecker+Invalid, 1627 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 263 mSolverCounterUnsat, 712 mSDtfsCounter, 1287 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2060 GetRequests, 2011 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 10.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=154occurred in iteration=4, InterpolantAutomatonStates: 43, 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, 4 MinimizatonAttempts, 113 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 45.2s InterpolantComputationTime, 1277 NumberOfCodeBlocks, 1277 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 2036 ConstructedInterpolants, 2 QuantifiedInterpolants, 4873 SizeOfPredicates, 15 NumberOfNonLiveVariables, 2071 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 25847/26240 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