/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_monotonic.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-16 06:52:19,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-16 06:52:19,115 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-16 06:52:19,118 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-16 06:52:19,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-16 06:52:19,142 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-16 06:52:19,143 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-16 06:52:19,143 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-16 06:52:19,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-16 06:52:19,147 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-16 06:52:19,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-16 06:52:19,148 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-16 06:52:19,148 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-16 06:52:19,148 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-16 06:52:19,149 INFO L153 SettingsManager]: * Use SBE=true [2023-12-16 06:52:19,149 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-16 06:52:19,149 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-16 06:52:19,149 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-16 06:52:19,149 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-16 06:52:19,149 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-16 06:52:19,149 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-16 06:52:19,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-16 06:52:19,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-16 06:52:19,151 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-16 06:52:19,151 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-16 06:52:19,151 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-16 06:52:19,151 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-16 06:52:19,151 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-16 06:52:19,152 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-16 06:52:19,152 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-16 06:52:19,153 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-16 06:52:19,153 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-16 06:52:19,153 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-16 06:52:19,153 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-16 06:52:19,153 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 06:52:19,153 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-16 06:52:19,153 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-16 06:52:19,154 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-16 06:52:19,154 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-16 06:52:19,154 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-16 06:52:19,154 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-16 06:52:19,154 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-16 06:52:19,154 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-16 06:52:19,154 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-16 06:52:19,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-16 06:52:19,155 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-16 06:52:19,155 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2023-12-16 06:52:19,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-16 06:52:19,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-16 06:52:19,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-16 06:52:19,362 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-16 06:52:19,362 INFO L274 PluginConnector]: CDTParser initialized [2023-12-16 06:52:19,363 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_monotonic.i [2023-12-16 06:52:20,424 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-16 06:52:20,570 INFO L384 CDTParser]: Found 1 translation units. [2023-12-16 06:52:20,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_monotonic.i [2023-12-16 06:52:20,576 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d90cd6f08/90c0fdc635294e07ae05b9dba1ddf072/FLAG09c8dbc3a [2023-12-16 06:52:20,588 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d90cd6f08/90c0fdc635294e07ae05b9dba1ddf072 [2023-12-16 06:52:20,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-16 06:52:20,591 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-16 06:52:20,591 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-16 06:52:20,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-16 06:52:20,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-16 06:52:20,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:52:20" (1/1) ... [2023-12-16 06:52:20,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43b6d4e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:52:20, skipping insertion in model container [2023-12-16 06:52:20,596 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.12 06:52:20" (1/1) ... [2023-12-16 06:52:20,612 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 06:52:20,706 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_monotonic.i[999,1012] [2023-12-16 06:52:20,719 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 06:52:20,730 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-16 06:52:20,732 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-16 06:52:20,744 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_monotonic.i[999,1012] [2023-12-16 06:52:20,747 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 06:52:20,753 INFO L202 MainTranslator]: Completed pre-run [2023-12-16 06:52:20,761 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-industry-pattern/array_of_struct_ptr_monotonic.i[999,1012] [2023-12-16 06:52:20,764 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-16 06:52:20,775 INFO L206 MainTranslator]: Completed translation [2023-12-16 06:52:20,776 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:52:20 WrapperNode [2023-12-16 06:52:20,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-16 06:52:20,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-16 06:52:20,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-16 06:52:20,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-16 06:52:20,781 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:52:20" (1/1) ... [2023-12-16 06:52:20,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:52:20" (1/1) ... [2023-12-16 06:52:20,797 INFO L138 Inliner]: procedures = 21, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 54 [2023-12-16 06:52:20,798 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-16 06:52:20,798 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-16 06:52:20,798 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-16 06:52:20,798 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-16 06:52:20,805 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:52:20" (1/1) ... [2023-12-16 06:52:20,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:52:20" (1/1) ... [2023-12-16 06:52:20,807 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:52:20" (1/1) ... [2023-12-16 06:52:20,819 INFO L175 MemorySlicer]: Split 10 memory accesses to 3 slices as follows [2, 3, 5]. 50 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2023-12-16 06:52:20,819 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:52:20" (1/1) ... [2023-12-16 06:52:20,819 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:52:20" (1/1) ... [2023-12-16 06:52:20,825 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:52:20" (1/1) ... [2023-12-16 06:52:20,827 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:52:20" (1/1) ... [2023-12-16 06:52:20,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:52:20" (1/1) ... [2023-12-16 06:52:20,830 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:52:20" (1/1) ... [2023-12-16 06:52:20,832 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-16 06:52:20,832 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-16 06:52:20,832 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-16 06:52:20,833 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-16 06:52:20,833 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:52:20" (1/1) ... [2023-12-16 06:52:20,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-16 06:52:20,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-16 06:52:20,869 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-12-16 06:52:20,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-12-16 06:52:20,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-16 06:52:20,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-16 06:52:20,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-12-16 06:52:20,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-16 06:52:20,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-16 06:52:20,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-16 06:52:20,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-12-16 06:52:20,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-16 06:52:20,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-16 06:52:20,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-12-16 06:52:20,926 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-16 06:52:20,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-12-16 06:52:20,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-12-16 06:52:20,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-12-16 06:52:20,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-16 06:52:20,926 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-16 06:52:20,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-12-16 06:52:20,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-12-16 06:52:20,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-12-16 06:52:20,992 INFO L241 CfgBuilder]: Building ICFG [2023-12-16 06:52:20,993 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-16 06:52:21,142 INFO L282 CfgBuilder]: Performing block encoding [2023-12-16 06:52:21,159 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-16 06:52:21,160 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-16 06:52:21,160 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:52:21 BoogieIcfgContainer [2023-12-16 06:52:21,160 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-16 06:52:21,161 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-16 06:52:21,161 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-16 06:52:21,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-16 06:52:21,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.12 06:52:20" (1/3) ... [2023-12-16 06:52:21,164 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1dbcd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:52:21, skipping insertion in model container [2023-12-16 06:52:21,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.12 06:52:20" (2/3) ... [2023-12-16 06:52:21,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d1dbcd1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.12 06:52:21, skipping insertion in model container [2023-12-16 06:52:21,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.12 06:52:21" (3/3) ... [2023-12-16 06:52:21,165 INFO L112 eAbstractionObserver]: Analyzing ICFG array_of_struct_ptr_monotonic.i [2023-12-16 06:52:21,177 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-16 06:52:21,177 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-12-16 06:52:21,211 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-16 06:52:21,215 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3653c597, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-16 06:52:21,215 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-12-16 06:52:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand has 14 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:52:21,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 06:52:21,224 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:52:21,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:52:21,225 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:52:21,228 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:52:21,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1414323135, now seen corresponding path program 1 times [2023-12-16 06:52:21,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:52:21,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [219630661] [2023-12-16 06:52:21,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:52:21,244 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:52:21,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:52:21,253 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:52:21,255 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-16 06:52:21,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:52:21,329 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-16 06:52:21,331 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:52:21,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:52:21,351 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:52:21,351 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:52:21,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [219630661] [2023-12-16 06:52:21,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [219630661] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:52:21,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:52:21,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 06:52:21,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100012613] [2023-12-16 06:52:21,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:52:21,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-16 06:52:21,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:52:21,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-16 06:52:21,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 06:52:21,387 INFO L87 Difference]: Start difference. First operand has 14 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 13 states have internal predecessors, (20), 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) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:52:21,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:52:21,402 INFO L93 Difference]: Finished difference Result 24 states and 33 transitions. [2023-12-16 06:52:21,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-16 06:52:21,403 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2023-12-16 06:52:21,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:52:21,408 INFO L225 Difference]: With dead ends: 24 [2023-12-16 06:52:21,408 INFO L226 Difference]: Without dead ends: 12 [2023-12-16 06:52:21,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-16 06:52:21,415 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:52:21,416 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:52:21,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2023-12-16 06:52:21,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2023-12-16 06:52:21,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 11 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:52:21,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2023-12-16 06:52:21,435 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 15 transitions. Word has length 7 [2023-12-16 06:52:21,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:52:21,435 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 15 transitions. [2023-12-16 06:52:21,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:52:21,436 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 15 transitions. [2023-12-16 06:52:21,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-12-16 06:52:21,436 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:52:21,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:52:21,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-16 06:52:21,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:52:21,639 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:52:21,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:52:21,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1042144172, now seen corresponding path program 1 times [2023-12-16 06:52:21,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:52:21,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [735674429] [2023-12-16 06:52:21,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:52:21,640 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:52:21,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:52:21,642 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:52:21,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-16 06:52:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:52:21,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 2 conjunts are in the unsatisfiable core [2023-12-16 06:52:21,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:52:21,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:52:21,740 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-16 06:52:21,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:52:21,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [735674429] [2023-12-16 06:52:21,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [735674429] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-16 06:52:21,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-16 06:52:21,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-16 06:52:21,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208526495] [2023-12-16 06:52:21,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-16 06:52:21,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-12-16 06:52:21,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:52:21,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-12-16 06:52:21,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:52:21,743 INFO L87 Difference]: Start difference. First operand 12 states and 15 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:52:21,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:52:21,785 INFO L93 Difference]: Finished difference Result 30 states and 37 transitions. [2023-12-16 06:52:21,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-12-16 06:52:21,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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) Word has length 7 [2023-12-16 06:52:21,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:52:21,787 INFO L225 Difference]: With dead ends: 30 [2023-12-16 06:52:21,787 INFO L226 Difference]: Without dead ends: 22 [2023-12-16 06:52:21,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-12-16 06:52:21,789 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 10 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-12-16 06:52:21,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-12-16 06:52:21,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2023-12-16 06:52:21,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 13. [2023-12-16 06:52:21,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.3333333333333333) internal successors, (16), 12 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:52:21,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 16 transitions. [2023-12-16 06:52:21,792 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 16 transitions. Word has length 7 [2023-12-16 06:52:21,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:52:21,793 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 16 transitions. [2023-12-16 06:52:21,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:52:21,793 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 16 transitions. [2023-12-16 06:52:21,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2023-12-16 06:52:21,793 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:52:21,793 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:52:21,797 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-12-16 06:52:21,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:52:21,996 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:52:21,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:52:21,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1248044372, now seen corresponding path program 1 times [2023-12-16 06:52:21,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:52:21,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618082629] [2023-12-16 06:52:21,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-16 06:52:21,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:52:21,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:52:22,000 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:52:22,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-16 06:52:22,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-16 06:52:22,079 INFO L262 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-16 06:52:22,080 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:52:22,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:52:22,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:52:22,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:52:22,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:52:22,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618082629] [2023-12-16 06:52:22,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618082629] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:52:22,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:52:22,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-12-16 06:52:22,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091217753] [2023-12-16 06:52:22,144 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:52:22,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-12-16 06:52:22,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:52:22,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-12-16 06:52:22,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-12-16 06:52:22,146 INFO L87 Difference]: Start difference. First operand 13 states and 16 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:52:22,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:52:22,242 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2023-12-16 06:52:22,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-16 06:52:22,243 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 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) Word has length 10 [2023-12-16 06:52:22,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:52:22,243 INFO L225 Difference]: With dead ends: 52 [2023-12-16 06:52:22,243 INFO L226 Difference]: Without dead ends: 44 [2023-12-16 06:52:22,244 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2023-12-16 06:52:22,244 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 64 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-16 06:52:22,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 42 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-16 06:52:22,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2023-12-16 06:52:22,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 22. [2023-12-16 06:52:22,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:52:22,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2023-12-16 06:52:22,252 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 10 [2023-12-16 06:52:22,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:52:22,252 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2023-12-16 06:52:22,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:52:22,252 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2023-12-16 06:52:22,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-12-16 06:52:22,252 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:52:22,252 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:52:22,258 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-16 06:52:22,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:52:22,455 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:52:22,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:52:22,456 INFO L85 PathProgramCache]: Analyzing trace with hash -483780180, now seen corresponding path program 2 times [2023-12-16 06:52:22,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:52:22,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [622242448] [2023-12-16 06:52:22,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-12-16 06:52:22,457 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:52:22,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:52:22,458 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:52:22,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-16 06:52:22,647 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-12-16 06:52:22,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:52:22,653 INFO L262 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 6 conjunts are in the unsatisfiable core [2023-12-16 06:52:22,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:52:22,731 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:52:22,731 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:52:22,822 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:52:22,822 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:52:22,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [622242448] [2023-12-16 06:52:22,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [622242448] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:52:22,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:52:22,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-12-16 06:52:22,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988034747] [2023-12-16 06:52:22,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:52:22,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-12-16 06:52:22,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:52:22,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-12-16 06:52:22,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-12-16 06:52:22,824 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:52:23,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:52:23,144 INFO L93 Difference]: Finished difference Result 112 states and 140 transitions. [2023-12-16 06:52:23,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-12-16 06:52:23,144 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 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) Word has length 19 [2023-12-16 06:52:23,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:52:23,145 INFO L225 Difference]: With dead ends: 112 [2023-12-16 06:52:23,145 INFO L226 Difference]: Without dead ends: 104 [2023-12-16 06:52:23,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2023-12-16 06:52:23,147 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 286 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-16 06:52:23,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 234 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-16 06:52:23,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-12-16 06:52:23,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 40. [2023-12-16 06:52:23,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3333333333333333) internal successors, (52), 39 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:52:23,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2023-12-16 06:52:23,152 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 52 transitions. Word has length 19 [2023-12-16 06:52:23,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:52:23,153 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 52 transitions. [2023-12-16 06:52:23,153 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:52:23,153 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 52 transitions. [2023-12-16 06:52:23,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-12-16 06:52:23,153 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:52:23,153 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:52:23,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-16 06:52:23,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:52:23,362 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:52:23,362 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:52:23,363 INFO L85 PathProgramCache]: Analyzing trace with hash 600315564, now seen corresponding path program 3 times [2023-12-16 06:52:23,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:52:23,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [915581192] [2023-12-16 06:52:23,363 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-12-16 06:52:23,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:52:23,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:52:23,364 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:52:23,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-16 06:52:25,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2023-12-16 06:52:25,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:52:25,481 INFO L262 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 12 conjunts are in the unsatisfiable core [2023-12-16 06:52:25,484 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:52:25,608 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:52:25,608 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:52:25,983 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:52:25,983 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:52:25,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [915581192] [2023-12-16 06:52:25,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [915581192] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:52:25,984 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:52:25,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 23 [2023-12-16 06:52:25,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798778222] [2023-12-16 06:52:25,984 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:52:25,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-12-16 06:52:25,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:52:25,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-12-16 06:52:25,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2023-12-16 06:52:25,985 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. Second operand has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:52:27,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:52:27,441 INFO L93 Difference]: Finished difference Result 232 states and 290 transitions. [2023-12-16 06:52:27,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-12-16 06:52:27,442 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 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) Word has length 37 [2023-12-16 06:52:27,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:52:27,443 INFO L225 Difference]: With dead ends: 232 [2023-12-16 06:52:27,443 INFO L226 Difference]: Without dead ends: 224 [2023-12-16 06:52:27,444 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=406, Invalid=716, Unknown=0, NotChecked=0, Total=1122 [2023-12-16 06:52:27,444 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 1168 mSDsluCounter, 960 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 1050 SdHoareTripleChecker+Invalid, 709 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-12-16 06:52:27,445 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 1050 Invalid, 709 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-12-16 06:52:27,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2023-12-16 06:52:27,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 76. [2023-12-16 06:52:27,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.3333333333333333) internal successors, (100), 75 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:52:27,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 100 transitions. [2023-12-16 06:52:27,453 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 100 transitions. Word has length 37 [2023-12-16 06:52:27,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:52:27,453 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 100 transitions. [2023-12-16 06:52:27,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.875) internal successors, (69), 23 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:52:27,453 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 100 transitions. [2023-12-16 06:52:27,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-12-16 06:52:27,454 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:52:27,454 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:52:27,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-16 06:52:27,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:52:27,669 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:52:27,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:52:27,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1947971412, now seen corresponding path program 4 times [2023-12-16 06:52:27,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:52:27,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1377101410] [2023-12-16 06:52:27,670 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-12-16 06:52:27,670 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:52:27,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:52:27,671 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:52:27,684 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-12-16 06:52:28,433 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-12-16 06:52:28,433 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-12-16 06:52:28,470 INFO L262 TraceCheckSpWp]: Trace formula consists of 1264 conjuncts, 24 conjunts are in the unsatisfiable core [2023-12-16 06:52:28,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-16 06:52:28,807 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:52:28,807 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-12-16 06:52:30,116 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-12-16 06:52:30,116 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-16 06:52:30,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1377101410] [2023-12-16 06:52:30,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1377101410] provided 0 perfect and 2 imperfect interpolant sequences [2023-12-16 06:52:30,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-12-16 06:52:30,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 47 [2023-12-16 06:52:30,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655827382] [2023-12-16 06:52:30,117 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-12-16 06:52:30,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2023-12-16 06:52:30,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-16 06:52:30,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2023-12-16 06:52:30,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=622, Invalid=1634, Unknown=0, NotChecked=0, Total=2256 [2023-12-16 06:52:30,119 INFO L87 Difference]: Start difference. First operand 76 states and 100 transitions. Second operand has 48 states, 48 states have (on average 2.9375) internal successors, (141), 47 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:52:38,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-16 06:52:38,169 INFO L93 Difference]: Finished difference Result 472 states and 590 transitions. [2023-12-16 06:52:38,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-12-16 06:52:38,170 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.9375) internal successors, (141), 47 states have internal predecessors, (141), 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) Word has length 73 [2023-12-16 06:52:38,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-16 06:52:38,172 INFO L225 Difference]: With dead ends: 472 [2023-12-16 06:52:38,172 INFO L226 Difference]: Without dead ends: 464 [2023-12-16 06:52:38,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=1678, Invalid=3152, Unknown=0, NotChecked=0, Total=4830 [2023-12-16 06:52:38,174 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 4296 mSDsluCounter, 4224 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 534 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4296 SdHoareTripleChecker+Valid, 4410 SdHoareTripleChecker+Invalid, 2811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 534 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-12-16 06:52:38,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4296 Valid, 4410 Invalid, 2811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [534 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-12-16 06:52:38,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2023-12-16 06:52:38,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 148. [2023-12-16 06:52:38,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.3333333333333333) internal successors, (196), 147 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:52:38,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 196 transitions. [2023-12-16 06:52:38,202 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 196 transitions. Word has length 73 [2023-12-16 06:52:38,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-16 06:52:38,203 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 196 transitions. [2023-12-16 06:52:38,203 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.9375) internal successors, (141), 47 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-12-16 06:52:38,203 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 196 transitions. [2023-12-16 06:52:38,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2023-12-16 06:52:38,205 INFO L187 NwaCegarLoop]: Found error trace [2023-12-16 06:52:38,205 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1] [2023-12-16 06:52:38,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-12-16 06:52:38,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:52:38,422 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-16 06:52:38,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-16 06:52:38,423 INFO L85 PathProgramCache]: Analyzing trace with hash 2052965548, now seen corresponding path program 5 times [2023-12-16 06:52:38,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-16 06:52:38,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1958651405] [2023-12-16 06:52:38,424 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-12-16 06:52:38,424 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:52:38,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-16 06:52:38,437 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-16 06:52:38,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process Received shutdown request... [2023-12-16 06:53:40,571 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 06:53:40,592 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-16 06:53:41,593 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 [2023-12-16 06:53:41,793 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forcibly destroying the process [2023-12-16 06:53:41,816 ERROR L246 FreeRefinementEngine]: Caught known exception: Timeout or Toolchain cancelled by user [2023-12-16 06:53:41,817 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2023-12-16 06:53:41,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-16 06:53:41,818 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 146 with TraceHistMax 46,while AutomatonFreeRefinementEngine was Timeout during feasibility check between IpTcStrategyModuleMathsat [1958651405] and IpTcStrategyModuleCvc4 [1245443226]. [2023-12-16 06:53:41,818 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 137 [2023-12-16 06:53:41,821 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1] [2023-12-16 06:53:41,823 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-16 06:53:41,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.12 06:53:41 BoogieIcfgContainer [2023-12-16 06:53:41,825 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-16 06:53:41,825 INFO L158 Benchmark]: Toolchain (without parser) took 81234.38ms. Allocated memory was 237.0MB in the beginning and 285.2MB in the end (delta: 48.2MB). Free memory was 182.6MB in the beginning and 111.0MB in the end (delta: 71.7MB). Peak memory consumption was 119.4MB. Max. memory is 8.0GB. [2023-12-16 06:53:41,825 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-16 06:53:41,825 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.51ms. Allocated memory is still 237.0MB. Free memory was 182.4MB in the beginning and 170.0MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2023-12-16 06:53:41,825 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.37ms. Allocated memory is still 237.0MB. Free memory was 170.0MB in the beginning and 168.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2023-12-16 06:53:41,826 INFO L158 Benchmark]: Boogie Preprocessor took 33.64ms. Allocated memory is still 237.0MB. Free memory was 168.3MB in the beginning and 165.9MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2023-12-16 06:53:41,826 INFO L158 Benchmark]: RCFGBuilder took 327.63ms. Allocated memory is still 237.0MB. Free memory was 165.6MB in the beginning and 190.6MB in the end (delta: -25.0MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2023-12-16 06:53:41,826 INFO L158 Benchmark]: TraceAbstraction took 80663.17ms. Allocated memory was 237.0MB in the beginning and 285.2MB in the end (delta: 48.2MB). Free memory was 190.1MB in the beginning and 111.0MB in the end (delta: 79.1MB). Peak memory consumption was 127.1MB. Max. memory is 8.0GB. [2023-12-16 06:53:41,827 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 197.1MB. Free memory is still 147.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 184.51ms. Allocated memory is still 237.0MB. Free memory was 182.4MB in the beginning and 170.0MB in the end (delta: 12.4MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 21.37ms. Allocated memory is still 237.0MB. Free memory was 170.0MB in the beginning and 168.3MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.64ms. Allocated memory is still 237.0MB. Free memory was 168.3MB in the beginning and 165.9MB in the end (delta: 2.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 327.63ms. Allocated memory is still 237.0MB. Free memory was 165.6MB in the beginning and 190.6MB in the end (delta: -25.0MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * TraceAbstraction took 80663.17ms. Allocated memory was 237.0MB in the beginning and 285.2MB in the end (delta: 48.2MB). Free memory was 190.1MB in the beginning and 111.0MB in the end (delta: 79.1MB). Peak memory consumption was 127.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 16]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 16). Cancelled while NwaCegarLoop was analyzing trace of length 146 with TraceHistMax 46,while AutomatonFreeRefinementEngine was Timeout during feasibility check between IpTcStrategyModuleMathsat [1958651405] and IpTcStrategyModuleCvc4 [1245443226]. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 14 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 80.6s, OverallIterations: 7, TraceHistogramMax: 46, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 10.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5824 SdHoareTripleChecker+Valid, 4.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5824 mSDsluCounter, 5768 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5408 mSDsCounter, 728 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3016 IncrementalHoareTripleChecker+Invalid, 3744 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 728 mSolverCounterUnsat, 360 mSDtfsCounter, 3016 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 319 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=6, InterpolantAutomatonStates: 95, 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, 6 MinimizatonAttempts, 559 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 2.7s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 153 NumberOfCodeBlocks, 153 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 282 ConstructedInterpolants, 0 QuantifiedInterpolants, 966 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2264 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 10 InterpolantComputations, 2 PerfectInterpolantSequences, 0/1766 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown