./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.cal17.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal17.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c94b3661676652faea857d81dc0e0e26cd1d6a51b23eb72c98391fe2e83a67ae --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:46:58,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:46:58,186 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-10-14 05:46:58,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:46:58,192 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:46:58,232 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:46:58,233 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:46:58,234 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:46:58,234 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:46:58,235 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:46:58,235 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:46:58,235 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:46:58,236 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:46:58,236 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:46:58,237 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:46:58,237 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:46:58,238 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:46:58,238 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 05:46:58,238 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:46:58,238 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:46:58,239 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:46:58,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:46:58,248 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:46:58,248 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:46:58,248 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:46:58,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:46:58,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:46:58,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:46:58,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:46:58,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:46:58,250 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:46:58,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:46:58,250 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:46:58,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 05:46:58,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 05:46:58,250 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:46:58,251 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:46:58,251 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:46:58,252 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:46:58,253 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c94b3661676652faea857d81dc0e0e26cd1d6a51b23eb72c98391fe2e83a67ae [2024-10-14 05:46:58,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:46:58,551 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:46:58,555 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:46:58,556 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:46:58,557 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:46:58,558 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal17.c [2024-10-14 05:46:59,980 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:47:00,194 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:47:00,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal17.c [2024-10-14 05:47:00,207 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1231ee152/be2840266c364a0e93692382859944e9/FLAGe7cf3373a [2024-10-14 05:47:00,569 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1231ee152/be2840266c364a0e93692382859944e9 [2024-10-14 05:47:00,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:47:00,573 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:47:00,574 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:47:00,574 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:47:00,580 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:47:00,581 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:47:00" (1/1) ... [2024-10-14 05:47:00,582 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c814512 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:00, skipping insertion in model container [2024-10-14 05:47:00,582 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:47:00" (1/1) ... [2024-10-14 05:47:00,607 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:47:00,742 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.cal17.c[1245,1258] [2024-10-14 05:47:00,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:47:00,814 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:47:00,828 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.cal17.c[1245,1258] [2024-10-14 05:47:00,889 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:47:00,912 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:47:00,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:00 WrapperNode [2024-10-14 05:47:00,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:47:00,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:47:00,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:47:00,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:47:00,921 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:00" (1/1) ... [2024-10-14 05:47:00,939 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:00" (1/1) ... [2024-10-14 05:47:00,995 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 295 [2024-10-14 05:47:00,996 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:47:00,996 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:47:00,996 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:47:00,996 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:47:01,011 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:00" (1/1) ... [2024-10-14 05:47:01,016 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:00" (1/1) ... [2024-10-14 05:47:01,029 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:00" (1/1) ... [2024-10-14 05:47:01,060 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-14 05:47:01,061 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:00" (1/1) ... [2024-10-14 05:47:01,061 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:00" (1/1) ... [2024-10-14 05:47:01,077 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:00" (1/1) ... [2024-10-14 05:47:01,081 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:00" (1/1) ... [2024-10-14 05:47:01,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:00" (1/1) ... [2024-10-14 05:47:01,092 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:00" (1/1) ... [2024-10-14 05:47:01,100 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:47:01,101 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:47:01,101 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:47:01,102 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:47:01,102 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:00" (1/1) ... [2024-10-14 05:47:01,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:47:01,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:47:01,140 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 05:47:01,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 05:47:01,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:47:01,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 05:47:01,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 05:47:01,183 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:47:01,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:47:01,268 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:47:01,271 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:47:01,808 INFO L? ?]: Removed 142 outVars from TransFormulas that were not future-live. [2024-10-14 05:47:01,809 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:47:01,839 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:47:01,839 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 05:47:01,841 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:47:01 BoogieIcfgContainer [2024-10-14 05:47:01,841 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:47:01,843 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:47:01,843 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:47:01,846 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:47:01,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:47:00" (1/3) ... [2024-10-14 05:47:01,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b3d466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:47:01, skipping insertion in model container [2024-10-14 05:47:01,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:00" (2/3) ... [2024-10-14 05:47:01,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71b3d466 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:47:01, skipping insertion in model container [2024-10-14 05:47:01,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:47:01" (3/3) ... [2024-10-14 05:47:01,850 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal17.c [2024-10-14 05:47:01,866 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:47:01,867 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 05:47:01,935 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:47:01,942 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;@3b344d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:47:01,942 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 05:47:01,947 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 65 states have (on average 1.5076923076923077) internal successors, (98), 66 states have internal predecessors, (98), 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-14 05:47:01,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-14 05:47:01,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:47:01,955 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-14 05:47:01,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:47:01,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:47:01,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1406128127, now seen corresponding path program 1 times [2024-10-14 05:47:01,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:47:01,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684259244] [2024-10-14 05:47:01,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:47:01,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:47:02,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:47:02,553 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-14 05:47:02,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:47:02,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684259244] [2024-10-14 05:47:02,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [684259244] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:47:02,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:47:02,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:47:02,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764445413] [2024-10-14 05:47:02,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:47:02,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:47:02,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:47:02,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:47:02,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:47:02,593 INFO L87 Difference]: Start difference. First operand has 67 states, 65 states have (on average 1.5076923076923077) internal successors, (98), 66 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:47:02,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:47:02,647 INFO L93 Difference]: Finished difference Result 118 states and 174 transitions. [2024-10-14 05:47:02,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:47:02,651 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-14 05:47:02,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:47:02,659 INFO L225 Difference]: With dead ends: 118 [2024-10-14 05:47:02,659 INFO L226 Difference]: Without dead ends: 68 [2024-10-14 05:47:02,662 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-14 05:47:02,666 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 274 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-14 05:47:02,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 274 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:47:02,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2024-10-14 05:47:02,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2024-10-14 05:47:02,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.462686567164179) internal successors, (98), 67 states have internal predecessors, (98), 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-14 05:47:02,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 98 transitions. [2024-10-14 05:47:02,700 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 98 transitions. Word has length 26 [2024-10-14 05:47:02,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:47:02,700 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 98 transitions. [2024-10-14 05:47:02,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:47:02,701 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 98 transitions. [2024-10-14 05:47:02,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-14 05:47:02,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:47:02,702 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-14 05:47:02,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 05:47:02,702 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:47:02,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:47:02,703 INFO L85 PathProgramCache]: Analyzing trace with hash 641994273, now seen corresponding path program 1 times [2024-10-14 05:47:02,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:47:02,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021469258] [2024-10-14 05:47:02,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:47:02,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:47:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:47:02,867 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-14 05:47:02,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:47:02,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021469258] [2024-10-14 05:47:02,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021469258] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:47:02,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:47:02,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 05:47:02,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332002743] [2024-10-14 05:47:02,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:47:02,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:47:02,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:47:02,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:47:02,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:47:02,874 INFO L87 Difference]: Start difference. First operand 68 states and 98 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:47:02,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:47:02,921 INFO L93 Difference]: Finished difference Result 121 states and 174 transitions. [2024-10-14 05:47:02,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:47:02,922 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-10-14 05:47:02,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:47:02,922 INFO L225 Difference]: With dead ends: 121 [2024-10-14 05:47:02,923 INFO L226 Difference]: Without dead ends: 70 [2024-10-14 05:47:02,923 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-14 05:47:02,924 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 0 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 271 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-14 05:47:02,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 271 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:47:02,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-14 05:47:02,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-14 05:47:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.4492753623188406) internal successors, (100), 69 states have internal predecessors, (100), 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-14 05:47:02,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 100 transitions. [2024-10-14 05:47:02,933 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 100 transitions. Word has length 27 [2024-10-14 05:47:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:47:02,933 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 100 transitions. [2024-10-14 05:47:02,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:47:02,935 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 100 transitions. [2024-10-14 05:47:02,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-14 05:47:02,936 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:47:02,936 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:47:02,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 05:47:02,937 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:47:02,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:47:02,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1623987480, now seen corresponding path program 1 times [2024-10-14 05:47:02,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:47:02,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052641213] [2024-10-14 05:47:02,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:47:02,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:47:02,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:47:03,290 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-14 05:47:03,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:47:03,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052641213] [2024-10-14 05:47:03,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052641213] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:47:03,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:47:03,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 05:47:03,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553626035] [2024-10-14 05:47:03,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:47:03,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 05:47:03,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:47:03,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 05:47:03,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 05:47:03,295 INFO L87 Difference]: Start difference. First operand 70 states and 100 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:47:03,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:47:03,425 INFO L93 Difference]: Finished difference Result 160 states and 226 transitions. [2024-10-14 05:47:03,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:47:03,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-14 05:47:03,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:47:03,431 INFO L225 Difference]: With dead ends: 160 [2024-10-14 05:47:03,431 INFO L226 Difference]: Without dead ends: 107 [2024-10-14 05:47:03,432 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-14 05:47:03,433 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 185 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:47:03,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 340 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:47:03,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-14 05:47:03,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 88. [2024-10-14 05:47:03,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.4482758620689655) internal successors, (126), 87 states have internal predecessors, (126), 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-14 05:47:03,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 126 transitions. [2024-10-14 05:47:03,451 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 126 transitions. Word has length 28 [2024-10-14 05:47:03,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:47:03,452 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 126 transitions. [2024-10-14 05:47:03,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:47:03,452 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 126 transitions. [2024-10-14 05:47:03,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-14 05:47:03,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:47:03,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:47:03,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 05:47:03,453 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:47:03,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:47:03,454 INFO L85 PathProgramCache]: Analyzing trace with hash -287108728, now seen corresponding path program 1 times [2024-10-14 05:47:03,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:47:03,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673713184] [2024-10-14 05:47:03,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:47:03,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:47:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:47:03,733 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-14 05:47:03,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:47:03,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673713184] [2024-10-14 05:47:03,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673713184] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:47:03,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:47:03,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 05:47:03,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397889272] [2024-10-14 05:47:03,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:47:03,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:47:03,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:47:03,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:47:03,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:47:03,736 INFO L87 Difference]: Start difference. First operand 88 states and 126 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:47:03,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:47:03,899 INFO L93 Difference]: Finished difference Result 162 states and 228 transitions. [2024-10-14 05:47:03,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 05:47:03,900 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-14 05:47:03,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:47:03,901 INFO L225 Difference]: With dead ends: 162 [2024-10-14 05:47:03,901 INFO L226 Difference]: Without dead ends: 109 [2024-10-14 05:47:03,902 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-14 05:47:03,903 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 188 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:47:03,904 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 498 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:47:03,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-14 05:47:03,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 91. [2024-10-14 05:47:03,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.4444444444444444) internal successors, (130), 90 states have internal predecessors, (130), 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-14 05:47:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 130 transitions. [2024-10-14 05:47:03,916 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 130 transitions. Word has length 29 [2024-10-14 05:47:03,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:47:03,916 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 130 transitions. [2024-10-14 05:47:03,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:47:03,917 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 130 transitions. [2024-10-14 05:47:03,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-14 05:47:03,917 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:47:03,918 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:47:03,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 05:47:03,918 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:47:03,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:47:03,922 INFO L85 PathProgramCache]: Analyzing trace with hash 8910453, now seen corresponding path program 1 times [2024-10-14 05:47:03,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:47:03,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [43547045] [2024-10-14 05:47:03,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:47:03,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:47:03,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:47:04,444 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-14 05:47:04,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 05:47:04,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [43547045] [2024-10-14 05:47:04,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [43547045] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:47:04,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:47:04,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 05:47:04,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697940285] [2024-10-14 05:47:04,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:47:04,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 05:47:04,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 05:47:04,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 05:47:04,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 05:47:04,449 INFO L87 Difference]: Start difference. First operand 91 states and 130 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:47:04,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:47:04,648 INFO L93 Difference]: Finished difference Result 162 states and 227 transitions. [2024-10-14 05:47:04,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 05:47:04,648 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2024-10-14 05:47:04,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:47:04,650 INFO L225 Difference]: With dead ends: 162 [2024-10-14 05:47:04,651 INFO L226 Difference]: Without dead ends: 109 [2024-10-14 05:47:04,652 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-10-14 05:47:04,653 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 183 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 480 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:47:04,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 480 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 05:47:04,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-14 05:47:04,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 95. [2024-10-14 05:47:04,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.4361702127659575) internal successors, (135), 94 states have internal predecessors, (135), 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-14 05:47:04,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 135 transitions. [2024-10-14 05:47:04,668 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 135 transitions. Word has length 30 [2024-10-14 05:47:04,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:47:04,669 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 135 transitions. [2024-10-14 05:47:04,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 05:47:04,669 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 135 transitions. [2024-10-14 05:47:04,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-14 05:47:04,670 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:47:04,670 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 05:47:04,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 05:47:04,671 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:47:04,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:47:04,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1840769287, now seen corresponding path program 1 times [2024-10-14 05:47:04,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 05:47:04,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659465349] [2024-10-14 05:47:04,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:47:04,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 05:47:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 05:47:04,703 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 05:47:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 05:47:04,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 05:47:04,764 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 05:47:04,766 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 05:47:04,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 05:47:04,771 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-14 05:47:04,812 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 05:47:04,817 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:47:04 BoogieIcfgContainer [2024-10-14 05:47:04,817 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 05:47:04,818 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 05:47:04,819 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 05:47:04,819 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 05:47:04,819 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:47:01" (3/4) ... [2024-10-14 05:47:04,821 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 05:47:04,822 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 05:47:04,823 INFO L158 Benchmark]: Toolchain (without parser) took 4250.08ms. Allocated memory was 146.8MB in the beginning and 186.6MB in the end (delta: 39.8MB). Free memory was 99.1MB in the beginning and 59.8MB in the end (delta: 39.3MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. [2024-10-14 05:47:04,823 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 146.8MB. Free memory is still 113.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 05:47:04,826 INFO L158 Benchmark]: CACSL2BoogieTranslator took 339.02ms. Allocated memory is still 146.8MB. Free memory was 98.5MB in the beginning and 83.2MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 05:47:04,827 INFO L158 Benchmark]: Boogie Procedure Inliner took 82.06ms. Allocated memory is still 146.8MB. Free memory was 83.2MB in the beginning and 76.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 05:47:04,827 INFO L158 Benchmark]: Boogie Preprocessor took 104.25ms. Allocated memory is still 146.8MB. Free memory was 76.9MB in the beginning and 71.9MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 05:47:04,827 INFO L158 Benchmark]: RCFGBuilder took 739.75ms. Allocated memory was 146.8MB in the beginning and 186.6MB in the end (delta: 39.8MB). Free memory was 71.9MB in the beginning and 149.2MB in the end (delta: -77.3MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. [2024-10-14 05:47:04,828 INFO L158 Benchmark]: TraceAbstraction took 2974.92ms. Allocated memory is still 186.6MB. Free memory was 148.1MB in the beginning and 59.8MB in the end (delta: 88.3MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. [2024-10-14 05:47:04,828 INFO L158 Benchmark]: Witness Printer took 3.96ms. Allocated memory is still 186.6MB. Free memory is still 59.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 05:47:04,829 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 146.8MB. Free memory is still 113.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 339.02ms. Allocated memory is still 146.8MB. Free memory was 98.5MB in the beginning and 83.2MB in the end (delta: 15.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 82.06ms. Allocated memory is still 146.8MB. Free memory was 83.2MB in the beginning and 76.9MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.25ms. Allocated memory is still 146.8MB. Free memory was 76.9MB in the beginning and 71.9MB in the end (delta: 5.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 739.75ms. Allocated memory was 146.8MB in the beginning and 186.6MB in the end (delta: 39.8MB). Free memory was 71.9MB in the beginning and 149.2MB in the end (delta: -77.3MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2974.92ms. Allocated memory is still 186.6MB. Free memory was 148.1MB in the beginning and 59.8MB in the end (delta: 88.3MB). Peak memory consumption was 89.4MB. Max. memory is 16.1GB. * Witness Printer took 3.96ms. Allocated memory is still 186.6MB. Free memory is still 59.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 92, overapproximation of bitwiseAnd at line 97. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 2); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (2 - 1); [L32] const SORT_1 var_10 = 0; [L33] const SORT_5 var_14 = 0; [L34] const SORT_1 var_29 = 1; [L35] const SORT_5 var_39 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_1 input_7; [L42] SORT_5 input_8; [L43] SORT_5 input_9; [L45] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=3, var_10=0, var_14=0, var_29=1, var_39=1] [L45] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=3, var_10=0, var_14=0, var_29=1, var_39=1] [L46] SORT_5 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=3, var_10=0, var_14=0, var_29=1, var_39=1] [L47] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, var_10=0, var_14=0, var_29=1, var_39=1] [L48] SORT_5 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L50] SORT_1 init_12_arg_1 = var_10; [L51] state_11 = init_12_arg_1 [L52] SORT_5 init_16_arg_1 = var_14; [L53] state_15 = init_16_arg_1 [L54] SORT_1 init_18_arg_1 = var_10; [L55] state_17 = init_18_arg_1 [L56] SORT_5 init_22_arg_1 = var_14; [L57] state_21 = init_22_arg_1 VAL [mask_SORT_1=1, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_14=0, var_29=1, var_39=1] [L60] input_2 = __VERIFIER_nondet_uchar() [L61] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_14=0, var_29=1, var_39=1] [L61] input_2 = input_2 & mask_SORT_1 [L62] input_3 = __VERIFIER_nondet_uchar() [L63] EXPR input_3 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=1, state_11=0, state_15=0, state_17=0, state_21=0, var_10=0, var_14=0, var_29=1, var_39=1] [L63] input_3 = input_3 & mask_SORT_1 [L64] input_4 = __VERIFIER_nondet_uchar() [L65] input_6 = __VERIFIER_nondet_uchar() [L66] input_7 = __VERIFIER_nondet_uchar() [L67] input_8 = __VERIFIER_nondet_uchar() [L68] input_9 = __VERIFIER_nondet_uchar() [L71] SORT_1 var_13_arg_0 = state_11; [L72] SORT_1 var_13 = ~var_13_arg_0; [L73] SORT_1 var_19_arg_0 = state_17; [L74] SORT_5 var_19_arg_1 = state_15; [L75] SORT_5 var_19_arg_2 = input_6; [L76] SORT_5 var_19 = var_19_arg_0 ? var_19_arg_1 : var_19_arg_2; [L77] SORT_5 var_20_arg_0 = var_19; [L78] SORT_1 var_20 = var_20_arg_0 >> 0; VAL [input_2=0, input_3=0, input_6=0, mask_SORT_1=1, state_11=0, state_17=0, state_21=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L79] EXPR var_20 & mask_SORT_1 VAL [input_2=0, input_3=0, input_6=0, mask_SORT_1=1, state_11=0, state_17=0, state_21=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_29=1, var_39=1] [L79] var_20 = var_20 & mask_SORT_1 [L80] SORT_1 var_23_arg_0 = state_17; [L81] SORT_5 var_23_arg_1 = state_21; [L82] SORT_5 var_23_arg_2 = input_6; [L83] SORT_5 var_23 = var_23_arg_0 ? var_23_arg_1 : var_23_arg_2; [L84] SORT_5 var_24_arg_0 = var_23; [L85] SORT_1 var_24 = var_24_arg_0 >> 0; VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_20=0, var_24=0, var_29=1, var_39=1] [L86] EXPR var_24 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_13=-1, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L86] var_24 = var_24 & mask_SORT_1 [L87] SORT_1 var_25_arg_0 = var_20; [L88] SORT_1 var_25_arg_1 = var_24; [L89] SORT_1 var_25 = var_25_arg_0 == var_25_arg_1; [L90] SORT_1 var_26_arg_0 = var_13; [L91] SORT_1 var_26_arg_1 = var_25; VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_26_arg_0=-1, var_26_arg_1=1, var_29=1, var_39=1] [L92] EXPR var_26_arg_0 | var_26_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L92] SORT_1 var_26 = var_26_arg_0 | var_26_arg_1; [L93] SORT_1 var_30_arg_0 = var_26; [L94] SORT_1 var_30 = ~var_30_arg_0; [L95] SORT_1 var_31_arg_0 = var_29; [L96] SORT_1 var_31_arg_1 = var_30; VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_31_arg_0=1, var_31_arg_1=-1, var_39=1] [L97] EXPR var_31_arg_0 & var_31_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L97] SORT_1 var_31 = var_31_arg_0 & var_31_arg_1; [L98] EXPR var_31 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, state_11=0, var_10=0, var_14=0, var_19=0, var_20=0, var_29=1, var_39=1] [L98] var_31 = var_31 & mask_SORT_1 [L99] SORT_1 bad_32_arg_0 = var_31; [L100] CALL __VERIFIER_assert(!(bad_32_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 67 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 556 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 556 mSDsluCounter, 1863 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1431 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 245 IncrementalHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 432 mSDtfsCounter, 245 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=5, InterpolantAutomatonStates: 31, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 171 NumberOfCodeBlocks, 171 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 575 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-14 05:47:04,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal17.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash c94b3661676652faea857d81dc0e0e26cd1d6a51b23eb72c98391fe2e83a67ae --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 05:47:07,088 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 05:47:07,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-10-14 05:47:07,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 05:47:07,184 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 05:47:07,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 05:47:07,216 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 05:47:07,216 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 05:47:07,217 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 05:47:07,219 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 05:47:07,220 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 05:47:07,220 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 05:47:07,221 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 05:47:07,221 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 05:47:07,224 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 05:47:07,225 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 05:47:07,225 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 05:47:07,225 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 05:47:07,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 05:47:07,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 05:47:07,226 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 05:47:07,227 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 05:47:07,227 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 05:47:07,227 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 05:47:07,227 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 05:47:07,228 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 05:47:07,228 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 05:47:07,228 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 05:47:07,228 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 05:47:07,229 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 05:47:07,229 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 05:47:07,229 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:47:07,230 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 05:47:07,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 05:47:07,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 05:47:07,242 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 05:47:07,245 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 05:47:07,246 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 05:47:07,246 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 05:47:07,246 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 05:47:07,247 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 05:47:07,247 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 05:47:07,247 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c94b3661676652faea857d81dc0e0e26cd1d6a51b23eb72c98391fe2e83a67ae [2024-10-14 05:47:07,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 05:47:07,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 05:47:07,601 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 05:47:07,602 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 05:47:07,602 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 05:47:07,604 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal17.c [2024-10-14 05:47:09,241 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 05:47:09,464 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 05:47:09,464 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal17.c [2024-10-14 05:47:09,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a2de984e/00d7f42d683741d0b31eac29de8fcaea/FLAG62760072a [2024-10-14 05:47:09,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a2de984e/00d7f42d683741d0b31eac29de8fcaea [2024-10-14 05:47:09,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 05:47:09,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 05:47:09,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 05:47:09,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 05:47:09,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 05:47:09,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:47:09" (1/1) ... [2024-10-14 05:47:09,839 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2145ba06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:09, skipping insertion in model container [2024-10-14 05:47:09,839 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:47:09" (1/1) ... [2024-10-14 05:47:09,870 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 05:47:10,026 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.cal17.c[1245,1258] [2024-10-14 05:47:10,108 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:47:10,128 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 05:47:10,143 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.cal17.c[1245,1258] [2024-10-14 05:47:10,183 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 05:47:10,202 INFO L204 MainTranslator]: Completed translation [2024-10-14 05:47:10,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:10 WrapperNode [2024-10-14 05:47:10,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 05:47:10,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 05:47:10,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 05:47:10,205 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 05:47:10,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:10" (1/1) ... [2024-10-14 05:47:10,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:10" (1/1) ... [2024-10-14 05:47:10,252 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 175 [2024-10-14 05:47:10,254 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 05:47:10,255 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 05:47:10,256 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 05:47:10,256 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 05:47:10,266 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:10" (1/1) ... [2024-10-14 05:47:10,266 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:10" (1/1) ... [2024-10-14 05:47:10,276 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:10" (1/1) ... [2024-10-14 05:47:10,299 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-10-14 05:47:10,300 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:10" (1/1) ... [2024-10-14 05:47:10,300 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:10" (1/1) ... [2024-10-14 05:47:10,310 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:10" (1/1) ... [2024-10-14 05:47:10,316 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:10" (1/1) ... [2024-10-14 05:47:10,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:10" (1/1) ... [2024-10-14 05:47:10,323 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:10" (1/1) ... [2024-10-14 05:47:10,326 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 05:47:10,329 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 05:47:10,330 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 05:47:10,330 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 05:47:10,331 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:10" (1/1) ... [2024-10-14 05:47:10,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 05:47:10,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 05:47:10,363 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 05:47:10,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 05:47:10,411 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 05:47:10,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 05:47:10,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-14 05:47:10,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 05:47:10,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 05:47:10,533 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 05:47:10,535 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 05:47:10,811 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2024-10-14 05:47:10,814 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 05:47:10,866 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 05:47:10,868 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 05:47:10,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:47:10 BoogieIcfgContainer [2024-10-14 05:47:10,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 05:47:10,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 05:47:10,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 05:47:10,874 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 05:47:10,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:47:09" (1/3) ... [2024-10-14 05:47:10,875 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726a348d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:47:10, skipping insertion in model container [2024-10-14 05:47:10,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:47:10" (2/3) ... [2024-10-14 05:47:10,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@726a348d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:47:10, skipping insertion in model container [2024-10-14 05:47:10,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:47:10" (3/3) ... [2024-10-14 05:47:10,878 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal17.c [2024-10-14 05:47:10,896 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 05:47:10,897 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 05:47:10,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 05:47:10,970 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;@47407a04, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 05:47:10,970 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 05:47:10,975 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-14 05:47:10,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-14 05:47:10,982 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:47:10,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-14 05:47:10,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:47:10,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:47:10,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1614770, now seen corresponding path program 1 times [2024-10-14 05:47:11,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 05:47:11,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [211302429] [2024-10-14 05:47:11,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:47:11,010 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-14 05:47:11,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 05:47:11,014 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 05:47:11,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 05:47:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:47:11,178 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-10-14 05:47:11,188 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:47:11,357 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-14 05:47:11,358 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 05:47:11,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 05:47:11,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [211302429] [2024-10-14 05:47:11,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [211302429] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 05:47:11,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 05:47:11,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 05:47:11,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483166286] [2024-10-14 05:47:11,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 05:47:11,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 05:47:11,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 05:47:11,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 05:47:11,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 05:47:11,399 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-14 05:47:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:47:11,455 INFO L93 Difference]: Finished difference Result 15 states and 20 transitions. [2024-10-14 05:47:11,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 05:47:11,458 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-14 05:47:11,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:47:11,466 INFO L225 Difference]: With dead ends: 15 [2024-10-14 05:47:11,466 INFO L226 Difference]: Without dead ends: 9 [2024-10-14 05:47:11,469 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-14 05:47:11,473 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-14 05:47:11,476 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-14 05:47:11,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-10-14 05:47:11,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 8. [2024-10-14 05:47:11,500 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-14 05:47:11,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2024-10-14 05:47:11,502 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 4 [2024-10-14 05:47:11,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:47:11,503 INFO L471 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2024-10-14 05:47:11,504 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-14 05:47:11,504 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2024-10-14 05:47:11,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 05:47:11,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:47:11,504 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1] [2024-10-14 05:47:11,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-14 05:47:11,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 05:47:11,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:47:11,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:47:11,719 INFO L85 PathProgramCache]: Analyzing trace with hash 865745430, now seen corresponding path program 1 times [2024-10-14 05:47:11,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 05:47:11,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975150586] [2024-10-14 05:47:11,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 05:47:11,720 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-14 05:47:11,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 05:47:11,722 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 05:47:11,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 05:47:11,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 05:47:11,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-14 05:47:11,826 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:47:11,991 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-14 05:47:11,991 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 05:47:13,015 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-14 05:47:13,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 05:47:13,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975150586] [2024-10-14 05:47:13,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975150586] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 05:47:13,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 05:47:13,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-10-14 05:47:13,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041095547] [2024-10-14 05:47:13,017 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 05:47:13,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 05:47:13,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 05:47:13,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 05:47:13,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 05:47:13,019 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-14 05:47:13,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:47:13,103 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2024-10-14 05:47:13,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 05:47:13,103 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-14 05:47:13,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:47:13,104 INFO L225 Difference]: With dead ends: 13 [2024-10-14 05:47:13,104 INFO L226 Difference]: Without dead ends: 11 [2024-10-14 05:47:13,105 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:47:13,106 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 05:47:13,106 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.1s Time] [2024-10-14 05:47:13,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-10-14 05:47:13,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2024-10-14 05:47:13,110 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-14 05:47:13,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2024-10-14 05:47:13,110 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 7 [2024-10-14 05:47:13,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:47:13,111 INFO L471 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2024-10-14 05:47:13,111 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-14 05:47:13,111 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2024-10-14 05:47:13,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-10-14 05:47:13,112 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 05:47:13,112 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1] [2024-10-14 05:47:13,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 05:47:13,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 05:47:13,313 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 05:47:13,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 05:47:13,313 INFO L85 PathProgramCache]: Analyzing trace with hash 148265266, now seen corresponding path program 2 times [2024-10-14 05:47:13,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 05:47:13,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [823597221] [2024-10-14 05:47:13,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-14 05:47:13,314 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-14 05:47:13,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 05:47:13,318 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 05:47:13,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 05:47:13,449 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-14 05:47:13,450 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-14 05:47:13,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-14 05:47:13,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 05:47:14,972 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 05:47:14,972 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 05:47:24,799 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-14 05:47:24,799 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 05:47:24,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [823597221] [2024-10-14 05:47:24,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [823597221] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 05:47:24,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 05:47:24,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-10-14 05:47:24,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804311466] [2024-10-14 05:47:24,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 05:47:24,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 05:47:24,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 05:47:24,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 05:47:24,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-14 05:47:24,802 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-14 05:47:24,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 05:47:24,881 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2024-10-14 05:47:24,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 05:47:24,882 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-14 05:47:24,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 05:47:24,882 INFO L225 Difference]: With dead ends: 11 [2024-10-14 05:47:24,882 INFO L226 Difference]: Without dead ends: 0 [2024-10-14 05:47:24,883 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-10-14 05:47:24,884 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 05:47:24,884 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 05:47:24,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-14 05:47:24,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-14 05:47:24,886 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-14 05:47:24,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-14 05:47:24,886 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2024-10-14 05:47:24,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 05:47:24,886 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-14 05:47:24,887 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-14 05:47:24,887 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-14 05:47:24,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-14 05:47:24,891 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 05:47:24,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 05:47:25,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 05:47:25,095 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1] [2024-10-14 05:47:25,097 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-14 05:47:25,208 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 05:47:25,219 WARN L953 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-10-14 05:47:25,223 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:47:25 BoogieIcfgContainer [2024-10-14 05:47:25,223 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 05:47:25,223 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 05:47:25,224 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 05:47:25,224 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 05:47:25,224 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:47:10" (3/4) ... [2024-10-14 05:47:25,228 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 05:47:25,236 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2024-10-14 05:47:25,237 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-10-14 05:47:25,237 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-10-14 05:47:25,237 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 05:47:25,238 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-14 05:47:25,324 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 05:47:25,325 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 05:47:25,325 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 05:47:25,326 INFO L158 Benchmark]: Toolchain (without parser) took 15497.40ms. Allocated memory was 73.4MB in the beginning and 723.5MB in the end (delta: 650.1MB). Free memory was 43.3MB in the beginning and 684.3MB in the end (delta: -641.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 05:47:25,326 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 52.4MB. Free memory is still 27.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 05:47:25,326 INFO L158 Benchmark]: CACSL2BoogieTranslator took 373.13ms. Allocated memory is still 73.4MB. Free memory was 43.1MB in the beginning and 47.8MB in the end (delta: -4.6MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2024-10-14 05:47:25,327 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.61ms. Allocated memory is still 73.4MB. Free memory was 47.8MB in the beginning and 45.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 05:47:25,327 INFO L158 Benchmark]: Boogie Preprocessor took 73.57ms. Allocated memory is still 73.4MB. Free memory was 45.5MB in the beginning and 42.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 05:47:25,327 INFO L158 Benchmark]: RCFGBuilder took 539.48ms. Allocated memory is still 73.4MB. Free memory was 42.6MB in the beginning and 37.8MB in the end (delta: 4.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-14 05:47:25,327 INFO L158 Benchmark]: TraceAbstraction took 14351.97ms. Allocated memory was 73.4MB in the beginning and 723.5MB in the end (delta: 650.1MB). Free memory was 37.1MB in the beginning and 690.6MB in the end (delta: -653.5MB). Peak memory consumption was 139.3MB. Max. memory is 16.1GB. [2024-10-14 05:47:25,328 INFO L158 Benchmark]: Witness Printer took 101.78ms. Allocated memory is still 723.5MB. Free memory was 689.6MB in the beginning and 684.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 05:47:25,329 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.15ms. Allocated memory is still 52.4MB. Free memory is still 27.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 373.13ms. Allocated memory is still 73.4MB. Free memory was 43.1MB in the beginning and 47.8MB in the end (delta: -4.6MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.61ms. Allocated memory is still 73.4MB. Free memory was 47.8MB in the beginning and 45.5MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.57ms. Allocated memory is still 73.4MB. Free memory was 45.5MB in the beginning and 42.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 539.48ms. Allocated memory is still 73.4MB. Free memory was 42.6MB in the beginning and 37.8MB in the end (delta: 4.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 14351.97ms. Allocated memory was 73.4MB in the beginning and 723.5MB in the end (delta: 650.1MB). Free memory was 37.1MB in the beginning and 690.6MB in the end (delta: -653.5MB). Peak memory consumption was 139.3MB. Max. memory is 16.1GB. * Witness Printer took 101.78ms. Allocated memory is still 723.5MB. Free memory was 689.6MB in the beginning and 684.3MB in the end (delta: 5.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 21]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.2s, OverallIterations: 3, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 21 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 15 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 57 IncrementalHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 6 mSDtfsCounter, 57 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=2, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 12.7s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 33 ConstructedInterpolants, 12 QuantifiedInterpolants, 9082 SizeOfPredicates, 23 NumberOfNonLiveVariables, 288 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 3/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 58]: Loop Invariant Derived loop invariant: (((((((0 == state_17) && (0 == var_10)) && (1 == var_29)) && (0 == state_11)) && (1 == mask_SORT_1)) || (((((1 == state_17) && (0 == var_10)) && (1 == var_29)) && (1 == mask_SORT_1)) && (1 == state_11))) || (((((0 == state_17) && (0 == var_10)) && (1 == var_29)) && (1 == mask_SORT_1)) && (1 == state_11))) RESULT: Ultimate proved your program to be correct! [2024-10-14 05:47:25,362 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE