/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'cvc5 --incremental --print-success --lang smt' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/float-newlib/double_req_bl_1252a.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-b75d321-m [2024-11-03 06:12:44,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-03 06:12:44,905 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-03 06:12:44,911 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-03 06:12:44,912 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-03 06:12:44,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-03 06:12:44,937 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-03 06:12:44,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-03 06:12:44,938 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-03 06:12:44,938 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-03 06:12:44,938 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-03 06:12:44,938 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-03 06:12:44,939 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-03 06:12:44,939 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-03 06:12:44,939 INFO L153 SettingsManager]: * Use SBE=true [2024-11-03 06:12:44,940 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-03 06:12:44,940 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-03 06:12:44,940 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-03 06:12:44,940 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-03 06:12:44,940 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-03 06:12:44,941 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-03 06:12:44,941 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-03 06:12:44,942 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-03 06:12:44,942 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-03 06:12:44,942 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-03 06:12:44,942 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-03 06:12:44,943 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-03 06:12:44,943 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-03 06:12:44,943 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-03 06:12:44,943 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-03 06:12:44,943 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-03 06:12:44,944 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-03 06:12:44,944 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-03 06:12:44,944 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-03 06:12:44,944 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 06:12:44,944 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-03 06:12:44,945 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-03 06:12:44,945 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-03 06:12:44,945 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-03 06:12:44,945 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-03 06:12:44,945 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-03 06:12:44,948 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-03 06:12:44,949 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-03 06:12:44,949 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-03 06:12:44,949 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 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:45,125 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-03 06:12:45,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-03 06:12:45,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-03 06:12:45,157 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-03 06:12:45,157 INFO L274 PluginConnector]: CDTParser initialized [2024-11-03 06:12:45,158 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/float-newlib/double_req_bl_1252a.c [2024-11-03 06:12:46,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-03 06:12:46,690 INFO L384 CDTParser]: Found 1 translation units. [2024-11-03 06:12:46,690 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1252a.c [2024-11-03 06:12:46,697 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01b091d3d/c1211e947c8d4ba1a8a46f36ba929a5e/FLAGd03aed63e [2024-11-03 06:12:47,086 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01b091d3d/c1211e947c8d4ba1a8a46f36ba929a5e [2024-11-03 06:12:47,089 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-03 06:12:47,091 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-03 06:12:47,092 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-03 06:12:47,092 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-03 06:12:47,098 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-03 06:12:47,099 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 06:12:47" (1/1) ... [2024-11-03 06:12:47,100 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30add25b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:47, skipping insertion in model container [2024-11-03 06:12:47,100 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 06:12:47" (1/1) ... [2024-11-03 06:12:47,120 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-03 06:12:47,332 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1252a.c[2154,2167] [2024-11-03 06:12:47,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 06:12:47,353 INFO L200 MainTranslator]: Completed pre-run [2024-11-03 06:12:47,374 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/float-newlib/double_req_bl_1252a.c[2154,2167] [2024-11-03 06:12:47,375 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-03 06:12:47,400 INFO L204 MainTranslator]: Completed translation [2024-11-03 06:12:47,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:47 WrapperNode [2024-11-03 06:12:47,400 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-03 06:12:47,402 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-03 06:12:47,405 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-03 06:12:47,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-03 06:12:47,412 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:47" (1/1) ... [2024-11-03 06:12:47,421 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:47" (1/1) ... [2024-11-03 06:12:47,440 INFO L138 Inliner]: procedures = 21, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 61 [2024-11-03 06:12:47,441 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-03 06:12:47,442 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-03 06:12:47,442 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-03 06:12:47,442 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-03 06:12:47,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:47" (1/1) ... [2024-11-03 06:12:47,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:47" (1/1) ... [2024-11-03 06:12:47,458 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:47" (1/1) ... [2024-11-03 06:12:47,468 INFO L175 MemorySlicer]: Split 7 memory accesses to 3 slices as follows [2, 3, 2]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-03 06:12:47,468 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:47" (1/1) ... [2024-11-03 06:12:47,468 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:47" (1/1) ... [2024-11-03 06:12:47,474 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:47" (1/1) ... [2024-11-03 06:12:47,477 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:47" (1/1) ... [2024-11-03 06:12:47,478 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:47" (1/1) ... [2024-11-03 06:12:47,479 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:47" (1/1) ... [2024-11-03 06:12:47,482 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-03 06:12:47,483 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-03 06:12:47,483 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-03 06:12:47,483 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-03 06:12:47,484 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:47" (1/1) ... [2024-11-03 06:12:47,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-03 06:12:47,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-03 06:12:47,520 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) [2024-11-03 06:12:47,522 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 [2024-11-03 06:12:47,548 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-03 06:12:47,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-03 06:12:47,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-03 06:12:47,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2024-11-03 06:12:47,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-03 06:12:47,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-03 06:12:47,549 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-03 06:12:47,549 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-03 06:12:47,550 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2024-11-03 06:12:47,550 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2024-11-03 06:12:47,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-03 06:12:47,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-03 06:12:47,550 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-03 06:12:47,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-03 06:12:47,550 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-03 06:12:47,550 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-03 06:12:47,612 INFO L238 CfgBuilder]: Building ICFG [2024-11-03 06:12:47,614 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-03 06:12:47,852 INFO L? ?]: Removed 25 outVars from TransFormulas that were not future-live. [2024-11-03 06:12:47,852 INFO L287 CfgBuilder]: Performing block encoding [2024-11-03 06:12:47,866 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-03 06:12:47,866 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-03 06:12:47,867 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 06:12:47 BoogieIcfgContainer [2024-11-03 06:12:47,867 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-03 06:12:47,874 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-03 06:12:47,874 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-03 06:12:47,877 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-03 06:12:47,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 06:12:47" (1/3) ... [2024-11-03 06:12:47,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4f0356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 06:12:47, skipping insertion in model container [2024-11-03 06:12:47,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 06:12:47" (2/3) ... [2024-11-03 06:12:47,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e4f0356 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 06:12:47, skipping insertion in model container [2024-11-03 06:12:47,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 06:12:47" (3/3) ... [2024-11-03 06:12:47,883 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2024-11-03 06:12:47,902 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-03 06:12:47,902 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-03 06:12:47,956 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-03 06:12:47,962 INFO L333 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, 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;@1e7ae792, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-03 06:12:47,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-03 06:12:47,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:47,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-03 06:12:47,973 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 06:12:47,974 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 06:12:47,974 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 06:12:47,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 06:12:47,979 INFO L85 PathProgramCache]: Analyzing trace with hash 624090286, now seen corresponding path program 1 times [2024-11-03 06:12:47,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 06:12:47,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1018452372] [2024-11-03 06:12:47,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 06:12:47,987 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:47,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-03 06:12:47,993 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 06:12:47,993 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (2)] Waiting until timeout for monitored process [2024-11-03 06:12:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 06:12:48,078 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-03 06:12:48,080 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 06:12:48,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 06:12:48,098 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 06:12:48,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 06:12:48,110 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 06:12:48,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1018452372] [2024-11-03 06:12:48,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1018452372] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 06:12:48,110 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 06:12:48,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2024-11-03 06:12:48,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733797793] [2024-11-03 06:12:48,117 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 06:12:48,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-03 06:12:48,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 06:12:48,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-03 06:12:48,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 06:12:48,143 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 23 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-03 06:12:48,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 06:12:48,157 INFO L93 Difference]: Finished difference Result 51 states and 76 transitions. [2024-11-03 06:12:48,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-03 06:12:48,158 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-11-03 06:12:48,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 06:12:48,163 INFO L225 Difference]: With dead ends: 51 [2024-11-03 06:12:48,163 INFO L226 Difference]: Without dead ends: 24 [2024-11-03 06:12:48,165 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-03 06:12:48,167 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 06:12:48,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 06:12:48,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-03 06:12:48,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2024-11-03 06:12:48,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:48,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-11-03 06:12:48,194 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 13 [2024-11-03 06:12:48,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 06:12:48,194 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-11-03 06:12:48,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-03 06:12:48,194 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-11-03 06:12:48,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-03 06:12:48,195 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 06:12:48,195 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 06:12:48,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (2)] Ended with exit code 0 [2024-11-03 06:12:48,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:48,399 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 06:12:48,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 06:12:48,399 INFO L85 PathProgramCache]: Analyzing trace with hash 181002929, now seen corresponding path program 1 times [2024-11-03 06:12:48,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 06:12:48,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [890211884] [2024-11-03 06:12:48,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 06:12:48,400 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:48,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-03 06:12:48,404 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 06:12:48,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-03 06:12:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 06:12:48,488 WARN L253 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-03 06:12:48,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 06:12:48,635 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_6| (_ BitVec 64)) (|v___fpclassify_double_~#ew_u~0.base_6| (_ BitVec 32))) (and (= |c_#valid| (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_6| (_ bv0 1))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_6| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_6|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_6|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_6|)))) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_6| (_ bv8 32)) |c_#length|))) is different from true [2024-11-03 06:12:48,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 06:12:48,808 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 06:12:49,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 06:12:49,241 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 06:12:49,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [890211884] [2024-11-03 06:12:49,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [890211884] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 06:12:49,241 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 06:12:49,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 4] imperfect sequences [] total 9 [2024-11-03 06:12:49,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141879005] [2024-11-03 06:12:49,242 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 06:12:49,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-03 06:12:49,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 06:12:49,245 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-03 06:12:49,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=42, Unknown=1, NotChecked=12, Total=72 [2024-11-03 06:12:49,246 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:49,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 06:12:49,544 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2024-11-03 06:12:49,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-03 06:12:49,545 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 14 [2024-11-03 06:12:49,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 06:12:49,547 INFO L225 Difference]: With dead ends: 40 [2024-11-03 06:12:49,547 INFO L226 Difference]: Without dead ends: 31 [2024-11-03 06:12:49,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=66, Unknown=1, NotChecked=16, Total=110 [2024-11-03 06:12:49,548 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-03 06:12:49,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 138 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 50 Invalid, 0 Unknown, 54 Unchecked, 0.3s Time] [2024-11-03 06:12:49,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-03 06:12:49,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2024-11-03 06:12:49,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 22 states have internal predecessors, (29), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 06:12:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2024-11-03 06:12:49,564 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 14 [2024-11-03 06:12:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 06:12:49,564 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2024-11-03 06:12:49,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:49,564 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2024-11-03 06:12:49,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-03 06:12:49,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 06:12:49,565 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 06:12:49,572 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (3)] Ended with exit code 0 [2024-11-03 06:12:49,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:49,767 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 06:12:49,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 06:12:49,767 INFO L85 PathProgramCache]: Analyzing trace with hash -248422138, now seen corresponding path program 1 times [2024-11-03 06:12:49,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 06:12:49,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1592403859] [2024-11-03 06:12:49,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 06:12:49,768 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:49,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-03 06:12:49,772 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 06:12:49,773 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-03 06:12:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 06:12:49,868 WARN L253 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-03 06:12:49,875 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 06:12:49,975 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v___fpclassify_double_~#ew_u~0.base_14| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_11| (_ BitVec 64))) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_14| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_14|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_11|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_11|)))) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_14| (_ bv8 32)) |c_#length|) (= |c_#valid| (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_14| (_ bv0 1))))) is different from true [2024-11-03 06:12:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 06:12:50,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 06:12:50,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 06:12:50,662 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 06:12:50,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1592403859] [2024-11-03 06:12:50,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1592403859] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 06:12:50,662 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 06:12:50,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 5] imperfect sequences [] total 10 [2024-11-03 06:12:50,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523034965] [2024-11-03 06:12:50,662 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 06:12:50,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-03 06:12:50,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 06:12:50,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-03 06:12:50,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=54, Unknown=1, NotChecked=14, Total=90 [2024-11-03 06:12:50,664 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:50,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 06:12:50,730 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2024-11-03 06:12:50,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-03 06:12:50,730 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2024-11-03 06:12:50,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 06:12:50,731 INFO L225 Difference]: With dead ends: 31 [2024-11-03 06:12:50,731 INFO L226 Difference]: Without dead ends: 28 [2024-11-03 06:12:50,731 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=67, Unknown=1, NotChecked=16, Total=110 [2024-11-03 06:12:50,732 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 06:12:50,733 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 78 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 37 Invalid, 0 Unknown, 99 Unchecked, 0.1s Time] [2024-11-03 06:12:50,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-03 06:12:50,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-03 06:12:50,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-03 06:12:50,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2024-11-03 06:12:50,737 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 34 transitions. Word has length 17 [2024-11-03 06:12:50,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 06:12:50,737 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 34 transitions. [2024-11-03 06:12:50,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:50,737 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2024-11-03 06:12:50,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-03 06:12:50,738 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 06:12:50,738 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 06:12:50,742 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (4)] Forceful destruction successful, exit code 0 [2024-11-03 06:12:50,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:50,940 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 06:12:50,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 06:12:50,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1493632229, now seen corresponding path program 1 times [2024-11-03 06:12:50,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 06:12:50,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1673811867] [2024-11-03 06:12:50,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 06:12:50,941 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:50,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-03 06:12:50,943 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 06:12:50,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-03 06:12:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 06:12:51,036 WARN L253 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-03 06:12:51,044 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 06:12:51,145 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v___fpclassify_double_~#ew_u~0.base_22| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_17| (_ BitVec 64))) (let ((.cse0 (select |c_#memory_int#1| |v___fpclassify_double_~#ew_u~0.base_22|))) (and (= (select .cse0 (_ bv0 32)) c___fpclassify_double_~lsw~0) (= |c___fpclassify_double_#in~x| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_17|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_17|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_17|))) (= (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_22| (_ bv0 1)) |c_#valid|) (= (select .cse0 (_ bv4 32)) c___fpclassify_double_~msw~0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_22| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_22|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_17|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_17|)))) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_22| (_ bv8 32)) |c_#length|)))) is different from true [2024-11-03 06:12:51,278 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((|v_skolemized_q#valueAsBitvector_17| (_ BitVec 64))) (and (exists ((|v___fpclassify_double_~#ew_u~0.base_22| (_ BitVec 32))) (and (not (= (_ bv0 32) (bvadd (_ bv2147483648 32) (select (select |c_#memory_int#1| |v___fpclassify_double_~#ew_u~0.base_22|) (_ bv4 32))))) (= (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_22| (_ bv0 1)) |c_#valid|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_22| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_22|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_17|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_17|)))) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_22| (_ bv8 32)) |c_#length|))) (= |c___fpclassify_double_#in~x| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_17|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_17|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_17|))))) (exists ((|v_skolemized_q#valueAsBitvector_17| (_ BitVec 64))) (and (= |c___fpclassify_double_#in~x| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_17|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_17|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_17|))) (exists ((|v___fpclassify_double_~#ew_u~0.base_22| (_ BitVec 32))) (and (not (= (select (select |c_#memory_int#1| |v___fpclassify_double_~#ew_u~0.base_22|) (_ bv0 32)) (_ bv0 32))) (= (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_22| (_ bv0 1)) |c_#valid|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_22| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_22|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_17|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_17|)))) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_22| (_ bv8 32)) |c_#length|)))))) is different from true [2024-11-03 06:12:51,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-03 06:12:51,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-03 06:12:51,585 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 06:12:51,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 06:12:52,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-03 06:12:52,270 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 06:12:52,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1673811867] [2024-11-03 06:12:52,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1673811867] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-03 06:12:52,270 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-03 06:12:52,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 6] imperfect sequences [] total 11 [2024-11-03 06:12:52,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823403340] [2024-11-03 06:12:52,271 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-03 06:12:52,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-03 06:12:52,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 06:12:52,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-03 06:12:52,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=54, Unknown=2, NotChecked=30, Total=110 [2024-11-03 06:12:52,272 INFO L87 Difference]: Start difference. First operand 27 states and 34 transitions. Second operand has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:52,685 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v___fpclassify_double_~#ew_u~0.base_22| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_17| (_ BitVec 64))) (let ((.cse0 (select |c_#memory_int#1| |v___fpclassify_double_~#ew_u~0.base_22|))) (and (= (select .cse0 (_ bv0 32)) c___fpclassify_double_~lsw~0) (= |c___fpclassify_double_#in~x| (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_17|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_17|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_17|))) (= (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_22| (_ bv0 1)) |c_#valid|) (= (select .cse0 (_ bv4 32)) c___fpclassify_double_~msw~0) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_22| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_22|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_17|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_17|)))) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_22| (_ bv8 32)) |c_#length|)))) (or (exists ((|v_skolemized_q#valueAsBitvector_21| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_21|)) |c___fpclassify_double_#in~x|) (not (= ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_21|) (_ bv0 32))))) (exists ((|v_skolemized_q#valueAsBitvector_21| (_ BitVec 64))) (and (not (= (_ bv0 32) (bvadd (_ bv2147483648 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_21|)))) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_21|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_21|)) |c___fpclassify_double_#in~x|))))) is different from true [2024-11-03 06:12:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 06:12:53,024 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2024-11-03 06:12:53,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-03 06:12:53,025 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2024-11-03 06:12:53,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 06:12:53,026 INFO L225 Difference]: With dead ends: 58 [2024-11-03 06:12:53,026 INFO L226 Difference]: Without dead ends: 34 [2024-11-03 06:12:53,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=53, Invalid=136, Unknown=5, NotChecked=78, Total=272 [2024-11-03 06:12:53,027 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 11 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-03 06:12:53,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 127 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 74 Unchecked, 0.3s Time] [2024-11-03 06:12:53,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-03 06:12:53,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 30. [2024-11-03 06:12:53,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:53,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2024-11-03 06:12:53,050 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 21 [2024-11-03 06:12:53,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 06:12:53,050 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2024-11-03 06:12:53,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 3.111111111111111) internal successors, (28), 10 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:12:53,051 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2024-11-03 06:12:53,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-03 06:12:53,052 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 06:12:53,052 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 06:12:53,059 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-03 06:12:53,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:53,255 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 06:12:53,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 06:12:53,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1347694819, now seen corresponding path program 1 times [2024-11-03 06:12:53,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 06:12:53,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1149170157] [2024-11-03 06:12:53,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 06:12:53,256 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:53,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-03 06:12:53,259 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 06:12:53,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-03 06:12:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 06:12:53,319 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-03 06:12:53,322 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 06:12:53,368 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v___fpclassify_double_~#ew_u~0.base_32| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_25| (_ BitVec 64))) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_32| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_32|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_25|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_25|)))) (= (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_32| (_ bv0 1)) |c_#valid|) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_32| (_ bv8 32)) |c_#length|))) is different from true [2024-11-03 06:12:53,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-03 06:12:53,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-03 06:12:53,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-03 06:12:53,529 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v___fpclassify_double_~#ew_u~0.base_33| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_26| (_ BitVec 64))) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_33| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_33|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_26|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_26|)))) (= (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_33| (_ bv0 1)) |c_#valid|) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_33| (_ bv8 32)) |c_#length|))) is different from true [2024-11-03 06:12:53,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2024-11-03 06:12:53,601 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 06:12:54,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-03 06:12:54,193 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 06:12:54,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1149170157] [2024-11-03 06:12:54,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1149170157] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-03 06:12:54,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-03 06:12:54,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2024-11-03 06:12:54,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062834582] [2024-11-03 06:12:54,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-03 06:12:54,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-03 06:12:54,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 06:12:54,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-03 06:12:54,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=57, Unknown=2, NotChecked=30, Total=110 [2024-11-03 06:12:54,195 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-03 06:12:54,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 06:12:54,221 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2024-11-03 06:12:54,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-03 06:12:54,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-03 06:12:54,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 06:12:54,222 INFO L225 Difference]: With dead ends: 42 [2024-11-03 06:12:54,222 INFO L226 Difference]: Without dead ends: 33 [2024-11-03 06:12:54,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=57, Unknown=2, NotChecked=30, Total=110 [2024-11-03 06:12:54,223 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-03 06:12:54,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-03 06:12:54,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-03 06:12:54,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-03 06:12:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-03 06:12:54,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-03 06:12:54,231 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 26 [2024-11-03 06:12:54,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 06:12:54,232 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-03 06:12:54,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-03 06:12:54,234 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-03 06:12:54,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-03 06:12:54,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 06:12:54,234 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 06:12:54,239 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (6)] Ended with exit code 0 [2024-11-03 06:12:54,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:54,435 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 06:12:54,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 06:12:54,436 INFO L85 PathProgramCache]: Analyzing trace with hash 2027753189, now seen corresponding path program 1 times [2024-11-03 06:12:54,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 06:12:54,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [854636922] [2024-11-03 06:12:54,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 06:12:54,436 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-03 06:12:54,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-03 06:12:54,442 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 06:12:54,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-03 06:12:54,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 06:12:54,565 WARN L253 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 66 conjuncts are in the unsatisfiable core [2024-11-03 06:12:54,573 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 06:12:54,634 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_skolemized_q#valueAsBitvector_37| (_ BitVec 64)) (|v___fpclassify_double_~#ew_u~0.base_49| (_ BitVec 32))) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_49| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_49|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_37|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_37|)))) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_49| (_ bv8 32)) |c_#length|) (= |c_#valid| (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_49| (_ bv0 1))))) is different from true [2024-11-03 06:12:54,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-03 06:12:54,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-03 06:12:54,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-03 06:12:54,834 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v___fpclassify_double_~#ew_u~0.base_50| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_38| (_ BitVec 64))) (and (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_50| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_50|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_38|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_38|)))) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_50| (_ bv8 32)) |c_#length|) (= (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_50| (_ bv0 1)) |c_#valid|))) is different from true [2024-11-03 06:12:54,940 INFO L349 Elim1Store]: treesize reduction 15, result has 31.8 percent of original size [2024-11-03 06:12:54,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 16 [2024-11-03 06:12:54,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-03 06:12:54,967 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-03 06:12:54,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-03 06:12:58,432 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 2 not checked. [2024-11-03 06:12:58,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 06:13:00,384 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-03 06:13:00,385 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 06:13:00,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [854636922] [2024-11-03 06:13:00,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [854636922] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-03 06:13:00,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-03 06:13:00,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [15] total 20 [2024-11-03 06:13:00,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958323961] [2024-11-03 06:13:00,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-03 06:13:00,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-03 06:13:00,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 06:13:00,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-03 06:13:00,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=264, Unknown=3, NotChecked=66, Total=380 [2024-11-03 06:13:00,387 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-03 06:13:00,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 06:13:00,683 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2024-11-03 06:13:00,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-03 06:13:00,684 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-03 06:13:00,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 06:13:00,684 INFO L225 Difference]: With dead ends: 42 [2024-11-03 06:13:00,684 INFO L226 Difference]: Without dead ends: 30 [2024-11-03 06:13:00,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=55, Invalid=330, Unknown=3, NotChecked=74, Total=462 [2024-11-03 06:13:00,685 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 3 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-03 06:13:00,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 169 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-03 06:13:00,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-03 06:13:00,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-03 06:13:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.04) internal successors, (26), 25 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-03 06:13:00,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2024-11-03 06:13:00,691 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 26 [2024-11-03 06:13:00,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 06:13:00,691 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2024-11-03 06:13:00,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-03 06:13:00,691 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2024-11-03 06:13:00,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-03 06:13:00,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-03 06:13:00,692 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-03 06:13:00,696 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-03 06:13:00,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-03 06:13:00,895 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-03 06:13:00,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-03 06:13:00,896 INFO L85 PathProgramCache]: Analyzing trace with hash -457128090, now seen corresponding path program 1 times [2024-11-03 06:13:00,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-03 06:13:00,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [240141424] [2024-11-03 06:13:00,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-03 06:13:00,897 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-11-03 06:13:00,897 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-11-03 06:13:00,900 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-03 06:13:00,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-03 06:13:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-03 06:13:01,000 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-03 06:13:01,003 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-03 06:13:01,045 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v___fpclassify_double_~#ew_u~0.base_66| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_50| (_ BitVec 64))) (and (= |c_#valid| (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_66| (_ bv0 1))) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_66| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_66|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_50|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_50|)))) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_66| (_ bv8 32)) |c_#length|))) is different from true [2024-11-03 06:13:01,107 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2024-11-03 06:13:01,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-03 06:13:01,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-03 06:13:01,267 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v___fpclassify_double_~#ew_u~0.base_67| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_51| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_51|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_51|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_51|)) |c___fpclassify_double_#in~x|) (= |c_#memory_int#1| (store |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_67| (store (store (select |c_old(#memory_int#1)| |v___fpclassify_double_~#ew_u~0.base_67|) (_ bv0 32) ((_ extract 31 0) |v_skolemized_q#valueAsBitvector_51|)) (_ bv4 32) ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_51|)))) (= (store |c_old(#length)| |v___fpclassify_double_~#ew_u~0.base_67| (_ bv8 32)) |c_#length|) (= (store |c_old(#valid)| |v___fpclassify_double_~#ew_u~0.base_67| (_ bv0 1)) |c_#valid|) (= (select (select |c_#memory_int#1| |v___fpclassify_double_~#ew_u~0.base_67|) (_ bv4 32)) c___fpclassify_double_~msw~0))) is different from true [2024-11-03 06:13:01,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-11-03 06:13:01,456 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-03 06:13:02,216 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-03 06:13:02,216 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-03 06:13:02,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [240141424] [2024-11-03 06:13:02,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [240141424] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-03 06:13:02,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-03 06:13:02,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-11-03 06:13:02,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867644409] [2024-11-03 06:13:02,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-03 06:13:02,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-03 06:13:02,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-03 06:13:02,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-03 06:13:02,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=104, Unknown=2, NotChecked=42, Total=182 [2024-11-03 06:13:02,219 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-03 06:13:02,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-03 06:13:02,356 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2024-11-03 06:13:02,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-03 06:13:02,361 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-03 06:13:02,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-03 06:13:02,362 INFO L225 Difference]: With dead ends: 30 [2024-11-03 06:13:02,362 INFO L226 Difference]: Without dead ends: 0 [2024-11-03 06:13:02,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=40, Invalid=122, Unknown=2, NotChecked=46, Total=210 [2024-11-03 06:13:02,366 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-03 06:13:02,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 26 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-03 06:13:02,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-03 06:13:02,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-03 06:13:02,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-03 06:13:02,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-03 06:13:02,367 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2024-11-03 06:13:02,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-03 06:13:02,367 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-03 06:13:02,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-03 06:13:02,368 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-03 06:13:02,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-03 06:13:02,371 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-03 06:13:02,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-03 06:13:02,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt [2024-11-03 06:13:02,576 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-03 06:13:02,581 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-03 06:13:06,257 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-03 06:13:06,288 WARN L156 FloydHoareUtils]: Requires clause for __fpclassify_double contained old-variable. Original clause: (and (= |old(#memory_int#1)| |#memory_int#1|) (= |old(#valid)| |#valid|) (= |#length| |old(#length)|)) Eliminated clause: true [2024-11-03 06:13:06,299 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-03 06:13:06,299 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-03 06:13:06,300 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-03 06:13:06,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 06:13:06 BoogieIcfgContainer [2024-11-03 06:13:06,303 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-03 06:13:06,304 INFO L158 Benchmark]: Toolchain (without parser) took 19212.90ms. Allocated memory was 212.9MB in the beginning and 362.8MB in the end (delta: 149.9MB). Free memory was 148.9MB in the beginning and 203.3MB in the end (delta: -54.4MB). Peak memory consumption was 96.4MB. Max. memory is 8.0GB. [2024-11-03 06:13:06,304 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 212.9MB. Free memory is still 162.3MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-03 06:13:06,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 308.53ms. Allocated memory is still 212.9MB. Free memory was 148.6MB in the beginning and 134.7MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2024-11-03 06:13:06,304 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.60ms. Allocated memory is still 212.9MB. Free memory was 134.7MB in the beginning and 133.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-03 06:13:06,304 INFO L158 Benchmark]: Boogie Preprocessor took 40.62ms. Allocated memory is still 212.9MB. Free memory was 133.2MB in the beginning and 130.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-03 06:13:06,304 INFO L158 Benchmark]: RCFGBuilder took 384.10ms. Allocated memory was 212.9MB in the beginning and 278.9MB in the end (delta: 66.1MB). Free memory was 130.8MB in the beginning and 239.0MB in the end (delta: -108.2MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. [2024-11-03 06:13:06,305 INFO L158 Benchmark]: TraceAbstraction took 18429.36ms. Allocated memory was 278.9MB in the beginning and 362.8MB in the end (delta: 83.9MB). Free memory was 238.5MB in the beginning and 203.3MB in the end (delta: 35.1MB). Peak memory consumption was 119.5MB. Max. memory is 8.0GB. [2024-11-03 06:13:06,306 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 212.9MB. Free memory is still 162.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 308.53ms. Allocated memory is still 212.9MB. Free memory was 148.6MB in the beginning and 134.7MB in the end (delta: 13.9MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 39.60ms. Allocated memory is still 212.9MB. Free memory was 134.7MB in the beginning and 133.2MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.62ms. Allocated memory is still 212.9MB. Free memory was 133.2MB in the beginning and 130.8MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 384.10ms. Allocated memory was 212.9MB in the beginning and 278.9MB in the end (delta: 66.1MB). Free memory was 130.8MB in the beginning and 239.0MB in the end (delta: -108.2MB). Peak memory consumption was 15.6MB. Max. memory is 8.0GB. * TraceAbstraction took 18429.36ms. Allocated memory was 278.9MB in the beginning and 362.8MB in the end (delta: 83.9MB). Free memory was 238.5MB in the beginning and 203.3MB in the end (delta: 35.1MB). Peak memory consumption was 119.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 87]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 27 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 28 mSDsluCounter, 648 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 227 IncrementalHoareTripleChecker+Unchecked, 474 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 240 IncrementalHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 174 mSDtfsCounter, 240 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 291 GetRequests, 212 SyntacticMatches, 4 SemanticMatches, 75 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred 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.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 10.8s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 278 ConstructedInterpolants, 84 QuantifiedInterpolants, 3519 SizeOfPredicates, 71 NumberOfNonLiveVariables, 538 ConjunctsInSsa, 267 ConjunctsInUnsatCore, 14 InterpolantComputations, 11 PerfectInterpolantSequences, 28/36 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 65]: Loop Invariant Derived loop invariant: null - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-03 06:13:06,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...