./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal181.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal181.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5963c871d6c136110dcc88c8949de566dbe1e9259aea809264af87f26dad49d7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:39:29,904 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:39:29,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-11 05:39:29,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:39:29,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:39:29,964 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:39:29,965 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:39:29,965 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:39:29,966 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:39:29,969 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:39:29,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:39:29,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:39:29,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:39:29,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:39:29,970 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:39:29,971 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:39:29,971 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:39:29,971 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 05:39:29,971 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:39:29,971 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:39:29,971 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:39:29,972 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:39:29,973 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:39:29,973 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:39:29,973 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:39:29,974 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:39:29,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:39:29,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:39:29,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:39:29,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:39:29,975 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:39:29,975 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:39:29,975 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:39:29,976 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 05:39:29,976 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 05:39:29,988 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:39:29,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:39:29,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:39:29,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:39:29,989 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5963c871d6c136110dcc88c8949de566dbe1e9259aea809264af87f26dad49d7 [2024-10-11 05:39:30,201 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:39:30,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:39:30,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:39:30,226 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:39:30,226 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:39:30,227 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal181.c [2024-10-11 05:39:31,433 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:39:31,619 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:39:31,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal181.c [2024-10-11 05:39:31,626 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cc95276d5/9bc9c6a3fae04e849716d9b4eaf095ec/FLAG425ad9e8e [2024-10-11 05:39:31,637 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/cc95276d5/9bc9c6a3fae04e849716d9b4eaf095ec [2024-10-11 05:39:31,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:39:31,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:39:31,641 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:39:31,641 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:39:31,652 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:39:31,653 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:39:31" (1/1) ... [2024-10-11 05:39:31,654 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6840dc25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:31, skipping insertion in model container [2024-10-11 05:39:31,654 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:39:31" (1/1) ... [2024-10-11 05:39:31,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:39:31,816 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal181.c[1246,1259] [2024-10-11 05:39:31,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:39:31,873 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:39:31,884 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal181.c[1246,1259] [2024-10-11 05:39:31,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:39:31,928 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:39:31,929 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:31 WrapperNode [2024-10-11 05:39:31,929 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:39:31,930 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:39:31,930 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:39:31,930 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:39:31,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:31" (1/1) ... [2024-10-11 05:39:31,943 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:31" (1/1) ... [2024-10-11 05:39:31,986 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 212 [2024-10-11 05:39:31,987 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:39:31,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:39:31,988 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:39:31,988 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:39:31,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:31" (1/1) ... [2024-10-11 05:39:31,996 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:31" (1/1) ... [2024-10-11 05:39:32,001 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:31" (1/1) ... [2024-10-11 05:39:32,016 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 05:39:32,017 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:31" (1/1) ... [2024-10-11 05:39:32,017 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:31" (1/1) ... [2024-10-11 05:39:32,023 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:31" (1/1) ... [2024-10-11 05:39:32,025 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:31" (1/1) ... [2024-10-11 05:39:32,027 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:31" (1/1) ... [2024-10-11 05:39:32,029 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:31" (1/1) ... [2024-10-11 05:39:32,031 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:39:32,032 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:39:32,032 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:39:32,032 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:39:32,037 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:31" (1/1) ... [2024-10-11 05:39:32,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:39:32,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:39:32,078 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:39:32,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:39:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:39:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 05:39:32,115 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:39:32,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:39:32,190 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:39:32,192 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:39:32,491 INFO L? ?]: Removed 96 outVars from TransFormulas that were not future-live. [2024-10-11 05:39:32,491 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:39:32,516 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:39:32,516 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 05:39:32,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:39:32 BoogieIcfgContainer [2024-10-11 05:39:32,518 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:39:32,519 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:39:32,519 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:39:32,522 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:39:32,523 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:39:31" (1/3) ... [2024-10-11 05:39:32,523 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3634aaef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:39:32, skipping insertion in model container [2024-10-11 05:39:32,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:31" (2/3) ... [2024-10-11 05:39:32,524 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3634aaef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:39:32, skipping insertion in model container [2024-10-11 05:39:32,524 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:39:32" (3/3) ... [2024-10-11 05:39:32,526 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal181.c [2024-10-11 05:39:32,541 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:39:32,541 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 05:39:32,606 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:39:32,613 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;@55af6667, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:39:32,613 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 05:39:32,616 INFO L276 IsEmpty]: Start isEmpty. Operand has 51 states, 49 states have (on average 1.510204081632653) internal successors, (74), 50 states have internal predecessors, (74), 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-10-11 05:39:32,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 05:39:32,621 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:39:32,621 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] [2024-10-11 05:39:32,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:39:32,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:39:32,625 INFO L85 PathProgramCache]: Analyzing trace with hash -862685377, now seen corresponding path program 1 times [2024-10-11 05:39:32,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:39:32,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022524537] [2024-10-11 05:39:32,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:39:32,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:39:32,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:39:33,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:39:33,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:39:33,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022524537] [2024-10-11 05:39:33,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022524537] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:39:33,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:39:33,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:39:33,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886806280] [2024-10-11 05:39:33,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:39:33,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:39:33,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:39:33,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:39:33,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:39:33,097 INFO L87 Difference]: Start difference. First operand has 51 states, 49 states have (on average 1.510204081632653) internal successors, (74), 50 states have internal predecessors, (74), 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 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-10-11 05:39:33,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:39:33,138 INFO L93 Difference]: Finished difference Result 86 states and 126 transitions. [2024-10-11 05:39:33,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:39:33,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 22 [2024-10-11 05:39:33,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:39:33,146 INFO L225 Difference]: With dead ends: 86 [2024-10-11 05:39:33,147 INFO L226 Difference]: Without dead ends: 52 [2024-10-11 05:39:33,149 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-10-11 05:39:33,154 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:39:33,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 202 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:39:33,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-11 05:39:33,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-11 05:39:33,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 51 states have internal predecessors, (74), 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-10-11 05:39:33,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 74 transitions. [2024-10-11 05:39:33,188 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 74 transitions. Word has length 22 [2024-10-11 05:39:33,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:39:33,189 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 74 transitions. [2024-10-11 05:39:33,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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-10-11 05:39:33,189 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 74 transitions. [2024-10-11 05:39:33,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-11 05:39:33,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:39:33,191 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] [2024-10-11 05:39:33,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 05:39:33,192 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:39:33,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:39:33,192 INFO L85 PathProgramCache]: Analyzing trace with hash -971747641, now seen corresponding path program 1 times [2024-10-11 05:39:33,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:39:33,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992085219] [2024-10-11 05:39:33,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:39:33,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:39:33,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:39:33,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:39:33,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:39:33,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992085219] [2024-10-11 05:39:33,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992085219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:39:33,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:39:33,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 05:39:33,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [358799901] [2024-10-11 05:39:33,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:39:33,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:39:33,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:39:33,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:39:33,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:39:33,323 INFO L87 Difference]: Start difference. First operand 52 states and 74 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-10-11 05:39:33,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:39:33,353 INFO L93 Difference]: Finished difference Result 89 states and 126 transitions. [2024-10-11 05:39:33,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:39:33,353 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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 23 [2024-10-11 05:39:33,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:39:33,354 INFO L225 Difference]: With dead ends: 89 [2024-10-11 05:39:33,354 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 05:39:33,355 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-10-11 05:39:33,355 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 0 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:39:33,356 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 199 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:39:33,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 05:39:33,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-11 05:39:33,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 53 states have (on average 1.4339622641509433) internal successors, (76), 53 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:39:33,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 76 transitions. [2024-10-11 05:39:33,360 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 76 transitions. Word has length 23 [2024-10-11 05:39:33,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:39:33,361 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 76 transitions. [2024-10-11 05:39:33,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 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-10-11 05:39:33,361 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 76 transitions. [2024-10-11 05:39:33,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 05:39:33,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:39:33,362 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:39:33,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 05:39:33,362 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:39:33,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:39:33,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1157371624, now seen corresponding path program 1 times [2024-10-11 05:39:33,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:39:33,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719614436] [2024-10-11 05:39:33,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:39:33,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:39:33,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:39:33,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:39:33,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:39:33,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719614436] [2024-10-11 05:39:33,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719614436] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:39:33,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:39:33,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 05:39:33,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946033578] [2024-10-11 05:39:33,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:39:33,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 05:39:33,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:39:33,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 05:39:33,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 05:39:33,615 INFO L87 Difference]: Start difference. First operand 54 states and 76 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:39:33,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:39:33,718 INFO L93 Difference]: Finished difference Result 120 states and 166 transitions. [2024-10-11 05:39:33,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 05:39:33,722 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-10-11 05:39:33,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:39:33,723 INFO L225 Difference]: With dead ends: 120 [2024-10-11 05:39:33,723 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 05:39:33,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 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-10-11 05:39:33,724 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 141 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:39:33,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 248 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:39:33,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 05:39:33,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 64. [2024-10-11 05:39:33,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 63 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:39:33,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2024-10-11 05:39:33,733 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 24 [2024-10-11 05:39:33,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:39:33,733 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2024-10-11 05:39:33,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:39:33,734 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2024-10-11 05:39:33,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 05:39:33,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:39:33,734 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:39:33,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 05:39:33,735 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:39:33,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:39:33,735 INFO L85 PathProgramCache]: Analyzing trace with hash -609895058, now seen corresponding path program 1 times [2024-10-11 05:39:33,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:39:33,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686870209] [2024-10-11 05:39:33,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:39:33,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:39:33,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:39:33,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:39:33,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:39:33,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686870209] [2024-10-11 05:39:33,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686870209] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:39:33,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:39:33,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 05:39:33,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456365944] [2024-10-11 05:39:33,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:39:33,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:39:33,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:39:33,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:39:33,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:39:33,959 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:39:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:39:34,076 INFO L93 Difference]: Finished difference Result 122 states and 168 transitions. [2024-10-11 05:39:34,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 05:39:34,077 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2024-10-11 05:39:34,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:39:34,078 INFO L225 Difference]: With dead ends: 122 [2024-10-11 05:39:34,079 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 05:39:34,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 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-10-11 05:39:34,080 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 144 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:39:34,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 360 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:39:34,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 05:39:34,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2024-10-11 05:39:34,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 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-10-11 05:39:34,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 94 transitions. [2024-10-11 05:39:34,085 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 94 transitions. Word has length 25 [2024-10-11 05:39:34,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:39:34,085 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 94 transitions. [2024-10-11 05:39:34,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:39:34,085 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 94 transitions. [2024-10-11 05:39:34,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 05:39:34,086 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:39:34,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 05:39:34,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 05:39:34,086 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:39:34,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:39:34,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1407531211, now seen corresponding path program 1 times [2024-10-11 05:39:34,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:39:34,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157655728] [2024-10-11 05:39:34,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:39:34,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:39:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:39:34,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:39:34,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 05:39:34,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157655728] [2024-10-11 05:39:34,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157655728] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:39:34,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:39:34,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 05:39:34,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357889477] [2024-10-11 05:39:34,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:39:34,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 05:39:34,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 05:39:34,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 05:39:34,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 05:39:34,390 INFO L87 Difference]: Start difference. First operand 67 states and 94 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:39:34,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:39:34,565 INFO L93 Difference]: Finished difference Result 122 states and 167 transitions. [2024-10-11 05:39:34,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 05:39:34,565 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-11 05:39:34,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:39:34,566 INFO L225 Difference]: With dead ends: 122 [2024-10-11 05:39:34,566 INFO L226 Difference]: Without dead ends: 85 [2024-10-11 05:39:34,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:39:34,567 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 138 mSDsluCounter, 341 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 05:39:34,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 397 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 05:39:34,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-11 05:39:34,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2024-10-11 05:39:34,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.4142857142857144) internal successors, (99), 70 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-10-11 05:39:34,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 99 transitions. [2024-10-11 05:39:34,574 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 99 transitions. Word has length 26 [2024-10-11 05:39:34,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:39:34,574 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 99 transitions. [2024-10-11 05:39:34,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 8 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:39:34,574 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 99 transitions. [2024-10-11 05:39:34,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-11 05:39:34,575 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:39:34,575 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-10-11 05:39:34,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 05:39:34,576 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:39:34,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:39:34,576 INFO L85 PathProgramCache]: Analyzing trace with hash 880750637, now seen corresponding path program 1 times [2024-10-11 05:39:34,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 05:39:34,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383546288] [2024-10-11 05:39:34,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:39:34,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 05:39:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 05:39:34,603 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 05:39:34,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 05:39:34,640 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 05:39:34,641 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 05:39:34,642 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 05:39:34,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 05:39:34,646 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-11 05:39:34,673 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 05:39:34,675 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:39:34 BoogieIcfgContainer [2024-10-11 05:39:34,675 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 05:39:34,676 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 05:39:34,676 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 05:39:34,676 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 05:39:34,677 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:39:32" (3/4) ... [2024-10-11 05:39:34,678 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 05:39:34,679 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 05:39:34,679 INFO L158 Benchmark]: Toolchain (without parser) took 3039.43ms. Allocated memory was 146.8MB in the beginning and 213.9MB in the end (delta: 67.1MB). Free memory was 116.3MB in the beginning and 160.8MB in the end (delta: -44.5MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2024-10-11 05:39:34,680 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 146.8MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 05:39:34,680 INFO L158 Benchmark]: CACSL2BoogieTranslator took 288.06ms. Allocated memory is still 146.8MB. Free memory was 116.3MB in the beginning and 102.1MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-11 05:39:34,680 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.39ms. Allocated memory is still 146.8MB. Free memory was 102.1MB in the beginning and 97.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 05:39:34,680 INFO L158 Benchmark]: Boogie Preprocessor took 44.22ms. Allocated memory is still 146.8MB. Free memory was 97.9MB in the beginning and 94.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 05:39:34,681 INFO L158 Benchmark]: RCFGBuilder took 485.50ms. Allocated memory is still 146.8MB. Free memory was 94.5MB in the beginning and 66.5MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-10-11 05:39:34,681 INFO L158 Benchmark]: TraceAbstraction took 2156.28ms. Allocated memory was 146.8MB in the beginning and 213.9MB in the end (delta: 67.1MB). Free memory was 65.9MB in the beginning and 160.8MB in the end (delta: -94.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 05:39:34,681 INFO L158 Benchmark]: Witness Printer took 3.14ms. Allocated memory is still 213.9MB. Free memory is still 160.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 05:39:34,682 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.18ms. Allocated memory is still 146.8MB. Free memory is still 115.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 288.06ms. Allocated memory is still 146.8MB. Free memory was 116.3MB in the beginning and 102.1MB in the end (delta: 14.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.39ms. Allocated memory is still 146.8MB. Free memory was 102.1MB in the beginning and 97.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.22ms. Allocated memory is still 146.8MB. Free memory was 97.9MB in the beginning and 94.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 485.50ms. Allocated memory is still 146.8MB. Free memory was 94.5MB in the beginning and 66.5MB in the end (delta: 28.0MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2156.28ms. Allocated memory was 146.8MB in the beginning and 213.9MB in the end (delta: 67.1MB). Free memory was 65.9MB in the beginning and 160.8MB in the end (delta: -94.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.14ms. Allocated memory is still 213.9MB. Free memory is still 160.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 79, overapproximation of bitwiseAnd at line 84. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 32); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (32 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 1); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (1 - 1); [L32] const SORT_3 var_7 = 0; [L33] const SORT_1 var_11 = 0; [L34] const SORT_3 var_24 = 1; [L36] SORT_1 input_2; [L37] SORT_3 input_4; [L38] SORT_1 input_5; [L39] SORT_1 input_6; [L41] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=-1, mask_SORT_3=1, var_11=0, var_24=1, var_7=0] [L41] SORT_3 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L42] EXPR __VERIFIER_nondet_uint() & mask_SORT_1 VAL [mask_SORT_1=-1, mask_SORT_3=1, var_11=0, var_24=1, var_7=0] [L42] SORT_1 state_12 = __VERIFIER_nondet_uint() & mask_SORT_1; [L43] EXPR __VERIFIER_nondet_uchar() & mask_SORT_3 VAL [mask_SORT_1=-1, mask_SORT_3=1, var_11=0, var_24=1, var_7=0] [L43] SORT_3 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_3; [L44] EXPR __VERIFIER_nondet_uint() & mask_SORT_1 VAL [mask_SORT_1=-1, mask_SORT_3=1, var_11=0, var_24=1, var_7=0] [L44] SORT_1 state_17 = __VERIFIER_nondet_uint() & mask_SORT_1; [L46] SORT_3 init_9_arg_1 = var_7; [L47] state_8 = init_9_arg_1 [L48] SORT_1 init_13_arg_1 = var_11; [L49] state_12 = init_13_arg_1 [L50] SORT_3 init_15_arg_1 = var_7; [L51] state_14 = init_15_arg_1 [L52] SORT_1 init_18_arg_1 = var_11; [L53] state_17 = init_18_arg_1 VAL [mask_SORT_1=-1, mask_SORT_3=1, state_12=0, state_14=0, state_17=0, state_8=0, var_11=0, var_24=1, var_7=0] [L56] input_2 = __VERIFIER_nondet_uint() [L57] input_4 = __VERIFIER_nondet_uchar() [L58] input_5 = __VERIFIER_nondet_uint() [L59] input_6 = __VERIFIER_nondet_uint() [L62] SORT_3 var_10_arg_0 = state_8; [L63] SORT_3 var_10 = ~var_10_arg_0; [L64] SORT_3 var_16_arg_0 = state_14; [L65] SORT_1 var_16_arg_1 = state_12; [L66] SORT_1 var_16_arg_2 = input_2; [L67] SORT_1 var_16 = var_16_arg_0 ? var_16_arg_1 : var_16_arg_2; VAL [input_2=0, mask_SORT_1=-1, mask_SORT_3=1, state_14=0, state_17=0, state_8=0, var_10=-1, var_11=0, var_16=0, var_24=1, var_7=0] [L68] EXPR var_16 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=-1, mask_SORT_3=1, state_14=0, state_17=0, state_8=0, var_10=-1, var_11=0, var_24=1, var_7=0] [L68] var_16 = var_16 & mask_SORT_1 [L69] SORT_3 var_19_arg_0 = state_14; [L70] SORT_1 var_19_arg_1 = state_17; [L71] SORT_1 var_19_arg_2 = input_2; [L72] SORT_1 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; VAL [mask_SORT_1=-1, mask_SORT_3=1, state_8=0, var_10=-1, var_11=0, var_16=0, var_19=0, var_24=1, var_7=0] [L73] EXPR var_19 & mask_SORT_1 VAL [mask_SORT_1=-1, mask_SORT_3=1, state_8=0, var_10=-1, var_11=0, var_16=0, var_24=1, var_7=0] [L73] var_19 = var_19 & mask_SORT_1 [L74] SORT_1 var_20_arg_0 = var_16; [L75] SORT_1 var_20_arg_1 = var_19; [L76] SORT_3 var_20 = var_20_arg_0 == var_20_arg_1; [L77] SORT_3 var_21_arg_0 = var_10; [L78] SORT_3 var_21_arg_1 = var_20; VAL [mask_SORT_1=-1, mask_SORT_3=1, state_8=0, var_11=0, var_16=0, var_21_arg_0=-1, var_21_arg_1=1, var_24=1, var_7=0] [L79] EXPR var_21_arg_0 | var_21_arg_1 VAL [mask_SORT_1=-1, mask_SORT_3=1, state_8=0, var_11=0, var_16=0, var_24=1, var_7=0] [L79] SORT_3 var_21 = var_21_arg_0 | var_21_arg_1; [L80] SORT_3 var_25_arg_0 = var_21; [L81] SORT_3 var_25 = ~var_25_arg_0; [L82] SORT_3 var_26_arg_0 = var_24; [L83] SORT_3 var_26_arg_1 = var_25; VAL [mask_SORT_1=-1, mask_SORT_3=1, state_8=0, var_11=0, var_16=0, var_24=1, var_26_arg_0=1, var_26_arg_1=-1, var_7=0] [L84] EXPR var_26_arg_0 & var_26_arg_1 VAL [mask_SORT_1=-1, mask_SORT_3=1, state_8=0, var_11=0, var_16=0, var_24=1, var_7=0] [L84] SORT_3 var_26 = var_26_arg_0 & var_26_arg_1; [L85] EXPR var_26 & mask_SORT_3 VAL [mask_SORT_1=-1, mask_SORT_3=1, state_8=0, var_11=0, var_16=0, var_24=1, var_7=0] [L85] var_26 = var_26 & mask_SORT_3 [L86] SORT_3 bad_27_arg_0 = var_26; [L87] CALL __VERIFIER_assert(!(bad_27_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 51 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.1s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 423 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 423 mSDsluCounter, 1406 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1091 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 245 IncrementalHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 315 mSDtfsCounter, 245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 147 NumberOfCodeBlocks, 147 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 115 ConstructedInterpolants, 0 QuantifiedInterpolants, 507 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-10-11 05:39:34,704 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal181.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 5963c871d6c136110dcc88c8949de566dbe1e9259aea809264af87f26dad49d7 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 05:39:36,774 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 05:39:36,841 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-11 05:39:36,846 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 05:39:36,847 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 05:39:36,869 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 05:39:36,873 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 05:39:36,874 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 05:39:36,874 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 05:39:36,874 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 05:39:36,875 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 05:39:36,875 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 05:39:36,875 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 05:39:36,875 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 05:39:36,876 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 05:39:36,876 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 05:39:36,876 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 05:39:36,876 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 05:39:36,877 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 05:39:36,877 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 05:39:36,878 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 05:39:36,879 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 05:39:36,879 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 05:39:36,879 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 05:39:36,881 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 05:39:36,881 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 05:39:36,881 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 05:39:36,881 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 05:39:36,884 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 05:39:36,884 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 05:39:36,884 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 05:39:36,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:39:36,884 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 05:39:36,885 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 05:39:36,885 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 05:39:36,885 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 05:39:36,885 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 05:39:36,885 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 05:39:36,885 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 05:39:36,885 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 05:39:36,886 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 05:39:36,886 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 05:39:36,886 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-clean/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-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5963c871d6c136110dcc88c8949de566dbe1e9259aea809264af87f26dad49d7 [2024-10-11 05:39:37,139 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 05:39:37,156 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 05:39:37,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 05:39:37,159 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 05:39:37,159 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 05:39:37,160 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal181.c [2024-10-11 05:39:38,389 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 05:39:38,563 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 05:39:38,564 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal181.c [2024-10-11 05:39:38,577 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/09f812b52/64dd0bd071fc4beb9bf2e354e18f1600/FLAG4ad7e1fac [2024-10-11 05:39:38,948 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/09f812b52/64dd0bd071fc4beb9bf2e354e18f1600 [2024-10-11 05:39:38,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 05:39:38,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 05:39:38,954 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 05:39:38,954 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 05:39:38,958 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 05:39:38,958 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:39:38" (1/1) ... [2024-10-11 05:39:38,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61f7c842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:38, skipping insertion in model container [2024-10-11 05:39:38,959 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 05:39:38" (1/1) ... [2024-10-11 05:39:38,981 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 05:39:39,130 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal181.c[1246,1259] [2024-10-11 05:39:39,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:39:39,191 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 05:39:39,201 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal181.c[1246,1259] [2024-10-11 05:39:39,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 05:39:39,242 INFO L204 MainTranslator]: Completed translation [2024-10-11 05:39:39,243 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:39 WrapperNode [2024-10-11 05:39:39,243 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 05:39:39,244 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 05:39:39,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 05:39:39,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 05:39:39,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:39" (1/1) ... [2024-10-11 05:39:39,259 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:39" (1/1) ... [2024-10-11 05:39:39,281 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 124 [2024-10-11 05:39:39,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 05:39:39,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 05:39:39,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 05:39:39,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 05:39:39,291 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:39" (1/1) ... [2024-10-11 05:39:39,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:39" (1/1) ... [2024-10-11 05:39:39,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:39" (1/1) ... [2024-10-11 05:39:39,310 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-11 05:39:39,311 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:39" (1/1) ... [2024-10-11 05:39:39,311 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:39" (1/1) ... [2024-10-11 05:39:39,315 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:39" (1/1) ... [2024-10-11 05:39:39,320 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:39" (1/1) ... [2024-10-11 05:39:39,321 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:39" (1/1) ... [2024-10-11 05:39:39,325 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:39" (1/1) ... [2024-10-11 05:39:39,327 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 05:39:39,332 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 05:39:39,332 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 05:39:39,332 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 05:39:39,333 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:39" (1/1) ... [2024-10-11 05:39:39,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 05:39:39,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 05:39:39,360 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 05:39:39,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 05:39:39,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 05:39:39,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 05:39:39,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 05:39:39,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 05:39:39,473 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 05:39:39,477 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 05:39:39,659 INFO L? ?]: Removed 38 outVars from TransFormulas that were not future-live. [2024-10-11 05:39:39,659 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 05:39:39,693 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 05:39:39,694 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 05:39:39,694 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:39:39 BoogieIcfgContainer [2024-10-11 05:39:39,694 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 05:39:39,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 05:39:39,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 05:39:39,700 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 05:39:39,700 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 05:39:38" (1/3) ... [2024-10-11 05:39:39,700 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3725a5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:39:39, skipping insertion in model container [2024-10-11 05:39:39,701 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 05:39:39" (2/3) ... [2024-10-11 05:39:39,701 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3725a5de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 05:39:39, skipping insertion in model container [2024-10-11 05:39:39,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:39:39" (3/3) ... [2024-10-11 05:39:39,703 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal181.c [2024-10-11 05:39:39,716 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 05:39:39,716 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 05:39:39,764 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 05:39:39,769 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;@4d0d3e6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 05:39:39,770 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 05:39:39,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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-10-11 05:39:39,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-11 05:39:39,777 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:39:39,779 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-11 05:39:39,779 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:39:39,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:39:39,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-11 05:39:39,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 05:39:39,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108265156] [2024-10-11 05:39:39,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:39:39,794 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-10-11 05:39:39,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 05:39:39,797 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-10-11 05:39:39,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 05:39:39,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:39:39,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-11 05:39:39,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:39:40,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:39:40,053 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 05:39:40,054 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 05:39:40,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108265156] [2024-10-11 05:39:40,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2108265156] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 05:39:40,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 05:39:40,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 05:39:40,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262727636] [2024-10-11 05:39:40,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 05:39:40,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 05:39:40,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 05:39:40,082 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 05:39:40,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 05:39:40,085 INFO L87 Difference]: Start difference. First operand has 7 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 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.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-11 05:39:40,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:39:40,132 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-11 05:39:40,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 05:39:40,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2024-10-11 05:39:40,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:39:40,144 INFO L225 Difference]: With dead ends: 15 [2024-10-11 05:39:40,146 INFO L226 Difference]: Without dead ends: 9 [2024-10-11 05:39:40,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-10-11 05:39:40,151 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 2 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 6 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-10-11 05:39:40,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 6 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:39:40,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-11 05:39:40,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-11 05:39:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 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-10-11 05:39:40,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-11 05:39:40,173 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-11 05:39:40,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:39:40,173 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-11 05:39:40,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.0) internal successors, (4), 3 states have internal predecessors, (4), 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-10-11 05:39:40,174 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-11 05:39:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 05:39:40,174 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:39:40,174 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-11 05:39:40,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 05:39:40,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-10-11 05:39:40,377 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:39:40,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:39:40,378 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-11 05:39:40,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 05:39:40,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231303037] [2024-10-11 05:39:40,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 05:39:40,383 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-10-11 05:39:40,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 05:39:40,386 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-10-11 05:39:40,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 05:39:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 05:39:40,469 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-11 05:39:40,479 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:39:40,635 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:39:40,639 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 05:39:41,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:39:41,138 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 05:39:41,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231303037] [2024-10-11 05:39:41,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1231303037] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 05:39:41,141 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 05:39:41,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-11 05:39:41,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357240914] [2024-10-11 05:39:41,142 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 05:39:41,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 05:39:41,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 05:39:41,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 05:39:41,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-11 05:39:41,144 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:39:41,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:39:41,204 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-11 05:39:41,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 05:39:41,205 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-11 05:39:41,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:39:41,205 INFO L225 Difference]: With dead ends: 13 [2024-10-11 05:39:41,205 INFO L226 Difference]: Without dead ends: 11 [2024-10-11 05:39:41,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:39:41,206 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:39:41,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 10 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:39:41,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-11 05:39:41,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-11 05:39:41,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.1) internal successors, (11), 10 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-10-11 05:39:41,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-11 05:39:41,209 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-11 05:39:41,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:39:41,209 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-11 05:39:41,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.625) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 05:39:41,210 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-11 05:39:41,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-11 05:39:41,210 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 05:39:41,210 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-11 05:39:41,214 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 05:39:41,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-10-11 05:39:41,411 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 05:39:41,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 05:39:41,412 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-11 05:39:41,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 05:39:41,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [987912918] [2024-10-11 05:39:41,413 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 05:39:41,413 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-10-11 05:39:41,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 05:39:41,415 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-10-11 05:39:41,416 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-10-11 05:39:41,504 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 05:39:41,504 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 05:39:41,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 05:39:41,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 05:39:41,646 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:39:41,646 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 05:39:42,009 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 05:39:42,009 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 05:39:42,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [987912918] [2024-10-11 05:39:42,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [987912918] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 05:39:42,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-11 05:39:42,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-11 05:39:42,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135489215] [2024-10-11 05:39:42,010 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-11 05:39:42,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 05:39:42,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 05:39:42,011 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 05:39:42,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-11 05:39:42,011 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-10-11 05:39:42,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 05:39:42,109 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2024-10-11 05:39:42,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 05:39:42,110 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-10-11 05:39:42,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 05:39:42,111 INFO L225 Difference]: With dead ends: 11 [2024-10-11 05:39:42,111 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 05:39:42,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-10-11 05:39:42,114 INFO L432 NwaCegarLoop]: 1 mSDtfsCounter, 1 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 05:39:42,114 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 2 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 05:39:42,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 05:39:42,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 05:39:42,116 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-10-11 05:39:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 05:39:42,117 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2024-10-11 05:39:42,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 05:39:42,117 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 05:39:42,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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-10-11 05:39:42,117 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 05:39:42,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 05:39:42,125 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 05:39:42,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-11 05:39:42,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-clean/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-10-11 05:39:42,330 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-10-11 05:39:42,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 05:39:42,377 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 05:39:42,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 05:39:42 BoogieIcfgContainer [2024-10-11 05:39:42,396 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 05:39:42,397 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 05:39:42,397 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 05:39:42,397 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 05:39:42,397 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 05:39:39" (3/4) ... [2024-10-11 05:39:42,399 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 05:39:42,425 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-10-11 05:39:42,429 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 05:39:42,429 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 05:39:42,430 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 05:39:42,517 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 05:39:42,517 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 05:39:42,517 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 05:39:42,518 INFO L158 Benchmark]: Toolchain (without parser) took 3567.01ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 42.6MB in the beginning and 80.9MB in the end (delta: -38.2MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 05:39:42,518 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 52.4MB. Free memory is still 29.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 05:39:42,518 INFO L158 Benchmark]: CACSL2BoogieTranslator took 289.68ms. Allocated memory is still 75.5MB. Free memory was 42.5MB in the beginning and 45.9MB in the end (delta: -3.4MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-10-11 05:39:42,518 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.71ms. Allocated memory is still 75.5MB. Free memory was 45.9MB in the beginning and 44.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 05:39:42,519 INFO L158 Benchmark]: Boogie Preprocessor took 47.48ms. Allocated memory is still 75.5MB. Free memory was 44.1MB in the beginning and 41.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 05:39:42,519 INFO L158 Benchmark]: RCFGBuilder took 362.80ms. Allocated memory is still 75.5MB. Free memory was 41.7MB in the beginning and 46.7MB in the end (delta: -5.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 05:39:42,519 INFO L158 Benchmark]: TraceAbstraction took 2699.22ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 46.3MB in the beginning and 86.3MB in the end (delta: -40.0MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. [2024-10-11 05:39:42,520 INFO L158 Benchmark]: Witness Printer took 120.73ms. Allocated memory is still 111.1MB. Free memory was 85.9MB in the beginning and 80.9MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-11 05:39:42,521 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 52.4MB. Free memory is still 29.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 289.68ms. Allocated memory is still 75.5MB. Free memory was 42.5MB in the beginning and 45.9MB in the end (delta: -3.4MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.71ms. Allocated memory is still 75.5MB. Free memory was 45.9MB in the beginning and 44.1MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.48ms. Allocated memory is still 75.5MB. Free memory was 44.1MB in the beginning and 41.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 362.80ms. Allocated memory is still 75.5MB. Free memory was 41.7MB in the beginning and 46.7MB in the end (delta: -5.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2699.22ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 46.3MB in the beginning and 86.3MB in the end (delta: -40.0MB). Peak memory consumption was 41.8MB. Max. memory is 16.1GB. * Witness Printer took 120.73ms. Allocated memory is still 111.1MB. Free memory was 85.9MB in the beginning and 80.9MB in the end (delta: 5.1MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 18 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 13 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 58 IncrementalHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 5 mSDtfsCounter, 58 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=2, InterpolantAutomatonStates: 19, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 33 ConstructedInterpolants, 11 QuantifiedInterpolants, 1054 SizeOfPredicates, 22 NumberOfNonLiveVariables, 228 ConjunctsInSsa, 64 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: ((((((((1 == mask_SORT_3) && (0 == var_7)) && (0 == state_8)) && (0 == state_14)) && (state_17 == state_12)) && (1 == var_24)) || ((((1 == mask_SORT_3) && (1 == state_8)) && (0 == state_14)) && (1 == var_24))) || ((((1 == mask_SORT_3) && (1 == state_8)) && (state_17 == state_12)) && (1 == var_24))) RESULT: Ultimate proved your program to be correct! [2024-10-11 05:39:42,541 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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