./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 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.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.fs.icfgbuilder-eval-3289d67-m [2024-11-16 10:52:33,192 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 10:52:33,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-16 10:52:33,263 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 10:52:33,265 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 10:52:33,293 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 10:52:33,295 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 10:52:33,295 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 10:52:33,296 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 10:52:33,297 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 10:52:33,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 10:52:33,298 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 10:52:33,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 10:52:33,301 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 10:52:33,301 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 10:52:33,301 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 10:52:33,301 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 10:52:33,302 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 10:52:33,302 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 10:52:33,302 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 10:52:33,302 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 10:52:33,306 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 10:52:33,306 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 10:52:33,306 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 10:52:33,307 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 10:52:33,307 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 10:52:33,307 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 10:52:33,307 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 10:52:33,308 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 10:52:33,308 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:52:33,308 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 10:52:33,308 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 10:52:33,308 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 10:52:33,309 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 10:52:33,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 10:52:33,309 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 10:52:33,309 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 10:52:33,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 10:52:33,310 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 10:52:33,310 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-16 10:52:33,604 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 10:52:33,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 10:52:33,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 10:52:33,633 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 10:52:33,633 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 10:52:33,634 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-16 10:52:34,971 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 10:52:35,187 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 10:52:35,187 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count2.c [2024-11-16 10:52:35,194 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7bd4c86f/b76ab3f815694abdace97e2ef26f7b61/FLAG907b0bd43 [2024-11-16 10:52:35,212 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7bd4c86f/b76ab3f815694abdace97e2ef26f7b61 [2024-11-16 10:52:35,217 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 10:52:35,219 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 10:52:35,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 10:52:35,223 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 10:52:35,228 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 10:52:35,229 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:52:35" (1/1) ... [2024-11-16 10:52:35,230 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ab4ef61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:52:35, skipping insertion in model container [2024-11-16 10:52:35,230 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:52:35" (1/1) ... [2024-11-16 10:52:35,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 10:52:35,422 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-16 10:52:35,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:52:35,452 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 10:52:35,462 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-16 10:52:35,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:52:35,486 INFO L204 MainTranslator]: Completed translation [2024-11-16 10:52:35,487 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:52:35 WrapperNode [2024-11-16 10:52:35,488 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 10:52:35,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 10:52:35,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 10:52:35,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 10:52:35,497 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:52:35" (1/1) ... [2024-11-16 10:52:35,503 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:52:35" (1/1) ... [2024-11-16 10:52:35,529 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 57 [2024-11-16 10:52:35,529 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 10:52:35,530 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 10:52:35,530 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 10:52:35,530 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 10:52:35,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:52:35" (1/1) ... [2024-11-16 10:52:35,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:52:35" (1/1) ... [2024-11-16 10:52:35,545 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:52:35" (1/1) ... [2024-11-16 10:52:35,571 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-16 10:52:35,571 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:52:35" (1/1) ... [2024-11-16 10:52:35,571 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:52:35" (1/1) ... [2024-11-16 10:52:35,579 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:52:35" (1/1) ... [2024-11-16 10:52:35,580 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:52:35" (1/1) ... [2024-11-16 10:52:35,581 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:52:35" (1/1) ... [2024-11-16 10:52:35,582 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:52:35" (1/1) ... [2024-11-16 10:52:35,584 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 10:52:35,585 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 10:52:35,586 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 10:52:35,586 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 10:52:35,587 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:52:35" (1/1) ... [2024-11-16 10:52:35,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:52:35,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:52:35,634 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-16 10:52:35,637 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-16 10:52:35,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 10:52:35,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 10:52:35,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 10:52:35,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 10:52:35,771 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 10:52:35,783 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 10:52:35,987 INFO L? ?]: Removed 26 outVars from TransFormulas that were not future-live. [2024-11-16 10:52:35,988 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 10:52:36,014 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 10:52:36,014 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 10:52:36,015 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:52:36 BoogieIcfgContainer [2024-11-16 10:52:36,015 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 10:52:36,017 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 10:52:36,017 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 10:52:36,020 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 10:52:36,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:52:35" (1/3) ... [2024-11-16 10:52:36,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18e3d864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:52:36, skipping insertion in model container [2024-11-16 10:52:36,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:52:35" (2/3) ... [2024-11-16 10:52:36,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18e3d864 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:52:36, skipping insertion in model container [2024-11-16 10:52:36,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:52:36" (3/3) ... [2024-11-16 10:52:36,022 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.count2.c [2024-11-16 10:52:36,042 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 10:52:36,043 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 10:52:36,116 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 10:52:36,125 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;@69804fd7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 10:52:36,126 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 10:52:36,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 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-16 10:52:36,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-16 10:52:36,137 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:52:36,138 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:52:36,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:52:36,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:52:36,146 INFO L85 PathProgramCache]: Analyzing trace with hash 194694780, now seen corresponding path program 1 times [2024-11-16 10:52:36,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:52:36,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610196277] [2024-11-16 10:52:36,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:36,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:52:36,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:36,656 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-16 10:52:36,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:52:36,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610196277] [2024-11-16 10:52:36,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610196277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:52:36,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:52:36,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:52:36,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512328749] [2024-11-16 10:52:36,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:52:36,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:52:36,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:52:36,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:52:36,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:52:36,683 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 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) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:52:36,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:52:36,738 INFO L93 Difference]: Finished difference Result 34 states and 45 transitions. [2024-11-16 10:52:36,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:52:36,740 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-16 10:52:36,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:52:36,747 INFO L225 Difference]: With dead ends: 34 [2024-11-16 10:52:36,747 INFO L226 Difference]: Without dead ends: 19 [2024-11-16 10:52:36,750 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-16 10:52:36,753 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 6 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 10:52:36,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 49 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 10:52:36,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2024-11-16 10:52:36,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2024-11-16 10:52:36,781 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-16 10:52:36,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2024-11-16 10:52:36,782 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 8 [2024-11-16 10:52:36,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:52:36,783 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2024-11-16 10:52:36,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:52:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2024-11-16 10:52:36,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-16 10:52:36,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:52:36,784 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:52:36,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 10:52:36,784 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:52:36,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:52:36,785 INFO L85 PathProgramCache]: Analyzing trace with hash 61717544, now seen corresponding path program 1 times [2024-11-16 10:52:36,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:52:36,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943868297] [2024-11-16 10:52:36,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:36,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:52:36,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:37,068 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-16 10:52:37,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:52:37,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943868297] [2024-11-16 10:52:37,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943868297] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:52:37,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [777173972] [2024-11-16 10:52:37,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:37,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:52:37,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:52:37,073 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-16 10:52:37,074 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-16 10:52:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:37,160 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-16 10:52:37,175 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:52:37,466 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-16 10:52:37,468 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:52:37,665 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-16 10:52:37,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [777173972] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:52:37,665 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 10:52:37,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 7] total 13 [2024-11-16 10:52:37,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837097154] [2024-11-16 10:52:37,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 10:52:37,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 10:52:37,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:52:37,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 10:52:37,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-16 10:52:37,669 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:52:37,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:52:37,751 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2024-11-16 10:52:37,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 10:52:37,752 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-16 10:52:37,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:52:37,752 INFO L225 Difference]: With dead ends: 25 [2024-11-16 10:52:37,752 INFO L226 Difference]: Without dead ends: 22 [2024-11-16 10:52:37,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2024-11-16 10:52:37,754 INFO L432 NwaCegarLoop]: 13 mSDtfsCounter, 30 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 10:52:37,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 73 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 10:52:37,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2024-11-16 10:52:37,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2024-11-16 10:52:37,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 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-16 10:52:37,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2024-11-16 10:52:37,759 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 13 [2024-11-16 10:52:37,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:52:37,759 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2024-11-16 10:52:37,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:52:37,760 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2024-11-16 10:52:37,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-16 10:52:37,760 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:52:37,760 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:52:37,773 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-16 10:52:37,963 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-16 10:52:37,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:52:37,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:52:37,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2100184568, now seen corresponding path program 1 times [2024-11-16 10:52:37,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:52:37,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168513487] [2024-11-16 10:52:37,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:37,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:52:37,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:38,137 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-16 10:52:38,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:52:38,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168513487] [2024-11-16 10:52:38,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168513487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:52:38,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:52:38,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 10:52:38,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753173924] [2024-11-16 10:52:38,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:52:38,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 10:52:38,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:52:38,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 10:52:38,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:52:38,139 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-16 10:52:38,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:52:38,203 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2024-11-16 10:52:38,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 10:52:38,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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 14 [2024-11-16 10:52:38,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:52:38,204 INFO L225 Difference]: With dead ends: 38 [2024-11-16 10:52:38,205 INFO L226 Difference]: Without dead ends: 25 [2024-11-16 10:52:38,205 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-16 10:52:38,207 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 5 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 24 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.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:52:38,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 24 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:52:38,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2024-11-16 10:52:38,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2024-11-16 10:52:38,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 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-16 10:52:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2024-11-16 10:52:38,215 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 14 [2024-11-16 10:52:38,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:52:38,215 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2024-11-16 10:52:38,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 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-16 10:52:38,215 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2024-11-16 10:52:38,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 10:52:38,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:52:38,217 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:52:38,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 10:52:38,218 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:52:38,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:52:38,219 INFO L85 PathProgramCache]: Analyzing trace with hash -219754866, now seen corresponding path program 1 times [2024-11-16 10:52:38,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:52:38,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859028309] [2024-11-16 10:52:38,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:38,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:52:38,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:38,716 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-16 10:52:38,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:52:38,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859028309] [2024-11-16 10:52:38,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859028309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:52:38,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646901875] [2024-11-16 10:52:38,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:38,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:52:38,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:52:38,721 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-16 10:52:38,722 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-16 10:52:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:38,789 WARN L253 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-16 10:52:38,793 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:52:39,132 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-16 10:52:39,132 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:52:39,573 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-16 10:52:39,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646901875] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:52:39,574 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 10:52:39,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 25 [2024-11-16 10:52:39,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255771824] [2024-11-16 10:52:39,574 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 10:52:39,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-16 10:52:39,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:52:39,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-16 10:52:39,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=511, Unknown=0, NotChecked=0, Total=600 [2024-11-16 10:52:39,580 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 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-16 10:52:39,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:52:39,801 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2024-11-16 10:52:39,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-16 10:52:39,802 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 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 15 [2024-11-16 10:52:39,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:52:39,803 INFO L225 Difference]: With dead ends: 42 [2024-11-16 10:52:39,803 INFO L226 Difference]: Without dead ends: 29 [2024-11-16 10:52:39,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=109, Invalid=593, Unknown=0, NotChecked=0, Total=702 [2024-11-16 10:52:39,805 INFO L432 NwaCegarLoop]: 7 mSDtfsCounter, 15 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:52:39,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 73 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:52:39,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-16 10:52:39,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2024-11-16 10:52:39,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 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-16 10:52:39,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2024-11-16 10:52:39,809 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 15 [2024-11-16 10:52:39,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:52:39,809 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2024-11-16 10:52:39,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.52) internal successors, (38), 25 states have internal predecessors, (38), 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-16 10:52:39,810 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2024-11-16 10:52:39,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-16 10:52:39,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:52:39,811 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:52:39,828 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 10:52:40,014 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-16 10:52:40,015 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:52:40,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:52:40,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1940549770, now seen corresponding path program 1 times [2024-11-16 10:52:40,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:52:40,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227329947] [2024-11-16 10:52:40,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:40,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:52:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:40,343 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-16 10:52:40,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:52:40,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227329947] [2024-11-16 10:52:40,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227329947] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:52:40,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231665178] [2024-11-16 10:52:40,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:40,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:52:40,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:52:40,348 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-16 10:52:40,350 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-16 10:52:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:40,444 WARN L253 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-16 10:52:40,448 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:52:40,754 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-16 10:52:40,754 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:52:45,359 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:52:45,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231665178] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:52:45,360 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 10:52:45,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 12] total 26 [2024-11-16 10:52:45,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136902503] [2024-11-16 10:52:45,361 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 10:52:45,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-16 10:52:45,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:52:45,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-16 10:52:45,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=548, Unknown=0, NotChecked=0, Total=650 [2024-11-16 10:52:45,365 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 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-16 10:52:45,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:52:45,658 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2024-11-16 10:52:45,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-16 10:52:45,659 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 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-16 10:52:45,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:52:45,659 INFO L225 Difference]: With dead ends: 54 [2024-11-16 10:52:45,659 INFO L226 Difference]: Without dead ends: 41 [2024-11-16 10:52:45,660 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2024-11-16 10:52:45,661 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 18 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 10:52:45,661 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 60 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 10:52:45,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-16 10:52:45,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-11-16 10:52:45,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.1891891891891893) internal successors, (44), 37 states have internal predecessors, (44), 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-16 10:52:45,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-16 10:52:45,666 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 21 [2024-11-16 10:52:45,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:52:45,666 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-16 10:52:45,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0384615384615383) internal successors, (53), 26 states have internal predecessors, (53), 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-16 10:52:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-16 10:52:45,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-16 10:52:45,667 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:52:45,667 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:52:45,683 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-16 10:52:45,871 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-16 10:52:45,872 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:52:45,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:52:45,872 INFO L85 PathProgramCache]: Analyzing trace with hash -873466308, now seen corresponding path program 2 times [2024-11-16 10:52:45,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:52:45,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285948051] [2024-11-16 10:52:45,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:45,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:52:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:46,530 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-16 10:52:46,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:52:46,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285948051] [2024-11-16 10:52:46,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285948051] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:52:46,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109646217] [2024-11-16 10:52:46,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 10:52:46,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:52:46,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:52:46,533 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-16 10:52:46,535 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-16 10:52:46,635 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 10:52:46,635 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 10:52:46,637 WARN L253 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-16 10:52:46,641 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:52:47,325 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-16 10:52:47,326 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:52:53,371 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-16 10:52:53,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109646217] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:52:53,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 10:52:53,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14, 17] total 38 [2024-11-16 10:52:53,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966037482] [2024-11-16 10:52:53,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 10:52:53,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2024-11-16 10:52:53,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:52:53,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2024-11-16 10:52:53,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=1239, Unknown=0, NotChecked=0, Total=1406 [2024-11-16 10:52:53,374 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 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-16 10:52:54,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:52:54,261 INFO L93 Difference]: Finished difference Result 46 states and 52 transitions. [2024-11-16 10:52:54,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-16 10:52:54,262 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-16 10:52:54,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:52:54,262 INFO L225 Difference]: With dead ends: 46 [2024-11-16 10:52:54,262 INFO L226 Difference]: Without dead ends: 43 [2024-11-16 10:52:54,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=238, Invalid=1654, Unknown=0, NotChecked=0, Total=1892 [2024-11-16 10:52:54,264 INFO L432 NwaCegarLoop]: 6 mSDtfsCounter, 16 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 10:52:54,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 108 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 10:52:54,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-11-16 10:52:54,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2024-11-16 10:52:54,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 states have internal predecessors, (44), 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-16 10:52:54,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-11-16 10:52:54,275 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 22 [2024-11-16 10:52:54,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:52:54,275 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-16 10:52:54,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.5526315789473684) internal successors, (59), 38 states have internal predecessors, (59), 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-16 10:52:54,275 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-11-16 10:52:54,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-16 10:52:54,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:52:54,276 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:52:54,289 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-16 10:52:54,476 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-16 10:52:54,477 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:52:54,477 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:52:54,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1296286436, now seen corresponding path program 1 times [2024-11-16 10:52:54,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:52:54,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960917950] [2024-11-16 10:52:54,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:54,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:52:54,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:54,651 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 10:52:54,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:52:54,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960917950] [2024-11-16 10:52:54,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960917950] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:52:54,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433768429] [2024-11-16 10:52:54,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:54,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:52:54,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:52:54,653 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-16 10:52:54,655 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-16 10:52:54,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:54,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-16 10:52:54,733 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:52:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 22 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 10:52:54,944 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:52:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 20 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-16 10:52:55,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433768429] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:52:55,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 10:52:55,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 17 [2024-11-16 10:52:55,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210221609] [2024-11-16 10:52:55,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 10:52:55,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-16 10:52:55,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:52:55,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-16 10:52:55,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2024-11-16 10:52:55,149 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 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-16 10:52:55,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:52:55,313 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2024-11-16 10:52:55,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 10:52:55,314 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 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 33 [2024-11-16 10:52:55,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:52:55,315 INFO L225 Difference]: With dead ends: 68 [2024-11-16 10:52:55,315 INFO L226 Difference]: Without dead ends: 55 [2024-11-16 10:52:55,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2024-11-16 10:52:55,316 INFO L432 NwaCegarLoop]: 8 mSDtfsCounter, 17 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:52:55,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 52 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:52:55,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-16 10:52:55,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-11-16 10:52:55,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1568627450980393) internal successors, (59), 51 states have internal predecessors, (59), 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-16 10:52:55,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2024-11-16 10:52:55,322 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 33 [2024-11-16 10:52:55,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:52:55,322 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2024-11-16 10:52:55,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 3.4705882352941178) internal successors, (59), 17 states have internal predecessors, (59), 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-16 10:52:55,323 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2024-11-16 10:52:55,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-16 10:52:55,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:52:55,323 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:52:55,341 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-16 10:52:55,524 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-16 10:52:55,525 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:52:55,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:52:55,525 INFO L85 PathProgramCache]: Analyzing trace with hash 629206818, now seen corresponding path program 1 times [2024-11-16 10:52:55,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:52:55,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860058881] [2024-11-16 10:52:55,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:55,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:52:55,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:55,804 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 10:52:55,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:52:55,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860058881] [2024-11-16 10:52:55,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860058881] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:52:55,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416095235] [2024-11-16 10:52:55,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:55,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:52:55,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:52:55,806 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 10:52:55,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-16 10:52:55,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:55,912 INFO L255 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-16 10:52:55,914 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:52:56,058 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 33 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2024-11-16 10:52:56,058 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:52:56,258 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 30 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-16 10:52:56,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416095235] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:52:56,258 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 10:52:56,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 7] total 15 [2024-11-16 10:52:56,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439768037] [2024-11-16 10:52:56,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 10:52:56,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-16 10:52:56,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:52:56,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-16 10:52:56,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=157, Unknown=0, NotChecked=0, Total=210 [2024-11-16 10:52:56,261 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 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-16 10:52:56,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:52:56,337 INFO L93 Difference]: Finished difference Result 68 states and 79 transitions. [2024-11-16 10:52:56,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-16 10:52:56,338 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 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-16 10:52:56,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:52:56,338 INFO L225 Difference]: With dead ends: 68 [2024-11-16 10:52:56,339 INFO L226 Difference]: Without dead ends: 45 [2024-11-16 10:52:56,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=201, Unknown=0, NotChecked=0, Total=272 [2024-11-16 10:52:56,340 INFO L432 NwaCegarLoop]: 9 mSDtfsCounter, 22 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:52:56,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 31 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:52:56,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-11-16 10:52:56,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-11-16 10:52:56,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.1136363636363635) internal successors, (49), 44 states have internal predecessors, (49), 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-16 10:52:56,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2024-11-16 10:52:56,346 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 34 [2024-11-16 10:52:56,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:52:56,346 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2024-11-16 10:52:56,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.4) internal successors, (66), 15 states have internal predecessors, (66), 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-16 10:52:56,346 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2024-11-16 10:52:56,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-16 10:52:56,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:52:56,347 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:52:56,360 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-16 10:52:56,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:52:56,548 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:52:56,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:52:56,549 INFO L85 PathProgramCache]: Analyzing trace with hash -712777526, now seen corresponding path program 2 times [2024-11-16 10:52:56,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:52:56,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767763177] [2024-11-16 10:52:56,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:52:56,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:52:56,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:52:57,487 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:52:57,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:52:57,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767763177] [2024-11-16 10:52:57,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767763177] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:52:57,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018549684] [2024-11-16 10:52:57,487 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 10:52:57,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:52:57,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:52:57,489 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 10:52:57,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-16 10:52:57,670 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 10:52:57,670 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 10:52:57,672 WARN L253 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 101 conjuncts are in the unsatisfiable core [2024-11-16 10:52:57,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:52:59,227 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-16 10:52:59,228 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:53:04,330 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-16 10:53:04,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018549684] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:53:04,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 10:53:04,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 17, 22] total 53 [2024-11-16 10:53:04,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375628502] [2024-11-16 10:53:04,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 10:53:04,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-16 10:53:04,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:04,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-16 10:53:04,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=2458, Unknown=0, NotChecked=0, Total=2756 [2024-11-16 10:53:04,334 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand has 53 states, 53 states have (on average 1.7547169811320755) internal successors, (93), 53 states have internal predecessors, (93), 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-16 10:53:05,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:05,924 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2024-11-16 10:53:05,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-16 10:53:05,924 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 1.7547169811320755) internal successors, (93), 53 states have internal predecessors, (93), 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 35 [2024-11-16 10:53:05,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:05,925 INFO L225 Difference]: With dead ends: 81 [2024-11-16 10:53:05,925 INFO L226 Difference]: Without dead ends: 65 [2024-11-16 10:53:05,926 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1285 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=419, Invalid=3241, Unknown=0, NotChecked=0, Total=3660 [2024-11-16 10:53:05,927 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 18 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:05,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 87 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-16 10:53:05,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-16 10:53:05,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2024-11-16 10:53:05,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 states have internal predecessors, (60), 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-16 10:53:05,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2024-11-16 10:53:05,940 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 35 [2024-11-16 10:53:05,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:05,943 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2024-11-16 10:53:05,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 1.7547169811320755) internal successors, (93), 53 states have internal predecessors, (93), 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-16 10:53:05,944 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2024-11-16 10:53:05,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-16 10:53:05,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:05,944 INFO L215 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:05,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-16 10:53:06,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:53:06,146 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:06,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:06,146 INFO L85 PathProgramCache]: Analyzing trace with hash -902914290, now seen corresponding path program 3 times [2024-11-16 10:53:06,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:06,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186831927] [2024-11-16 10:53:06,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:06,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:07,485 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 10:53:07,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 10:53:07,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186831927] [2024-11-16 10:53:07,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186831927] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 10:53:07,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771681880] [2024-11-16 10:53:07,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 10:53:07,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 10:53:07,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:53:07,487 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 10:53:07,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-16 10:53:07,573 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-16 10:53:07,573 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 10:53:07,574 WARN L253 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-16 10:53:07,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:53:08,358 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 15 proven. 29 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-16 10:53:08,358 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:53:10,716 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 3 proven. 41 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-16 10:53:10,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771681880] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:53:10,717 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 10:53:10,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 13, 14] total 44 [2024-11-16 10:53:10,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806058063] [2024-11-16 10:53:10,717 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 10:53:10,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-16 10:53:10,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 10:53:10,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-16 10:53:10,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=1714, Unknown=0, NotChecked=0, Total=1892 [2024-11-16 10:53:10,719 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 44 states, 44 states have (on average 2.0) internal successors, (88), 44 states have internal predecessors, (88), 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-16 10:53:11,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:11,910 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2024-11-16 10:53:11,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2024-11-16 10:53:11,911 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.0) internal successors, (88), 44 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2024-11-16 10:53:11,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:11,911 INFO L225 Difference]: With dead ends: 62 [2024-11-16 10:53:11,912 INFO L226 Difference]: Without dead ends: 59 [2024-11-16 10:53:11,913 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 890 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=582, Invalid=3840, Unknown=0, NotChecked=0, Total=4422 [2024-11-16 10:53:11,913 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 56 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:11,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 66 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 10:53:11,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-16 10:53:11,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-11-16 10:53:11,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 58 states have internal predecessors, (62), 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-16 10:53:11,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2024-11-16 10:53:11,920 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 43 [2024-11-16 10:53:11,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:11,921 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2024-11-16 10:53:11,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.0) internal successors, (88), 44 states have internal predecessors, (88), 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-16 10:53:11,921 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2024-11-16 10:53:11,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-16 10:53:11,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:11,922 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:11,938 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-16 10:53:12,123 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-16 10:53:12,123 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:12,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:12,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1078304056, now seen corresponding path program 3 times [2024-11-16 10:53:12,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 10:53:12,124 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772633595] [2024-11-16 10:53:12,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:12,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 10:53:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 10:53:12,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 10:53:12,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 10:53:12,327 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 10:53:12,327 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 10:53:12,328 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 10:53:12,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 10:53:12,333 INFO L407 BasicCegarLoop]: Path program histogram: [3, 3, 1, 1, 1, 1, 1] [2024-11-16 10:53:12,372 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 10:53:12,374 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 10:53:12 BoogieIcfgContainer [2024-11-16 10:53:12,375 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 10:53:12,375 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 10:53:12,375 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 10:53:12,375 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 10:53:12,376 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:52:36" (3/4) ... [2024-11-16 10:53:12,378 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 10:53:12,379 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 10:53:12,380 INFO L158 Benchmark]: Toolchain (without parser) took 37161.09ms. Allocated memory was 169.9MB in the beginning and 297.8MB in the end (delta: 127.9MB). Free memory was 138.9MB in the beginning and 178.3MB in the end (delta: -39.4MB). Peak memory consumption was 88.6MB. Max. memory is 16.1GB. [2024-11-16 10:53:12,380 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 109.1MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 10:53:12,380 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.96ms. Allocated memory is still 169.9MB. Free memory was 138.9MB in the beginning and 126.4MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 10:53:12,381 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.63ms. Allocated memory is still 169.9MB. Free memory was 126.4MB in the beginning and 124.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 10:53:12,381 INFO L158 Benchmark]: Boogie Preprocessor took 54.83ms. Allocated memory is still 169.9MB. Free memory was 124.3MB in the beginning and 122.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 10:53:12,381 INFO L158 Benchmark]: IcfgBuilder took 429.56ms. Allocated memory is still 169.9MB. Free memory was 122.2MB in the beginning and 132.8MB in the end (delta: -10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-16 10:53:12,382 INFO L158 Benchmark]: TraceAbstraction took 36358.08ms. Allocated memory was 169.9MB in the beginning and 297.8MB in the end (delta: 127.9MB). Free memory was 131.7MB in the beginning and 178.3MB in the end (delta: -46.6MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. [2024-11-16 10:53:12,382 INFO L158 Benchmark]: Witness Printer took 4.05ms. Allocated memory is still 297.8MB. Free memory is still 178.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 10:53:12,383 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.19ms. Allocated memory is still 109.1MB. Free memory is still 79.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.96ms. Allocated memory is still 169.9MB. Free memory was 138.9MB in the beginning and 126.4MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.63ms. Allocated memory is still 169.9MB. Free memory was 126.4MB in the beginning and 124.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 54.83ms. Allocated memory is still 169.9MB. Free memory was 124.3MB in the beginning and 122.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 429.56ms. Allocated memory is still 169.9MB. Free memory was 122.2MB in the beginning and 132.8MB in the end (delta: -10.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 36358.08ms. Allocated memory was 169.9MB in the beginning and 297.8MB in the end (delta: 127.9MB). Free memory was 131.7MB in the beginning and 178.3MB in the end (delta: -46.6MB). Peak memory consumption was 84.5MB. Max. memory is 16.1GB. * Witness Printer took 4.05ms. Allocated memory is still 297.8MB. Free memory is still 178.3MB. 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, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 36.2s, OverallIterations: 11, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 203 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 203 mSDsluCounter, 623 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 543 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1981 IncrementalHoareTripleChecker+Invalid, 2034 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 80 mSDtfsCounter, 1981 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 579 GetRequests, 300 SyntacticMatches, 5 SemanticMatches, 274 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3359 ImplicationChecksByTransitivity, 15.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred in iteration=10, InterpolantAutomatonStates: 130, 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, 10 MinimizatonAttempts, 28 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 28.2s InterpolantComputationTime, 510 NumberOfCodeBlocks, 489 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 644 ConstructedInterpolants, 17 QuantifiedInterpolants, 15248 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1009 ConjunctsInSsa, 425 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 332/716 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-16 10:53:12,433 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.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.fs.icfgbuilder-eval-3289d67-m [2024-11-16 10:53:14,584 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 10:53:14,654 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-16 10:53:14,660 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 10:53:14,660 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 10:53:14,687 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 10:53:14,688 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 10:53:14,688 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 10:53:14,689 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 10:53:14,689 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 10:53:14,689 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 10:53:14,690 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 10:53:14,690 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 10:53:14,691 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 10:53:14,691 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 10:53:14,692 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 10:53:14,692 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 10:53:14,692 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 10:53:14,693 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 10:53:14,693 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 10:53:14,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 10:53:14,697 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 10:53:14,698 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 10:53:14,698 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 10:53:14,698 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 10:53:14,699 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 10:53:14,699 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 10:53:14,700 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 10:53:14,700 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 10:53:14,700 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 10:53:14,701 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 10:53:14,701 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:53:14,701 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 10:53:14,702 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 10:53:14,702 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 10:53:14,702 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 10:53:14,703 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 10:53:14,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 10:53:14,703 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 10:53:14,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 10:53:14,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 10:53:14,705 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-16 10:53:15,025 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 10:53:15,055 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 10:53:15,059 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 10:53:15,060 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 10:53:15,061 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 10:53:15,063 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-16 10:53:16,675 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 10:53:16,884 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 10:53:16,885 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.count2.c [2024-11-16 10:53:16,899 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7dc7fc5/f71575d37c5c4eba852b29e72808af72/FLAGe20b92101 [2024-11-16 10:53:16,918 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7dc7fc5/f71575d37c5c4eba852b29e72808af72 [2024-11-16 10:53:16,921 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 10:53:16,922 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 10:53:16,926 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 10:53:16,927 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 10:53:16,932 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 10:53:16,933 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:53:16" (1/1) ... [2024-11-16 10:53:16,934 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3accaff2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:16, skipping insertion in model container [2024-11-16 10:53:16,934 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 10:53:16" (1/1) ... [2024-11-16 10:53:16,956 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 10:53:17,156 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-16 10:53:17,184 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:53:17,197 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 10:53:17,209 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-16 10:53:17,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 10:53:17,236 INFO L204 MainTranslator]: Completed translation [2024-11-16 10:53:17,236 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:17 WrapperNode [2024-11-16 10:53:17,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 10:53:17,238 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 10:53:17,238 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 10:53:17,238 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 10:53:17,245 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:17" (1/1) ... [2024-11-16 10:53:17,253 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:17" (1/1) ... [2024-11-16 10:53:17,271 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 41 [2024-11-16 10:53:17,271 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 10:53:17,272 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 10:53:17,272 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 10:53:17,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 10:53:17,283 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:17" (1/1) ... [2024-11-16 10:53:17,283 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:17" (1/1) ... [2024-11-16 10:53:17,286 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:17" (1/1) ... [2024-11-16 10:53:17,302 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-16 10:53:17,302 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:17" (1/1) ... [2024-11-16 10:53:17,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:17" (1/1) ... [2024-11-16 10:53:17,306 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:17" (1/1) ... [2024-11-16 10:53:17,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:17" (1/1) ... [2024-11-16 10:53:17,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:17" (1/1) ... [2024-11-16 10:53:17,309 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:17" (1/1) ... [2024-11-16 10:53:17,311 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 10:53:17,311 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 10:53:17,312 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 10:53:17,312 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 10:53:17,312 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:17" (1/1) ... [2024-11-16 10:53:17,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 10:53:17,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 10:53:17,345 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-16 10:53:17,348 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-16 10:53:17,394 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 10:53:17,394 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 10:53:17,394 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 10:53:17,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 10:53:17,474 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 10:53:17,476 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 10:53:17,623 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-11-16 10:53:17,625 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 10:53:17,638 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 10:53:17,638 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 10:53:17,639 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:53:17 BoogieIcfgContainer [2024-11-16 10:53:17,640 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 10:53:17,642 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 10:53:17,643 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 10:53:17,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 10:53:17,646 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 10:53:16" (1/3) ... [2024-11-16 10:53:17,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50cd7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:53:17, skipping insertion in model container [2024-11-16 10:53:17,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 10:53:17" (2/3) ... [2024-11-16 10:53:17,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50cd7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 10:53:17, skipping insertion in model container [2024-11-16 10:53:17,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:53:17" (3/3) ... [2024-11-16 10:53:17,650 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.count2.c [2024-11-16 10:53:17,665 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 10:53:17,666 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 10:53:17,725 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 10:53:17,733 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;@2f790378, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 10:53:17,733 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 10:53:17,738 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:17,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-16 10:53:17,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:17,745 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-16 10:53:17,746 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:17,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:17,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1271070717, now seen corresponding path program 1 times [2024-11-16 10:53:17,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 10:53:17,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1039062284] [2024-11-16 10:53:17,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:17,765 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-16 10:53:17,765 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 10:53:17,768 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-16 10:53:17,770 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-16 10:53:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:17,843 INFO L255 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-16 10:53:17,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:53:18,015 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-16 10:53:18,016 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 10:53:18,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 10:53:18,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1039062284] [2024-11-16 10:53:18,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1039062284] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 10:53:18,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 10:53:18,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 10:53:18,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268927882] [2024-11-16 10:53:18,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 10:53:18,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 10:53:18,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 10:53:18,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 10:53:18,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 10:53:18,053 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:18,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:18,104 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2024-11-16 10:53:18,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 10:53:18,107 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-16 10:53:18,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:18,113 INFO L225 Difference]: With dead ends: 22 [2024-11-16 10:53:18,113 INFO L226 Difference]: Without dead ends: 11 [2024-11-16 10:53:18,116 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-16 10:53:18,120 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 2 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:18,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 14 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 10:53:18,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2024-11-16 10:53:18,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 10. [2024-11-16 10:53:18,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:18,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2024-11-16 10:53:18,148 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2024-11-16 10:53:18,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:18,148 INFO L471 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2024-11-16 10:53:18,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:18,149 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2024-11-16 10:53:18,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-16 10:53:18,149 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:18,149 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 10:53:18,153 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-16 10:53:18,350 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-16 10:53:18,351 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:18,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:18,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2061110753, now seen corresponding path program 1 times [2024-11-16 10:53:18,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 10:53:18,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756075657] [2024-11-16 10:53:18,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 10:53:18,354 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-16 10:53:18,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 10:53:18,356 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-16 10:53:18,375 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-16 10:53:18,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 10:53:18,436 INFO L255 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-16 10:53:18,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:53:18,630 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-16 10:53:18,631 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:53:18,736 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-16 10:53:18,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 10:53:18,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756075657] [2024-11-16 10:53:18,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756075657] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:53:18,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 10:53:18,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-16 10:53:18,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147177290] [2024-11-16 10:53:18,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 10:53:18,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-16 10:53:18,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 10:53:18,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-16 10:53:18,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-16 10:53:18,740 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:18,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:18,882 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-11-16 10:53:18,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-16 10:53:18,884 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-16 10:53:18,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:18,884 INFO L225 Difference]: With dead ends: 20 [2024-11-16 10:53:18,885 INFO L226 Difference]: Without dead ends: 17 [2024-11-16 10:53:18,885 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-16 10:53:18,886 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 6 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:18,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:53:18,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2024-11-16 10:53:18,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2024-11-16 10:53:18,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 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-16 10:53:18,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2024-11-16 10:53:18,896 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2024-11-16 10:53:18,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:18,897 INFO L471 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2024-11-16 10:53:18,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 10:53:18,897 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2024-11-16 10:53:18,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-16 10:53:18,898 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:18,898 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1] [2024-11-16 10:53:18,904 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-16 10:53:19,099 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-16 10:53:19,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:19,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:19,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1989777505, now seen corresponding path program 2 times [2024-11-16 10:53:19,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 10:53:19,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735391451] [2024-11-16 10:53:19,102 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 10:53:19,102 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-16 10:53:19,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 10:53:19,105 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-16 10:53:19,106 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-16 10:53:19,178 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 10:53:19,178 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 10:53:19,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-16 10:53:19,185 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 10:53:19,453 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-16 10:53:19,454 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 10:53:19,620 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-16 10:53:19,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 10:53:19,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735391451] [2024-11-16 10:53:19,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735391451] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 10:53:19,623 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-16 10:53:19,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-16 10:53:19,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361784496] [2024-11-16 10:53:19,623 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-16 10:53:19,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 10:53:19,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 10:53:19,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 10:53:19,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-16 10:53:19,625 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 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-16 10:53:19,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 10:53:19,939 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-11-16 10:53:19,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 10:53:19,939 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2024-11-16 10:53:19,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 10:53:19,940 INFO L225 Difference]: With dead ends: 32 [2024-11-16 10:53:19,940 INFO L226 Difference]: Without dead ends: 29 [2024-11-16 10:53:19,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2024-11-16 10:53:19,942 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 10 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 10:53:19,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 26 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 10:53:19,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-11-16 10:53:19,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2024-11-16 10:53:19,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 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-16 10:53:19,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2024-11-16 10:53:19,948 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 15 [2024-11-16 10:53:19,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 10:53:19,949 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2024-11-16 10:53:19,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 12 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-16 10:53:19,949 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2024-11-16 10:53:19,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-16 10:53:19,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 10:53:19,950 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1] [2024-11-16 10:53:19,953 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-16 10:53:20,150 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-16 10:53:20,151 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 10:53:20,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 10:53:20,151 INFO L85 PathProgramCache]: Analyzing trace with hash 778767713, now seen corresponding path program 3 times [2024-11-16 10:53:20,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 10:53:20,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115426219] [2024-11-16 10:53:20,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-16 10:53:20,153 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-16 10:53:20,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 10:53:20,155 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-16 10:53:20,157 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-16 10:53:20,243 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2024-11-16 10:53:20,243 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-16 10:53:20,243 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 10:53:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 10:53:20,311 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-16 10:53:20,311 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 10:53:20,312 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 10:53:20,318 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-16 10:53:20,514 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-16 10:53:20,517 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-11-16 10:53:20,537 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 10:53:20,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 10:53:20 BoogieIcfgContainer [2024-11-16 10:53:20,540 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 10:53:20,541 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 10:53:20,541 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 10:53:20,541 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 10:53:20,541 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 10:53:17" (3/4) ... [2024-11-16 10:53:20,543 INFO L137 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-16 10:53:20,602 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 10:53:20,602 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 10:53:20,603 INFO L158 Benchmark]: Toolchain (without parser) took 3680.55ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 37.7MB in the beginning and 50.6MB in the end (delta: -12.9MB). Peak memory consumption was 1.6MB. Max. memory is 16.1GB. [2024-11-16 10:53:20,603 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 54.5MB. Free memory was 32.6MB in the beginning and 32.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 10:53:20,603 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.71ms. Allocated memory is still 71.3MB. Free memory was 37.5MB in the beginning and 42.4MB in the end (delta: -4.9MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. [2024-11-16 10:53:20,603 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.81ms. Allocated memory is still 71.3MB. Free memory was 42.4MB in the beginning and 40.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 10:53:20,604 INFO L158 Benchmark]: Boogie Preprocessor took 38.92ms. Allocated memory is still 71.3MB. Free memory was 40.9MB in the beginning and 39.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 10:53:20,604 INFO L158 Benchmark]: IcfgBuilder took 328.33ms. Allocated memory is still 71.3MB. Free memory was 39.2MB in the beginning and 47.5MB in the end (delta: -8.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-16 10:53:20,604 INFO L158 Benchmark]: TraceAbstraction took 2898.14ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 46.5MB in the beginning and 54.0MB in the end (delta: -7.5MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2024-11-16 10:53:20,604 INFO L158 Benchmark]: Witness Printer took 61.51ms. Allocated memory is still 86.0MB. Free memory was 54.0MB in the beginning and 50.6MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 10:53:20,606 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.24ms. Allocated memory is still 54.5MB. Free memory was 32.6MB in the beginning and 32.5MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.71ms. Allocated memory is still 71.3MB. Free memory was 37.5MB in the beginning and 42.4MB in the end (delta: -4.9MB). Peak memory consumption was 7.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.81ms. Allocated memory is still 71.3MB. Free memory was 42.4MB in the beginning and 40.9MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 38.92ms. Allocated memory is still 71.3MB. Free memory was 40.9MB in the beginning and 39.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 328.33ms. Allocated memory is still 71.3MB. Free memory was 39.2MB in the beginning and 47.5MB in the end (delta: -8.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 2898.14ms. Allocated memory was 71.3MB in the beginning and 86.0MB in the end (delta: 14.7MB). Free memory was 46.5MB in the beginning and 54.0MB in the end (delta: -7.5MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Witness Printer took 61.51ms. Allocated memory is still 86.0MB. Free memory was 54.0MB in the beginning and 50.6MB in the end (delta: 3.5MB). 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, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.8s, OverallIterations: 4, TraceHistogramMax: 8, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 58 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 105 IncrementalHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 15 mSDtfsCounter, 105 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred 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.9s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 49 ConstructedInterpolants, 0 QuantifiedInterpolants, 503 SizeOfPredicates, 11 NumberOfNonLiveVariables, 122 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-16 10:53:20,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE