./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b06.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b06.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ec179c2b0ae29cffe9fd88f2044fb26f554ea0dd1abcec6f41fd07a61f74c869 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 11:06:43,680 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 11:06:43,736 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-16 11:06:43,743 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 11:06:43,744 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 11:06:43,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 11:06:43,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 11:06:43,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 11:06:43,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 11:06:43,780 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 11:06:43,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 11:06:43,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 11:06:43,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 11:06:43,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 11:06:43,782 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 11:06:43,782 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 11:06:43,782 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 11:06:43,783 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 11:06:43,783 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 11:06:43,783 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 11:06:43,784 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 11:06:43,786 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 11:06:43,786 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 11:06:43,786 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 11:06:43,787 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 11:06:43,787 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 11:06:43,787 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 11:06:43,788 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 11:06:43,788 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 11:06:43,788 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:06:43,788 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 11:06:43,789 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 11:06:43,789 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 11:06:43,789 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 11:06:43,789 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 11:06:43,789 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 11:06:43,790 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 11:06:43,790 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 11:06:43,790 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 11:06:43,791 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec179c2b0ae29cffe9fd88f2044fb26f554ea0dd1abcec6f41fd07a61f74c869 [2024-11-16 11:06:44,028 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 11:06:44,056 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 11:06:44,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 11:06:44,061 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 11:06:44,062 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 11:06:44,063 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b06.c [2024-11-16 11:06:45,557 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 11:06:45,756 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 11:06:45,757 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b06.c [2024-11-16 11:06:45,771 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60149900a/187ba7556cda402f97a7ec420c5c2430/FLAGf2f1cfaf8 [2024-11-16 11:06:45,784 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/60149900a/187ba7556cda402f97a7ec420c5c2430 [2024-11-16 11:06:45,787 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 11:06:45,788 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 11:06:45,789 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 11:06:45,790 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 11:06:45,794 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 11:06:45,795 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:06:45" (1/1) ... [2024-11-16 11:06:45,796 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f61ea39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:45, skipping insertion in model container [2024-11-16 11:06:45,796 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:06:45" (1/1) ... [2024-11-16 11:06:45,818 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 11:06:46,024 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b06.c[1245,1258] [2024-11-16 11:06:46,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:06:46,156 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 11:06:46,169 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b06.c[1245,1258] [2024-11-16 11:06:46,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:06:46,218 INFO L204 MainTranslator]: Completed translation [2024-11-16 11:06:46,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:46 WrapperNode [2024-11-16 11:06:46,219 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 11:06:46,220 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 11:06:46,220 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 11:06:46,220 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 11:06:46,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:46" (1/1) ... [2024-11-16 11:06:46,238 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:46" (1/1) ... [2024-11-16 11:06:46,279 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 258 [2024-11-16 11:06:46,279 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 11:06:46,280 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 11:06:46,280 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 11:06:46,280 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 11:06:46,293 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:46" (1/1) ... [2024-11-16 11:06:46,294 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:46" (1/1) ... [2024-11-16 11:06:46,305 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:46" (1/1) ... [2024-11-16 11:06:46,333 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-16 11:06:46,334 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:46" (1/1) ... [2024-11-16 11:06:46,334 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:46" (1/1) ... [2024-11-16 11:06:46,352 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:46" (1/1) ... [2024-11-16 11:06:46,359 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:46" (1/1) ... [2024-11-16 11:06:46,364 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:46" (1/1) ... [2024-11-16 11:06:46,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:46" (1/1) ... [2024-11-16 11:06:46,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 11:06:46,377 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 11:06:46,378 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 11:06:46,378 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 11:06:46,379 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:46" (1/1) ... [2024-11-16 11:06:46,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:06:46,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:06:46,422 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-16 11:06:46,428 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-16 11:06:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 11:06:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 11:06:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 11:06:46,480 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 11:06:46,480 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 11:06:46,581 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 11:06:46,583 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 11:06:47,029 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-16 11:06:47,029 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 11:06:47,072 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 11:06:47,072 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 11:06:47,074 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:06:47 BoogieIcfgContainer [2024-11-16 11:06:47,074 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 11:06:47,078 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 11:06:47,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 11:06:47,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 11:06:47,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:06:45" (1/3) ... [2024-11-16 11:06:47,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c29bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:06:47, skipping insertion in model container [2024-11-16 11:06:47,085 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:46" (2/3) ... [2024-11-16 11:06:47,085 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c29bb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:06:47, skipping insertion in model container [2024-11-16 11:06:47,086 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:06:47" (3/3) ... [2024-11-16 11:06:47,088 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b06.c [2024-11-16 11:06:47,123 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 11:06:47,124 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 11:06:47,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 11:06:47,212 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;@a9662f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 11:06:47,213 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 11:06:47,219 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 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-16 11:06:47,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-16 11:06:47,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:47,227 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, 1, 1, 1, 1, 1] [2024-11-16 11:06:47,228 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:47,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:47,232 INFO L85 PathProgramCache]: Analyzing trace with hash -2059040939, now seen corresponding path program 1 times [2024-11-16 11:06:47,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:47,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282230233] [2024-11-16 11:06:47,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:47,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:47,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:47,851 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-16 11:06:47,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:47,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282230233] [2024-11-16 11:06:47,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282230233] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:47,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:47,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:06:47,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952239718] [2024-11-16 11:06:47,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:47,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:06:47,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:47,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:06:47,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:06:47,892 INFO L87 Difference]: Start difference. First operand has 65 states, 63 states have (on average 1.4603174603174602) internal successors, (92), 64 states have internal predecessors, (92), 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 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-16 11:06:47,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:47,994 INFO L93 Difference]: Finished difference Result 109 states and 157 transitions. [2024-11-16 11:06:47,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:06:47,996 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2024-11-16 11:06:47,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:48,004 INFO L225 Difference]: With dead ends: 109 [2024-11-16 11:06:48,004 INFO L226 Difference]: Without dead ends: 62 [2024-11-16 11:06:48,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:06:48,014 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:48,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 208 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:06:48,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-11-16 11:06:48,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2024-11-16 11:06:48,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 61 states have internal predecessors, (88), 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-16 11:06:48,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 88 transitions. [2024-11-16 11:06:48,058 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 88 transitions. Word has length 26 [2024-11-16 11:06:48,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:48,059 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 88 transitions. [2024-11-16 11:06:48,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-16 11:06:48,060 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 88 transitions. [2024-11-16 11:06:48,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-16 11:06:48,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:48,062 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, 1, 1, 1, 1, 1, 1] [2024-11-16 11:06:48,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 11:06:48,063 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:48,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:48,064 INFO L85 PathProgramCache]: Analyzing trace with hash 739293729, now seen corresponding path program 1 times [2024-11-16 11:06:48,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:48,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446463403] [2024-11-16 11:06:48,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:48,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:48,327 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-16 11:06:48,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:48,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446463403] [2024-11-16 11:06:48,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446463403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:48,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:48,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:06:48,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427051144] [2024-11-16 11:06:48,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:48,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:06:48,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:48,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:06:48,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:06:48,337 INFO L87 Difference]: Start difference. First operand 62 states and 88 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-16 11:06:48,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:48,420 INFO L93 Difference]: Finished difference Result 108 states and 153 transitions. [2024-11-16 11:06:48,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:06:48,421 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 27 [2024-11-16 11:06:48,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:48,422 INFO L225 Difference]: With dead ends: 108 [2024-11-16 11:06:48,422 INFO L226 Difference]: Without dead ends: 64 [2024-11-16 11:06:48,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:06:48,425 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 0 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:48,426 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 205 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:06:48,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-16 11:06:48,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2024-11-16 11:06:48,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 63 states have internal predecessors, (90), 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-16 11:06:48,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2024-11-16 11:06:48,437 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 27 [2024-11-16 11:06:48,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:48,437 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2024-11-16 11:06:48,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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-16 11:06:48,437 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2024-11-16 11:06:48,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-16 11:06:48,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:48,439 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:06:48,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 11:06:48,440 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:48,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:48,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1190512698, now seen corresponding path program 1 times [2024-11-16 11:06:48,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:48,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961938658] [2024-11-16 11:06:48,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:48,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:48,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:48,691 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-16 11:06:48,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:48,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961938658] [2024-11-16 11:06:48,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961938658] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:48,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:48,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 11:06:48,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645267967] [2024-11-16 11:06:48,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:48,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 11:06:48,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:48,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 11:06:48,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 11:06:48,694 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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) [2024-11-16 11:06:48,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:48,793 INFO L93 Difference]: Finished difference Result 114 states and 160 transitions. [2024-11-16 11:06:48,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 11:06:48,794 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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) Word has length 28 [2024-11-16 11:06:48,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:48,796 INFO L225 Difference]: With dead ends: 114 [2024-11-16 11:06:48,797 INFO L226 Difference]: Without dead ends: 68 [2024-11-16 11:06:48,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-16 11:06:48,798 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 73 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:48,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 195 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:06:48,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-11-16 11:06:48,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2024-11-16 11:06:48,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.4090909090909092) internal successors, (93), 66 states have internal predecessors, (93), 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-16 11:06:48,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 93 transitions. [2024-11-16 11:06:48,813 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 93 transitions. Word has length 28 [2024-11-16 11:06:48,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:48,814 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 93 transitions. [2024-11-16 11:06:48,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 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) [2024-11-16 11:06:48,814 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 93 transitions. [2024-11-16 11:06:48,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-16 11:06:48,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:48,816 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:06:48,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 11:06:48,816 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:48,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:48,820 INFO L85 PathProgramCache]: Analyzing trace with hash 955850684, now seen corresponding path program 1 times [2024-11-16 11:06:48,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:48,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833218634] [2024-11-16 11:06:48,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:48,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:48,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:49,177 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-16 11:06:49,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:49,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833218634] [2024-11-16 11:06:49,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833218634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:49,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:49,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 11:06:49,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017237086] [2024-11-16 11:06:49,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:49,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 11:06:49,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:49,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 11:06:49,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-16 11:06:49,180 INFO L87 Difference]: Start difference. First operand 67 states and 93 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-16 11:06:49,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:49,268 INFO L93 Difference]: Finished difference Result 114 states and 158 transitions. [2024-11-16 11:06:49,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 11:06:49,269 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 29 [2024-11-16 11:06:49,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:49,269 INFO L225 Difference]: With dead ends: 114 [2024-11-16 11:06:49,270 INFO L226 Difference]: Without dead ends: 65 [2024-11-16 11:06:49,270 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-16 11:06:49,271 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 67 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:49,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 237 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:06:49,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-16 11:06:49,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2024-11-16 11:06:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.4098360655737705) internal successors, (86), 61 states have internal predecessors, (86), 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-16 11:06:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 86 transitions. [2024-11-16 11:06:49,277 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 86 transitions. Word has length 29 [2024-11-16 11:06:49,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:49,277 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 86 transitions. [2024-11-16 11:06:49,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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-16 11:06:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 86 transitions. [2024-11-16 11:06:49,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-16 11:06:49,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:49,278 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:06:49,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 11:06:49,278 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:49,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:49,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1877451364, now seen corresponding path program 1 times [2024-11-16 11:06:49,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:49,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931349484] [2024-11-16 11:06:49,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:49,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:49,801 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-16 11:06:49,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 11:06:49,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931349484] [2024-11-16 11:06:49,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931349484] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:49,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:49,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-16 11:06:49,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456660810] [2024-11-16 11:06:49,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:49,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 11:06:49,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 11:06:49,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 11:06:49,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-16 11:06:49,806 INFO L87 Difference]: Start difference. First operand 62 states and 86 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-16 11:06:49,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:49,946 INFO L93 Difference]: Finished difference Result 123 states and 171 transitions. [2024-11-16 11:06:49,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 11:06:49,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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 29 [2024-11-16 11:06:49,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:49,950 INFO L225 Difference]: With dead ends: 123 [2024-11-16 11:06:49,952 INFO L226 Difference]: Without dead ends: 79 [2024-11-16 11:06:49,952 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-16 11:06:49,953 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 113 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:49,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 244 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:06:49,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-16 11:06:49,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 74. [2024-11-16 11:06:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.4109589041095891) internal successors, (103), 73 states have internal predecessors, (103), 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-16 11:06:49,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 103 transitions. [2024-11-16 11:06:49,967 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 103 transitions. Word has length 29 [2024-11-16 11:06:49,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:49,968 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 103 transitions. [2024-11-16 11:06:49,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 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-16 11:06:49,970 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 103 transitions. [2024-11-16 11:06:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-16 11:06:49,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:49,971 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:06:49,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 11:06:49,972 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:49,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:49,972 INFO L85 PathProgramCache]: Analyzing trace with hash -562039206, now seen corresponding path program 1 times [2024-11-16 11:06:49,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 11:06:49,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355667578] [2024-11-16 11:06:49,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:49,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 11:06:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 11:06:50,016 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 11:06:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 11:06:50,069 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 11:06:50,070 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 11:06:50,071 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 11:06:50,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 11:06:50,076 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-16 11:06:50,116 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 11:06:50,121 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:06:50 BoogieIcfgContainer [2024-11-16 11:06:50,122 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 11:06:50,123 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 11:06:50,123 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 11:06:50,124 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 11:06:50,124 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:06:47" (3/4) ... [2024-11-16 11:06:50,126 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 11:06:50,128 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 11:06:50,129 INFO L158 Benchmark]: Toolchain (without parser) took 4340.29ms. Allocated memory was 157.3MB in the beginning and 199.2MB in the end (delta: 41.9MB). Free memory was 105.1MB in the beginning and 87.6MB in the end (delta: 17.6MB). Peak memory consumption was 57.9MB. Max. memory is 16.1GB. [2024-11-16 11:06:50,129 INFO L158 Benchmark]: CDTParser took 0.70ms. Allocated memory is still 100.7MB. Free memory was 58.2MB in the beginning and 58.1MB in the end (delta: 152.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:06:50,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.73ms. Allocated memory is still 157.3MB. Free memory was 105.1MB in the beginning and 123.0MB in the end (delta: -17.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 11:06:50,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.65ms. Allocated memory is still 157.3MB. Free memory was 123.0MB in the beginning and 117.6MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 11:06:50,132 INFO L158 Benchmark]: Boogie Preprocessor took 96.58ms. Allocated memory is still 157.3MB. Free memory was 117.6MB in the beginning and 113.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-16 11:06:50,132 INFO L158 Benchmark]: IcfgBuilder took 696.65ms. Allocated memory is still 157.3MB. Free memory was 113.4MB in the beginning and 77.5MB in the end (delta: 35.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-16 11:06:50,133 INFO L158 Benchmark]: TraceAbstraction took 3044.39ms. Allocated memory was 157.3MB in the beginning and 199.2MB in the end (delta: 41.9MB). Free memory was 76.9MB in the beginning and 87.6MB in the end (delta: -10.7MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2024-11-16 11:06:50,133 INFO L158 Benchmark]: Witness Printer took 4.51ms. Allocated memory is still 199.2MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:06:50,134 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.70ms. Allocated memory is still 100.7MB. Free memory was 58.2MB in the beginning and 58.1MB in the end (delta: 152.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 429.73ms. Allocated memory is still 157.3MB. Free memory was 105.1MB in the beginning and 123.0MB in the end (delta: -17.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.65ms. Allocated memory is still 157.3MB. Free memory was 123.0MB in the beginning and 117.6MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 96.58ms. Allocated memory is still 157.3MB. Free memory was 117.6MB in the beginning and 113.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 696.65ms. Allocated memory is still 157.3MB. Free memory was 113.4MB in the beginning and 77.5MB in the end (delta: 35.9MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3044.39ms. Allocated memory was 157.3MB in the beginning and 199.2MB in the end (delta: 41.9MB). Free memory was 76.9MB in the beginning and 87.6MB in the end (delta: -10.7MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. * Witness Printer took 4.51ms. Allocated memory is still 199.2MB. Free memory is still 87.6MB. There was no memory consumed. Max. memory is 16.1GB. * 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 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 89. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_11 mask_SORT_11 = (SORT_11)-1 >> (sizeof(SORT_11) * 8 - 2); [L30] const SORT_11 msb_SORT_11 = (SORT_11)1 << (2 - 1); [L32] const SORT_15 mask_SORT_15 = (SORT_15)-1 >> (sizeof(SORT_15) * 8 - 32); [L33] const SORT_15 msb_SORT_15 = (SORT_15)1 << (32 - 1); [L35] const SORT_1 var_5 = 0; [L36] const SORT_11 var_12 = 0; [L37] const SORT_15 var_17 = 2; [L38] const SORT_1 var_22 = 1; [L39] const SORT_11 var_39 = 1; [L41] SORT_1 input_2; [L42] SORT_1 input_3; [L43] SORT_1 input_4; [L44] SORT_11 input_26; [L45] SORT_11 input_40; [L46] SORT_1 input_45; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L48] SORT_1 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L49] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_11 VAL [mask_SORT_11=3, mask_SORT_1=1, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L50] SORT_11 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_11; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L51] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] SORT_1 init_7_arg_1 = var_5; [L54] state_6 = init_7_arg_1 [L55] SORT_1 init_9_arg_1 = var_5; [L56] state_8 = init_9_arg_1 [L57] SORT_11 init_14_arg_1 = var_12; [L58] state_13 = init_14_arg_1 [L59] SORT_1 init_32_arg_1 = var_5; [L60] state_31 = init_32_arg_1 VAL [mask_SORT_11=3, mask_SORT_1=1, state_13=0, state_31=0, state_6=0, state_8=0, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L63] input_2 = __VERIFIER_nondet_uchar() [L64] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, state_13=0, state_31=0, state_6=0, state_8=0, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L64] input_2 = input_2 & mask_SORT_1 [L65] input_3 = __VERIFIER_nondet_uchar() [L66] EXPR input_3 & mask_SORT_1 VAL [input_2=0, mask_SORT_11=3, mask_SORT_1=1, state_13=0, state_31=0, state_6=0, state_8=0, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L66] input_3 = input_3 & mask_SORT_1 [L67] input_4 = __VERIFIER_nondet_uchar() [L68] input_26 = __VERIFIER_nondet_uchar() [L69] input_40 = __VERIFIER_nondet_uchar() [L70] input_45 = __VERIFIER_nondet_uchar() [L73] SORT_1 var_10_arg_0 = state_6; [L74] SORT_1 var_10_arg_1 = state_8; [L75] SORT_1 var_10 = var_10_arg_0 == var_10_arg_1; [L76] SORT_11 var_16_arg_0 = state_13; VAL [input_2=0, input_3=0, mask_SORT_11=3, mask_SORT_1=1, state_31=0, var_10=1, var_12=0, var_16_arg_0=0, var_17=2, var_22=1, var_39=1, var_5=0] [L77] EXPR var_16_arg_0 & mask_SORT_11 VAL [input_2=0, input_3=0, mask_SORT_11=3, mask_SORT_1=1, state_31=0, var_10=1, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L77] var_16_arg_0 = var_16_arg_0 & mask_SORT_11 [L78] SORT_15 var_16 = var_16_arg_0; [L79] SORT_15 var_18_arg_0 = var_16; [L80] SORT_15 var_18_arg_1 = var_17; [L81] SORT_1 var_18 = var_18_arg_0 != var_18_arg_1; [L82] SORT_1 var_19_arg_0 = var_10; [L83] SORT_1 var_19_arg_1 = var_18; VAL [input_2=0, input_3=0, mask_SORT_11=3, mask_SORT_1=1, state_31=0, var_12=0, var_17=2, var_19_arg_0=1, var_19_arg_1=1, var_22=1, var_39=1, var_5=0] [L84] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_2=0, input_3=0, mask_SORT_11=3, mask_SORT_1=1, state_31=0, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L84] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L85] SORT_1 var_23_arg_0 = var_19; [L86] SORT_1 var_23 = ~var_23_arg_0; [L87] SORT_1 var_24_arg_0 = var_22; [L88] SORT_1 var_24_arg_1 = var_23; VAL [input_2=0, input_3=0, mask_SORT_11=3, mask_SORT_1=1, state_31=0, var_12=0, var_17=2, var_22=1, var_24_arg_0=1, var_24_arg_1=-2, var_39=1, var_5=0] [L89] EXPR var_24_arg_0 & var_24_arg_1 VAL [input_2=0, input_3=0, mask_SORT_11=3, mask_SORT_1=1, state_31=0, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L89] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L90] EXPR var_24 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_11=3, mask_SORT_1=1, state_31=0, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L90] var_24 = var_24 & mask_SORT_1 [L91] SORT_1 bad_25_arg_0 = var_24; [L92] CALL __VERIFIER_assert(!(bad_25_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 65 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 253 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 253 mSDsluCounter, 1089 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 757 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 350 IncrementalHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 332 mSDtfsCounter, 350 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=74occurred in iteration=5, InterpolantAutomatonStates: 26, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 169 NumberOfCodeBlocks, 169 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 134 ConstructedInterpolants, 0 QuantifiedInterpolants, 398 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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: unable to determine feasibility of some traces [2024-11-16 11:06:50,167 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 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b06.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ec179c2b0ae29cffe9fd88f2044fb26f554ea0dd1abcec6f41fd07a61f74c869 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 11:06:52,430 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 11:06:52,514 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-16 11:06:52,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 11:06:52,519 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 11:06:52,555 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 11:06:52,556 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 11:06:52,556 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 11:06:52,557 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 11:06:52,557 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 11:06:52,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 11:06:52,558 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 11:06:52,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 11:06:52,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 11:06:52,563 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 11:06:52,563 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 11:06:52,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 11:06:52,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 11:06:52,564 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 11:06:52,564 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 11:06:52,564 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 11:06:52,567 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 11:06:52,567 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 11:06:52,568 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 11:06:52,568 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 11:06:52,568 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 11:06:52,568 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 11:06:52,569 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 11:06:52,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 11:06:52,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 11:06:52,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 11:06:52,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:06:52,570 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 11:06:52,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 11:06:52,570 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 11:06:52,570 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 11:06:52,570 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 11:06:52,571 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 11:06:52,571 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 11:06:52,571 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 11:06:52,571 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 11:06:52,573 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec179c2b0ae29cffe9fd88f2044fb26f554ea0dd1abcec6f41fd07a61f74c869 [2024-11-16 11:06:52,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 11:06:52,959 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 11:06:52,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 11:06:52,965 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 11:06:52,966 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 11:06:52,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b06.c [2024-11-16 11:06:54,519 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 11:06:54,720 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 11:06:54,721 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b06.c [2024-11-16 11:06:54,730 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39fa57162/e27f810bf0404a66a6ac8fc451d1844e/FLAGadc5873ee [2024-11-16 11:06:55,103 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39fa57162/e27f810bf0404a66a6ac8fc451d1844e [2024-11-16 11:06:55,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 11:06:55,108 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 11:06:55,109 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 11:06:55,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 11:06:55,114 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 11:06:55,114 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:06:55" (1/1) ... [2024-11-16 11:06:55,115 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36211fb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:55, skipping insertion in model container [2024-11-16 11:06:55,115 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:06:55" (1/1) ... [2024-11-16 11:06:55,137 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 11:06:55,328 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b06.c[1245,1258] [2024-11-16 11:06:55,394 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:06:55,409 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 11:06:55,420 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b06.c[1245,1258] [2024-11-16 11:06:55,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 11:06:55,470 INFO L204 MainTranslator]: Completed translation [2024-11-16 11:06:55,470 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:55 WrapperNode [2024-11-16 11:06:55,471 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 11:06:55,472 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 11:06:55,472 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 11:06:55,472 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 11:06:55,479 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:55" (1/1) ... [2024-11-16 11:06:55,492 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:55" (1/1) ... [2024-11-16 11:06:55,521 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 154 [2024-11-16 11:06:55,521 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 11:06:55,522 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 11:06:55,522 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 11:06:55,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 11:06:55,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:55" (1/1) ... [2024-11-16 11:06:55,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:55" (1/1) ... [2024-11-16 11:06:55,539 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:55" (1/1) ... [2024-11-16 11:06:55,568 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-16 11:06:55,569 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:55" (1/1) ... [2024-11-16 11:06:55,572 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:55" (1/1) ... [2024-11-16 11:06:55,580 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:55" (1/1) ... [2024-11-16 11:06:55,585 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:55" (1/1) ... [2024-11-16 11:06:55,587 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:55" (1/1) ... [2024-11-16 11:06:55,591 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:55" (1/1) ... [2024-11-16 11:06:55,598 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 11:06:55,599 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 11:06:55,603 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 11:06:55,603 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 11:06:55,604 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:55" (1/1) ... [2024-11-16 11:06:55,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 11:06:55,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 11:06:55,638 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-16 11:06:55,642 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-16 11:06:55,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 11:06:55,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 11:06:55,696 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-16 11:06:55,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 11:06:55,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 11:06:55,783 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 11:06:55,786 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 11:06:56,057 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-16 11:06:56,058 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 11:06:56,072 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 11:06:56,072 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 11:06:56,072 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:06:56 BoogieIcfgContainer [2024-11-16 11:06:56,072 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 11:06:56,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 11:06:56,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 11:06:56,079 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 11:06:56,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:06:55" (1/3) ... [2024-11-16 11:06:56,080 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8805a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:06:56, skipping insertion in model container [2024-11-16 11:06:56,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:55" (2/3) ... [2024-11-16 11:06:56,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a8805a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:06:56, skipping insertion in model container [2024-11-16 11:06:56,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:06:56" (3/3) ... [2024-11-16 11:06:56,082 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b06.c [2024-11-16 11:06:56,103 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 11:06:56,103 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 11:06:56,169 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 11:06:56,178 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;@52940ee4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 11:06:56,178 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 11:06:56,183 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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-16 11:06:56,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-16 11:06:56,189 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:56,191 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-16 11:06:56,192 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:56,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:56,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-16 11:06:56,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 11:06:56,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1045934359] [2024-11-16 11:06:56,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:56,213 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 [2024-11-16 11:06:56,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 11:06:56,217 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) [2024-11-16 11:06:56,218 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 [2024-11-16 11:06:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:56,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-16 11:06:56,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:06:56,684 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-16 11:06:56,684 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 11:06:56,685 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 11:06:56,685 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1045934359] [2024-11-16 11:06:56,687 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1045934359] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 11:06:56,687 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 11:06:56,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 11:06:56,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529149693] [2024-11-16 11:06:56,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 11:06:56,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 11:06:56,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 11:06:56,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 11:06:56,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:06:56,723 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 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 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-16 11:06:56,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:06:56,754 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2024-11-16 11:06:56,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 11:06:56,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2024-11-16 11:06:56,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:06:56,769 INFO L225 Difference]: With dead ends: 21 [2024-11-16 11:06:56,769 INFO L226 Difference]: Without dead ends: 10 [2024-11-16 11:06:56,772 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 11:06:56,776 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 11:06:56,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 11:06:56,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-16 11:06:56,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-16 11:06:56,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 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-16 11:06:56,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-16 11:06:56,809 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-16 11:06:56,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:06:56,810 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-16 11:06:56,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-16 11:06:56,810 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-16 11:06:56,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 11:06:56,811 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:06:56,811 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 11:06:56,815 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 11:06:57,011 WARN L453 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 [2024-11-16 11:06:57,012 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:06:57,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:06:57,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-16 11:06:57,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 11:06:57,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146483664] [2024-11-16 11:06:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 11:06:57,014 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 [2024-11-16 11:06:57,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 11:06:57,018 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) [2024-11-16 11:06:57,019 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 [2024-11-16 11:06:57,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 11:06:57,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-16 11:06:57,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:06:57,598 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:06:57,599 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 11:07:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:07:03,933 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 11:07:03,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146483664] [2024-11-16 11:07:03,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146483664] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 11:07:03,935 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 11:07:03,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-16 11:07:03,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280288604] [2024-11-16 11:07:03,935 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 11:07:03,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 11:07:03,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 11:07:03,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 11:07:03,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=39, Unknown=1, NotChecked=0, Total=56 [2024-11-16 11:07:03,938 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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) [2024-11-16 11:07:04,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 11:07:04,239 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-11-16 11:07:04,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 11:07:04,240 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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 9 [2024-11-16 11:07:04,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 11:07:04,240 INFO L225 Difference]: With dead ends: 16 [2024-11-16 11:07:04,241 INFO L226 Difference]: Without dead ends: 13 [2024-11-16 11:07:04,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=27, Invalid=62, Unknown=1, NotChecked=0, Total=90 [2024-11-16 11:07:04,242 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 11:07:04,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 11:07:04,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-16 11:07:04,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-16 11:07:04,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 states have internal predecessors, (13), 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-16 11:07:04,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-16 11:07:04,247 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2024-11-16 11:07:04,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 11:07:04,248 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-16 11:07:04,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 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) [2024-11-16 11:07:04,250 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-16 11:07:04,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-16 11:07:04,250 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 11:07:04,251 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2024-11-16 11:07:04,254 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 [2024-11-16 11:07:04,451 WARN L453 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 [2024-11-16 11:07:04,452 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 11:07:04,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 11:07:04,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1723041149, now seen corresponding path program 2 times [2024-11-16 11:07:04,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 11:07:04,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1664345828] [2024-11-16 11:07:04,458 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 11:07:04,458 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 [2024-11-16 11:07:04,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 11:07:04,461 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) [2024-11-16 11:07:04,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 (4)] Waiting until timeout for monitored process [2024-11-16 11:07:04,567 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 11:07:04,568 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 11:07:04,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-16 11:07:04,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 11:07:05,325 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 11:07:05,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 11:07:18,176 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse10 (forall ((|v_ULTIMATE.start_main_~var_24_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_24_arg_0~0#1_16|))))))))) (.cse8 (forall ((|v_ULTIMATE.start_main_~var_24_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_24_arg_0~0#1_16|))))))))) (.cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_39~0#1|))))) (let ((.cse3 (let ((.cse12 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse9))))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_12~0#1|))))))))) (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_11~0#1|) .cse11))) |c_ULTIMATE.start_main_~var_17~0#1|)) .cse10) (or (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_11~0#1|) .cse12))) |c_ULTIMATE.start_main_~var_17~0#1|)) .cse10) (or .cse8 (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_11~0#1|) .cse12))) |c_ULTIMATE.start_main_~var_17~0#1|)))) (or .cse8 (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_11~0#1|) .cse11))) |c_ULTIMATE.start_main_~var_17~0#1|))))))) (.cse1 (and (or .cse8 (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_11~0#1|)))) |c_ULTIMATE.start_main_~var_17~0#1|)))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_11~0#1|)))) |c_ULTIMATE.start_main_~var_17~0#1|)) .cse10))) (.cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_22~0#1|)))) (.cse0 (= |c_ULTIMATE.start_main_~state_31~0#1| (_ bv0 8)))) (and (or (not .cse0) (let ((.cse2 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 .cse5))))) (and (or .cse1 (not .cse2)) (or .cse2 .cse3)))) (or (let ((.cse7 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse5)))))))) (.cse6 (= ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_5~0#1|))))))))) (_ bv0 8)))) (and (or .cse3 .cse6) (or .cse7 .cse3) (or (not .cse7) .cse1) (or (not .cse6) .cse1))) .cse0))))) is different from false [2024-11-16 11:07:21,752 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-16 11:07:21,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 11:07:21,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1664345828] [2024-11-16 11:07:21,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1664345828] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 11:07:21,755 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 11:07:21,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-16 11:07:21,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077035431] [2024-11-16 11:07:21,758 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 11:07:21,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-16 11:07:21,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 11:07:21,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-16 11:07:21,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=53, Unknown=2, NotChecked=14, Total=90 [2024-11-16 11:07:21,760 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 10 states have internal predecessors, (21), 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-16 11:07:32,085 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-16 11:07:32,086 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 101 [2024-11-16 11:07:32,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 17.8s TimeCoverageRelationStatistics Valid=59, Invalid=152, Unknown=3, NotChecked=26, Total=240 [2024-11-16 11:07:32,088 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 11:07:32,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 6 Unchecked, 0.5s Time] [2024-11-16 11:07:32,093 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 [2024-11-16 11:07:32,289 WARN L453 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 [2024-11-16 11:07:32,290 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:177) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.pop(Scriptor.java:139) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.arrays.DiffWrapperScript.pop(DiffWrapperScript.java:99) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.pop(WrapperScript.java:153) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.pop(HistoryRecordingScript.java:117) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.pop(ManagedScript.java:138) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.unAssertPostcondition(IncrementalHoareTripleChecker.java:665) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.clearAssertionStack(IncrementalHoareTripleChecker.java:269) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.IncrementalHoareTripleChecker.releaseLock(IncrementalHoareTripleChecker.java:284) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker$ProtectedHtc.releaseLock(ChainingHoareTripleChecker.java:449) at java.base/java.util.ArrayList$ArrayListSpliterator.forEachRemaining(ArrayList.java:1655) at java.base/java.util.stream.ReferencePipeline$Head.forEach(ReferencePipeline.java:658) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.ChainingHoareTripleChecker.releaseLock(ChainingHoareTripleChecker.java:98) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.hoaretriple.CachingHoareTripleChecker.releaseLock(CachingHoareTripleChecker.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.interpolantautomata.transitionappender.AbstractInterpolantAutomaton.switchToReadonlyMode(AbstractInterpolantAutomaton.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.computeAutomataDifference(NwaCegarLoop.java:385) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.NwaCegarLoop.refineAbstraction(NwaCegarLoop.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.refineAbstractionInternal(AbstractCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: java.io.IOException: Broken pipe at java.base/java.io.FileOutputStream.writeBytes(Native Method) at java.base/java.io.FileOutputStream.write(FileOutputStream.java:354) at java.base/java.io.BufferedOutputStream.flushBuffer(BufferedOutputStream.java:81) at java.base/java.io.BufferedOutputStream.flush(BufferedOutputStream.java:142) at java.base/sun.nio.cs.StreamEncoder.implFlush(StreamEncoder.java:318) at java.base/sun.nio.cs.StreamEncoder.flush(StreamEncoder.java:153) at java.base/java.io.OutputStreamWriter.flush(OutputStreamWriter.java:251) at java.base/java.io.BufferedWriter.flush(BufferedWriter.java:257) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.input(Executor.java:175) ... 36 more [2024-11-16 11:07:32,294 INFO L158 Benchmark]: Toolchain (without parser) took 37185.75ms. Allocated memory was 62.9MB in the beginning and 98.6MB in the end (delta: 35.7MB). Free memory was 36.6MB in the beginning and 61.3MB in the end (delta: -24.8MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-11-16 11:07:32,294 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 41.9MB. Free memory was 20.7MB in the beginning and 20.7MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 11:07:32,294 INFO L158 Benchmark]: CACSL2BoogieTranslator took 361.95ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 36.2MB in the beginning and 57.4MB in the end (delta: -21.1MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-11-16 11:07:32,295 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.28ms. Allocated memory is still 81.8MB. Free memory was 57.4MB in the beginning and 55.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 11:07:32,295 INFO L158 Benchmark]: Boogie Preprocessor took 77.06ms. Allocated memory is still 81.8MB. Free memory was 55.4MB in the beginning and 53.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 11:07:32,296 INFO L158 Benchmark]: IcfgBuilder took 473.16ms. Allocated memory is still 81.8MB. Free memory was 52.6MB in the beginning and 58.2MB in the end (delta: -5.6MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2024-11-16 11:07:32,296 INFO L158 Benchmark]: TraceAbstraction took 36217.34ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 57.4MB in the beginning and 61.3MB in the end (delta: -4.0MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2024-11-16 11:07:32,298 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.23ms. Allocated memory is still 41.9MB. Free memory was 20.7MB in the beginning and 20.7MB in the end (delta: 42.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 361.95ms. Allocated memory was 62.9MB in the beginning and 81.8MB in the end (delta: 18.9MB). Free memory was 36.2MB in the beginning and 57.4MB in the end (delta: -21.1MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.28ms. Allocated memory is still 81.8MB. Free memory was 57.4MB in the beginning and 55.4MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 77.06ms. Allocated memory is still 81.8MB. Free memory was 55.4MB in the beginning and 53.0MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 473.16ms. Allocated memory is still 81.8MB. Free memory was 52.6MB in the beginning and 58.2MB in the end (delta: -5.6MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * TraceAbstraction took 36217.34ms. Allocated memory was 81.8MB in the beginning and 98.6MB in the end (delta: 16.8MB). Free memory was 57.4MB in the beginning and 61.3MB in the end (delta: -4.0MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken: de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.convertIOException(Executor.java:337) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Connection to SMT solver broken