/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_fillercodesize_ps-cn-100_file-65.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 10:49:03,230 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 10:49:03,295 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 10:49:03,297 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 10:49:03,298 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 10:49:03,325 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 10:49:03,325 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 10:49:03,326 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 10:49:03,326 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 10:49:03,326 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 10:49:03,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 10:49:03,327 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 10:49:03,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 10:49:03,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 10:49:03,327 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 10:49:03,328 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 10:49:03,328 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 10:49:03,328 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 10:49:03,328 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 10:49:03,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 10:49:03,329 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 10:49:03,329 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 10:49:03,329 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 10:49:03,330 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 10:49:03,330 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 10:49:03,330 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 10:49:03,330 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 10:49:03,330 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 10:49:03,331 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 10:49:03,331 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 10:49:03,331 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 10:49:03,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 10:49:03,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 10:49:03,331 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 10:49:03,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 10:49:03,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 10:49:03,332 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 10:49:03,332 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 10:49:03,332 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 10:49:03,332 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 10:49:03,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 10:49:03,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 10:49:03,333 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 10:49:03,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 10:49:03,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 10:49:03,333 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 10:49:03,333 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 10:49:03,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 10:49:03,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 10:49:03,531 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 10:49:03,532 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 10:49:03,535 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 10:49:03,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-65.i [2023-12-16 10:49:04,676 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 10:49:04,859 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 10:49:04,859 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-100_file-65.i [2023-12-16 10:49:04,866 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/996279d47/ab8a69582231460a8c4e0f954b2fcb9a/FLAG97eb2bb08 [2023-12-16 10:49:04,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/996279d47/ab8a69582231460a8c4e0f954b2fcb9a [2023-12-16 10:49:04,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 10:49:04,879 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 10:49:04,879 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 10:49:04,879 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 10:49:04,883 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 10:49:04,884 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:49:04" (1/1) ... [2023-12-16 10:49:04,885 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16b81946 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:49:04, skipping insertion in model container [2023-12-16 10:49:04,885 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 10:49:04" (1/1) ... [2023-12-16 10:49:04,923 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 10:49:05,048 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_fillercodesize_ps-cn-100_file-65.i[916,929] [2023-12-16 10:49:05,125 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 10:49:05,139 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 10:49:05,148 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_fillercodesize_ps-cn-100_file-65.i[916,929] [2023-12-16 10:49:05,197 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 10:49:05,222 INFO L206 MainTranslator]: Completed translation [2023-12-16 10:49:05,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:49:05 WrapperNode [2023-12-16 10:49:05,223 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 10:49:05,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 10:49:05,224 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 10:49:05,224 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 10:49:05,233 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:49:05" (1/1) ... [2023-12-16 10:49:05,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:49:05" (1/1) ... [2023-12-16 10:49:05,278 INFO L138 Inliner]: procedures = 27, calls = 70, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 319 [2023-12-16 10:49:05,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 10:49:05,279 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 10:49:05,279 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 10:49:05,279 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 10:49:05,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:49:05" (1/1) ... [2023-12-16 10:49:05,291 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:49:05" (1/1) ... [2023-12-16 10:49:05,294 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:49:05" (1/1) ... [2023-12-16 10:49:05,307 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 10:49:05,307 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:49:05" (1/1) ... [2023-12-16 10:49:05,307 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:49:05" (1/1) ... [2023-12-16 10:49:05,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:49:05" (1/1) ... [2023-12-16 10:49:05,353 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:49:05" (1/1) ... [2023-12-16 10:49:05,356 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:49:05" (1/1) ... [2023-12-16 10:49:05,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:49:05" (1/1) ... [2023-12-16 10:49:05,361 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 10:49:05,361 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 10:49:05,361 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 10:49:05,362 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 10:49:05,362 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:49:05" (1/1) ... [2023-12-16 10:49:05,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 10:49:05,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 10:49:05,413 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 10:49:05,440 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 10:49:05,446 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 10:49:05,446 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 10:49:05,446 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2023-12-16 10:49:05,446 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2023-12-16 10:49:05,447 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 10:49:05,447 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 10:49:05,521 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 10:49:05,523 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 10:49:07,444 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 10:49:07,511 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 10:49:07,511 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-12-16 10:49:07,511 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:49:07 BoogieIcfgContainer [2023-12-16 10:49:07,511 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 10:49:07,513 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 10:49:07,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 10:49:07,518 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 10:49:07,518 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 10:49:04" (1/3) ... [2023-12-16 10:49:07,519 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257c3de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 10:49:07, skipping insertion in model container [2023-12-16 10:49:07,519 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 10:49:05" (2/3) ... [2023-12-16 10:49:07,520 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@257c3de1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 10:49:07, skipping insertion in model container [2023-12-16 10:49:07,520 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 10:49:07" (3/3) ... [2023-12-16 10:49:07,521 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-100_file-65.i [2023-12-16 10:49:07,535 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 10:49:07,536 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 10:49:07,583 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 10:49:07,588 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;@107a7972, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 10:49:07,588 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 10:49:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand has 135 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 76 states have internal predecessors, (109), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2023-12-16 10:49:07,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2023-12-16 10:49:07,620 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 10:49:07,621 INFO L195 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:49:07,622 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 10:49:07,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 10:49:07,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1608411370, now seen corresponding path program 1 times [2023-12-16 10:49:07,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 10:49:07,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1747552524] [2023-12-16 10:49:07,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 10:49:07,640 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 10:49:07,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 10:49:07,660 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 10:49:07,728 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 10:49:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 10:49:08,186 INFO L262 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 10:49:08,195 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 10:49:08,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 5840 trivial. 0 not checked. [2023-12-16 10:49:08,261 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 10:49:08,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 10:49:08,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1747552524] [2023-12-16 10:49:08,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1747552524] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 10:49:08,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 10:49:08,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 10:49:08,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652757807] [2023-12-16 10:49:08,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 10:49:08,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 10:49:08,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 10:49:08,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 10:49:08,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 10:49:08,292 INFO L87 Difference]: Start difference. First operand has 135 states, 75 states have (on average 1.4533333333333334) internal successors, (109), 76 states have internal predecessors, (109), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) Second operand has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2023-12-16 10:49:09,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 10:49:09,271 INFO L93 Difference]: Finished difference Result 267 states and 501 transitions. [2023-12-16 10:49:09,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 10:49:09,291 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) Word has length 342 [2023-12-16 10:49:09,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 10:49:09,298 INFO L225 Difference]: With dead ends: 267 [2023-12-16 10:49:09,298 INFO L226 Difference]: Without dead ends: 133 [2023-12-16 10:49:09,302 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 341 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 10:49:09,305 INFO L413 NwaCegarLoop]: 214 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 214 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.9s IncrementalHoareTripleChecker+Time [2023-12-16 10:49:09,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 214 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-16 10:49:09,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-12-16 10:49:09,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2023-12-16 10:49:09,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 74 states have (on average 1.3918918918918919) internal successors, (103), 74 states have internal predecessors, (103), 57 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2023-12-16 10:49:09,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 217 transitions. [2023-12-16 10:49:09,353 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 217 transitions. Word has length 342 [2023-12-16 10:49:09,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 10:49:09,353 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 217 transitions. [2023-12-16 10:49:09,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 2 states have call successors, (57), 2 states have call predecessors, (57), 2 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2023-12-16 10:49:09,354 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 217 transitions. [2023-12-16 10:49:09,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2023-12-16 10:49:09,361 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 10:49:09,361 INFO L195 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:49:09,375 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 10:49:09,573 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 10:49:09,573 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 10:49:09,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 10:49:09,574 INFO L85 PathProgramCache]: Analyzing trace with hash -595566440, now seen corresponding path program 1 times [2023-12-16 10:49:09,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 10:49:09,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1750960785] [2023-12-16 10:49:09,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 10:49:09,575 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 10:49:09,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 10:49:09,577 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 10:49:09,585 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 10:49:09,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 10:49:10,000 INFO L262 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 10:49:10,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 10:49:10,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6384 trivial. 0 not checked. [2023-12-16 10:49:10,045 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 10:49:10,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 10:49:10,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1750960785] [2023-12-16 10:49:10,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1750960785] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 10:49:10,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 10:49:10,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-12-16 10:49:10,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624057166] [2023-12-16 10:49:10,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 10:49:10,047 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 10:49:10,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 10:49:10,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 10:49:10,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 10:49:10,048 INFO L87 Difference]: Start difference. First operand 133 states and 217 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2023-12-16 10:49:10,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 10:49:10,617 INFO L93 Difference]: Finished difference Result 336 states and 547 transitions. [2023-12-16 10:49:10,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 10:49:10,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) Word has length 342 [2023-12-16 10:49:10,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 10:49:10,625 INFO L225 Difference]: With dead ends: 336 [2023-12-16 10:49:10,625 INFO L226 Difference]: Without dead ends: 204 [2023-12-16 10:49:10,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 340 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 10:49:10,627 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 110 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 469 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-12-16 10:49:10,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 469 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-12-16 10:49:10,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2023-12-16 10:49:10,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2023-12-16 10:49:10,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 119 states have (on average 1.411764705882353) internal successors, (168), 120 states have internal predecessors, (168), 79 states have call successors, (79), 2 states have call predecessors, (79), 2 states have return successors, (79), 78 states have call predecessors, (79), 79 states have call successors, (79) [2023-12-16 10:49:10,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 326 transitions. [2023-12-16 10:49:10,669 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 326 transitions. Word has length 342 [2023-12-16 10:49:10,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 10:49:10,670 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 326 transitions. [2023-12-16 10:49:10,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (57), 1 states have call predecessors, (57), 1 states have return successors, (57), 1 states have call predecessors, (57), 1 states have call successors, (57) [2023-12-16 10:49:10,670 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 326 transitions. [2023-12-16 10:49:10,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2023-12-16 10:49:10,675 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 10:49:10,675 INFO L195 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:49:10,688 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-16 10:49:10,888 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 10:49:10,889 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 10:49:10,889 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 10:49:10,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1705256150, now seen corresponding path program 1 times [2023-12-16 10:49:10,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 10:49:10,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [426372490] [2023-12-16 10:49:10,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 10:49:10,891 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 10:49:10,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 10:49:10,893 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 10:49:10,901 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 10:49:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 10:49:11,315 INFO L262 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 10 conjunts are in the unsatisfiable core [2023-12-16 10:49:11,322 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 10:49:12,107 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 2684 proven. 114 refuted. 0 times theorem prover too weak. 3586 trivial. 0 not checked. [2023-12-16 10:49:12,108 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 10:49:12,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 372 proven. 123 refuted. 0 times theorem prover too weak. 5889 trivial. 0 not checked. [2023-12-16 10:49:12,637 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 10:49:12,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [426372490] [2023-12-16 10:49:12,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [426372490] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 10:49:12,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 10:49:12,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2023-12-16 10:49:12,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137861654] [2023-12-16 10:49:12,638 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 10:49:12,639 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-12-16 10:49:12,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 10:49:12,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-12-16 10:49:12,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2023-12-16 10:49:12,641 INFO L87 Difference]: Start difference. First operand 201 states and 326 transitions. Second operand has 20 states, 19 states have (on average 5.315789473684211) internal successors, (101), 18 states have internal predecessors, (101), 7 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (73), 7 states have call predecessors, (73), 7 states have call successors, (73) [2023-12-16 10:49:14,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 10:49:14,293 INFO L93 Difference]: Finished difference Result 419 states and 666 transitions. [2023-12-16 10:49:14,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-12-16 10:49:14,314 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 5.315789473684211) internal successors, (101), 18 states have internal predecessors, (101), 7 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (73), 7 states have call predecessors, (73), 7 states have call successors, (73) Word has length 342 [2023-12-16 10:49:14,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 10:49:14,318 INFO L225 Difference]: With dead ends: 419 [2023-12-16 10:49:14,318 INFO L226 Difference]: Without dead ends: 219 [2023-12-16 10:49:14,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 665 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=294, Invalid=576, Unknown=0, NotChecked=0, Total=870 [2023-12-16 10:49:14,320 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 463 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-12-16 10:49:14,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [505 Valid, 431 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-12-16 10:49:14,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2023-12-16 10:49:14,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 213. [2023-12-16 10:49:14,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 128 states have (on average 1.3671875) internal successors, (175), 129 states have internal predecessors, (175), 79 states have call successors, (79), 5 states have call predecessors, (79), 5 states have return successors, (79), 78 states have call predecessors, (79), 79 states have call successors, (79) [2023-12-16 10:49:14,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 333 transitions. [2023-12-16 10:49:14,346 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 333 transitions. Word has length 342 [2023-12-16 10:49:14,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 10:49:14,346 INFO L495 AbstractCegarLoop]: Abstraction has 213 states and 333 transitions. [2023-12-16 10:49:14,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 5.315789473684211) internal successors, (101), 18 states have internal predecessors, (101), 7 states have call successors, (72), 4 states have call predecessors, (72), 9 states have return successors, (73), 7 states have call predecessors, (73), 7 states have call successors, (73) [2023-12-16 10:49:14,347 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 333 transitions. [2023-12-16 10:49:14,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2023-12-16 10:49:14,349 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 10:49:14,349 INFO L195 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:49:14,373 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 10:49:14,573 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 10:49:14,573 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 10:49:14,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 10:49:14,574 INFO L85 PathProgramCache]: Analyzing trace with hash -157514976, now seen corresponding path program 1 times [2023-12-16 10:49:14,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 10:49:14,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141280680] [2023-12-16 10:49:14,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 10:49:14,575 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 10:49:14,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 10:49:14,580 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 10:49:14,585 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 10:49:14,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 10:49:14,990 INFO L262 TraceCheckSpWp]: Trace formula consists of 553 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 10:49:14,995 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 10:49:15,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 1268 proven. 150 refuted. 0 times theorem prover too weak. 4966 trivial. 0 not checked. [2023-12-16 10:49:15,411 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 10:49:15,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 18 proven. 150 refuted. 0 times theorem prover too weak. 6216 trivial. 0 not checked. [2023-12-16 10:49:15,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 10:49:15,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141280680] [2023-12-16 10:49:15,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141280680] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 10:49:15,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 10:49:15,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2023-12-16 10:49:15,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011384262] [2023-12-16 10:49:15,677 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 10:49:15,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-12-16 10:49:15,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 10:49:15,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-12-16 10:49:15,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-12-16 10:49:15,679 INFO L87 Difference]: Start difference. First operand 213 states and 333 transitions. Second operand has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (107), 2 states have call predecessors, (107), 4 states have return successors, (108), 2 states have call predecessors, (108), 2 states have call successors, (108) [2023-12-16 10:49:16,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 10:49:16,938 INFO L93 Difference]: Finished difference Result 449 states and 693 transitions. [2023-12-16 10:49:16,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-12-16 10:49:16,939 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (107), 2 states have call predecessors, (107), 4 states have return successors, (108), 2 states have call predecessors, (108), 2 states have call successors, (108) Word has length 344 [2023-12-16 10:49:16,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 10:49:16,942 INFO L225 Difference]: With dead ends: 449 [2023-12-16 10:49:16,942 INFO L226 Difference]: Without dead ends: 237 [2023-12-16 10:49:16,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 694 GetRequests, 679 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=153, Unknown=0, NotChecked=0, Total=240 [2023-12-16 10:49:16,943 INFO L413 NwaCegarLoop]: 162 mSDtfsCounter, 253 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2023-12-16 10:49:16,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 352 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2023-12-16 10:49:16,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2023-12-16 10:49:16,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 230. [2023-12-16 10:49:16,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 137 states have (on average 1.3284671532846715) internal successors, (182), 139 states have internal predecessors, (182), 85 states have call successors, (85), 7 states have call predecessors, (85), 7 states have return successors, (85), 83 states have call predecessors, (85), 85 states have call successors, (85) [2023-12-16 10:49:16,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 352 transitions. [2023-12-16 10:49:16,972 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 352 transitions. Word has length 344 [2023-12-16 10:49:16,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 10:49:16,974 INFO L495 AbstractCegarLoop]: Abstraction has 230 states and 352 transitions. [2023-12-16 10:49:16,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.11111111111111) internal successors, (73), 9 states have internal predecessors, (73), 2 states have call successors, (107), 2 states have call predecessors, (107), 4 states have return successors, (108), 2 states have call predecessors, (108), 2 states have call successors, (108) [2023-12-16 10:49:16,974 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 352 transitions. [2023-12-16 10:49:16,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2023-12-16 10:49:16,978 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 10:49:16,978 INFO L195 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:49:17,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 10:49:17,190 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 10:49:17,191 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 10:49:17,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 10:49:17,192 INFO L85 PathProgramCache]: Analyzing trace with hash -599749765, now seen corresponding path program 1 times [2023-12-16 10:49:17,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 10:49:17,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1446692476] [2023-12-16 10:49:17,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 10:49:17,193 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 10:49:17,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 10:49:17,194 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 10:49:17,242 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 10:49:17,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 10:49:17,652 INFO L262 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 5 conjunts are in the unsatisfiable core [2023-12-16 10:49:17,657 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 10:49:17,967 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 2742 proven. 117 refuted. 0 times theorem prover too weak. 3525 trivial. 0 not checked. [2023-12-16 10:49:17,967 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 10:49:18,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6384 backedges. 51 proven. 117 refuted. 0 times theorem prover too weak. 6216 trivial. 0 not checked. [2023-12-16 10:49:18,207 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 10:49:18,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1446692476] [2023-12-16 10:49:18,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1446692476] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 10:49:18,208 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 10:49:18,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2023-12-16 10:49:18,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063440581] [2023-12-16 10:49:18,208 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 10:49:18,210 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-12-16 10:49:18,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 10:49:18,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-12-16 10:49:18,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2023-12-16 10:49:18,212 INFO L87 Difference]: Start difference. First operand 230 states and 352 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 2 states have call successors, (96), 2 states have call predecessors, (96), 4 states have return successors, (97), 2 states have call predecessors, (97), 2 states have call successors, (97) [2023-12-16 10:49:20,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 10:49:20,005 INFO L93 Difference]: Finished difference Result 631 states and 951 transitions. [2023-12-16 10:49:20,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-12-16 10:49:20,006 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 2 states have call successors, (96), 2 states have call predecessors, (96), 4 states have return successors, (97), 2 states have call predecessors, (97), 2 states have call successors, (97) Word has length 345 [2023-12-16 10:49:20,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 10:49:20,009 INFO L225 Difference]: With dead ends: 631 [2023-12-16 10:49:20,009 INFO L226 Difference]: Without dead ends: 411 [2023-12-16 10:49:20,010 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 700 GetRequests, 682 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2023-12-16 10:49:20,011 INFO L413 NwaCegarLoop]: 292 mSDtfsCounter, 236 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 643 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2023-12-16 10:49:20,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 785 Invalid, 803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 643 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2023-12-16 10:49:20,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2023-12-16 10:49:20,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 342. [2023-12-16 10:49:20,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 342 states, 190 states have (on average 1.2263157894736842) internal successors, (233), 192 states have internal predecessors, (233), 136 states have call successors, (136), 15 states have call predecessors, (136), 15 states have return successors, (136), 134 states have call predecessors, (136), 136 states have call successors, (136) [2023-12-16 10:49:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 505 transitions. [2023-12-16 10:49:20,051 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 505 transitions. Word has length 345 [2023-12-16 10:49:20,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 10:49:20,056 INFO L495 AbstractCegarLoop]: Abstraction has 342 states and 505 transitions. [2023-12-16 10:49:20,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 2 states have call successors, (96), 2 states have call predecessors, (96), 4 states have return successors, (97), 2 states have call predecessors, (97), 2 states have call successors, (97) [2023-12-16 10:49:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 505 transitions. [2023-12-16 10:49:20,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2023-12-16 10:49:20,058 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 10:49:20,058 INFO L195 NwaCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 10:49:20,071 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 10:49:20,270 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 10:49:20,271 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 10:49:20,271 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 10:49:20,271 INFO L85 PathProgramCache]: Analyzing trace with hash -599690183, now seen corresponding path program 1 times [2023-12-16 10:49:20,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 10:49:20,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272592594] [2023-12-16 10:49:20,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 10:49:20,272 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 10:49:20,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 10:49:20,273 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 10:49:20,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 10:49:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 10:49:20,808 INFO L262 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 28 conjunts are in the unsatisfiable core [2023-12-16 10:49:20,816 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 10:50:02,465 WARN L293 SmtUtils]: Spent 9.32s on a formula simplification that was a NOOP. DAG size: 51 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2023-12-16 10:50:20,832 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 10:50:20,834 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 10:50:21,867 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 10:50:21,936 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 10:50:21,937 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 346 with TraceHistMax 57,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while executing Executor. [2023-12-16 10:50:21,940 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2023-12-16 10:50:21,941 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 10:50:21,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 10:50:21 BoogieIcfgContainer [2023-12-16 10:50:21,947 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 10:50:21,947 INFO L158 Benchmark]: Toolchain (without parser) took 77068.56ms. Allocated memory was 341.8MB in the beginning and 411.0MB in the end (delta: 69.2MB). Free memory was 289.9MB in the beginning and 239.6MB in the end (delta: 50.3MB). Peak memory consumption was 120.5MB. Max. memory is 8.0GB. [2023-12-16 10:50:21,947 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 195.0MB. Free memory is still 145.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 10:50:21,948 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.52ms. Allocated memory is still 341.8MB. Free memory was 289.5MB in the beginning and 270.3MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. [2023-12-16 10:50:21,948 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.40ms. Allocated memory is still 341.8MB. Free memory was 270.3MB in the beginning and 267.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 10:50:21,948 INFO L158 Benchmark]: Boogie Preprocessor took 81.59ms. Allocated memory is still 341.8MB. Free memory was 266.9MB in the beginning and 262.2MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. [2023-12-16 10:50:21,948 INFO L158 Benchmark]: RCFGBuilder took 2150.01ms. Allocated memory is still 341.8MB. Free memory was 262.2MB in the beginning and 289.9MB in the end (delta: -27.6MB). Peak memory consumption was 22.5MB. Max. memory is 8.0GB. [2023-12-16 10:50:21,948 INFO L158 Benchmark]: TraceAbstraction took 74433.90ms. Allocated memory was 341.8MB in the beginning and 411.0MB in the end (delta: 69.2MB). Free memory was 288.8MB in the beginning and 239.6MB in the end (delta: 49.3MB). Peak memory consumption was 118.0MB. Max. memory is 8.0GB. [2023-12-16 10:50:21,950 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.11ms. Allocated memory is still 195.0MB. Free memory is still 145.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 343.52ms. Allocated memory is still 341.8MB. Free memory was 289.5MB in the beginning and 270.3MB in the end (delta: 19.2MB). Peak memory consumption was 18.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 55.40ms. Allocated memory is still 341.8MB. Free memory was 270.3MB in the beginning and 267.2MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 81.59ms. Allocated memory is still 341.8MB. Free memory was 266.9MB in the beginning and 262.2MB in the end (delta: 4.7MB). Peak memory consumption was 5.2MB. Max. memory is 8.0GB. * RCFGBuilder took 2150.01ms. Allocated memory is still 341.8MB. Free memory was 262.2MB in the beginning and 289.9MB in the end (delta: -27.6MB). Peak memory consumption was 22.5MB. Max. memory is 8.0GB. * TraceAbstraction took 74433.90ms. Allocated memory was 341.8MB in the beginning and 411.0MB in the end (delta: 69.2MB). Free memory was 288.8MB in the beginning and 239.6MB in the end (delta: 49.3MB). Peak memory consumption was 118.0MB. 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 346 with TraceHistMax 57,while TraceCheckSpWp was constructing forward predicates,while PredicateUnifier was unifying predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 135 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 74.4s, OverallIterations: 6, TraceHistogramMax: 57, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1129 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1062 mSDsluCounter, 2251 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1163 mSDsCounter, 631 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1427 IncrementalHoareTripleChecker+Invalid, 2058 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 631 mSolverCounterUnsat, 1088 mSDtfsCounter, 1427 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2769 GetRequests, 2707 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 242 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=342occurred in iteration=5, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 85 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 1715 NumberOfCodeBlocks, 1715 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 2738 ConstructedInterpolants, 0 QuantifiedInterpolants, 6006 SizeOfPredicates, 19 NumberOfNonLiveVariables, 2760 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 50301/51072 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