./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count2.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 02da88a4f4d1ccaffb329e5ada42e451b6381aa731e6c7a9ccc4142d0ea1fbdc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 05:02:04,039 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 05:02:04,099 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-22 05:02:04,103 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 05:02:04,104 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 05:02:04,131 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 05:02:04,132 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 05:02:04,132 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 05:02:04,132 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 05:02:04,133 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 05:02:04,133 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 05:02:04,133 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 05:02:04,134 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 05:02:04,134 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 05:02:04,134 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 05:02:04,134 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 05:02:04,135 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 05:02:04,135 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 05:02:04,139 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 05:02:04,139 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 05:02:04,140 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 05:02:04,140 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 05:02:04,140 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 05:02:04,140 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 05:02:04,140 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 05:02:04,141 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 05:02:04,141 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 05:02:04,141 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 05:02:04,141 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 05:02:04,141 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:02:04,142 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 05:02:04,142 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 05:02:04,142 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 05:02:04,142 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 05:02:04,142 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 05:02:04,142 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 05:02:04,142 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 05:02:04,142 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 05:02:04,143 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 05:02:04,143 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 -> 02da88a4f4d1ccaffb329e5ada42e451b6381aa731e6c7a9ccc4142d0ea1fbdc [2024-11-22 05:02:04,389 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 05:02:04,413 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 05:02:04,415 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 05:02:04,417 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 05:02:04,417 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 05:02:04,418 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count2.c [2024-11-22 05:02:05,902 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 05:02:06,093 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 05:02:06,094 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count2.c [2024-11-22 05:02:06,101 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30e06ee2e/15a057fdd92d449aa473dc0954d6ba2b/FLAGf1ab0f048 [2024-11-22 05:02:06,117 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30e06ee2e/15a057fdd92d449aa473dc0954d6ba2b [2024-11-22 05:02:06,123 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 05:02:06,125 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 05:02:06,126 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 05:02:06,126 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 05:02:06,132 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 05:02:06,133 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:02:06" (1/1) ... [2024-11-22 05:02:06,134 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d2f0dc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:06, skipping insertion in model container [2024-11-22 05:02:06,134 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:02:06" (1/1) ... [2024-11-22 05:02:06,157 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 05:02:06,301 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count2.c[1256,1269] [2024-11-22 05:02:06,330 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:02:06,341 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 05:02:06,352 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count2.c[1256,1269] [2024-11-22 05:02:06,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:02:06,379 INFO L204 MainTranslator]: Completed translation [2024-11-22 05:02:06,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:06 WrapperNode [2024-11-22 05:02:06,380 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 05:02:06,381 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 05:02:06,382 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 05:02:06,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 05:02:06,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:06" (1/1) ... [2024-11-22 05:02:06,402 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:06" (1/1) ... [2024-11-22 05:02:06,441 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 58 [2024-11-22 05:02:06,445 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 05:02:06,446 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 05:02:06,446 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 05:02:06,446 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 05:02:06,459 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:06" (1/1) ... [2024-11-22 05:02:06,459 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:06" (1/1) ... [2024-11-22 05:02:06,461 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:06" (1/1) ... [2024-11-22 05:02:06,488 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 05:02:06,488 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:06" (1/1) ... [2024-11-22 05:02:06,488 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:06" (1/1) ... [2024-11-22 05:02:06,491 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:06" (1/1) ... [2024-11-22 05:02:06,497 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:06" (1/1) ... [2024-11-22 05:02:06,498 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:06" (1/1) ... [2024-11-22 05:02:06,499 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:06" (1/1) ... [2024-11-22 05:02:06,502 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 05:02:06,503 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 05:02:06,503 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 05:02:06,503 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 05:02:06,505 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:06" (1/1) ... [2024-11-22 05:02:06,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:02:06,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 05:02:06,545 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 05:02:06,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 05:02:06,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 05:02:06,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 05:02:06,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 05:02:06,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 05:02:06,669 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 05:02:06,672 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 05:02:06,851 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-22 05:02:06,852 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 05:02:06,861 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 05:02:06,862 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 05:02:06,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:02:06 BoogieIcfgContainer [2024-11-22 05:02:06,862 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 05:02:06,866 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 05:02:06,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 05:02:06,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 05:02:06,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 05:02:06" (1/3) ... [2024-11-22 05:02:06,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e101c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:02:06, skipping insertion in model container [2024-11-22 05:02:06,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:06" (2/3) ... [2024-11-22 05:02:06,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e101c71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:02:06, skipping insertion in model container [2024-11-22 05:02:06,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:02:06" (3/3) ... [2024-11-22 05:02:06,872 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.count2.c [2024-11-22 05:02:06,885 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 05:02:06,885 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 05:02:06,944 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 05:02:06,950 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;@5da6b5d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 05:02:06,951 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 05:02:06,956 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:06,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 05:02:06,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:02:06,965 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:02:06,965 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:02:06,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:02:06,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1805152072, now seen corresponding path program 1 times [2024-11-22 05:02:06,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:02:06,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573443249] [2024-11-22 05:02:06,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:02:06,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:02:07,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:02:07,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:02:07,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:02:07,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573443249] [2024-11-22 05:02:07,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [573443249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:02:07,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:02:07,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 05:02:07,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994361782] [2024-11-22 05:02:07,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:02:07,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 05:02:07,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:02:07,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 05:02:07,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 05:02:07,586 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:07,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:02:07,643 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2024-11-22 05:02:07,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 05:02:07,654 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 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-11-22 05:02:07,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:02:07,662 INFO L225 Difference]: With dead ends: 30 [2024-11-22 05:02:07,663 INFO L226 Difference]: Without dead ends: 18 [2024-11-22 05:02:07,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 05:02:07,671 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 6 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:02:07,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 52 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:02:07,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-22 05:02:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2024-11-22 05:02:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2024-11-22 05:02:07,732 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 7 [2024-11-22 05:02:07,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:02:07,732 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2024-11-22 05:02:07,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:07,736 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2024-11-22 05:02:07,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 05:02:07,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:02:07,737 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:02:07,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 05:02:07,738 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:02:07,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:02:07,738 INFO L85 PathProgramCache]: Analyzing trace with hash 185570019, now seen corresponding path program 1 times [2024-11-22 05:02:07,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:02:07,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788984859] [2024-11-22 05:02:07,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:02:07,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:02:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:02:08,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:02:08,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:02:08,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788984859] [2024-11-22 05:02:08,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788984859] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 05:02:08,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [519964222] [2024-11-22 05:02:08,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:02:08,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 05:02:08,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 05:02:08,012 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 05:02:08,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 05:02:08,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:02:08,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-22 05:02:08,085 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:02:08,301 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:02:08,301 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 05:02:08,464 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:02:08,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [519964222] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 05:02:08,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 05:02:08,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 13 [2024-11-22 05:02:08,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525528719] [2024-11-22 05:02:08,465 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 05:02:08,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 05:02:08,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:02:08,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 05:02:08,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-22 05:02:08,469 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:08,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:02:08,575 INFO L93 Difference]: Finished difference Result 23 states and 27 transitions. [2024-11-22 05:02:08,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 05:02:08,576 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 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 12 [2024-11-22 05:02:08,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:02:08,576 INFO L225 Difference]: With dead ends: 23 [2024-11-22 05:02:08,577 INFO L226 Difference]: Without dead ends: 21 [2024-11-22 05:02:08,578 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-22 05:02:08,579 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 38 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 05:02:08,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 98 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 05:02:08,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-22 05:02:08,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2024-11-22 05:02:08,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:08,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-22 05:02:08,585 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 12 [2024-11-22 05:02:08,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:02:08,586 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-22 05:02:08,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 13 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:08,586 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-22 05:02:08,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-22 05:02:08,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:02:08,596 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:02:08,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 05:02:08,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 05:02:08,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:02:08,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:02:08,798 INFO L85 PathProgramCache]: Analyzing trace with hash 1511026262, now seen corresponding path program 1 times [2024-11-22 05:02:08,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:02:08,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816435787] [2024-11-22 05:02:08,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:02:08,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:02:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:02:08,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:02:08,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:02:08,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816435787] [2024-11-22 05:02:08,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816435787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:02:08,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:02:08,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 05:02:08,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843423887] [2024-11-22 05:02:08,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:02:08,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 05:02:08,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:02:08,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 05:02:08,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 05:02:08,933 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:08,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:02:08,984 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2024-11-22 05:02:08,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 05:02:08,985 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 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 13 [2024-11-22 05:02:08,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:02:08,985 INFO L225 Difference]: With dead ends: 36 [2024-11-22 05:02:08,986 INFO L226 Difference]: Without dead ends: 24 [2024-11-22 05:02:08,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 05:02:08,987 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 5 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:02:08,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 20 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:02:08,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-22 05:02:08,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2024-11-22 05:02:08,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:08,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2024-11-22 05:02:08,996 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 13 [2024-11-22 05:02:08,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:02:08,997 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2024-11-22 05:02:08,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:08,997 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2024-11-22 05:02:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 05:02:08,997 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:02:08,998 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:02:08,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 05:02:08,998 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:02:08,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:02:08,999 INFO L85 PathProgramCache]: Analyzing trace with hash -346732602, now seen corresponding path program 1 times [2024-11-22 05:02:08,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:02:08,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653211813] [2024-11-22 05:02:08,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:02:09,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:02:09,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:02:09,335 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:02:09,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:02:09,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653211813] [2024-11-22 05:02:09,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653211813] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 05:02:09,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940199079] [2024-11-22 05:02:09,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:02:09,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 05:02:09,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 05:02:09,342 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 05:02:09,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 05:02:09,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:02:09,395 WARN L253 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-22 05:02:09,399 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:02:09,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:02:09,605 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 05:02:10,013 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:02:10,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940199079] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 05:02:10,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 05:02:10,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 12] total 26 [2024-11-22 05:02:10,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578049355] [2024-11-22 05:02:10,013 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 05:02:10,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-22 05:02:10,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:02:10,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-22 05:02:10,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=553, Unknown=0, NotChecked=0, Total=650 [2024-11-22 05:02:10,017 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:10,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:02:10,172 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-11-22 05:02:10,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 05:02:10,172 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 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 14 [2024-11-22 05:02:10,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:02:10,173 INFO L225 Difference]: With dead ends: 40 [2024-11-22 05:02:10,174 INFO L226 Difference]: Without dead ends: 28 [2024-11-22 05:02:10,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=105, Invalid=597, Unknown=0, NotChecked=0, Total=702 [2024-11-22 05:02:10,175 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 05:02:10,176 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 54 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 05:02:10,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-22 05:02:10,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 24. [2024-11-22 05:02:10,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:10,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2024-11-22 05:02:10,182 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 28 transitions. Word has length 14 [2024-11-22 05:02:10,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:02:10,182 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 28 transitions. [2024-11-22 05:02:10,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 1.4230769230769231) internal successors, (37), 26 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:10,183 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 28 transitions. [2024-11-22 05:02:10,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-22 05:02:10,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:02:10,183 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:02:10,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 05:02:10,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-11-22 05:02:10,384 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:02:10,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:02:10,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1746694228, now seen corresponding path program 1 times [2024-11-22 05:02:10,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:02:10,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258079252] [2024-11-22 05:02:10,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:02:10,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:02:10,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:02:10,610 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:02:10,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:02:10,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258079252] [2024-11-22 05:02:10,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258079252] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 05:02:10,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416690883] [2024-11-22 05:02:10,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:02:10,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 05:02:10,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 05:02:10,614 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 05:02:10,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 05:02:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:02:10,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-22 05:02:10,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:02:10,884 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:02:10,884 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 05:02:11,228 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 5 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:02:11,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416690883] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 05:02:11,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 05:02:11,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 21 [2024-11-22 05:02:11,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542264283] [2024-11-22 05:02:11,229 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 05:02:11,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-22 05:02:11,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:02:11,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-22 05:02:11,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-11-22 05:02:11,233 INFO L87 Difference]: Start difference. First operand 24 states and 28 transitions. Second operand has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:11,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:02:11,413 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2024-11-22 05:02:11,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 05:02:11,414 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 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 20 [2024-11-22 05:02:11,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:02:11,415 INFO L225 Difference]: With dead ends: 51 [2024-11-22 05:02:11,416 INFO L226 Difference]: Without dead ends: 39 [2024-11-22 05:02:11,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=85, Invalid=377, Unknown=0, NotChecked=0, Total=462 [2024-11-22 05:02:11,417 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 14 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 05:02:11,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 54 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 05:02:11,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-22 05:02:11,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-11-22 05:02:11,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:11,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2024-11-22 05:02:11,427 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 20 [2024-11-22 05:02:11,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:02:11,428 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2024-11-22 05:02:11,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.142857142857143) internal successors, (45), 21 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:11,428 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2024-11-22 05:02:11,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-22 05:02:11,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:02:11,429 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-22 05:02:11,439 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 05:02:11,629 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 05:02:11,630 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:02:11,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:02:11,631 INFO L85 PathProgramCache]: Analyzing trace with hash -1630960248, now seen corresponding path program 2 times [2024-11-22 05:02:11,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:02:11,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423931795] [2024-11-22 05:02:11,631 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 05:02:11,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:02:11,660 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 05:02:11,660 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 05:02:12,239 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:02:12,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:02:12,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423931795] [2024-11-22 05:02:12,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1423931795] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 05:02:12,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161639675] [2024-11-22 05:02:12,240 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 05:02:12,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 05:02:12,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 05:02:12,244 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 05:02:12,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 05:02:12,323 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 05:02:12,324 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 05:02:12,326 WARN L253 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-22 05:02:12,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:02:13,061 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:02:13,062 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 05:02:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:02:16,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161639675] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 05:02:16,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 05:02:16,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2024-11-22 05:02:16,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162392274] [2024-11-22 05:02:16,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 05:02:16,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-22 05:02:16,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:02:16,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-22 05:02:16,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=988, Unknown=0, NotChecked=0, Total=1122 [2024-11-22 05:02:16,621 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 34 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:17,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:02:17,325 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2024-11-22 05:02:17,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-22 05:02:17,326 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 34 states have internal predecessors, (58), 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 21 [2024-11-22 05:02:17,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:02:17,326 INFO L225 Difference]: With dead ends: 49 [2024-11-22 05:02:17,326 INFO L226 Difference]: Without dead ends: 37 [2024-11-22 05:02:17,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=349, Invalid=2003, Unknown=0, NotChecked=0, Total=2352 [2024-11-22 05:02:17,328 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 45 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 281 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 05:02:17,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 36 Invalid, 281 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 05:02:17,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-22 05:02:17,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-22 05:02:17,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1111111111111112) internal successors, (40), 36 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:17,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-22 05:02:17,333 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 21 [2024-11-22 05:02:17,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:02:17,333 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-22 05:02:17,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.7058823529411764) internal successors, (58), 34 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:17,333 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-22 05:02:17,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-22 05:02:17,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:02:17,334 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:02:17,344 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 05:02:17,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 05:02:17,536 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:02:17,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:02:17,536 INFO L85 PathProgramCache]: Analyzing trace with hash 860979732, now seen corresponding path program 2 times [2024-11-22 05:02:17,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:02:17,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632463262] [2024-11-22 05:02:17,536 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 05:02:17,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:02:17,581 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 05:02:17,581 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 05:02:18,168 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:02:18,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:02:18,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632463262] [2024-11-22 05:02:18,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632463262] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 05:02:18,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560157357] [2024-11-22 05:02:18,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 05:02:18,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 05:02:18,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 05:02:18,171 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 05:02:18,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 05:02:18,355 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 05:02:18,355 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 05:02:18,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 75 conjuncts are in the unsatisfiable core [2024-11-22 05:02:18,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:02:19,575 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 11 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:02:19,576 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 05:02:20,399 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:02:20,400 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560157357] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 05:02:20,400 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 05:02:20,400 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 15, 17] total 42 [2024-11-22 05:02:20,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009663758] [2024-11-22 05:02:20,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 05:02:20,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-22 05:02:20,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:02:20,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-22 05:02:20,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=1481, Unknown=0, NotChecked=0, Total=1722 [2024-11-22 05:02:20,402 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 42 states, 42 states have (on average 2.238095238095238) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:21,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:02:21,124 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2024-11-22 05:02:21,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-22 05:02:21,125 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.238095238095238) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-22 05:02:21,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:02:21,126 INFO L225 Difference]: With dead ends: 70 [2024-11-22 05:02:21,126 INFO L226 Difference]: Without dead ends: 58 [2024-11-22 05:02:21,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 906 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=346, Invalid=2104, Unknown=0, NotChecked=0, Total=2450 [2024-11-22 05:02:21,127 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 12 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 05:02:21,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 57 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 05:02:21,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-22 05:02:21,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-22 05:02:21,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.0701754385964912) internal successors, (61), 57 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:21,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2024-11-22 05:02:21,134 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 34 [2024-11-22 05:02:21,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:02:21,134 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2024-11-22 05:02:21,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.238095238095238) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:21,134 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2024-11-22 05:02:21,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-22 05:02:21,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:02:21,135 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:02:21,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 05:02:21,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 05:02:21,336 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:02:21,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:02:21,337 INFO L85 PathProgramCache]: Analyzing trace with hash 550162710, now seen corresponding path program 3 times [2024-11-22 05:02:21,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:02:21,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218112781] [2024-11-22 05:02:21,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 05:02:21,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:02:21,465 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-22 05:02:21,466 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 05:02:21,466 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 05:02:21,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 05:02:21,549 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 05:02:21,550 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 05:02:21,551 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 05:02:21,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 05:02:21,559 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2024-11-22 05:02:21,605 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 05:02:21,608 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 05:02:21 BoogieIcfgContainer [2024-11-22 05:02:21,609 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 05:02:21,609 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 05:02:21,610 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 05:02:21,610 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 05:02:21,610 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:02:06" (3/4) ... [2024-11-22 05:02:21,613 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 05:02:21,615 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 05:02:21,615 INFO L158 Benchmark]: Toolchain (without parser) took 15490.95ms. Allocated memory was 138.4MB in the beginning and 362.8MB in the end (delta: 224.4MB). Free memory was 68.2MB in the beginning and 202.7MB in the end (delta: -134.5MB). Peak memory consumption was 90.7MB. Max. memory is 16.1GB. [2024-11-22 05:02:21,616 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 138.4MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 05:02:21,616 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.58ms. Allocated memory is still 138.4MB. Free memory was 68.0MB in the beginning and 55.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-22 05:02:21,616 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.12ms. Allocated memory is still 138.4MB. Free memory was 55.5MB in the beginning and 53.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 05:02:21,616 INFO L158 Benchmark]: Boogie Preprocessor took 56.66ms. Allocated memory is still 138.4MB. Free memory was 53.3MB in the beginning and 110.0MB in the end (delta: -56.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-22 05:02:21,617 INFO L158 Benchmark]: RCFGBuilder took 358.91ms. Allocated memory is still 138.4MB. Free memory was 109.9MB in the beginning and 99.7MB in the end (delta: 10.2MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. [2024-11-22 05:02:21,617 INFO L158 Benchmark]: TraceAbstraction took 14742.33ms. Allocated memory was 138.4MB in the beginning and 362.8MB in the end (delta: 224.4MB). Free memory was 99.0MB in the beginning and 202.7MB in the end (delta: -103.7MB). Peak memory consumption was 119.3MB. Max. memory is 16.1GB. [2024-11-22 05:02:21,617 INFO L158 Benchmark]: Witness Printer took 5.48ms. Allocated memory is still 362.8MB. Free memory is still 202.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 05:02:21,619 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.17ms. Allocated memory is still 138.4MB. Free memory is still 91.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.58ms. Allocated memory is still 138.4MB. Free memory was 68.0MB in the beginning and 55.5MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.12ms. Allocated memory is still 138.4MB. Free memory was 55.5MB in the beginning and 53.3MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 56.66ms. Allocated memory is still 138.4MB. Free memory was 53.3MB in the beginning and 110.0MB in the end (delta: -56.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 358.91ms. Allocated memory is still 138.4MB. Free memory was 109.9MB in the beginning and 99.7MB in the end (delta: 10.2MB). Peak memory consumption was 11.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14742.33ms. Allocated memory was 138.4MB in the beginning and 362.8MB in the end (delta: 224.4MB). Free memory was 99.0MB in the beginning and 202.7MB in the end (delta: -103.7MB). Peak memory consumption was 119.3MB. Max. memory is 16.1GB. * Witness Printer took 5.48ms. Allocated memory is still 362.8MB. Free memory is still 202.7MB. 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: 22]: 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 bitwiseAnd at line 55. Possible FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 3); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (3 - 1); [L30] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 1); [L31] const SORT_9 msb_SORT_9 = (SORT_9)1 << (1 - 1); [L33] const SORT_1 var_2 = 0; [L34] const SORT_1 var_5 = 1; [L35] const SORT_1 var_8 = mask_SORT_1; [L38] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=7, var_2=0, var_5=1, var_8=7] [L38] SORT_1 state_3 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L40] SORT_1 init_4_arg_1 = var_2; [L41] state_3 = init_4_arg_1 VAL [mask_SORT_1=7, state_3=0, var_5=1, var_8=7] [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [mask_SORT_1=7, var_5=1, var_6=1, var_8=7] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=7, var_5=1, var_8=7] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [mask_SORT_1=7, var_5=1, var_6=2, var_8=7] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=7, var_5=1, var_8=7] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [mask_SORT_1=7, var_5=1, var_6=3, var_8=7] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=7, var_5=1, var_8=7] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [mask_SORT_1=7, var_5=1, var_6=4, var_8=7] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=7, var_5=1, var_8=7] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [mask_SORT_1=7, var_5=1, var_6=5, var_8=7] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=7, var_5=1, var_8=7] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [mask_SORT_1=7, var_5=1, var_6=6, var_8=7] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=7, var_5=1, var_8=7] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; VAL [mask_SORT_1=7, var_5=1, var_6=7, var_8=7] [L55] EXPR var_6 & mask_SORT_1 VAL [mask_SORT_1=7, var_5=1, var_8=7] [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 14.6s, OverallIterations: 8, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 132 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 132 mSDsluCounter, 371 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 315 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1056 IncrementalHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 56 mSDtfsCounter, 1056 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 124 SyntacticMatches, 3 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1625 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=58occurred in iteration=7, InterpolantAutomatonStates: 82, 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, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 10.3s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 306 ConstructedInterpolants, 15 QuantifiedInterpolants, 6459 SizeOfPredicates, 16 NumberOfNonLiveVariables, 559 ConjunctsInSsa, 250 ConjunctsInUnsatCore, 17 InterpolantComputations, 2 PerfectInterpolantSequences, 50/218 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 05:02:21,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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 ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count2.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 02da88a4f4d1ccaffb329e5ada42e451b6381aa731e6c7a9ccc4142d0ea1fbdc --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 05:02:23,980 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 05:02:24,062 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-22 05:02:24,069 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 05:02:24,070 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 05:02:24,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 05:02:24,101 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 05:02:24,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 05:02:24,102 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 05:02:24,103 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 05:02:24,103 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 05:02:24,103 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 05:02:24,104 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 05:02:24,105 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 05:02:24,107 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 05:02:24,108 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 05:02:24,108 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 05:02:24,108 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 05:02:24,108 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 05:02:24,109 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 05:02:24,109 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 05:02:24,110 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 05:02:24,110 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 05:02:24,110 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 05:02:24,110 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 05:02:24,111 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 05:02:24,111 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 05:02:24,111 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 05:02:24,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 05:02:24,115 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 05:02:24,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 05:02:24,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:02:24,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 05:02:24,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 05:02:24,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 05:02:24,116 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 05:02:24,116 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 05:02:24,116 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 05:02:24,116 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 05:02:24,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 05:02:24,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 05:02:24,119 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 -> 02da88a4f4d1ccaffb329e5ada42e451b6381aa731e6c7a9ccc4142d0ea1fbdc [2024-11-22 05:02:24,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 05:02:24,478 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 05:02:24,481 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 05:02:24,482 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 05:02:24,482 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 05:02:24,483 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count2.c [2024-11-22 05:02:25,946 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 05:02:26,157 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 05:02:26,158 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count2.c [2024-11-22 05:02:26,164 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0313fc6/896b33d829e646bb8f00fdbb83a051c6/FLAG4184e97d3 [2024-11-22 05:02:26,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8a0313fc6/896b33d829e646bb8f00fdbb83a051c6 [2024-11-22 05:02:26,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 05:02:26,182 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 05:02:26,183 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 05:02:26,183 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 05:02:26,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 05:02:26,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:02:26" (1/1) ... [2024-11-22 05:02:26,189 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c5019c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:26, skipping insertion in model container [2024-11-22 05:02:26,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:02:26" (1/1) ... [2024-11-22 05:02:26,211 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 05:02:26,401 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count2.c[1256,1269] [2024-11-22 05:02:26,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:02:26,469 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 05:02:26,480 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count2.c[1256,1269] [2024-11-22 05:02:26,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:02:26,507 INFO L204 MainTranslator]: Completed translation [2024-11-22 05:02:26,507 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:26 WrapperNode [2024-11-22 05:02:26,507 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 05:02:26,508 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 05:02:26,508 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 05:02:26,509 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 05:02:26,515 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:26" (1/1) ... [2024-11-22 05:02:26,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:26" (1/1) ... [2024-11-22 05:02:26,536 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 42 [2024-11-22 05:02:26,536 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 05:02:26,537 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 05:02:26,537 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 05:02:26,537 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 05:02:26,546 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:26" (1/1) ... [2024-11-22 05:02:26,547 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:26" (1/1) ... [2024-11-22 05:02:26,549 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:26" (1/1) ... [2024-11-22 05:02:26,558 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 05:02:26,562 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:26" (1/1) ... [2024-11-22 05:02:26,562 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:26" (1/1) ... [2024-11-22 05:02:26,566 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:26" (1/1) ... [2024-11-22 05:02:26,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:26" (1/1) ... [2024-11-22 05:02:26,573 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:26" (1/1) ... [2024-11-22 05:02:26,576 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:26" (1/1) ... [2024-11-22 05:02:26,578 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 05:02:26,579 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 05:02:26,579 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 05:02:26,579 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 05:02:26,580 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:26" (1/1) ... [2024-11-22 05:02:26,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:02:26,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 05:02:26,610 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 05:02:26,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 05:02:26,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 05:02:26,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 05:02:26,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 05:02:26,656 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 05:02:26,718 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 05:02:26,720 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 05:02:26,848 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-22 05:02:26,848 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 05:02:26,864 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 05:02:26,865 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 05:02:26,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:02:26 BoogieIcfgContainer [2024-11-22 05:02:26,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 05:02:26,869 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 05:02:26,870 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 05:02:26,873 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 05:02:26,874 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 05:02:26" (1/3) ... [2024-11-22 05:02:26,874 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455df45e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:02:26, skipping insertion in model container [2024-11-22 05:02:26,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:02:26" (2/3) ... [2024-11-22 05:02:26,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@455df45e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:02:26, skipping insertion in model container [2024-11-22 05:02:26,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:02:26" (3/3) ... [2024-11-22 05:02:26,878 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.count2.c [2024-11-22 05:02:26,896 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 05:02:26,897 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 05:02:26,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 05:02:26,981 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;@792c06ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 05:02:26,981 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 05:02:26,987 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:26,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 05:02:26,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:02:26,994 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 05:02:26,994 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:02:26,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:02:27,000 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-22 05:02:27,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 05:02:27,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1723742533] [2024-11-22 05:02:27,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:02:27,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:02:27,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 05:02:27,018 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 05:02:27,021 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 05:02:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:02:27,102 INFO L255 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 05:02:27,113 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:02:27,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:02:27,261 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 05:02:27,262 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 05:02:27,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1723742533] [2024-11-22 05:02:27,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1723742533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:02:27,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:02:27,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 05:02:27,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231812383] [2024-11-22 05:02:27,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:02:27,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 05:02:27,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 05:02:27,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 05:02:27,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:02:27,301 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:27,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:02:27,365 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-22 05:02:27,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 05:02:27,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-22 05:02:27,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:02:27,375 INFO L225 Difference]: With dead ends: 18 [2024-11-22 05:02:27,375 INFO L226 Difference]: Without dead ends: 10 [2024-11-22 05:02:27,378 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 05:02:27,384 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:02:27,385 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:02:27,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-22 05:02:27,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-22 05:02:27,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:27,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-22 05:02:27,413 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-22 05:02:27,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:02:27,414 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-22 05:02:27,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:27,414 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-22 05:02:27,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 05:02:27,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:02:27,414 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-22 05:02:27,418 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 05:02:27,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:02:27,618 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:02:27,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:02:27,619 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-22 05:02:27,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 05:02:27,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506546201] [2024-11-22 05:02:27,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:02:27,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:02:27,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 05:02:27,631 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 05:02:27,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 05:02:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:02:27,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 05:02:27,709 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:02:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:02:27,878 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 05:02:27,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:02:27,958 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 05:02:27,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506546201] [2024-11-22 05:02:27,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506546201] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 05:02:27,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 05:02:27,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-22 05:02:27,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115925924] [2024-11-22 05:02:27,959 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 05:02:27,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 05:02:27,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 05:02:27,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 05:02:27,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-22 05:02:27,963 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:28,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:02:28,083 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-22 05:02:28,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 05:02:28,084 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-22 05:02:28,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:02:28,085 INFO L225 Difference]: With dead ends: 18 [2024-11-22 05:02:28,085 INFO L226 Difference]: Without dead ends: 16 [2024-11-22 05:02:28,086 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-22 05:02:28,088 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:02:28,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 14 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:02:28,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-22 05:02:28,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-22 05:02:28,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:28,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-22 05:02:28,095 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-22 05:02:28,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:02:28,096 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-22 05:02:28,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:28,096 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-22 05:02:28,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 05:02:28,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:02:28,097 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-22 05:02:28,101 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 05:02:28,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:02:28,298 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:02:28,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:02:28,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times [2024-11-22 05:02:28,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 05:02:28,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [355276452] [2024-11-22 05:02:28,300 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 05:02:28,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:02:28,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 05:02:28,302 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 05:02:28,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 05:02:28,340 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 05:02:28,340 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 05:02:28,342 INFO L255 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 05:02:28,345 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:02:28,532 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:02:28,532 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 05:02:28,652 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:02:28,653 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 05:02:28,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [355276452] [2024-11-22 05:02:28,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [355276452] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 05:02:28,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 05:02:28,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-22 05:02:28,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294718038] [2024-11-22 05:02:28,654 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 05:02:28,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 05:02:28,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 05:02:28,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 05:02:28,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-22 05:02:28,655 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:28,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:02:28,921 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-22 05:02:28,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 05:02:28,922 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 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 14 [2024-11-22 05:02:28,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:02:28,923 INFO L225 Difference]: With dead ends: 30 [2024-11-22 05:02:28,923 INFO L226 Difference]: Without dead ends: 28 [2024-11-22 05:02:28,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2024-11-22 05:02:28,924 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 10 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 05:02:28,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 26 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 05:02:28,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-22 05:02:28,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-22 05:02:28,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:28,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-22 05:02:28,931 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2024-11-22 05:02:28,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:02:28,931 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-22 05:02:28,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:02:28,931 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-22 05:02:28,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-22 05:02:28,932 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:02:28,932 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2024-11-22 05:02:28,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-22 05:02:29,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:02:29,132 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:02:29,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:02:29,133 INFO L85 PathProgramCache]: Analyzing trace with hash 96933411, now seen corresponding path program 3 times [2024-11-22 05:02:29,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 05:02:29,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649441406] [2024-11-22 05:02:29,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 05:02:29,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:02:29,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 05:02:29,138 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 05:02:29,139 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 (5)] Waiting until timeout for monitored process [2024-11-22 05:02:29,208 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-22 05:02:29,208 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 05:02:29,208 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 05:02:29,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 05:02:29,265 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-22 05:02:29,265 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 05:02:29,266 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 05:02:29,275 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 (5)] Ended with exit code 0 [2024-11-22 05:02:29,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:02:29,471 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-11-22 05:02:29,492 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 05:02:29,494 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 05:02:29 BoogieIcfgContainer [2024-11-22 05:02:29,495 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 05:02:29,495 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 05:02:29,495 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 05:02:29,495 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 05:02:29,496 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:02:26" (3/4) ... [2024-11-22 05:02:29,496 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 05:02:29,581 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 05:02:29,581 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 05:02:29,582 INFO L158 Benchmark]: Toolchain (without parser) took 3399.46ms. Allocated memory was 75.5MB in the beginning and 100.7MB in the end (delta: 25.2MB). Free memory was 46.4MB in the beginning and 75.8MB in the end (delta: -29.4MB). Peak memory consumption was 26.3MB. Max. memory is 16.1GB. [2024-11-22 05:02:29,582 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 52.4MB. Free memory is still 31.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 05:02:29,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 324.35ms. Allocated memory is still 75.5MB. Free memory was 46.2MB in the beginning and 52.8MB in the end (delta: -6.6MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. [2024-11-22 05:02:29,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.05ms. Allocated memory is still 75.5MB. Free memory was 52.8MB in the beginning and 51.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 05:02:29,583 INFO L158 Benchmark]: Boogie Preprocessor took 41.44ms. Allocated memory is still 75.5MB. Free memory was 51.4MB in the beginning and 49.6MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 05:02:29,583 INFO L158 Benchmark]: RCFGBuilder took 287.03ms. Allocated memory is still 75.5MB. Free memory was 49.6MB in the beginning and 38.9MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-22 05:02:29,583 INFO L158 Benchmark]: TraceAbstraction took 2625.84ms. Allocated memory was 75.5MB in the beginning and 100.7MB in the end (delta: 25.2MB). Free memory was 38.2MB in the beginning and 47.5MB in the end (delta: -9.3MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. [2024-11-22 05:02:29,583 INFO L158 Benchmark]: Witness Printer took 86.19ms. Allocated memory is still 100.7MB. Free memory was 47.5MB in the beginning and 75.8MB in the end (delta: -28.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 05:02:29,593 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 31.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 324.35ms. Allocated memory is still 75.5MB. Free memory was 46.2MB in the beginning and 52.8MB in the end (delta: -6.6MB). Peak memory consumption was 13.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.05ms. Allocated memory is still 75.5MB. Free memory was 52.8MB in the beginning and 51.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 41.44ms. Allocated memory is still 75.5MB. Free memory was 51.4MB in the beginning and 49.6MB in the end (delta: 1.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 287.03ms. Allocated memory is still 75.5MB. Free memory was 49.6MB in the beginning and 38.9MB in the end (delta: 10.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 2625.84ms. Allocated memory was 75.5MB in the beginning and 100.7MB in the end (delta: 25.2MB). Free memory was 38.2MB in the beginning and 47.5MB in the end (delta: -9.3MB). Peak memory consumption was 14.6MB. Max. memory is 16.1GB. * Witness Printer took 86.19ms. Allocated memory is still 100.7MB. Free memory was 47.5MB in the beginning and 75.8MB in the end (delta: -28.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 22]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 3); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (3 - 1); [L30] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 1); [L31] const SORT_9 msb_SORT_9 = (SORT_9)1 << (1 - 1); [L33] const SORT_1 var_2 = 0; [L34] const SORT_1 var_5 = 1; [L35] const SORT_1 var_8 = mask_SORT_1; [L38] SORT_1 state_3 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L40] SORT_1 init_4_arg_1 = var_2; [L41] state_3 = init_4_arg_1 VAL [mask_SORT_1=7, state_3=0, var_5=1, var_8=7] [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND FALSE !(!(cond)) [L50] RET __VERIFIER_assert(!(bad_11_arg_0)) [L52] SORT_1 var_6_arg_0 = state_3; [L53] SORT_1 var_6_arg_1 = var_5; [L54] SORT_1 var_6 = var_6_arg_0 + var_6_arg_1; [L55] var_6 = var_6 & mask_SORT_1 [L56] SORT_1 next_7_arg_1 = var_6; [L58] state_3 = next_7_arg_1 [L46] SORT_1 var_10_arg_0 = state_3; [L47] SORT_1 var_10_arg_1 = var_8; [L48] SORT_9 var_10 = var_10_arg_0 == var_10_arg_1; [L49] SORT_9 bad_11_arg_0 = var_10; [L50] CALL __VERIFIER_assert(!(bad_11_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.5s, OverallIterations: 4, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 51 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 39 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 117 IncrementalHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 12 mSDtfsCounter, 117 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=3, InterpolantAutomatonStates: 28, 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, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 498 SizeOfPredicates, 11 NumberOfNonLiveVariables, 119 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 5 InterpolantComputations, 1 PerfectInterpolantSequences, 0/34 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 proved your program to be incorrect! [2024-11-22 05:02:29,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE