./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal25.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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.cal25.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 c2f9f17c6d1e33b7d4937d5702f73ddc421381e322ac5ad4ecf1688b251301a7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 17:58:27,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:58:27,891 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-08 17:58:27,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:58:27,895 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:58:27,915 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:58:27,916 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:58:27,917 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:58:27,918 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:58:27,920 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:58:27,921 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:58:27,921 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:58:27,921 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:58:27,921 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:58:27,922 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:58:27,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:58:27,922 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:58:27,923 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 17:58:27,923 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:58:27,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:58:27,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:58:27,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:58:27,924 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:58:27,924 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:58:27,925 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:58:27,925 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:58:27,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:58:27,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:58:27,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:58:27,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:58:27,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:58:27,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:58:27,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:58:27,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 17:58:27,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 17:58:27,928 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:58:27,928 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:58:27,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:58:27,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:58:27,929 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 -> c2f9f17c6d1e33b7d4937d5702f73ddc421381e322ac5ad4ecf1688b251301a7 [2024-11-08 17:58:28,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:58:28,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:58:28,165 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:58:28,166 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:58:28,167 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:58:28,168 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal25.c [2024-11-08 17:58:29,591 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:58:29,732 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:58:29,733 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal25.c [2024-11-08 17:58:29,740 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f934dc0d2/75c206826a5d4c48b664899f39384c4a/FLAGe101cd93d [2024-11-08 17:58:29,751 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f934dc0d2/75c206826a5d4c48b664899f39384c4a [2024-11-08 17:58:29,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:58:29,754 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:58:29,755 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:58:29,755 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:58:29,761 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:58:29,761 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:58:29" (1/1) ... [2024-11-08 17:58:29,762 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59bfa59e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:29, skipping insertion in model container [2024-11-08 17:58:29,762 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:58:29" (1/1) ... [2024-11-08 17:58:29,783 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:58:29,935 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.cal25.c[1245,1258] [2024-11-08 17:58:29,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:58:29,998 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:58:30,013 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.cal25.c[1245,1258] [2024-11-08 17:58:30,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:58:30,056 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:58:30,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:30 WrapperNode [2024-11-08 17:58:30,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:58:30,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:58:30,058 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:58:30,058 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:58:30,064 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:30" (1/1) ... [2024-11-08 17:58:30,085 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:30" (1/1) ... [2024-11-08 17:58:30,171 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 295 [2024-11-08 17:58:30,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:58:30,172 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:58:30,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:58:30,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:58:30,183 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:30" (1/1) ... [2024-11-08 17:58:30,184 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:30" (1/1) ... [2024-11-08 17:58:30,195 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:30" (1/1) ... [2024-11-08 17:58:30,219 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-08 17:58:30,219 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:30" (1/1) ... [2024-11-08 17:58:30,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:30" (1/1) ... [2024-11-08 17:58:30,241 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:30" (1/1) ... [2024-11-08 17:58:30,248 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:30" (1/1) ... [2024-11-08 17:58:30,255 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:30" (1/1) ... [2024-11-08 17:58:30,262 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:30" (1/1) ... [2024-11-08 17:58:30,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:58:30,278 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:58:30,278 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:58:30,278 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:58:30,283 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:30" (1/1) ... [2024-11-08 17:58:30,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:58:30,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 17:58:30,311 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-08 17:58:30,314 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-08 17:58:30,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:58:30,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 17:58:30,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 17:58:30,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:58:30,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:58:30,429 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:58:30,431 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:58:30,774 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2024-11-08 17:58:30,774 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:58:30,790 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:58:30,791 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:58:30,792 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:58:30 BoogieIcfgContainer [2024-11-08 17:58:30,792 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:58:30,794 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:58:30,795 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:58:30,798 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:58:30,798 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:58:29" (1/3) ... [2024-11-08 17:58:30,798 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19453fa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:58:30, skipping insertion in model container [2024-11-08 17:58:30,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:30" (2/3) ... [2024-11-08 17:58:30,799 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19453fa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:58:30, skipping insertion in model container [2024-11-08 17:58:30,799 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:58:30" (3/3) ... [2024-11-08 17:58:30,800 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal25.c [2024-11-08 17:58:30,813 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:58:30,813 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:58:30,866 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:58:30,872 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;@50420a72, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:58:30,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:58:30,876 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 68 states have (on average 1.4852941176470589) internal successors, (101), 69 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:58:30,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-08 17:58:30,883 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:58:30,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:58:30,884 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:58:30,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:58:30,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2017394231, now seen corresponding path program 1 times [2024-11-08 17:58:30,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:58:30,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347808390] [2024-11-08 17:58:30,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:58:30,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:58:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:58:31,350 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-08 17:58:31,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:58:31,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347808390] [2024-11-08 17:58:31,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347808390] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:58:31,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:58:31,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:58:31,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071605390] [2024-11-08 17:58:31,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:58:31,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:58:31,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:58:31,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:58:31,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:58:31,376 INFO L87 Difference]: Start difference. First operand has 70 states, 68 states have (on average 1.4852941176470589) internal successors, (101), 69 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:58:31,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:58:31,405 INFO L93 Difference]: Finished difference Result 121 states and 177 transitions. [2024-11-08 17:58:31,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:58:31,408 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-08 17:58:31,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:58:31,430 INFO L225 Difference]: With dead ends: 121 [2024-11-08 17:58:31,430 INFO L226 Difference]: Without dead ends: 69 [2024-11-08 17:58:31,433 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-08 17:58:31,437 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:58:31,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 279 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:58:31,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-08 17:58:31,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-08 17:58:31,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.4558823529411764) internal successors, (99), 68 states have internal predecessors, (99), 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-08 17:58:31,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 99 transitions. [2024-11-08 17:58:31,531 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 99 transitions. Word has length 27 [2024-11-08 17:58:31,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:58:31,532 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 99 transitions. [2024-11-08 17:58:31,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:58:31,533 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 99 transitions. [2024-11-08 17:58:31,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-08 17:58:31,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:58:31,534 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:58:31,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 17:58:31,535 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:58:31,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:58:31,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1883592983, now seen corresponding path program 1 times [2024-11-08 17:58:31,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:58:31,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075995225] [2024-11-08 17:58:31,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:58:31,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:58:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:58:31,734 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-08 17:58:31,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:58:31,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075995225] [2024-11-08 17:58:31,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075995225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:58:31,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:58:31,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:58:31,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419767810] [2024-11-08 17:58:31,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:58:31,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:58:31,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:58:31,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:58:31,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:58:31,739 INFO L87 Difference]: Start difference. First operand 69 states and 99 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:58:31,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:58:31,769 INFO L93 Difference]: Finished difference Result 122 states and 175 transitions. [2024-11-08 17:58:31,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:58:31,770 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-08 17:58:31,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:58:31,771 INFO L225 Difference]: With dead ends: 122 [2024-11-08 17:58:31,773 INFO L226 Difference]: Without dead ends: 71 [2024-11-08 17:58:31,774 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-08 17:58:31,775 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 0 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:58:31,776 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 275 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:58:31,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2024-11-08 17:58:31,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2024-11-08 17:58:31,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.4428571428571428) internal successors, (101), 70 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:58:31,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 101 transitions. [2024-11-08 17:58:31,787 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 101 transitions. Word has length 28 [2024-11-08 17:58:31,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:58:31,788 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 101 transitions. [2024-11-08 17:58:31,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:58:31,788 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 101 transitions. [2024-11-08 17:58:31,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-08 17:58:31,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:58:31,789 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:58:31,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 17:58:31,789 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:58:31,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:58:31,790 INFO L85 PathProgramCache]: Analyzing trace with hash 640193872, now seen corresponding path program 1 times [2024-11-08 17:58:31,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:58:31,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975173124] [2024-11-08 17:58:31,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:58:31,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:58:31,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:58:32,061 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-08 17:58:32,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:58:32,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975173124] [2024-11-08 17:58:32,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975173124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:58:32,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:58:32,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 17:58:32,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863043402] [2024-11-08 17:58:32,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:58:32,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 17:58:32,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:58:32,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 17:58:32,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 17:58:32,063 INFO L87 Difference]: Start difference. First operand 71 states and 101 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:58:32,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:58:32,162 INFO L93 Difference]: Finished difference Result 161 states and 227 transitions. [2024-11-08 17:58:32,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:58:32,163 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-08 17:58:32,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:58:32,164 INFO L225 Difference]: With dead ends: 161 [2024-11-08 17:58:32,164 INFO L226 Difference]: Without dead ends: 108 [2024-11-08 17:58:32,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:58:32,165 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 185 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:58:32,166 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 346 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:58:32,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-08 17:58:32,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 89. [2024-11-08 17:58:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 88 states have (on average 1.4431818181818181) internal successors, (127), 88 states have internal predecessors, (127), 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-08 17:58:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 127 transitions. [2024-11-08 17:58:32,171 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 127 transitions. Word has length 29 [2024-11-08 17:58:32,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:58:32,172 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 127 transitions. [2024-11-08 17:58:32,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:58:32,172 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 127 transitions. [2024-11-08 17:58:32,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-08 17:58:32,172 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:58:32,173 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 17:58:32,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 17:58:32,173 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:58:32,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:58:32,175 INFO L85 PathProgramCache]: Analyzing trace with hash -719939504, now seen corresponding path program 1 times [2024-11-08 17:58:32,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:58:32,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744781992] [2024-11-08 17:58:32,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:58:32,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:58:32,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:58:32,523 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-08 17:58:32,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:58:32,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744781992] [2024-11-08 17:58:32,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744781992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:58:32,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:58:32,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-08 17:58:32,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158310054] [2024-11-08 17:58:32,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:58:32,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:58:32,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:58:32,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:58:32,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:58:32,525 INFO L87 Difference]: Start difference. First operand 89 states and 127 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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-08 17:58:32,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:58:32,687 INFO L93 Difference]: Finished difference Result 163 states and 229 transitions. [2024-11-08 17:58:32,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-08 17:58:32,687 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 30 [2024-11-08 17:58:32,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:58:32,688 INFO L225 Difference]: With dead ends: 163 [2024-11-08 17:58:32,688 INFO L226 Difference]: Without dead ends: 110 [2024-11-08 17:58:32,689 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-08 17:58:32,690 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 188 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:58:32,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 506 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:58:32,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-08 17:58:32,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 92. [2024-11-08 17:58:32,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4395604395604396) internal successors, (131), 91 states have internal predecessors, (131), 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-08 17:58:32,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 131 transitions. [2024-11-08 17:58:32,703 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 131 transitions. Word has length 30 [2024-11-08 17:58:32,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:58:32,703 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 131 transitions. [2024-11-08 17:58:32,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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-08 17:58:32,705 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 131 transitions. [2024-11-08 17:58:32,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-08 17:58:32,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:58:32,706 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] [2024-11-08 17:58:32,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 17:58:32,707 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:58:32,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:58:32,707 INFO L85 PathProgramCache]: Analyzing trace with hash -523941715, now seen corresponding path program 1 times [2024-11-08 17:58:32,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:58:32,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119715514] [2024-11-08 17:58:32,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:58:32,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:58:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:58:33,102 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-08 17:58:33,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 17:58:33,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119715514] [2024-11-08 17:58:33,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119715514] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:58:33,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:58:33,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 17:58:33,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555823170] [2024-11-08 17:58:33,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:58:33,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 17:58:33,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 17:58:33,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 17:58:33,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-08 17:58:33,106 INFO L87 Difference]: Start difference. First operand 92 states and 131 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-08 17:58:33,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:58:33,257 INFO L93 Difference]: Finished difference Result 163 states and 228 transitions. [2024-11-08 17:58:33,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-08 17:58:33,257 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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 31 [2024-11-08 17:58:33,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:58:33,258 INFO L225 Difference]: With dead ends: 163 [2024-11-08 17:58:33,258 INFO L226 Difference]: Without dead ends: 110 [2024-11-08 17:58:33,259 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-08 17:58:33,260 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 183 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 17:58:33,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 488 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 17:58:33,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-08 17:58:33,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 96. [2024-11-08 17:58:33,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 95 states have (on average 1.431578947368421) internal successors, (136), 95 states have internal predecessors, (136), 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-08 17:58:33,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 136 transitions. [2024-11-08 17:58:33,268 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 136 transitions. Word has length 31 [2024-11-08 17:58:33,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:58:33,268 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 136 transitions. [2024-11-08 17:58:33,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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-08 17:58:33,268 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 136 transitions. [2024-11-08 17:58:33,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 17:58:33,269 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:58:33,269 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] [2024-11-08 17:58:33,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 17:58:33,269 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:58:33,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:58:33,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1792746033, now seen corresponding path program 1 times [2024-11-08 17:58:33,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 17:58:33,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352938386] [2024-11-08 17:58:33,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:58:33,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 17:58:33,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:58:33,295 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 17:58:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 17:58:33,355 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 17:58:33,356 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 17:58:33,357 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:58:33,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 17:58:33,361 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-08 17:58:33,406 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:58:33,412 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:58:33 BoogieIcfgContainer [2024-11-08 17:58:33,415 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:58:33,416 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:58:33,419 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:58:33,419 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:58:33,420 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:58:30" (3/4) ... [2024-11-08 17:58:33,422 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 17:58:33,427 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:58:33,428 INFO L158 Benchmark]: Toolchain (without parser) took 3673.41ms. Allocated memory was 151.0MB in the beginning and 251.7MB in the end (delta: 100.7MB). Free memory was 77.8MB in the beginning and 153.9MB in the end (delta: -76.1MB). Peak memory consumption was 26.4MB. Max. memory is 16.1GB. [2024-11-08 17:58:33,428 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 151.0MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:58:33,428 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.43ms. Allocated memory is still 151.0MB. Free memory was 77.6MB in the beginning and 61.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-08 17:58:33,428 INFO L158 Benchmark]: Boogie Procedure Inliner took 114.27ms. Allocated memory was 151.0MB in the beginning and 251.7MB in the end (delta: 100.7MB). Free memory was 61.4MB in the beginning and 221.0MB in the end (delta: -159.6MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-11-08 17:58:33,428 INFO L158 Benchmark]: Boogie Preprocessor took 105.08ms. Allocated memory is still 251.7MB. Free memory was 221.0MB in the beginning and 216.4MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:58:33,429 INFO L158 Benchmark]: RCFGBuilder took 514.91ms. Allocated memory is still 251.7MB. Free memory was 216.4MB in the beginning and 176.3MB in the end (delta: 40.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-08 17:58:33,429 INFO L158 Benchmark]: TraceAbstraction took 2620.98ms. Allocated memory is still 251.7MB. Free memory was 175.3MB in the beginning and 154.9MB in the end (delta: 20.3MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-11-08 17:58:33,429 INFO L158 Benchmark]: Witness Printer took 11.45ms. Allocated memory is still 251.7MB. Free memory was 154.9MB in the beginning and 153.9MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 17:58:33,430 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 151.0MB. Free memory is still 100.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.43ms. Allocated memory is still 151.0MB. Free memory was 77.6MB in the beginning and 61.6MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 114.27ms. Allocated memory was 151.0MB in the beginning and 251.7MB in the end (delta: 100.7MB). Free memory was 61.4MB in the beginning and 221.0MB in the end (delta: -159.6MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 105.08ms. Allocated memory is still 251.7MB. Free memory was 221.0MB in the beginning and 216.4MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 514.91ms. Allocated memory is still 251.7MB. Free memory was 216.4MB in the beginning and 176.3MB in the end (delta: 40.1MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2620.98ms. Allocated memory is still 251.7MB. Free memory was 175.3MB in the beginning and 154.9MB in the end (delta: 20.3MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Witness Printer took 11.45ms. Allocated memory is still 251.7MB. Free memory was 154.9MB in the beginning and 153.9MB 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 92, overapproximation of bitwiseAnd at line 97. 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_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 2); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (2 - 1); [L32] const SORT_1 var_10 = 0; [L33] const SORT_5 var_14 = 0; [L34] const SORT_1 var_29 = 1; [L35] const SORT_5 var_40 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_1 input_7; [L42] SORT_5 input_8; [L43] SORT_5 input_9; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=3, var_10=0, var_14=0, var_29=1, var_40=1] [L45] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=3, var_10=0, var_14=0, var_29=1, var_40=1] [L46] SORT_5 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=3, var_10=0, var_14=0, var_29=1, var_40=1] [L47] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, var_10=0, var_14=0, var_29=1, var_40=1] [L48] SORT_5 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L50] SORT_1 init_12_arg_1 = var_10; [L51] state_11 = init_12_arg_1 [L52] SORT_5 init_16_arg_1 = var_14; [L53] state_15 = init_16_arg_1 [L54] SORT_1 init_18_arg_1 = var_10; [L55] state_17 = init_18_arg_1 [L56] SORT_5 init_22_arg_1 = var_14; [L57] state_21 = init_22_arg_1 VAL [mask_SORT_1=1, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_14=0, var_29=1, var_40=1] [L60] input_2 = __VERIFIER_nondet_uchar() [L61] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_14=0, var_29=1, var_40=1] [L61] input_2 = input_2 & mask_SORT_1 [L62] input_3 = __VERIFIER_nondet_uchar() [L63] EXPR input_3 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=1, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_14=0, var_29=1, var_40=1] [L63] input_3 = input_3 & mask_SORT_1 [L64] input_4 = __VERIFIER_nondet_uchar() [L65] input_6 = __VERIFIER_nondet_uchar() [L66] input_7 = __VERIFIER_nondet_uchar() [L67] input_8 = __VERIFIER_nondet_uchar() [L68] input_9 = __VERIFIER_nondet_uchar() [L71] SORT_1 var_13_arg_0 = state_11; [L72] SORT_1 var_13 = ~var_13_arg_0; [L73] SORT_1 var_19_arg_0 = state_17; [L74] SORT_5 var_19_arg_1 = state_15; [L75] SORT_5 var_19_arg_2 = input_6; [L76] SORT_5 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L77] SORT_5 var_20_arg_0 = var_19; [L78] SORT_1 var_20 = var_20_arg_0 >> 0; VAL [input_2=0, input_3=0, input_6=0, mask_SORT_1=1, state_11=0, state_17=0, state_21=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_20=0, var_29=1, var_40=1] [L79] EXPR var_20 & mask_SORT_1 VAL [input_2=0, input_3=0, input_6=0, mask_SORT_1=1, state_11=0, state_17=0, state_21=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_29=1, var_40=1] [L79] var_20 = var_20 & mask_SORT_1 [L80] SORT_1 var_23_arg_0 = state_17; [L81] SORT_5 var_23_arg_1 = state_21; [L82] SORT_5 var_23_arg_2 = input_6; [L83] SORT_5 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L84] SORT_5 var_24_arg_0 = var_23; [L85] SORT_1 var_24 = var_24_arg_0 >> 0; VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_20=0, var_24=0, var_29=1, var_40=1] [L86] EXPR var_24 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_20=0, var_29=1, var_40=1] [L86] var_24 = var_24 & mask_SORT_1 [L87] SORT_1 var_25_arg_0 = var_20; [L88] SORT_1 var_25_arg_1 = var_24; [L89] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L90] SORT_1 var_26_arg_0 = var_13; [L91] SORT_1 var_26_arg_1 = var_25; VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_26_arg_0=-1, var_26_arg_1=1, var_29=1, var_40=1] [L92] EXPR var_26_arg_0 | var_26_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_40=1] [L92] SORT_1 var_26 = var_26_arg_0 | var_26_arg_1; [L93] SORT_1 var_30_arg_0 = var_26; [L94] SORT_1 var_30 = ~var_30_arg_0; [L95] SORT_1 var_31_arg_0 = var_29; [L96] SORT_1 var_31_arg_1 = var_30; VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_31_arg_0=1, var_31_arg_1=-1, var_40=1] [L97] EXPR var_31_arg_0 & var_31_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_40=1] [L97] SORT_1 var_31 = var_31_arg_0 & var_31_arg_1; [L98] EXPR var_31 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_40=1] [L98] var_31 = var_31 & mask_SORT_1 [L99] SORT_1 bad_32_arg_0 = var_31; [L100] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 70 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 556 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 556 mSDsluCounter, 1894 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1452 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 239 IncrementalHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 442 mSDtfsCounter, 239 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=96occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 489 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-08 17:58:33,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal25.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 c2f9f17c6d1e33b7d4937d5702f73ddc421381e322ac5ad4ecf1688b251301a7 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 17:58:35,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 17:58:35,873 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-08 17:58:35,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 17:58:35,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 17:58:35,913 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 17:58:35,914 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 17:58:35,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 17:58:35,914 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 17:58:35,915 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 17:58:35,915 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 17:58:35,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 17:58:35,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 17:58:35,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 17:58:35,917 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 17:58:35,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 17:58:35,918 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 17:58:35,920 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 17:58:35,920 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 17:58:35,921 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 17:58:35,921 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 17:58:35,921 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 17:58:35,921 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 17:58:35,922 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 17:58:35,922 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 17:58:35,922 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 17:58:35,922 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 17:58:35,922 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 17:58:35,922 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 17:58:35,923 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 17:58:35,923 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 17:58:35,923 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:58:35,923 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 17:58:35,923 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 17:58:35,924 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 17:58:35,924 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 17:58:35,924 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 17:58:35,924 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 17:58:35,924 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 17:58:35,924 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 17:58:35,925 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 17:58:35,926 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 -> c2f9f17c6d1e33b7d4937d5702f73ddc421381e322ac5ad4ecf1688b251301a7 [2024-11-08 17:58:36,182 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 17:58:36,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 17:58:36,200 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 17:58:36,202 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 17:58:36,202 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 17:58:36,203 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal25.c [2024-11-08 17:58:37,747 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 17:58:37,933 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 17:58:37,934 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal25.c [2024-11-08 17:58:37,945 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f90a3da23/fa0a3def81574bfd9aa066253eddf979/FLAGda84e0a6a [2024-11-08 17:58:37,958 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f90a3da23/fa0a3def81574bfd9aa066253eddf979 [2024-11-08 17:58:37,960 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 17:58:37,962 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 17:58:37,963 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 17:58:37,963 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 17:58:37,967 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 17:58:37,968 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:58:37" (1/1) ... [2024-11-08 17:58:37,969 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37385c73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:37, skipping insertion in model container [2024-11-08 17:58:37,969 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 05:58:37" (1/1) ... [2024-11-08 17:58:37,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 17:58:38,150 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.cal25.c[1245,1258] [2024-11-08 17:58:38,217 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:58:38,230 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 17:58:38,242 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.cal25.c[1245,1258] [2024-11-08 17:58:38,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 17:58:38,300 INFO L204 MainTranslator]: Completed translation [2024-11-08 17:58:38,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:38 WrapperNode [2024-11-08 17:58:38,301 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 17:58:38,304 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 17:58:38,304 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 17:58:38,304 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 17:58:38,309 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:38" (1/1) ... [2024-11-08 17:58:38,320 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:38" (1/1) ... [2024-11-08 17:58:38,346 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 175 [2024-11-08 17:58:38,347 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 17:58:38,347 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 17:58:38,347 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 17:58:38,347 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 17:58:38,360 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:38" (1/1) ... [2024-11-08 17:58:38,360 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:38" (1/1) ... [2024-11-08 17:58:38,363 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:38" (1/1) ... [2024-11-08 17:58:38,384 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-08 17:58:38,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:38" (1/1) ... [2024-11-08 17:58:38,385 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:38" (1/1) ... [2024-11-08 17:58:38,389 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:38" (1/1) ... [2024-11-08 17:58:38,390 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:38" (1/1) ... [2024-11-08 17:58:38,391 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:38" (1/1) ... [2024-11-08 17:58:38,392 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:38" (1/1) ... [2024-11-08 17:58:38,394 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 17:58:38,395 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 17:58:38,395 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 17:58:38,395 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 17:58:38,396 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:38" (1/1) ... [2024-11-08 17:58:38,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 17:58:38,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 17:58:38,431 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-08 17:58:38,433 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-08 17:58:38,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 17:58:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 17:58:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-08 17:58:38,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 17:58:38,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 17:58:38,567 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 17:58:38,568 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 17:58:38,786 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-11-08 17:58:38,786 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 17:58:38,801 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 17:58:38,801 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 17:58:38,802 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:58:38 BoogieIcfgContainer [2024-11-08 17:58:38,802 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 17:58:38,804 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 17:58:38,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 17:58:38,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 17:58:38,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 05:58:37" (1/3) ... [2024-11-08 17:58:38,807 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301b50a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:58:38, skipping insertion in model container [2024-11-08 17:58:38,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 05:58:38" (2/3) ... [2024-11-08 17:58:38,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301b50a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 05:58:38, skipping insertion in model container [2024-11-08 17:58:38,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:58:38" (3/3) ... [2024-11-08 17:58:38,809 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal25.c [2024-11-08 17:58:38,843 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 17:58:38,843 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 17:58:38,891 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 17:58:38,897 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;@3143ab7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 17:58:38,897 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 17:58:38,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-08 17:58:38,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-08 17:58:38,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:58:38,905 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-08 17:58:38,905 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:58:38,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:58:38,909 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-08 17:58:38,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 17:58:38,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [241051530] [2024-11-08 17:58:38,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:58:38,920 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-08 17:58:38,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 17:58:38,924 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-08 17:58:38,925 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-08 17:58:39,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:58:39,025 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-08 17:58:39,032 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:58:39,159 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-08 17:58:39,159 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 17:58:39,160 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 17:58:39,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [241051530] [2024-11-08 17:58:39,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [241051530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 17:58:39,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 17:58:39,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 17:58:39,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450616691] [2024-11-08 17:58:39,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 17:58:39,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 17:58:39,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 17:58:39,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 17:58:39,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 17:58:39,185 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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.25) internal successors, (5), 4 states have internal predecessors, (5), 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-08 17:58:39,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:58:39,238 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-08 17:58:39,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 17:58:39,241 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-08 17:58:39,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:58:39,246 INFO L225 Difference]: With dead ends: 18 [2024-11-08 17:58:39,246 INFO L226 Difference]: Without dead ends: 10 [2024-11-08 17:58:39,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-08 17:58:39,250 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 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-08 17:58:39,251 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:58:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-08 17:58:39,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-08 17:58:39,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-08 17:58:39,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-08 17:58:39,274 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-08 17:58:39,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:58:39,274 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-08 17:58:39,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-08 17:58:39,274 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-08 17:58:39,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-08 17:58:39,274 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:58:39,274 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-08 17:58:39,278 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-08 17:58:39,478 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-08 17:58:39,478 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:58:39,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:58:39,479 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-08 17:58:39,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 17:58:39,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2133587135] [2024-11-08 17:58:39,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 17:58:39,480 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-08 17:58:39,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 17:58:39,483 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-08 17:58:39,508 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-08 17:58:39,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 17:58:39,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-08 17:58:39,623 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:58:39,762 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-08 17:58:39,762 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:58:40,866 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-08 17:58:40,867 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 17:58:40,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2133587135] [2024-11-08 17:58:40,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2133587135] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:58:40,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:58:40,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-08 17:58:40,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712909349] [2024-11-08 17:58:40,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:58:40,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-08 17:58:40,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 17:58:40,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-08 17:58:40,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-08 17:58:40,872 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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-08 17:58:40,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:58:40,929 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-08 17:58:40,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 17:58:40,930 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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) Word has length 8 [2024-11-08 17:58:40,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:58:40,931 INFO L225 Difference]: With dead ends: 14 [2024-11-08 17:58:40,931 INFO L226 Difference]: Without dead ends: 12 [2024-11-08 17:58:40,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:58:40,932 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:58:40,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:58:40,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-08 17:58:40,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-08 17:58:40,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-08 17:58:40,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-08 17:58:40,937 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-08 17:58:40,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:58:40,937 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-08 17:58:40,937 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 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-08 17:58:40,938 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-08 17:58:40,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-08 17:58:40,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 17:58:40,938 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-08 17:58:40,946 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-08 17:58:41,139 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-08 17:58:41,139 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 17:58:41,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 17:58:41,140 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-08 17:58:41,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 17:58:41,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [429564548] [2024-11-08 17:58:41,140 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-08 17:58:41,141 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-08 17:58:41,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 17:58:41,146 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 17:58:41,151 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-08 17:58:41,237 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-08 17:58:41,237 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-08 17:58:41,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-08 17:58:41,242 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 17:58:42,177 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:58:42,177 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 17:58:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 17:58:51,908 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 17:58:51,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [429564548] [2024-11-08 17:58:51,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [429564548] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 17:58:51,909 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 17:58:51,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-08 17:58:51,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180983244] [2024-11-08 17:58:51,909 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 17:58:51,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 17:58:51,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 17:58:51,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 17:58:51,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-08 17:58:51,911 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:58:51,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 17:58:51,994 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2024-11-08 17:58:51,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 17:58:51,994 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-08 17:58:51,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 17:58:51,995 INFO L225 Difference]: With dead ends: 12 [2024-11-08 17:58:51,995 INFO L226 Difference]: Without dead ends: 0 [2024-11-08 17:58:51,995 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-08 17:58:51,997 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 17:58:51,997 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 17:58:51,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-08 17:58:51,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-08 17:58:51,998 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-08 17:58:51,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-08 17:58:51,998 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2024-11-08 17:58:51,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 17:58:51,998 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-08 17:58:51,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-08 17:58:51,999 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-08 17:58:51,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-08 17:58:52,001 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 17:58:52,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-08 17:58:52,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 17:58:52,205 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-11-08 17:58:52,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-08 17:58:52,278 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 17:58:52,288 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-08 17:58:52,290 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 05:58:52 BoogieIcfgContainer [2024-11-08 17:58:52,290 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 17:58:52,291 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 17:58:52,291 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 17:58:52,291 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 17:58:52,291 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 05:58:38" (3/4) ... [2024-11-08 17:58:52,293 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-08 17:58:52,299 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-08 17:58:52,299 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-08 17:58:52,299 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-08 17:58:52,301 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 17:58:52,301 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-08 17:58:52,378 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-08 17:58:52,379 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-08 17:58:52,379 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 17:58:52,379 INFO L158 Benchmark]: Toolchain (without parser) took 14417.46ms. Allocated memory was 88.1MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 54.6MB in the beginning and 496.8MB in the end (delta: -442.2MB). Peak memory consumption was 671.4MB. Max. memory is 16.1GB. [2024-11-08 17:58:52,379 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 58.7MB. Free memory was 35.6MB in the beginning and 35.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 17:58:52,379 INFO L158 Benchmark]: CACSL2BoogieTranslator took 337.55ms. Allocated memory is still 88.1MB. Free memory was 54.4MB in the beginning and 62.6MB in the end (delta: -8.2MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. [2024-11-08 17:58:52,380 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.12ms. Allocated memory is still 88.1MB. Free memory was 62.6MB in the beginning and 60.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-08 17:58:52,380 INFO L158 Benchmark]: Boogie Preprocessor took 47.31ms. Allocated memory is still 88.1MB. Free memory was 60.4MB in the beginning and 57.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:58:52,380 INFO L158 Benchmark]: RCFGBuilder took 406.67ms. Allocated memory is still 88.1MB. Free memory was 57.5MB in the beginning and 36.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-08 17:58:52,380 INFO L158 Benchmark]: TraceAbstraction took 13486.29ms. Allocated memory was 88.1MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 35.7MB in the beginning and 503.1MB in the end (delta: -467.4MB). Peak memory consumption was 647.4MB. Max. memory is 16.1GB. [2024-11-08 17:58:52,380 INFO L158 Benchmark]: Witness Printer took 87.67ms. Allocated memory is still 1.2GB. Free memory was 502.0MB in the beginning and 496.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 17:58:52,381 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 58.7MB. Free memory was 35.6MB in the beginning and 35.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 337.55ms. Allocated memory is still 88.1MB. Free memory was 54.4MB in the beginning and 62.6MB in the end (delta: -8.2MB). Peak memory consumption was 11.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.12ms. Allocated memory is still 88.1MB. Free memory was 62.6MB in the beginning and 60.4MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.31ms. Allocated memory is still 88.1MB. Free memory was 60.4MB in the beginning and 57.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 406.67ms. Allocated memory is still 88.1MB. Free memory was 57.5MB in the beginning and 36.5MB in the end (delta: 21.0MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 13486.29ms. Allocated memory was 88.1MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 35.7MB in the beginning and 503.1MB in the end (delta: -467.4MB). Peak memory consumption was 647.4MB. Max. memory is 16.1GB. * Witness Printer took 87.67ms. Allocated memory is still 1.2GB. Free memory was 502.0MB in the beginning and 496.8MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 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, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 13.3s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 44 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 59 IncrementalHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 12 mSDtfsCounter, 59 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12occurred in iteration=2, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 12.1s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 38 ConstructedInterpolants, 12 QuantifiedInterpolants, 9369 SizeOfPredicates, 23 NumberOfNonLiveVariables, 309 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 3/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: (((((((0 == state_17) && (0 == var_10)) && (1 == var_29)) && (0 == state_11)) && (1 == mask_SORT_1)) || (((((1 == state_17) && (0 == var_10)) && (1 == var_29)) && (1 == mask_SORT_1)) && (1 == state_11))) || (((((0 == state_17) && (0 == var_10)) && (1 == var_29)) && (1 == mask_SORT_1)) && (1 == state_11))) RESULT: Ultimate proved your program to be correct! [2024-11-08 17:58:52,424 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