./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.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.vcegar_QF_BV_itc99_b13_p14.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 6941340a217c21b00eedda9dba2fb93b4ff9d5189cb3951c1318a65ece342f1e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 02:59:12,048 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 02:59:12,124 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-10 02:59:12,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 02:59:12,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 02:59:12,178 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 02:59:12,179 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 02:59:12,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 02:59:12,179 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 02:59:12,180 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 02:59:12,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 02:59:12,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 02:59:12,181 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 02:59:12,181 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 02:59:12,182 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 02:59:12,183 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 02:59:12,184 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 02:59:12,187 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 02:59:12,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 02:59:12,188 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 02:59:12,188 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 02:59:12,188 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 02:59:12,188 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 02:59:12,188 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 02:59:12,189 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 02:59:12,189 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 02:59:12,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 02:59:12,189 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 02:59:12,189 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 02:59:12,189 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:59:12,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 02:59:12,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 02:59:12,190 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 02:59:12,190 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 02:59:12,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 02:59:12,191 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 02:59:12,191 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 02:59:12,191 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 02:59:12,192 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 02:59:12,193 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 -> 6941340a217c21b00eedda9dba2fb93b4ff9d5189cb3951c1318a65ece342f1e [2024-11-10 02:59:12,458 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 02:59:12,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 02:59:12,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 02:59:12,515 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 02:59:12,515 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 02:59:12,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c [2024-11-10 02:59:14,159 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 02:59:14,497 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 02:59:14,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c [2024-11-10 02:59:14,519 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/897a5d67a/dbc0f51901754055886585e2eda14e38/FLAG58b7fa941 [2024-11-10 02:59:14,749 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/897a5d67a/dbc0f51901754055886585e2eda14e38 [2024-11-10 02:59:14,752 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 02:59:14,753 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 02:59:14,761 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 02:59:14,762 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 02:59:14,767 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 02:59:14,768 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:59:14" (1/1) ... [2024-11-10 02:59:14,769 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44f8effd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:14, skipping insertion in model container [2024-11-10 02:59:14,769 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:59:14" (1/1) ... [2024-11-10 02:59:14,797 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 02:59:14,932 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.vcegar_QF_BV_itc99_b13_p14.c[1266,1279] [2024-11-10 02:59:15,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:59:15,045 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 02:59:15,054 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.vcegar_QF_BV_itc99_b13_p14.c[1266,1279] [2024-11-10 02:59:15,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:59:15,186 INFO L204 MainTranslator]: Completed translation [2024-11-10 02:59:15,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:15 WrapperNode [2024-11-10 02:59:15,187 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 02:59:15,188 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 02:59:15,188 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 02:59:15,188 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 02:59:15,227 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:15" (1/1) ... [2024-11-10 02:59:15,246 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:15" (1/1) ... [2024-11-10 02:59:15,310 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 705 [2024-11-10 02:59:15,310 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 02:59:15,311 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 02:59:15,311 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 02:59:15,311 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 02:59:15,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:15" (1/1) ... [2024-11-10 02:59:15,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:15" (1/1) ... [2024-11-10 02:59:15,332 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:15" (1/1) ... [2024-11-10 02:59:15,356 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 02:59:15,357 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:15" (1/1) ... [2024-11-10 02:59:15,357 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:15" (1/1) ... [2024-11-10 02:59:15,375 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:15" (1/1) ... [2024-11-10 02:59:15,378 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:15" (1/1) ... [2024-11-10 02:59:15,384 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:15" (1/1) ... [2024-11-10 02:59:15,389 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:15" (1/1) ... [2024-11-10 02:59:15,397 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 02:59:15,398 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 02:59:15,398 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 02:59:15,398 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 02:59:15,399 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:15" (1/1) ... [2024-11-10 02:59:15,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:59:15,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:59:15,436 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 02:59:15,439 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 02:59:15,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 02:59:15,498 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 02:59:15,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 02:59:15,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 02:59:15,610 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 02:59:15,612 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 02:59:16,433 INFO L? ?]: Removed 342 outVars from TransFormulas that were not future-live. [2024-11-10 02:59:16,433 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 02:59:16,490 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 02:59:16,491 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 02:59:16,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:59:16 BoogieIcfgContainer [2024-11-10 02:59:16,493 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 02:59:16,495 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 02:59:16,496 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 02:59:16,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 02:59:16,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:59:14" (1/3) ... [2024-11-10 02:59:16,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb7e2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:59:16, skipping insertion in model container [2024-11-10 02:59:16,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:15" (2/3) ... [2024-11-10 02:59:16,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cb7e2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:59:16, skipping insertion in model container [2024-11-10 02:59:16,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:59:16" (3/3) ... [2024-11-10 02:59:16,504 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c [2024-11-10 02:59:16,521 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 02:59:16,522 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 02:59:16,605 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 02:59:16,615 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;@817feb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 02:59:16,615 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 02:59:16,619 INFO L276 IsEmpty]: Start isEmpty. Operand has 141 states, 139 states have (on average 1.4820143884892085) internal successors, (206), 140 states have internal predecessors, (206), 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 02:59:16,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-10 02:59:16,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:59:16,631 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:59:16,632 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:59:16,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:59:16,637 INFO L85 PathProgramCache]: Analyzing trace with hash 838464979, now seen corresponding path program 1 times [2024-11-10 02:59:16,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:59:16,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315467109] [2024-11-10 02:59:16,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:59:16,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:59:16,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:59:17,390 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 02:59:17,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:59:17,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315467109] [2024-11-10 02:59:17,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315467109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:59:17,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:59:17,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:59:17,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540329159] [2024-11-10 02:59:17,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:59:17,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:59:17,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:59:17,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:59:17,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:59:17,421 INFO L87 Difference]: Start difference. First operand has 141 states, 139 states have (on average 1.4820143884892085) internal successors, (206), 140 states have internal predecessors, (206), 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 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 02:59:17,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:59:17,595 INFO L93 Difference]: Finished difference Result 227 states and 334 transitions. [2024-11-10 02:59:17,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:59:17,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 40 [2024-11-10 02:59:17,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:59:17,608 INFO L225 Difference]: With dead ends: 227 [2024-11-10 02:59:17,609 INFO L226 Difference]: Without dead ends: 136 [2024-11-10 02:59:17,612 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 02:59:17,617 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 6 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:59:17,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 480 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:59:17,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-10 02:59:17,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-10 02:59:17,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 135 states have (on average 1.474074074074074) internal successors, (199), 135 states have internal predecessors, (199), 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 02:59:17,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 199 transitions. [2024-11-10 02:59:17,676 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 199 transitions. Word has length 40 [2024-11-10 02:59:17,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:59:17,677 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 199 transitions. [2024-11-10 02:59:17,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 02:59:17,678 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 199 transitions. [2024-11-10 02:59:17,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 02:59:17,680 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:59:17,680 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:59:17,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 02:59:17,681 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:59:17,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:59:17,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1447675667, now seen corresponding path program 1 times [2024-11-10 02:59:17,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:59:17,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867246418] [2024-11-10 02:59:17,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:59:17,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:59:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:59:17,957 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 02:59:17,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:59:17,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867246418] [2024-11-10 02:59:17,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867246418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:59:17,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:59:17,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:59:17,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295907377] [2024-11-10 02:59:17,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:59:17,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:59:17,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:59:17,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:59:17,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:59:17,961 INFO L87 Difference]: Start difference. First operand 136 states and 199 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 02:59:18,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:59:18,126 INFO L93 Difference]: Finished difference Result 141 states and 204 transitions. [2024-11-10 02:59:18,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:59:18,127 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 41 [2024-11-10 02:59:18,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:59:18,129 INFO L225 Difference]: With dead ends: 141 [2024-11-10 02:59:18,130 INFO L226 Difference]: Without dead ends: 138 [2024-11-10 02:59:18,131 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 02:59:18,132 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 325 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:59:18,134 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 490 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:59:18,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-10 02:59:18,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-10 02:59:18,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.467153284671533) internal successors, (201), 137 states have internal predecessors, (201), 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 02:59:18,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 201 transitions. [2024-11-10 02:59:18,151 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 201 transitions. Word has length 41 [2024-11-10 02:59:18,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:59:18,153 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 201 transitions. [2024-11-10 02:59:18,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 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 02:59:18,154 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 201 transitions. [2024-11-10 02:59:18,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 02:59:18,156 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:59:18,157 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:59:18,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 02:59:18,157 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:59:18,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:59:18,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1783219235, now seen corresponding path program 1 times [2024-11-10 02:59:18,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:59:18,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809011307] [2024-11-10 02:59:18,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:59:18,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:59:18,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:59:18,335 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 02:59:18,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:59:18,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809011307] [2024-11-10 02:59:18,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809011307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:59:18,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:59:18,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:59:18,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198441929] [2024-11-10 02:59:18,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:59:18,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:59:18,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:59:18,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:59:18,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:59:18,342 INFO L87 Difference]: Start difference. First operand 138 states and 201 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 02:59:18,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:59:18,496 INFO L93 Difference]: Finished difference Result 228 states and 331 transitions. [2024-11-10 02:59:18,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:59:18,497 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 42 [2024-11-10 02:59:18,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:59:18,498 INFO L225 Difference]: With dead ends: 228 [2024-11-10 02:59:18,499 INFO L226 Difference]: Without dead ends: 140 [2024-11-10 02:59:18,499 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 02:59:18,500 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:59:18,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 487 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:59:18,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-10 02:59:18,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2024-11-10 02:59:18,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 139 states have (on average 1.460431654676259) internal successors, (203), 139 states have internal predecessors, (203), 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 02:59:18,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 203 transitions. [2024-11-10 02:59:18,517 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 203 transitions. Word has length 42 [2024-11-10 02:59:18,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:59:18,518 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 203 transitions. [2024-11-10 02:59:18,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 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 02:59:18,518 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 203 transitions. [2024-11-10 02:59:18,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-10 02:59:18,523 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:59:18,523 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:59:18,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 02:59:18,523 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:59:18,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:59:18,524 INFO L85 PathProgramCache]: Analyzing trace with hash 302022226, now seen corresponding path program 1 times [2024-11-10 02:59:18,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:59:18,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987835447] [2024-11-10 02:59:18,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:59:18,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:59:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:59:19,034 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 02:59:19,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 02:59:19,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987835447] [2024-11-10 02:59:19,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987835447] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:59:19,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:59:19,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 02:59:19,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713437279] [2024-11-10 02:59:19,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:59:19,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 02:59:19,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 02:59:19,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 02:59:19,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:59:19,041 INFO L87 Difference]: Start difference. First operand 140 states and 203 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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 02:59:19,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:59:19,205 INFO L93 Difference]: Finished difference Result 234 states and 337 transitions. [2024-11-10 02:59:19,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 02:59:19,210 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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 43 [2024-11-10 02:59:19,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:59:19,211 INFO L225 Difference]: With dead ends: 234 [2024-11-10 02:59:19,211 INFO L226 Difference]: Without dead ends: 144 [2024-11-10 02:59:19,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-10 02:59:19,213 INFO L432 NwaCegarLoop]: 163 mSDtfsCounter, 174 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 483 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 02:59:19,216 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 483 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 02:59:19,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-10 02:59:19,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2024-11-10 02:59:19,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.4507042253521127) internal successors, (206), 142 states have internal predecessors, (206), 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 02:59:19,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2024-11-10 02:59:19,230 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 43 [2024-11-10 02:59:19,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:59:19,230 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2024-11-10 02:59:19,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 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 02:59:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2024-11-10 02:59:19,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-10 02:59:19,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:59:19,232 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:59:19,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 02:59:19,232 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:59:19,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:59:19,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1961513806, now seen corresponding path program 1 times [2024-11-10 02:59:19,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 02:59:19,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018999953] [2024-11-10 02:59:19,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:59:19,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 02:59:19,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 02:59:19,289 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 02:59:19,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 02:59:19,380 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 02:59:19,381 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 02:59:19,382 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 02:59:19,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 02:59:19,386 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-11-10 02:59:19,434 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 02:59:19,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:59:19 BoogieIcfgContainer [2024-11-10 02:59:19,437 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 02:59:19,438 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 02:59:19,438 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 02:59:19,438 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 02:59:19,439 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:59:16" (3/4) ... [2024-11-10 02:59:19,441 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 02:59:19,442 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 02:59:19,443 INFO L158 Benchmark]: Toolchain (without parser) took 4689.32ms. Allocated memory was 136.3MB in the beginning and 331.4MB in the end (delta: 195.0MB). Free memory was 66.4MB in the beginning and 253.7MB in the end (delta: -187.3MB). Peak memory consumption was 10.8MB. Max. memory is 16.1GB. [2024-11-10 02:59:19,443 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 136.3MB. Free memory is still 101.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 02:59:19,443 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.93ms. Allocated memory was 136.3MB in the beginning and 213.9MB in the end (delta: 77.6MB). Free memory was 66.3MB in the beginning and 181.5MB in the end (delta: -115.2MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. [2024-11-10 02:59:19,444 INFO L158 Benchmark]: Boogie Procedure Inliner took 122.16ms. Allocated memory is still 213.9MB. Free memory was 181.5MB in the beginning and 170.7MB in the end (delta: 10.8MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-11-10 02:59:19,444 INFO L158 Benchmark]: Boogie Preprocessor took 86.84ms. Allocated memory is still 213.9MB. Free memory was 170.7MB in the beginning and 162.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-10 02:59:19,444 INFO L158 Benchmark]: IcfgBuilder took 1095.34ms. Allocated memory is still 213.9MB. Free memory was 162.3MB in the beginning and 156.5MB in the end (delta: 5.8MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. [2024-11-10 02:59:19,445 INFO L158 Benchmark]: TraceAbstraction took 2942.11ms. Allocated memory was 213.9MB in the beginning and 331.4MB in the end (delta: 117.4MB). Free memory was 155.4MB in the beginning and 254.7MB in the end (delta: -99.3MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-11-10 02:59:19,445 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 331.4MB. Free memory was 254.7MB in the beginning and 253.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 02:59:19,447 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.12ms. Allocated memory is still 136.3MB. Free memory is still 101.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.93ms. Allocated memory was 136.3MB in the beginning and 213.9MB in the end (delta: 77.6MB). Free memory was 66.3MB in the beginning and 181.5MB in the end (delta: -115.2MB). Peak memory consumption was 31.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 122.16ms. Allocated memory is still 213.9MB. Free memory was 181.5MB in the beginning and 170.7MB in the end (delta: 10.8MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.84ms. Allocated memory is still 213.9MB. Free memory was 170.7MB in the beginning and 162.3MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 1095.34ms. Allocated memory is still 213.9MB. Free memory was 162.3MB in the beginning and 156.5MB in the end (delta: 5.8MB). Peak memory consumption was 73.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2942.11ms. Allocated memory was 213.9MB in the beginning and 331.4MB in the end (delta: 117.4MB). Free memory was 155.4MB in the beginning and 254.7MB in the end (delta: -99.3MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 331.4MB. Free memory was 254.7MB in the beginning and 253.7MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 162. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 8); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (8 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 32); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (32 - 1); [L35] const SORT_32 mask_SORT_32 = (SORT_32)-1 >> (sizeof(SORT_32) * 8 - 4); [L36] const SORT_32 msb_SORT_32 = (SORT_32)1 << (4 - 1); [L38] const SORT_70 mask_SORT_70 = (SORT_70)-1 >> (sizeof(SORT_70) * 8 - 10); [L39] const SORT_70 msb_SORT_70 = (SORT_70)1 << (10 - 1); [L41] const SORT_1 var_7 = 0; [L42] const SORT_10 var_12 = 0; [L43] const SORT_1 var_22 = 1; [L44] const SORT_70 var_71 = 0; [L45] const SORT_10 var_95 = 104; [L46] const SORT_10 var_143 = 1; [L48] SORT_1 input_2; [L49] SORT_3 input_4; [L50] SORT_1 input_5; [L51] SORT_1 input_6; [L52] SORT_1 input_30; [L53] SORT_32 input_33; [L54] SORT_1 input_35; [L55] SORT_32 input_37; [L56] SORT_1 input_39; [L57] SORT_1 input_41; [L58] SORT_1 input_47; [L59] SORT_1 input_49; [L60] SORT_1 input_51; [L61] SORT_3 input_55; [L62] SORT_1 input_58; [L63] SORT_1 input_66; [L64] SORT_1 input_75; [L65] SORT_1 input_77; [L66] SORT_1 input_89; [L67] SORT_1 input_90; [L68] SORT_1 input_91; [L69] SORT_1 input_105; [L70] SORT_1 input_111; [L71] SORT_1 input_117; [L72] SORT_1 input_123; [L73] SORT_1 input_124; [L74] SORT_1 input_125; [L75] SORT_70 input_141; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L77] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L78] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L79] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L80] SORT_1 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L81] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L82] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L83] SORT_1 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L84] SORT_1 state_60 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L85] SORT_1 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L86] SORT_1 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L87] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_ushort() & mask_SORT_70 VAL [mask_SORT_1=1, mask_SORT_70=1023, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L88] SORT_70 state_72 = __VERIFIER_nondet_ushort() & mask_SORT_70; [L90] SORT_1 init_9_arg_1 = var_7; [L91] state_8 = init_9_arg_1 [L92] SORT_1 init_16_arg_1 = var_7; [L93] state_15 = init_16_arg_1 [L94] SORT_1 init_27_arg_1 = var_7; [L95] state_26 = init_27_arg_1 [L96] SORT_1 init_29_arg_1 = var_7; [L97] state_28 = init_29_arg_1 [L98] SORT_1 init_44_arg_1 = var_7; [L99] state_43 = init_44_arg_1 [L100] SORT_1 init_46_arg_1 = var_7; [L101] state_45 = init_46_arg_1 [L102] SORT_1 init_54_arg_1 = var_22; [L103] state_53 = init_54_arg_1 [L104] SORT_1 init_61_arg_1 = var_7; [L105] state_60 = init_61_arg_1 [L106] SORT_1 init_63_arg_1 = var_7; [L107] state_62 = init_63_arg_1 [L108] SORT_1 init_65_arg_1 = var_7; [L109] state_64 = init_65_arg_1 [L110] SORT_1 init_69_arg_1 = var_7; [L111] state_68 = init_69_arg_1 [L112] SORT_70 init_73_arg_1 = var_71; [L113] state_72 = init_73_arg_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L116] input_2 = __VERIFIER_nondet_uchar() [L117] input_4 = __VERIFIER_nondet_uchar() [L118] input_5 = __VERIFIER_nondet_uchar() [L119] input_6 = __VERIFIER_nondet_uchar() [L120] input_30 = __VERIFIER_nondet_uchar() [L121] input_33 = __VERIFIER_nondet_uchar() [L122] input_35 = __VERIFIER_nondet_uchar() [L123] input_37 = __VERIFIER_nondet_uchar() [L124] input_39 = __VERIFIER_nondet_uchar() [L125] input_41 = __VERIFIER_nondet_uchar() [L126] input_47 = __VERIFIER_nondet_uchar() [L127] input_49 = __VERIFIER_nondet_uchar() [L128] input_51 = __VERIFIER_nondet_uchar() [L129] input_55 = __VERIFIER_nondet_uchar() [L130] input_58 = __VERIFIER_nondet_uchar() [L131] input_66 = __VERIFIER_nondet_uchar() [L132] input_75 = __VERIFIER_nondet_uchar() [L133] input_77 = __VERIFIER_nondet_uchar() [L134] input_89 = __VERIFIER_nondet_uchar() [L135] input_90 = __VERIFIER_nondet_uchar() [L136] input_91 = __VERIFIER_nondet_uchar() [L137] input_105 = __VERIFIER_nondet_uchar() [L138] input_111 = __VERIFIER_nondet_uchar() [L139] input_117 = __VERIFIER_nondet_uchar() [L140] input_123 = __VERIFIER_nondet_uchar() [L141] input_124 = __VERIFIER_nondet_uchar() [L142] input_125 = __VERIFIER_nondet_uchar() [L143] input_141 = __VERIFIER_nondet_ushort() [L146] SORT_1 var_11_arg_0 = state_8; VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_11_arg_0=0, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L147] EXPR var_11_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L147] var_11_arg_0 = var_11_arg_0 & mask_SORT_1 [L148] SORT_10 var_11 = var_11_arg_0; [L149] SORT_10 var_13_arg_0 = var_11; [L150] SORT_10 var_13_arg_1 = var_12; [L151] SORT_1 var_13 = var_13_arg_0 == var_13_arg_1; [L152] SORT_1 var_14_arg_0 = var_13; [L153] SORT_1 var_14 = ~var_14_arg_0; [L154] SORT_1 var_17_arg_0 = state_15; VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_14=-2, var_17_arg_0=0, var_22=1, var_71=0, var_7=0, var_95=104] [L155] EXPR var_17_arg_0 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_14=-2, var_22=1, var_71=0, var_7=0, var_95=104] [L155] var_17_arg_0 = var_17_arg_0 & mask_SORT_1 [L156] SORT_10 var_17 = var_17_arg_0; [L157] SORT_10 var_18_arg_0 = var_17; [L158] SORT_10 var_18_arg_1 = var_12; [L159] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L160] SORT_1 var_19_arg_0 = var_14; [L161] SORT_1 var_19_arg_1 = var_18; VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_19_arg_0=-2, var_19_arg_1=1, var_22=1, var_71=0, var_7=0, var_95=104] [L162] EXPR var_19_arg_0 | var_19_arg_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L162] SORT_1 var_19 = var_19_arg_0 | var_19_arg_1; [L163] SORT_1 var_23_arg_0 = var_19; [L164] SORT_1 var_23 = ~var_23_arg_0; [L165] SORT_1 var_24_arg_0 = var_22; [L166] SORT_1 var_24_arg_1 = var_23; VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_22=1, var_24_arg_0=1, var_24_arg_1=-255, var_71=0, var_7=0, var_95=104] [L167] EXPR var_24_arg_0 & var_24_arg_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L167] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L168] EXPR var_24 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_70=1023, state_15=0, state_26=0, state_28=0, state_43=0, state_45=0, state_53=1, state_60=0, state_62=0, state_64=0, state_68=0, state_72=0, state_8=0, var_12=0, var_143=1, var_22=1, var_71=0, var_7=0, var_95=104] [L168] var_24 = var_24 & mask_SORT_1 [L169] SORT_1 bad_25_arg_0 = var_24; [L170] CALL __VERIFIER_assert(!(bad_25_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 141 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 180 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 180 mSDsluCounter, 1940 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1284 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 436 IncrementalHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 656 mSDtfsCounter, 436 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=143occurred in iteration=4, 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.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 162 ConstructedInterpolants, 0 QuantifiedInterpolants, 298 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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 02:59:19,484 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 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.vcegar_QF_BV_itc99_b13_p14.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 6941340a217c21b00eedda9dba2fb93b4ff9d5189cb3951c1318a65ece342f1e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 02:59:22,059 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 02:59:22,132 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-10 02:59:22,138 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 02:59:22,138 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 02:59:22,178 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 02:59:22,179 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 02:59:22,179 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 02:59:22,180 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 02:59:22,180 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 02:59:22,180 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 02:59:22,180 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 02:59:22,181 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 02:59:22,185 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 02:59:22,186 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 02:59:22,186 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 02:59:22,186 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 02:59:22,187 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 02:59:22,187 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 02:59:22,187 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 02:59:22,187 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 02:59:22,188 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 02:59:22,188 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 02:59:22,189 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 02:59:22,189 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 02:59:22,189 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 02:59:22,189 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 02:59:22,189 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 02:59:22,189 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 02:59:22,190 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 02:59:22,190 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 02:59:22,190 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:59:22,190 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 02:59:22,190 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 02:59:22,191 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 02:59:22,191 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 02:59:22,191 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 02:59:22,195 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 02:59:22,196 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 02:59:22,196 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 02:59:22,196 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 02:59:22,196 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 -> 6941340a217c21b00eedda9dba2fb93b4ff9d5189cb3951c1318a65ece342f1e [2024-11-10 02:59:22,529 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 02:59:22,557 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 02:59:22,560 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 02:59:22,562 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 02:59:22,563 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 02:59:22,564 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c [2024-11-10 02:59:24,494 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 02:59:24,696 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 02:59:24,697 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c [2024-11-10 02:59:24,714 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dffaf133/009c8a27622f4aa9b7dbe827c4fbdd56/FLAG5bbe60fae [2024-11-10 02:59:24,727 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0dffaf133/009c8a27622f4aa9b7dbe827c4fbdd56 [2024-11-10 02:59:24,729 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 02:59:24,730 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 02:59:24,731 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 02:59:24,731 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 02:59:24,739 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 02:59:24,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:59:24" (1/1) ... [2024-11-10 02:59:24,745 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@64ab8714 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:24, skipping insertion in model container [2024-11-10 02:59:24,745 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:59:24" (1/1) ... [2024-11-10 02:59:24,803 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 02:59:25,007 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.vcegar_QF_BV_itc99_b13_p14.c[1266,1279] [2024-11-10 02:59:25,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:59:25,167 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 02:59:25,183 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.vcegar_QF_BV_itc99_b13_p14.c[1266,1279] [2024-11-10 02:59:25,262 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 02:59:25,284 INFO L204 MainTranslator]: Completed translation [2024-11-10 02:59:25,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:25 WrapperNode [2024-11-10 02:59:25,286 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 02:59:25,287 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 02:59:25,287 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 02:59:25,288 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 02:59:25,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:25" (1/1) ... [2024-11-10 02:59:25,317 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:25" (1/1) ... [2024-11-10 02:59:25,371 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 449 [2024-11-10 02:59:25,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 02:59:25,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 02:59:25,376 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 02:59:25,376 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 02:59:25,383 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:25" (1/1) ... [2024-11-10 02:59:25,384 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:25" (1/1) ... [2024-11-10 02:59:25,388 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:25" (1/1) ... [2024-11-10 02:59:25,406 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 02:59:25,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:25" (1/1) ... [2024-11-10 02:59:25,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:25" (1/1) ... [2024-11-10 02:59:25,415 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:25" (1/1) ... [2024-11-10 02:59:25,415 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:25" (1/1) ... [2024-11-10 02:59:25,417 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:25" (1/1) ... [2024-11-10 02:59:25,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:25" (1/1) ... [2024-11-10 02:59:25,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 02:59:25,426 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 02:59:25,430 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 02:59:25,430 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 02:59:25,431 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:25" (1/1) ... [2024-11-10 02:59:25,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 02:59:25,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 02:59:25,464 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 02:59:25,468 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 02:59:25,506 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 02:59:25,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 02:59:25,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 02:59:25,507 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 02:59:25,670 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 02:59:25,673 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 02:59:26,045 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2024-11-10 02:59:26,045 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 02:59:26,057 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 02:59:26,058 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 02:59:26,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:59:26 BoogieIcfgContainer [2024-11-10 02:59:26,058 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 02:59:26,062 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 02:59:26,062 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 02:59:26,065 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 02:59:26,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 02:59:24" (1/3) ... [2024-11-10 02:59:26,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f250c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:59:26, skipping insertion in model container [2024-11-10 02:59:26,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:59:25" (2/3) ... [2024-11-10 02:59:26,067 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70f250c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 02:59:26, skipping insertion in model container [2024-11-10 02:59:26,067 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:59:26" (3/3) ... [2024-11-10 02:59:26,069 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.vcegar_QF_BV_itc99_b13_p14.c [2024-11-10 02:59:26,083 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 02:59:26,083 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 02:59:26,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 02:59:26,131 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;@427ce10, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 02:59:26,135 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 02:59:26,141 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 02:59:26,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-10 02:59:26,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:59:26,149 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-10 02:59:26,149 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:59:26,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:59:26,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-10 02:59:26,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:59:26,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2088010227] [2024-11-10 02:59:26,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:59:26,175 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 02:59:26,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:59:26,178 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 02:59:26,180 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 02:59:26,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:59:26,393 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-10 02:59:26,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:59:26,561 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 02:59:26,561 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 02:59:26,561 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 02:59:26,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2088010227] [2024-11-10 02:59:26,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2088010227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 02:59:26,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 02:59:26,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 02:59:26,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019183827] [2024-11-10 02:59:26,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 02:59:26,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 02:59:26,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 02:59:26,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 02:59:26,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 02:59:26,601 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 02:59:26,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:59:26,657 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-10 02:59:26,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 02:59:26,659 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 02:59:26,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:59:26,666 INFO L225 Difference]: With dead ends: 22 [2024-11-10 02:59:26,666 INFO L226 Difference]: Without dead ends: 11 [2024-11-10 02:59:26,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 02:59:26,671 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 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 02:59:26,672 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 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 02:59:26,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-10 02:59:26,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-10 02:59:26,694 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 02:59:26,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-10 02:59:26,696 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-10 02:59:26,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:59:26,696 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-10 02:59:26,696 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 02:59:26,696 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-10 02:59:26,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-10 02:59:26,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 02:59:26,697 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 02:59:26,700 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 02:59:26,899 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 02:59:26,901 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 02:59:26,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 02:59:26,902 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-10 02:59:26,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 02:59:26,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1120871022] [2024-11-10 02:59:26,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 02:59:26,904 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 02:59:26,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 02:59:26,907 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 02:59:26,908 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 02:59:27,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 02:59:27,068 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-10 02:59:27,073 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 02:59:27,203 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 02:59:27,204 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 02:59:27,557 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 02:59:27,558 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 02:59:27,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1120871022] [2024-11-10 02:59:27,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1120871022] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 02:59:27,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 02:59:27,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-10 02:59:27,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871464392] [2024-11-10 02:59:27,560 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 02:59:27,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 02:59:27,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 02:59:27,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 02:59:27,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 02:59:27,562 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 02:59:27,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 02:59:27,732 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2024-11-10 02:59:27,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 02:59:27,733 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 02:59:27,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 02:59:27,734 INFO L225 Difference]: With dead ends: 11 [2024-11-10 02:59:27,738 INFO L226 Difference]: Without dead ends: 0 [2024-11-10 02:59:27,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2024-11-10 02:59:27,740 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 8 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 02:59:27,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 6 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 02:59:27,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-10 02:59:27,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-10 02:59:27,741 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 02:59:27,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-10 02:59:27,741 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 9 [2024-11-10 02:59:27,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 02:59:27,741 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-10 02:59:27,741 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 02:59:27,741 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-10 02:59:27,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-10 02:59:27,746 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 02:59:27,761 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 02:59:27,947 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 02:59:27,952 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-10 02:59:27,954 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-10 02:59:27,996 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 02:59:28,002 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 02:59:28 BoogieIcfgContainer [2024-11-10 02:59:28,002 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 02:59:28,003 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 02:59:28,003 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 02:59:28,003 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 02:59:28,004 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 02:59:26" (3/4) ... [2024-11-10 02:59:28,005 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-10 02:59:28,014 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-10 02:59:28,015 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-10 02:59:28,015 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-10 02:59:28,016 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-10 02:59:28,109 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-10 02:59:28,111 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-10 02:59:28,111 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 02:59:28,112 INFO L158 Benchmark]: Toolchain (without parser) took 3382.31ms. Allocated memory was 56.6MB in the beginning and 104.9MB in the end (delta: 48.2MB). Free memory was 27.9MB in the beginning and 62.5MB in the end (delta: -34.5MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-10 02:59:28,112 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 56.6MB. Free memory was 33.0MB in the beginning and 33.0MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 02:59:28,113 INFO L158 Benchmark]: CACSL2BoogieTranslator took 555.24ms. Allocated memory was 56.6MB in the beginning and 79.7MB in the end (delta: 23.1MB). Free memory was 27.6MB in the beginning and 45.0MB in the end (delta: -17.4MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-11-10 02:59:28,113 INFO L158 Benchmark]: Boogie Procedure Inliner took 88.01ms. Allocated memory is still 79.7MB. Free memory was 45.0MB in the beginning and 41.2MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 02:59:28,113 INFO L158 Benchmark]: Boogie Preprocessor took 50.05ms. Allocated memory is still 79.7MB. Free memory was 41.2MB in the beginning and 36.7MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 02:59:28,114 INFO L158 Benchmark]: IcfgBuilder took 632.33ms. Allocated memory is still 79.7MB. Free memory was 36.7MB in the beginning and 53.0MB in the end (delta: -16.4MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2024-11-10 02:59:28,114 INFO L158 Benchmark]: TraceAbstraction took 1940.44ms. Allocated memory was 79.7MB in the beginning and 104.9MB in the end (delta: 25.2MB). Free memory was 52.5MB in the beginning and 71.9MB in the end (delta: -19.4MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2024-11-10 02:59:28,114 INFO L158 Benchmark]: Witness Printer took 108.48ms. Allocated memory is still 104.9MB. Free memory was 71.9MB in the beginning and 62.5MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 02:59:28,116 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.25ms. Allocated memory is still 56.6MB. Free memory was 33.0MB in the beginning and 33.0MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 555.24ms. Allocated memory was 56.6MB in the beginning and 79.7MB in the end (delta: 23.1MB). Free memory was 27.6MB in the beginning and 45.0MB in the end (delta: -17.4MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 88.01ms. Allocated memory is still 79.7MB. Free memory was 45.0MB in the beginning and 41.2MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.05ms. Allocated memory is still 79.7MB. Free memory was 41.2MB in the beginning and 36.7MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 632.33ms. Allocated memory is still 79.7MB. Free memory was 36.7MB in the beginning and 53.0MB in the end (delta: -16.4MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1940.44ms. Allocated memory was 79.7MB in the beginning and 104.9MB in the end (delta: 25.2MB). Free memory was 52.5MB in the beginning and 71.9MB in the end (delta: -19.4MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. * Witness Printer took 108.48ms. Allocated memory is still 104.9MB. Free memory was 71.9MB in the beginning and 62.5MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. 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: 1.8s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 10 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10 mSDsluCounter, 20 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 7 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 10, 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, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 15 NumberOfCodeBlocks, 15 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 21 ConstructedInterpolants, 4 QuantifiedInterpolants, 700 SizeOfPredicates, 13 NumberOfNonLiveVariables, 192 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 3 InterpolantComputations, 1 PerfectInterpolantSequences, 0/4 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: 114]: Location Invariant Derived location invariant: null RESULT: Ultimate proved your program to be correct! [2024-11-10 02:59:28,148 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