./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal181.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f 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.cal181.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 5963c871d6c136110dcc88c8949de566dbe1e9259aea809264af87f26dad49d7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:37:23,917 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:37:23,984 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 01:37:23,988 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:37:23,989 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:37:24,011 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:37:24,014 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:37:24,015 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:37:24,015 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:37:24,015 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:37:24,016 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:37:24,016 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:37:24,017 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:37:24,018 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:37:24,018 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:37:24,019 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:37:24,019 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:37:24,019 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 01:37:24,019 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:37:24,019 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:37:24,023 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:37:24,023 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:37:24,024 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:37:24,024 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:37:24,024 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:37:24,024 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:37:24,024 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:37:24,024 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:37:24,025 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:37:24,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:37:24,025 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:37:24,025 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:37:24,025 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:37:24,025 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 01:37:24,025 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 01:37:24,025 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:37:24,026 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:37:24,026 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:37:24,026 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:37:24,026 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 -> 5963c871d6c136110dcc88c8949de566dbe1e9259aea809264af87f26dad49d7 [2024-11-10 01:37:24,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:37:24,287 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:37:24,289 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:37:24,290 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:37:24,291 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:37:24,292 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal181.c [2024-11-10 01:37:25,525 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:37:25,710 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:37:25,711 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal181.c [2024-11-10 01:37:25,722 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e6ed157f/5247566870db43deb1bac065af4a6a37/FLAG79bcb9121 [2024-11-10 01:37:26,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5e6ed157f/5247566870db43deb1bac065af4a6a37 [2024-11-10 01:37:26,106 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:37:26,107 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:37:26,108 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:37:26,109 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:37:26,115 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:37:26,115 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:37:26" (1/1) ... [2024-11-10 01:37:26,116 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@729fd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:26, skipping insertion in model container [2024-11-10 01:37:26,116 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:37:26" (1/1) ... [2024-11-10 01:37:26,138 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:37:26,273 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.cal181.c[1246,1259] [2024-11-10 01:37:26,327 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:37:26,341 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:37:26,352 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.cal181.c[1246,1259] [2024-11-10 01:37:26,381 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:37:26,398 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:37:26,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:26 WrapperNode [2024-11-10 01:37:26,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:37:26,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:37:26,400 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:37:26,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:37:26,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:26" (1/1) ... [2024-11-10 01:37:26,415 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:26" (1/1) ... [2024-11-10 01:37:26,473 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 211 [2024-11-10 01:37:26,473 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:37:26,474 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:37:26,474 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:37:26,474 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:37:26,486 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:26" (1/1) ... [2024-11-10 01:37:26,486 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:26" (1/1) ... [2024-11-10 01:37:26,496 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:26" (1/1) ... [2024-11-10 01:37:26,514 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 01:37:26,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:26" (1/1) ... [2024-11-10 01:37:26,514 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:26" (1/1) ... [2024-11-10 01:37:26,525 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:26" (1/1) ... [2024-11-10 01:37:26,528 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:26" (1/1) ... [2024-11-10 01:37:26,530 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:26" (1/1) ... [2024-11-10 01:37:26,532 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:26" (1/1) ... [2024-11-10 01:37:26,536 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:37:26,536 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:37:26,536 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:37:26,536 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:37:26,537 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:26" (1/1) ... [2024-11-10 01:37:26,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:37:26,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:37:26,573 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-10 01:37:26,576 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-10 01:37:26,614 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:37:26,614 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 01:37:26,614 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:37:26,614 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:37:26,679 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:37:26,680 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:37:26,962 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-11-10 01:37:26,962 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:37:26,987 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:37:26,987 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:37:26,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:37:26 BoogieIcfgContainer [2024-11-10 01:37:26,987 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:37:26,989 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:37:26,989 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:37:26,991 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:37:26,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:37:26" (1/3) ... [2024-11-10 01:37:26,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373a724f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:37:26, skipping insertion in model container [2024-11-10 01:37:26,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:26" (2/3) ... [2024-11-10 01:37:26,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373a724f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:37:26, skipping insertion in model container [2024-11-10 01:37:26,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:37:26" (3/3) ... [2024-11-10 01:37:26,993 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal181.c [2024-11-10 01:37:27,006 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:37:27,006 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 01:37:27,045 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:37:27,050 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;@31d6f27b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:37:27,051 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 01:37:27,054 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 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-10 01:37:27,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-10 01:37:27,058 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:37:27,059 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] [2024-11-10 01:37:27,059 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:37:27,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:37:27,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1935713317, now seen corresponding path program 1 times [2024-11-10 01:37:27,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:37:27,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391357402] [2024-11-10 01:37:27,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:37:27,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:37:27,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:37:27,517 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-10 01:37:27,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:37:27,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391357402] [2024-11-10 01:37:27,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391357402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:37:27,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:37:27,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:37:27,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043243833] [2024-11-10 01:37:27,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:37:27,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:37:27,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:37:27,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:37:27,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:37:27,546 INFO L87 Difference]: Start difference. First operand has 57 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 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.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10 01:37:27,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:37:27,612 INFO L93 Difference]: Finished difference Result 93 states and 133 transitions. [2024-11-10 01:37:27,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:37:27,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 24 [2024-11-10 01:37:27,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:37:27,620 INFO L225 Difference]: With dead ends: 93 [2024-11-10 01:37:27,621 INFO L226 Difference]: Without dead ends: 54 [2024-11-10 01:37:27,623 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-10 01:37:27,626 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:37:27,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 178 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:37:27,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-10 01:37:27,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-10 01:37:27,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 53 states have internal predecessors, (76), 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-10 01:37:27,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2024-11-10 01:37:27,651 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 24 [2024-11-10 01:37:27,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:37:27,651 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 76 transitions. [2024-11-10 01:37:27,651 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10 01:37:27,652 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2024-11-10 01:37:27,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 01:37:27,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:37:27,652 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] [2024-11-10 01:37:27,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 01:37:27,653 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:37:27,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:37:27,654 INFO L85 PathProgramCache]: Analyzing trace with hash 267482708, now seen corresponding path program 1 times [2024-11-10 01:37:27,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:37:27,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950635193] [2024-11-10 01:37:27,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:37:27,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:37:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:37:27,766 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-10 01:37:27,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:37:27,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950635193] [2024-11-10 01:37:27,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950635193] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:37:27,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:37:27,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:37:27,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119246955] [2024-11-10 01:37:27,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:37:27,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:37:27,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:37:27,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:37:27,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:37:27,771 INFO L87 Difference]: Start difference. First operand 54 states and 76 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-10 01:37:27,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:37:27,825 INFO L93 Difference]: Finished difference Result 92 states and 129 transitions. [2024-11-10 01:37:27,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:37:27,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2024-11-10 01:37:27,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:37:27,827 INFO L225 Difference]: With dead ends: 92 [2024-11-10 01:37:27,827 INFO L226 Difference]: Without dead ends: 56 [2024-11-10 01:37:27,828 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-10 01:37:27,828 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:37:27,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 175 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:37:27,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-10 01:37:27,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-11-10 01:37:27,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 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-10 01:37:27,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2024-11-10 01:37:27,838 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 25 [2024-11-10 01:37:27,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:37:27,839 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2024-11-10 01:37:27,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-10 01:37:27,839 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2024-11-10 01:37:27,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-10 01:37:27,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:37:27,840 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-10 01:37:27,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 01:37:27,840 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:37:27,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:37:27,841 INFO L85 PathProgramCache]: Analyzing trace with hash -550727072, now seen corresponding path program 1 times [2024-11-10 01:37:27,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:37:27,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830753657] [2024-11-10 01:37:27,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:37:27,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:37:27,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:37:28,121 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-10 01:37:28,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:37:28,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830753657] [2024-11-10 01:37:28,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830753657] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:37:28,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:37:28,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 01:37:28,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239822168] [2024-11-10 01:37:28,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:37:28,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 01:37:28,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:37:28,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 01:37:28,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 01:37:28,126 INFO L87 Difference]: Start difference. First operand 56 states and 78 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-10 01:37:28,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:37:28,253 INFO L93 Difference]: Finished difference Result 124 states and 170 transitions. [2024-11-10 01:37:28,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:37:28,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-10 01:37:28,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:37:28,255 INFO L225 Difference]: With dead ends: 124 [2024-11-10 01:37:28,255 INFO L226 Difference]: Without dead ends: 86 [2024-11-10 01:37:28,256 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:37:28,256 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 144 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:37:28,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 217 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:37:28,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-10 01:37:28,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2024-11-10 01:37:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 65 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-10 01:37:28,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2024-11-10 01:37:28,266 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 26 [2024-11-10 01:37:28,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:37:28,266 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2024-11-10 01:37:28,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 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-10 01:37:28,267 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2024-11-10 01:37:28,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-10 01:37:28,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:37:28,268 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-10 01:37:28,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 01:37:28,268 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:37:28,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:37:28,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1482974641, now seen corresponding path program 1 times [2024-11-10 01:37:28,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:37:28,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47879292] [2024-11-10 01:37:28,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:37:28,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:37:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:37:28,456 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-10 01:37:28,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:37:28,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47879292] [2024-11-10 01:37:28,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47879292] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:37:28,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:37:28,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-10 01:37:28,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476440149] [2024-11-10 01:37:28,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:37:28,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:37:28,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:37:28,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:37:28,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:37:28,459 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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-10 01:37:28,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:37:28,609 INFO L93 Difference]: Finished difference Result 126 states and 172 transitions. [2024-11-10 01:37:28,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 01:37:28,610 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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-10 01:37:28,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:37:28,612 INFO L225 Difference]: With dead ends: 126 [2024-11-10 01:37:28,612 INFO L226 Difference]: Without dead ends: 88 [2024-11-10 01:37:28,612 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-10 01:37:28,615 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 147 mSDsluCounter, 261 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:37:28,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 314 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:37:28,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-10 01:37:28,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 69. [2024-11-10 01:37:28,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 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-10 01:37:28,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 96 transitions. [2024-11-10 01:37:28,624 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 96 transitions. Word has length 27 [2024-11-10 01:37:28,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:37:28,624 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 96 transitions. [2024-11-10 01:37:28,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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-10 01:37:28,624 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 96 transitions. [2024-11-10 01:37:28,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-10 01:37:28,625 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:37:28,625 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-10 01:37:28,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 01:37:28,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:37:28,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:37:28,626 INFO L85 PathProgramCache]: Analyzing trace with hash 76943995, now seen corresponding path program 1 times [2024-11-10 01:37:28,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:37:28,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112778214] [2024-11-10 01:37:28,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:37:28,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:37:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:37:29,015 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-10 01:37:29,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 01:37:29,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112778214] [2024-11-10 01:37:29,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112778214] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:37:29,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:37:29,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 01:37:29,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639059675] [2024-11-10 01:37:29,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:37:29,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 01:37:29,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 01:37:29,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 01:37:29,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-10 01:37:29,018 INFO L87 Difference]: Start difference. First operand 69 states and 96 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 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-10 01:37:29,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:37:29,204 INFO L93 Difference]: Finished difference Result 126 states and 171 transitions. [2024-11-10 01:37:29,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 01:37:29,205 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 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-10 01:37:29,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:37:29,206 INFO L225 Difference]: With dead ends: 126 [2024-11-10 01:37:29,206 INFO L226 Difference]: Without dead ends: 88 [2024-11-10 01:37:29,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-10 01:37:29,207 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 141 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 01:37:29,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 348 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 01:37:29,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-10 01:37:29,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 73. [2024-11-10 01:37:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.4027777777777777) internal successors, (101), 72 states have internal predecessors, (101), 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-10 01:37:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 101 transitions. [2024-11-10 01:37:29,214 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 101 transitions. Word has length 28 [2024-11-10 01:37:29,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:37:29,214 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 101 transitions. [2024-11-10 01:37:29,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 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-10 01:37:29,215 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 101 transitions. [2024-11-10 01:37:29,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-10 01:37:29,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:37:29,215 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-10 01:37:29,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 01:37:29,215 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:37:29,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:37:29,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2038342796, now seen corresponding path program 1 times [2024-11-10 01:37:29,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 01:37:29,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291518925] [2024-11-10 01:37:29,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:37:29,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 01:37:29,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 01:37:29,244 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 01:37:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 01:37:29,279 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 01:37:29,279 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 01:37:29,280 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 01:37:29,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 01:37:29,283 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-10 01:37:29,319 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 01:37:29,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:37:29 BoogieIcfgContainer [2024-11-10 01:37:29,325 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 01:37:29,325 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 01:37:29,325 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 01:37:29,325 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 01:37:29,326 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:37:26" (3/4) ... [2024-11-10 01:37:29,328 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 01:37:29,332 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 01:37:29,332 INFO L158 Benchmark]: Toolchain (without parser) took 3225.00ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 101.6MB in the beginning and 117.3MB in the end (delta: -15.6MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2024-11-10 01:37:29,332 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 94.4MB. Free memory was 59.0MB in the beginning and 58.9MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 01:37:29,332 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.16ms. Allocated memory is still 153.1MB. Free memory was 101.6MB in the beginning and 87.1MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 01:37:29,333 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.32ms. Allocated memory is still 153.1MB. Free memory was 87.1MB in the beginning and 121.1MB in the end (delta: -34.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 01:37:29,333 INFO L158 Benchmark]: Boogie Preprocessor took 61.72ms. Allocated memory is still 153.1MB. Free memory was 121.1MB in the beginning and 117.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 01:37:29,333 INFO L158 Benchmark]: IcfgBuilder took 451.26ms. Allocated memory is still 153.1MB. Free memory was 117.9MB in the beginning and 88.7MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-10 01:37:29,333 INFO L158 Benchmark]: TraceAbstraction took 2336.15ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 88.7MB in the beginning and 117.3MB in the end (delta: -28.6MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. [2024-11-10 01:37:29,333 INFO L158 Benchmark]: Witness Printer took 6.50ms. Allocated memory is still 184.5MB. Free memory is still 117.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 01:37:29,334 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.48ms. Allocated memory is still 94.4MB. Free memory was 59.0MB in the beginning and 58.9MB in the end (delta: 69.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.16ms. Allocated memory is still 153.1MB. Free memory was 101.6MB in the beginning and 87.1MB in the end (delta: 14.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.32ms. Allocated memory is still 153.1MB. Free memory was 87.1MB in the beginning and 121.1MB in the end (delta: -34.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 61.72ms. Allocated memory is still 153.1MB. Free memory was 121.1MB in the beginning and 117.9MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 451.26ms. Allocated memory is still 153.1MB. Free memory was 117.9MB in the beginning and 88.7MB in the end (delta: 29.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2336.15ms. Allocated memory was 153.1MB in the beginning and 184.5MB in the end (delta: 31.5MB). Free memory was 88.7MB in the beginning and 117.3MB in the end (delta: -28.6MB). Peak memory consumption was 4.8MB. Max. memory is 16.1GB. * Witness Printer took 6.50ms. Allocated memory is still 184.5MB. Free memory is still 117.3MB. 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 bitwiseOr at line 79, overapproximation of bitwiseAnd at line 84. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 32); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (32 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_3 var_7 = 0; [L33] const SORT_1 var_11 = 0; [L34] const SORT_3 var_24 = 1; [L36] SORT_1 input_2; [L37] SORT_3 input_4; [L38] SORT_1 input_5; [L39] SORT_1 input_6; [L41] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=-1, mask_SORT_3=1, var_11=0, var_24=1, var_7=0] [L41] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L42] EXPR __VERIFIER_nondet_uint() & mask_SORT_1 VAL [mask_SORT_1=-1, mask_SORT_3=1, var_11=0, var_24=1, var_7=0] [L42] SORT_1 state_12 = __VERIFIER_nondet_uint() & mask_SORT_1; [L43] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=-1, mask_SORT_3=1, var_11=0, var_24=1, var_7=0] [L43] SORT_3 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L44] EXPR __VERIFIER_nondet_uint() & mask_SORT_1 VAL [mask_SORT_1=-1, mask_SORT_3=1, var_11=0, var_24=1, var_7=0] [L44] SORT_1 state_17 = __VERIFIER_nondet_uint() & mask_SORT_1; [L46] SORT_3 init_9_arg_1 = var_7; [L47] state_8 = init_9_arg_1 [L48] SORT_1 init_13_arg_1 = var_11; [L49] state_12 = init_13_arg_1 [L50] SORT_3 init_15_arg_1 = var_7; [L51] state_14 = init_15_arg_1 [L52] SORT_1 init_18_arg_1 = var_11; [L53] state_17 = init_18_arg_1 VAL [mask_SORT_1=-1, mask_SORT_3=1, state_12=0, state_14=0, state_17=0, state_8=0, var_11=0, var_24=1, var_7=0] [L56] input_2 = __VERIFIER_nondet_uint() [L57] input_4 = __VERIFIER_nondet_uchar() [L58] input_5 = __VERIFIER_nondet_uint() [L59] input_6 = __VERIFIER_nondet_uint() [L62] SORT_3 var_10_arg_0 = state_8; [L63] SORT_3 var_10 = ~var_10_arg_0; [L64] SORT_3 var_16_arg_0 = state_14; [L65] SORT_1 var_16_arg_1 = state_12; [L66] SORT_1 var_16_arg_2 = input_2; [L67] SORT_1 var_16 = var_16_arg_0 ? var_16_arg_1 : var_16_arg_2; VAL [input_2=0, mask_SORT_1=-1, mask_SORT_3=1, state_14=0, state_17=0, state_8=0, var_10=-1, var_11=0, var_16=0, var_24=1, var_7=0] [L68] EXPR var_16 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=-1, mask_SORT_3=1, state_14=0, state_17=0, state_8=0, var_10=-1, var_11=0, var_24=1, var_7=0] [L68] var_16 = var_16 & mask_SORT_1 [L69] SORT_3 var_19_arg_0 = state_14; [L70] SORT_1 var_19_arg_1 = state_17; [L71] SORT_1 var_19_arg_2 = input_2; [L72] SORT_1 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; VAL [mask_SORT_1=-1, mask_SORT_3=1, state_8=0, var_10=-1, var_11=0, var_16=0, var_19=0, var_24=1, var_7=0] [L73] EXPR var_19 & mask_SORT_1 VAL [mask_SORT_1=-1, mask_SORT_3=1, state_8=0, var_10=-1, var_11=0, var_16=0, var_24=1, var_7=0] [L73] var_19 = var_19 & mask_SORT_1 [L74] SORT_1 var_20_arg_0 = var_16; [L75] SORT_1 var_20_arg_1 = var_19; [L76] SORT_3 var_20 = var_20_arg_0 == var_20_arg_1; [L77] SORT_3 var_21_arg_0 = var_10; [L78] SORT_3 var_21_arg_1 = var_20; VAL [mask_SORT_1=-1, mask_SORT_3=1, state_8=0, var_11=0, var_16=0, var_21_arg_0=-1, var_21_arg_1=1, var_24=1, var_7=0] [L79] EXPR var_21_arg_0 | var_21_arg_1 VAL [mask_SORT_1=-1, mask_SORT_3=1, state_8=0, var_11=0, var_16=0, var_24=1, var_7=0] [L79] SORT_3 var_21 = var_21_arg_0 | var_21_arg_1; [L80] SORT_3 var_25_arg_0 = var_21; [L81] SORT_3 var_25 = ~var_25_arg_0; [L82] SORT_3 var_26_arg_0 = var_24; [L83] SORT_3 var_26_arg_1 = var_25; VAL [mask_SORT_1=-1, mask_SORT_3=1, state_8=0, var_11=0, var_16=0, var_24=1, var_26_arg_0=1, var_26_arg_1=-1, var_7=0] [L84] EXPR var_26_arg_0 & var_26_arg_1 VAL [mask_SORT_1=-1, mask_SORT_3=1, state_8=0, var_11=0, var_16=0, var_24=1, var_7=0] [L84] SORT_3 var_26 = var_26_arg_0 & var_26_arg_1; [L85] EXPR var_26 & mask_SORT_3 VAL [mask_SORT_1=-1, mask_SORT_3=1, state_8=0, var_11=0, var_16=0, var_24=1, var_7=0] [L85] var_26 = var_26 & mask_SORT_3 [L86] SORT_3 bad_27_arg_0 = var_26; [L87] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.3s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 432 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 432 mSDsluCounter, 1232 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 953 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 468 IncrementalHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 279 mSDtfsCounter, 468 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=73occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 54 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 159 NumberOfCodeBlocks, 159 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 426 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-10 01:37:29,367 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.cal181.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 5963c871d6c136110dcc88c8949de566dbe1e9259aea809264af87f26dad49d7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 01:37:31,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 01:37:31,292 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-10 01:37:31,296 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 01:37:31,297 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 01:37:31,321 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 01:37:31,321 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 01:37:31,321 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 01:37:31,322 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 01:37:31,322 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 01:37:31,322 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 01:37:31,323 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 01:37:31,323 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 01:37:31,323 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 01:37:31,323 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 01:37:31,324 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 01:37:31,324 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 01:37:31,328 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 01:37:31,329 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 01:37:31,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 01:37:31,330 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 01:37:31,330 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 01:37:31,330 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 01:37:31,331 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 01:37:31,332 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 01:37:31,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 01:37:31,332 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 01:37:31,333 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 01:37:31,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 01:37:31,333 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 01:37:31,333 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 01:37:31,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:37:31,333 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 01:37:31,334 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 01:37:31,334 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 01:37:31,334 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 01:37:31,334 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 01:37:31,334 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 01:37:31,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 01:37:31,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 01:37:31,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 01:37:31,336 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 -> 5963c871d6c136110dcc88c8949de566dbe1e9259aea809264af87f26dad49d7 [2024-11-10 01:37:31,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 01:37:31,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 01:37:31,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 01:37:31,653 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 01:37:31,653 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 01:37:31,655 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal181.c [2024-11-10 01:37:32,990 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 01:37:33,137 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 01:37:33,138 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal181.c [2024-11-10 01:37:33,144 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21fbd2787/488b96a691bf430598fdedcb3fe67f39/FLAG5560958d4 [2024-11-10 01:37:33,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21fbd2787/488b96a691bf430598fdedcb3fe67f39 [2024-11-10 01:37:33,157 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 01:37:33,158 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 01:37:33,159 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 01:37:33,159 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 01:37:33,163 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 01:37:33,164 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:37:33" (1/1) ... [2024-11-10 01:37:33,165 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75f4ac8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:33, skipping insertion in model container [2024-11-10 01:37:33,165 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:37:33" (1/1) ... [2024-11-10 01:37:33,184 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 01:37:33,335 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.cal181.c[1246,1259] [2024-11-10 01:37:33,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:37:33,394 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 01:37:33,417 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.cal181.c[1246,1259] [2024-11-10 01:37:33,436 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 01:37:33,454 INFO L204 MainTranslator]: Completed translation [2024-11-10 01:37:33,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:33 WrapperNode [2024-11-10 01:37:33,455 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 01:37:33,456 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 01:37:33,456 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 01:37:33,457 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 01:37:33,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:33" (1/1) ... [2024-11-10 01:37:33,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:33" (1/1) ... [2024-11-10 01:37:33,491 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 123 [2024-11-10 01:37:33,494 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 01:37:33,495 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 01:37:33,495 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 01:37:33,495 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 01:37:33,503 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:33" (1/1) ... [2024-11-10 01:37:33,503 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:33" (1/1) ... [2024-11-10 01:37:33,507 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:33" (1/1) ... [2024-11-10 01:37:33,525 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 01:37:33,529 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:33" (1/1) ... [2024-11-10 01:37:33,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:33" (1/1) ... [2024-11-10 01:37:33,537 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:33" (1/1) ... [2024-11-10 01:37:33,537 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:33" (1/1) ... [2024-11-10 01:37:33,538 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:33" (1/1) ... [2024-11-10 01:37:33,542 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:33" (1/1) ... [2024-11-10 01:37:33,545 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 01:37:33,547 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 01:37:33,548 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 01:37:33,548 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 01:37:33,549 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:33" (1/1) ... [2024-11-10 01:37:33,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 01:37:33,562 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 01:37:33,577 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-10 01:37:33,580 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-10 01:37:33,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 01:37:33,616 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 01:37:33,616 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 01:37:33,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 01:37:33,691 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 01:37:33,693 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 01:37:33,867 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2024-11-10 01:37:33,868 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 01:37:33,880 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 01:37:33,880 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 01:37:33,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:37:33 BoogieIcfgContainer [2024-11-10 01:37:33,881 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 01:37:33,883 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 01:37:33,883 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 01:37:33,885 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 01:37:33,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:37:33" (1/3) ... [2024-11-10 01:37:33,886 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3d84df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:37:33, skipping insertion in model container [2024-11-10 01:37:33,886 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:37:33" (2/3) ... [2024-11-10 01:37:33,888 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b3d84df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:37:33, skipping insertion in model container [2024-11-10 01:37:33,888 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:37:33" (3/3) ... [2024-11-10 01:37:33,889 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal181.c [2024-11-10 01:37:33,903 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 01:37:33,904 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 01:37:33,968 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 01:37:33,974 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;@45ab6426, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 01:37:33,975 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 01:37:33,979 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-10 01:37:33,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 01:37:33,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:37:33,984 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 01:37:33,985 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:37:33,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:37:33,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-10 01:37:33,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 01:37:33,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153857435] [2024-11-10 01:37:33,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:37:33,998 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-10 01:37:33,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 01:37:34,001 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-10 01:37:34,002 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-10 01:37:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:37:34,097 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-10 01:37:34,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:37:34,284 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-10 01:37:34,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 01:37:34,286 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 01:37:34,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153857435] [2024-11-10 01:37:34,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153857435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 01:37:34,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 01:37:34,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 01:37:34,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888773750] [2024-11-10 01:37:34,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 01:37:34,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 01:37:34,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 01:37:34,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 01:37:34,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 01:37:34,312 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-10 01:37:34,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:37:34,337 INFO L93 Difference]: Finished difference Result 21 states and 26 transitions. [2024-11-10 01:37:34,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 01:37:34,339 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-10 01:37:34,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:37:34,344 INFO L225 Difference]: With dead ends: 21 [2024-11-10 01:37:34,344 INFO L226 Difference]: Without dead ends: 10 [2024-11-10 01:37:34,346 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-10 01:37:34,349 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-10 01:37:34,349 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-10 01:37:34,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-10 01:37:34,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2024-11-10 01:37:34,374 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-10 01:37:34,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-10 01:37:34,375 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-10 01:37:34,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:37:34,376 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-10 01:37:34,376 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-10 01:37:34,376 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-10 01:37:34,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 01:37:34,377 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:37:34,377 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 01:37:34,379 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-10 01:37:34,579 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-10 01:37:34,579 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:37:34,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:37:34,580 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-10 01:37:34,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 01:37:34,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1486508167] [2024-11-10 01:37:34,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 01:37:34,581 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-10 01:37:34,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 01:37:34,584 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-10 01:37:34,584 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-10 01:37:34,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 01:37:34,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-10 01:37:34,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:37:34,790 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-10 01:37:34,794 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 01:37:35,333 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-10 01:37:35,333 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 01:37:35,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1486508167] [2024-11-10 01:37:35,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1486508167] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 01:37:35,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 01:37:35,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 01:37:35,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284128472] [2024-11-10 01:37:35,334 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 01:37:35,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 01:37:35,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 01:37:35,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 01:37:35,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 01:37:35,336 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-10 01:37:35,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:37:35,407 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2024-11-10 01:37:35,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 01:37:35,407 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-10 01:37:35,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:37:35,408 INFO L225 Difference]: With dead ends: 16 [2024-11-10 01:37:35,408 INFO L226 Difference]: Without dead ends: 13 [2024-11-10 01:37:35,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:37:35,411 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:37:35,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:37:35,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2024-11-10 01:37:35,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2024-11-10 01:37:35,416 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-10 01:37:35,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2024-11-10 01:37:35,417 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 9 [2024-11-10 01:37:35,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:37:35,417 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2024-11-10 01:37:35,417 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-10 01:37:35,418 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2024-11-10 01:37:35,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-10 01:37:35,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 01:37:35,419 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1] [2024-11-10 01:37:35,422 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-10 01:37:35,619 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-10 01:37:35,620 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 01:37:35,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 01:37:35,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1723041149, now seen corresponding path program 2 times [2024-11-10 01:37:35,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 01:37:35,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1414079050] [2024-11-10 01:37:35,622 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-10 01:37:35,622 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-10 01:37:35,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 01:37:35,625 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-10 01:37:35,626 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-10 01:37:35,721 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-10 01:37:35,722 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-10 01:37:35,727 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-10 01:37:35,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 01:37:35,843 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 01:37:35,843 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 01:37:36,855 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-10 01:37:36,856 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 01:37:36,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1414079050] [2024-11-10 01:37:36,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1414079050] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 01:37:36,856 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 01:37:36,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-10 01:37:36,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924446093] [2024-11-10 01:37:36,857 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 01:37:36,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 01:37:36,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 01:37:36,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 01:37:36,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-10 01:37:36,858 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-10 01:37:36,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 01:37:36,925 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-11-10 01:37:36,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 01:37:36,926 INFO L78 Accepts]: Start accepts. Automaton has 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) Word has length 12 [2024-11-10 01:37:36,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 01:37:36,926 INFO L225 Difference]: With dead ends: 13 [2024-11-10 01:37:36,926 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 01:37:36,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-10 01:37:36,927 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 01:37:36,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 01:37:36,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 01:37:36,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 01:37:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 01:37:36,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 01:37:36,929 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 12 [2024-11-10 01:37:36,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 01:37:36,929 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 01:37:36,929 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-10 01:37:36,929 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 01:37:36,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 01:37:36,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 01:37:36,935 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 (4)] Ended with exit code 0 [2024-11-10 01:37:37,134 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-10 01:37:37,138 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-11-10 01:37:37,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 01:37:37,196 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 01:37:37,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:37:37 BoogieIcfgContainer [2024-11-10 01:37:37,219 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 01:37:37,220 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 01:37:37,220 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 01:37:37,220 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 01:37:37,220 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 01:37:33" (3/4) ... [2024-11-10 01:37:37,225 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 01:37:37,250 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-10 01:37:37,255 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-10 01:37:37,256 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 01:37:37,256 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 01:37:37,343 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 01:37:37,343 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 01:37:37,343 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 01:37:37,344 INFO L158 Benchmark]: Toolchain (without parser) took 4185.85ms. Allocated memory was 69.2MB in the beginning and 163.6MB in the end (delta: 94.4MB). Free memory was 37.1MB in the beginning and 135.6MB in the end (delta: -98.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 01:37:37,344 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 52.4MB. Free memory is still 35.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 01:37:37,345 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.44ms. Allocated memory is still 69.2MB. Free memory was 36.8MB in the beginning and 47.5MB in the end (delta: -10.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 01:37:37,345 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.10ms. Allocated memory is still 69.2MB. Free memory was 47.5MB in the beginning and 45.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 01:37:37,345 INFO L158 Benchmark]: Boogie Preprocessor took 51.96ms. Allocated memory is still 69.2MB. Free memory was 45.5MB in the beginning and 43.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 01:37:37,345 INFO L158 Benchmark]: IcfgBuilder took 333.43ms. Allocated memory is still 69.2MB. Free memory was 43.4MB in the beginning and 27.7MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-10 01:37:37,345 INFO L158 Benchmark]: TraceAbstraction took 3336.42ms. Allocated memory was 69.2MB in the beginning and 163.6MB in the end (delta: 94.4MB). Free memory was 26.9MB in the beginning and 140.9MB in the end (delta: -113.9MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2024-11-10 01:37:37,346 INFO L158 Benchmark]: Witness Printer took 123.72ms. Allocated memory is still 163.6MB. Free memory was 140.9MB in the beginning and 135.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 01:37:37,347 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.21ms. Allocated memory is still 52.4MB. Free memory is still 35.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.44ms. Allocated memory is still 69.2MB. Free memory was 36.8MB in the beginning and 47.5MB in the end (delta: -10.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.10ms. Allocated memory is still 69.2MB. Free memory was 47.5MB in the beginning and 45.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.96ms. Allocated memory is still 69.2MB. Free memory was 45.5MB in the beginning and 43.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 333.43ms. Allocated memory is still 69.2MB. Free memory was 43.4MB in the beginning and 27.7MB in the end (delta: 15.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 3336.42ms. Allocated memory was 69.2MB in the beginning and 163.6MB in the end (delta: 94.4MB). Free memory was 26.9MB in the beginning and 140.9MB in the end (delta: -113.9MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * Witness Printer took 123.72ms. Allocated memory is still 163.6MB. Free memory was 140.9MB in the beginning and 135.6MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. 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 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 49 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 34 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 15 mSDtfsCounter, 53 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 27 NumberOfCodeBlocks, 27 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 43 ConstructedInterpolants, 11 QuantifiedInterpolants, 2789 SizeOfPredicates, 20 NumberOfNonLiveVariables, 249 ConjunctsInSsa, 73 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 3/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 54]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-10 01:37:37,369 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE