./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.3.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3061b6dc 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.krebs.3.prop1-func-interl.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 7ea452f54e78c2d290c3e632eda9aad30263ed9e2c27aee3c4420815eb85a208 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 17:31:05,381 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 17:31:05,439 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-18 17:31:05,445 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 17:31:05,445 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 17:31:05,470 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 17:31:05,470 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 17:31:05,471 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 17:31:05,471 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 17:31:05,471 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 17:31:05,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 17:31:05,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 17:31:05,472 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 17:31:05,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 17:31:05,473 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 17:31:05,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 17:31:05,474 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 17:31:05,474 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-18 17:31:05,474 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 17:31:05,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 17:31:05,475 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 17:31:05,475 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 17:31:05,475 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 17:31:05,476 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 17:31:05,476 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 17:31:05,476 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 17:31:05,476 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 17:31:05,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 17:31:05,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 17:31:05,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 17:31:05,478 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 17:31:05,478 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 17:31:05,478 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 17:31:05,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-18 17:31:05,479 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-18 17:31:05,479 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 17:31:05,479 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 17:31:05,479 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 17:31:05,480 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 17:31:05,480 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 -> 7ea452f54e78c2d290c3e632eda9aad30263ed9e2c27aee3c4420815eb85a208 [2024-11-18 17:31:05,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 17:31:05,727 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 17:31:05,730 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 17:31:05,731 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 17:31:05,732 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 17:31:05,733 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.3.prop1-func-interl.c [2024-11-18 17:31:07,122 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 17:31:07,404 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 17:31:07,404 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.3.prop1-func-interl.c [2024-11-18 17:31:07,434 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/338bd8b7d/80bd804ca52f4690b3356901bb4650e9/FLAG2600a0a07 [2024-11-18 17:31:07,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/338bd8b7d/80bd804ca52f4690b3356901bb4650e9 [2024-11-18 17:31:07,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 17:31:07,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 17:31:07,722 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 17:31:07,722 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 17:31:07,729 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 17:31:07,730 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:31:07" (1/1) ... [2024-11-18 17:31:07,731 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@98dd9c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:07, skipping insertion in model container [2024-11-18 17:31:07,731 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:31:07" (1/1) ... [2024-11-18 17:31:07,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 17:31:08,204 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.krebs.3.prop1-func-interl.c[1172,1185] [2024-11-18 17:31:08,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 17:31:08,537 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 17:31:08,546 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.krebs.3.prop1-func-interl.c[1172,1185] [2024-11-18 17:31:08,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 17:31:08,734 INFO L204 MainTranslator]: Completed translation [2024-11-18 17:31:08,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:08 WrapperNode [2024-11-18 17:31:08,735 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 17:31:08,735 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 17:31:08,736 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 17:31:08,736 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 17:31:08,743 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:08" (1/1) ... [2024-11-18 17:31:08,786 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:08" (1/1) ... [2024-11-18 17:31:09,551 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4657 [2024-11-18 17:31:09,552 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 17:31:09,554 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 17:31:09,555 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 17:31:09,555 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 17:31:09,568 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:08" (1/1) ... [2024-11-18 17:31:09,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:08" (1/1) ... [2024-11-18 17:31:09,677 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:08" (1/1) ... [2024-11-18 17:31:09,826 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-18 17:31:09,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:08" (1/1) ... [2024-11-18 17:31:09,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:08" (1/1) ... [2024-11-18 17:31:09,979 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:08" (1/1) ... [2024-11-18 17:31:10,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:08" (1/1) ... [2024-11-18 17:31:10,049 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:08" (1/1) ... [2024-11-18 17:31:10,073 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:08" (1/1) ... [2024-11-18 17:31:10,130 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 17:31:10,131 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 17:31:10,131 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 17:31:10,132 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 17:31:10,132 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:08" (1/1) ... [2024-11-18 17:31:10,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 17:31:10,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 17:31:10,163 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-18 17:31:10,167 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-18 17:31:10,310 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 17:31:10,310 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-18 17:31:10,310 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 17:31:10,310 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 17:31:10,579 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 17:31:10,581 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 17:31:14,511 INFO L? ?]: Removed 2670 outVars from TransFormulas that were not future-live. [2024-11-18 17:31:14,512 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 17:31:14,555 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 17:31:14,555 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 17:31:14,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:31:14 BoogieIcfgContainer [2024-11-18 17:31:14,556 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 17:31:14,562 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 17:31:14,562 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 17:31:14,569 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 17:31:14,569 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:31:07" (1/3) ... [2024-11-18 17:31:14,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de30a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:31:14, skipping insertion in model container [2024-11-18 17:31:14,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:08" (2/3) ... [2024-11-18 17:31:14,570 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4de30a3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:31:14, skipping insertion in model container [2024-11-18 17:31:14,570 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:31:14" (3/3) ... [2024-11-18 17:31:14,571 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.krebs.3.prop1-func-interl.c [2024-11-18 17:31:14,603 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 17:31:14,603 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 17:31:14,681 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 17:31:14,687 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;@998d077, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 17:31:14,687 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 17:31:14,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 1570 states, 1568 states have (on average 1.5044642857142858) internal successors, (2359), 1569 states have internal predecessors, (2359), 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-18 17:31:14,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-18 17:31:14,706 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:31:14,707 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:31:14,707 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:31:14,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:31:14,712 INFO L85 PathProgramCache]: Analyzing trace with hash -593962925, now seen corresponding path program 1 times [2024-11-18 17:31:14,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:31:14,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116817564] [2024-11-18 17:31:14,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:31:14,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:31:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:31:15,427 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-18 17:31:15,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:31:15,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116817564] [2024-11-18 17:31:15,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116817564] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:31:15,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:31:15,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 17:31:15,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159697367] [2024-11-18 17:31:15,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:31:15,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 17:31:15,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:31:15,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 17:31:15,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 17:31:15,468 INFO L87 Difference]: Start difference. First operand has 1570 states, 1568 states have (on average 1.5044642857142858) internal successors, (2359), 1569 states have internal predecessors, (2359), 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 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-18 17:31:15,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:31:15,611 INFO L93 Difference]: Finished difference Result 3001 states and 4513 transitions. [2024-11-18 17:31:15,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 17:31:15,614 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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 113 [2024-11-18 17:31:15,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:31:15,634 INFO L225 Difference]: With dead ends: 3001 [2024-11-18 17:31:15,634 INFO L226 Difference]: Without dead ends: 1569 [2024-11-18 17:31:15,641 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 17:31:15,644 INFO L432 NwaCegarLoop]: 2353 mSDtfsCounter, 0 mSDsluCounter, 4700 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7053 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 17:31:15,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7053 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 17:31:15,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2024-11-18 17:31:15,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2024-11-18 17:31:15,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1569 states, 1568 states have (on average 1.503188775510204) internal successors, (2357), 1568 states have internal predecessors, (2357), 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-18 17:31:15,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2357 transitions. [2024-11-18 17:31:15,761 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2357 transitions. Word has length 113 [2024-11-18 17:31:15,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:31:15,761 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 2357 transitions. [2024-11-18 17:31:15,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 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-18 17:31:15,762 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2357 transitions. [2024-11-18 17:31:15,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-18 17:31:15,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:31:15,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:31:15,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-18 17:31:15,769 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:31:15,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:31:15,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1231285636, now seen corresponding path program 1 times [2024-11-18 17:31:15,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:31:15,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628323455] [2024-11-18 17:31:15,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:31:15,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:31:15,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:31:16,049 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-18 17:31:16,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:31:16,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628323455] [2024-11-18 17:31:16,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628323455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:31:16,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:31:16,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 17:31:16,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002210325] [2024-11-18 17:31:16,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:31:16,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 17:31:16,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:31:16,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 17:31:16,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 17:31:16,053 INFO L87 Difference]: Start difference. First operand 1569 states and 2357 transitions. Second operand has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-18 17:31:16,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:31:16,110 INFO L93 Difference]: Finished difference Result 3002 states and 4511 transitions. [2024-11-18 17:31:16,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 17:31:16,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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 114 [2024-11-18 17:31:16,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:31:16,115 INFO L225 Difference]: With dead ends: 3002 [2024-11-18 17:31:16,115 INFO L226 Difference]: Without dead ends: 1571 [2024-11-18 17:31:16,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 17:31:16,118 INFO L432 NwaCegarLoop]: 2353 mSDtfsCounter, 0 mSDsluCounter, 4696 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7049 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 17:31:16,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7049 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 17:31:16,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2024-11-18 17:31:16,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1571. [2024-11-18 17:31:16,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1571 states, 1570 states have (on average 1.502547770700637) internal successors, (2359), 1570 states have internal predecessors, (2359), 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-18 17:31:16,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2359 transitions. [2024-11-18 17:31:16,237 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2359 transitions. Word has length 114 [2024-11-18 17:31:16,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:31:16,237 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2359 transitions. [2024-11-18 17:31:16,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.5) internal successors, (114), 4 states have internal predecessors, (114), 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-18 17:31:16,238 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2359 transitions. [2024-11-18 17:31:16,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-18 17:31:16,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:31:16,239 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:31:16,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-18 17:31:16,240 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:31:16,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:31:16,241 INFO L85 PathProgramCache]: Analyzing trace with hash -613114292, now seen corresponding path program 1 times [2024-11-18 17:31:16,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:31:16,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207182189] [2024-11-18 17:31:16,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:31:16,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:31:16,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:31:16,422 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-18 17:31:16,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:31:16,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207182189] [2024-11-18 17:31:16,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207182189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:31:16,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:31:16,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 17:31:16,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714673535] [2024-11-18 17:31:16,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:31:16,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 17:31:16,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:31:16,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 17:31:16,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 17:31:16,425 INFO L87 Difference]: Start difference. First operand 1571 states and 2359 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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-18 17:31:16,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:31:16,474 INFO L93 Difference]: Finished difference Result 3006 states and 4515 transitions. [2024-11-18 17:31:16,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 17:31:16,474 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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 115 [2024-11-18 17:31:16,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:31:16,479 INFO L225 Difference]: With dead ends: 3006 [2024-11-18 17:31:16,479 INFO L226 Difference]: Without dead ends: 1573 [2024-11-18 17:31:16,480 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 17:31:16,481 INFO L432 NwaCegarLoop]: 2353 mSDtfsCounter, 0 mSDsluCounter, 4690 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7043 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 17:31:16,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7043 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 17:31:16,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2024-11-18 17:31:16,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1573. [2024-11-18 17:31:16,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1572 states have (on average 1.501908396946565) internal successors, (2361), 1572 states have internal predecessors, (2361), 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-18 17:31:16,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2361 transitions. [2024-11-18 17:31:16,503 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2361 transitions. Word has length 115 [2024-11-18 17:31:16,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:31:16,504 INFO L471 AbstractCegarLoop]: Abstraction has 1573 states and 2361 transitions. [2024-11-18 17:31:16,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 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-18 17:31:16,504 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2361 transitions. [2024-11-18 17:31:16,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-18 17:31:16,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:31:16,505 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:31:16,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-18 17:31:16,506 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:31:16,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:31:16,506 INFO L85 PathProgramCache]: Analyzing trace with hash -917786365, now seen corresponding path program 1 times [2024-11-18 17:31:16,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:31:16,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592163458] [2024-11-18 17:31:16,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:31:16,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:31:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:31:16,693 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-18 17:31:16,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:31:16,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592163458] [2024-11-18 17:31:16,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592163458] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:31:16,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:31:16,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 17:31:16,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746553674] [2024-11-18 17:31:16,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:31:16,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 17:31:16,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:31:16,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 17:31:16,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 17:31:16,696 INFO L87 Difference]: Start difference. First operand 1573 states and 2361 transitions. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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-18 17:31:16,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:31:16,742 INFO L93 Difference]: Finished difference Result 3016 states and 4527 transitions. [2024-11-18 17:31:16,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 17:31:16,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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 116 [2024-11-18 17:31:16,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:31:16,747 INFO L225 Difference]: With dead ends: 3016 [2024-11-18 17:31:16,747 INFO L226 Difference]: Without dead ends: 1581 [2024-11-18 17:31:16,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 17:31:16,750 INFO L432 NwaCegarLoop]: 2353 mSDtfsCounter, 3 mSDsluCounter, 4690 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 7043 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-18 17:31:16,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 7043 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-18 17:31:16,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2024-11-18 17:31:16,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1577. [2024-11-18 17:31:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1576 states have (on average 1.5019035532994924) internal successors, (2367), 1576 states have internal predecessors, (2367), 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-18 17:31:16,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2367 transitions. [2024-11-18 17:31:16,771 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2367 transitions. Word has length 116 [2024-11-18 17:31:16,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:31:16,771 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2367 transitions. [2024-11-18 17:31:16,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 states have internal predecessors, (116), 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-18 17:31:16,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2367 transitions. [2024-11-18 17:31:16,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-18 17:31:16,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:31:16,773 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:31:16,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-18 17:31:16,773 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:31:16,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:31:16,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1567379643, now seen corresponding path program 1 times [2024-11-18 17:31:16,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:31:16,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828204264] [2024-11-18 17:31:16,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:31:16,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:31:16,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:31:17,023 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-18 17:31:17,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:31:17,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828204264] [2024-11-18 17:31:17,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828204264] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:31:17,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:31:17,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-18 17:31:17,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971095419] [2024-11-18 17:31:17,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:31:17,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-18 17:31:17,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:31:17,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-18 17:31:17,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-18 17:31:17,030 INFO L87 Difference]: Start difference. First operand 1577 states and 2367 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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-18 17:31:19,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:31:19,222 INFO L93 Difference]: Finished difference Result 4439 states and 6665 transitions. [2024-11-18 17:31:19,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-18 17:31:19,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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 117 [2024-11-18 17:31:19,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:31:19,238 INFO L225 Difference]: With dead ends: 4439 [2024-11-18 17:31:19,239 INFO L226 Difference]: Without dead ends: 3000 [2024-11-18 17:31:19,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-18 17:31:19,249 INFO L432 NwaCegarLoop]: 1869 mSDtfsCounter, 2233 mSDsluCounter, 5467 mSDsCounter, 0 mSdLazyCounter, 1879 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2233 SdHoareTripleChecker+Valid, 7336 SdHoareTripleChecker+Invalid, 1880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-18 17:31:19,250 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2233 Valid, 7336 Invalid, 1880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1879 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-18 17:31:19,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2024-11-18 17:31:19,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1644. [2024-11-18 17:31:19,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1644 states, 1643 states have (on average 1.5009129640900791) internal successors, (2466), 1643 states have internal predecessors, (2466), 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-18 17:31:19,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2466 transitions. [2024-11-18 17:31:19,291 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2466 transitions. Word has length 117 [2024-11-18 17:31:19,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:31:19,292 INFO L471 AbstractCegarLoop]: Abstraction has 1644 states and 2466 transitions. [2024-11-18 17:31:19,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 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-18 17:31:19,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2466 transitions. [2024-11-18 17:31:19,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-18 17:31:19,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:31:19,294 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:31:19,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-18 17:31:19,295 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:31:19,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:31:19,295 INFO L85 PathProgramCache]: Analyzing trace with hash -1110143802, now seen corresponding path program 1 times [2024-11-18 17:31:19,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:31:19,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150370965] [2024-11-18 17:31:19,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:31:19,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:31:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:31:19,789 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-18 17:31:19,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-18 17:31:19,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150370965] [2024-11-18 17:31:19,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150370965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:31:19,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:31:19,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-18 17:31:19,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573615826] [2024-11-18 17:31:19,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:31:19,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-18 17:31:19,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-18 17:31:19,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-18 17:31:19,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-18 17:31:19,793 INFO L87 Difference]: Start difference. First operand 1644 states and 2466 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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-18 17:31:20,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:31:20,962 INFO L93 Difference]: Finished difference Result 3098 states and 4648 transitions. [2024-11-18 17:31:20,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-18 17:31:20,962 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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 118 [2024-11-18 17:31:20,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:31:20,967 INFO L225 Difference]: With dead ends: 3098 [2024-11-18 17:31:20,967 INFO L226 Difference]: Without dead ends: 1659 [2024-11-18 17:31:20,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-18 17:31:20,970 INFO L432 NwaCegarLoop]: 1858 mSDtfsCounter, 2266 mSDsluCounter, 5560 mSDsCounter, 0 mSdLazyCounter, 2001 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2266 SdHoareTripleChecker+Valid, 7418 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-18 17:31:20,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2266 Valid, 7418 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2001 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-18 17:31:20,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2024-11-18 17:31:20,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1657. [2024-11-18 17:31:20,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1657 states, 1656 states have (on average 1.4981884057971016) internal successors, (2481), 1656 states have internal predecessors, (2481), 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-18 17:31:20,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2481 transitions. [2024-11-18 17:31:20,992 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2481 transitions. Word has length 118 [2024-11-18 17:31:20,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:31:20,992 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2481 transitions. [2024-11-18 17:31:20,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 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-18 17:31:20,994 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2481 transitions. [2024-11-18 17:31:20,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-18 17:31:20,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:31:20,995 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:31:20,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-18 17:31:20,995 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:31:20,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:31:20,996 INFO L85 PathProgramCache]: Analyzing trace with hash 264627494, now seen corresponding path program 1 times [2024-11-18 17:31:20,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-18 17:31:20,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753080201] [2024-11-18 17:31:20,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:31:20,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-18 17:31:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 17:31:21,051 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-18 17:31:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-18 17:31:21,226 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-18 17:31:21,227 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-18 17:31:21,227 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-18 17:31:21,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-18 17:31:21,236 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-18 17:31:21,316 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-18 17:31:21,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.11 05:31:21 BoogieIcfgContainer [2024-11-18 17:31:21,320 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-18 17:31:21,320 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-18 17:31:21,321 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-18 17:31:21,321 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-18 17:31:21,321 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:31:14" (3/4) ... [2024-11-18 17:31:21,323 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-18 17:31:21,324 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-18 17:31:21,324 INFO L158 Benchmark]: Toolchain (without parser) took 13607.55ms. Allocated memory was 142.6MB in the beginning and 1.4GB in the end (delta: 1.3GB). Free memory was 67.4MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 112.2MB. Max. memory is 16.1GB. [2024-11-18 17:31:21,325 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 142.6MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 17:31:21,325 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1013.15ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 67.2MB in the beginning and 112.4MB in the end (delta: -45.2MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. [2024-11-18 17:31:21,325 INFO L158 Benchmark]: Boogie Procedure Inliner took 816.35ms. Allocated memory was 197.1MB in the beginning and 388.0MB in the end (delta: 190.8MB). Free memory was 112.4MB in the beginning and 275.8MB in the end (delta: -163.3MB). Peak memory consumption was 102.0MB. Max. memory is 16.1GB. [2024-11-18 17:31:21,325 INFO L158 Benchmark]: Boogie Preprocessor took 575.96ms. Allocated memory is still 388.0MB. Free memory was 275.8MB in the beginning and 217.1MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2024-11-18 17:31:21,326 INFO L158 Benchmark]: RCFGBuilder took 4424.54ms. Allocated memory was 388.0MB in the beginning and 1.4GB in the end (delta: 1.0GB). Free memory was 217.1MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 227.5MB. Max. memory is 16.1GB. [2024-11-18 17:31:21,327 INFO L158 Benchmark]: TraceAbstraction took 6758.53ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: -1.0MB). Peak memory consumption was 798.0MB. Max. memory is 16.1GB. [2024-11-18 17:31:21,327 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-18 17:31:21,328 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.16ms. Allocated memory is still 142.6MB. Free memory is still 104.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1013.15ms. Allocated memory was 142.6MB in the beginning and 197.1MB in the end (delta: 54.5MB). Free memory was 67.2MB in the beginning and 112.4MB in the end (delta: -45.2MB). Peak memory consumption was 22.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 816.35ms. Allocated memory was 197.1MB in the beginning and 388.0MB in the end (delta: 190.8MB). Free memory was 112.4MB in the beginning and 275.8MB in the end (delta: -163.3MB). Peak memory consumption was 102.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 575.96ms. Allocated memory is still 388.0MB. Free memory was 275.8MB in the beginning and 217.1MB in the end (delta: 58.7MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * RCFGBuilder took 4424.54ms. Allocated memory was 388.0MB in the beginning and 1.4GB in the end (delta: 1.0GB). Free memory was 217.1MB in the beginning and 1.2GB in the end (delta: -1.0GB). Peak memory consumption was 227.5MB. Max. memory is 16.1GB. * TraceAbstraction took 6758.53ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: -1.0MB). Peak memory consumption was 798.0MB. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 1.4GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 214. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 8); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (8 - 1); [L32] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 24); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (24 - 1); [L35] const SORT_4 mask_SORT_4 = (SORT_4)-1 >> (sizeof(SORT_4) * 8 - 32); [L36] const SORT_4 msb_SORT_4 = (SORT_4)1 << (32 - 1); [L38] const SORT_2 var_5 = 0; [L39] const SORT_1 var_30 = 0; [L40] const SORT_3 var_75 = 0; [L41] const SORT_4 var_77 = 50; [L42] const SORT_2 var_81 = 10; [L43] const SORT_4 var_85 = 1; [L44] const SORT_2 var_91 = 4; [L45] const SORT_4 var_93 = 2; [L46] const SORT_2 var_117 = 12; [L47] const SORT_2 var_140 = 2; [L48] const SORT_2 var_181 = 15; [L50] SORT_1 input_82; [L51] SORT_1 input_92; [L52] SORT_1 input_98; [L53] SORT_1 input_122; [L54] SORT_1 input_125; [L55] SORT_1 input_126; [L56] SORT_1 input_127; [L57] SORT_1 input_128; [L58] SORT_1 input_147; [L59] SORT_1 input_148; [L60] SORT_1 input_170; [L61] SORT_1 input_174; [L62] SORT_1 input_216; [L63] SORT_1 input_219; [L64] SORT_1 input_240; [L65] SORT_1 input_261; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L67] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L68] SORT_2 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L69] SORT_2 state_10 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L70] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L71] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L71] SORT_2 state_14 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L72] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L72] SORT_2 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L73] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L73] SORT_2 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L74] SORT_2 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L75] SORT_2 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L76] SORT_2 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L77] SORT_2 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L78] SORT_2 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L79] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L80] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L80] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L81] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L81] SORT_1 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L82] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L82] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L83] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L83] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L84] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L85] SORT_1 state_43 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L86] SORT_1 state_45 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L87] SORT_1 state_47 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L88] SORT_1 state_49 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L89] SORT_1 state_51 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L90] SORT_1 state_53 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L91] SORT_1 state_55 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L92] SORT_1 state_57 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L93] SORT_1 state_59 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L94] SORT_1 state_61 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L95] SORT_1 state_63 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L96] SORT_1 state_65 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L97] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L97] SORT_1 state_67 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L98] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L98] SORT_1 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L99] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L99] SORT_1 state_71 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L100] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_117=12, var_140=2, var_181=15, var_30=0, var_5=0, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L100] SORT_1 state_73 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L102] SORT_2 init_7_arg_1 = var_5; [L103] state_6 = init_7_arg_1 [L104] SORT_2 init_9_arg_1 = var_5; [L105] state_8 = init_9_arg_1 [L106] SORT_2 init_11_arg_1 = var_5; [L107] state_10 = init_11_arg_1 [L108] SORT_2 init_13_arg_1 = var_5; [L109] state_12 = init_13_arg_1 [L110] SORT_2 init_15_arg_1 = var_5; [L111] state_14 = init_15_arg_1 [L112] SORT_2 init_17_arg_1 = var_5; [L113] state_16 = init_17_arg_1 [L114] SORT_2 init_19_arg_1 = var_5; [L115] state_18 = init_19_arg_1 [L116] SORT_2 init_21_arg_1 = var_5; [L117] state_20 = init_21_arg_1 [L118] SORT_2 init_23_arg_1 = var_5; [L119] state_22 = init_23_arg_1 [L120] SORT_2 init_25_arg_1 = var_5; [L121] state_24 = init_25_arg_1 [L122] SORT_2 init_27_arg_1 = var_5; [L123] state_26 = init_27_arg_1 [L124] SORT_2 init_29_arg_1 = var_5; [L125] state_28 = init_29_arg_1 [L126] SORT_1 init_32_arg_1 = var_30; [L127] state_31 = init_32_arg_1 [L128] SORT_1 init_34_arg_1 = var_30; [L129] state_33 = init_34_arg_1 [L130] SORT_1 init_36_arg_1 = var_30; [L131] state_35 = init_36_arg_1 [L132] SORT_1 init_38_arg_1 = var_30; [L133] state_37 = init_38_arg_1 [L134] SORT_1 init_40_arg_1 = var_30; [L135] state_39 = init_40_arg_1 [L136] SORT_1 init_42_arg_1 = var_30; [L137] state_41 = init_42_arg_1 [L138] SORT_1 init_44_arg_1 = var_30; [L139] state_43 = init_44_arg_1 [L140] SORT_1 init_46_arg_1 = var_30; [L141] state_45 = init_46_arg_1 [L142] SORT_1 init_48_arg_1 = var_30; [L143] state_47 = init_48_arg_1 [L144] SORT_1 init_50_arg_1 = var_30; [L145] state_49 = init_50_arg_1 [L146] SORT_1 init_52_arg_1 = var_30; [L147] state_51 = init_52_arg_1 [L148] SORT_1 init_54_arg_1 = var_30; [L149] state_53 = init_54_arg_1 [L150] SORT_1 init_56_arg_1 = var_30; [L151] state_55 = init_56_arg_1 [L152] SORT_1 init_58_arg_1 = var_30; [L153] state_57 = init_58_arg_1 [L154] SORT_1 init_60_arg_1 = var_30; [L155] state_59 = init_60_arg_1 [L156] SORT_1 init_62_arg_1 = var_30; [L157] state_61 = init_62_arg_1 [L158] SORT_1 init_64_arg_1 = var_30; [L159] state_63 = init_64_arg_1 [L160] SORT_1 init_66_arg_1 = var_30; [L161] state_65 = init_66_arg_1 [L162] SORT_1 init_68_arg_1 = var_30; [L163] state_67 = init_68_arg_1 [L164] SORT_1 init_70_arg_1 = var_30; [L165] state_69 = init_70_arg_1 [L166] SORT_1 init_72_arg_1 = var_30; [L167] state_71 = init_72_arg_1 [L168] SORT_1 init_74_arg_1 = var_30; [L169] state_73 = init_74_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L172] input_82 = __VERIFIER_nondet_uchar() [L173] EXPR input_82 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L173] input_82 = input_82 & mask_SORT_1 [L174] input_92 = __VERIFIER_nondet_uchar() [L175] EXPR input_92 & mask_SORT_1 VAL [input_82=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L175] input_92 = input_92 & mask_SORT_1 [L176] input_98 = __VERIFIER_nondet_uchar() [L177] EXPR input_98 & mask_SORT_1 VAL [input_82=0, input_92=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L177] input_98 = input_98 & mask_SORT_1 [L178] input_122 = __VERIFIER_nondet_uchar() [L179] EXPR input_122 & mask_SORT_1 VAL [input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L179] input_122 = input_122 & mask_SORT_1 [L180] input_125 = __VERIFIER_nondet_uchar() [L181] EXPR input_125 & mask_SORT_1 VAL [input_122=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L181] input_125 = input_125 & mask_SORT_1 [L182] input_126 = __VERIFIER_nondet_uchar() [L183] EXPR input_126 & mask_SORT_1 VAL [input_122=0, input_125=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L183] input_126 = input_126 & mask_SORT_1 [L184] input_127 = __VERIFIER_nondet_uchar() [L185] EXPR input_127 & mask_SORT_1 VAL [input_122=0, input_125=0, input_126=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L185] input_127 = input_127 & mask_SORT_1 [L186] input_128 = __VERIFIER_nondet_uchar() [L187] EXPR input_128 & mask_SORT_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L187] input_128 = input_128 & mask_SORT_1 [L188] input_147 = __VERIFIER_nondet_uchar() [L189] EXPR input_147 & mask_SORT_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L189] input_147 = input_147 & mask_SORT_1 [L190] input_148 = __VERIFIER_nondet_uchar() [L191] EXPR input_148 & mask_SORT_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L191] input_148 = input_148 & mask_SORT_1 [L192] input_170 = __VERIFIER_nondet_uchar() [L193] EXPR input_170 & mask_SORT_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L193] input_170 = input_170 & mask_SORT_1 [L194] input_174 = __VERIFIER_nondet_uchar() [L195] EXPR input_174 & mask_SORT_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L195] input_174 = input_174 & mask_SORT_1 [L196] input_216 = __VERIFIER_nondet_uchar() [L197] EXPR input_216 & mask_SORT_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_174=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L197] input_216 = input_216 & mask_SORT_1 [L198] input_219 = __VERIFIER_nondet_uchar() [L199] EXPR input_219 & mask_SORT_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_174=0, input_216=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L199] input_219 = input_219 & mask_SORT_1 [L200] input_240 = __VERIFIER_nondet_uchar() [L201] input_261 = __VERIFIER_nondet_uchar() [L204] SORT_3 var_76_arg_0 = var_75; [L205] SORT_2 var_76_arg_1 = state_28; VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_174=0, input_216=0, input_219=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_76_arg_0=0, var_76_arg_1=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L206] EXPR ((SORT_4)var_76_arg_0 << 8) | var_76_arg_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_174=0, input_216=0, input_219=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L206] SORT_4 var_76 = ((SORT_4)var_76_arg_0 << 8) | var_76_arg_1; [L207] EXPR var_76 & mask_SORT_4 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_174=0, input_216=0, input_219=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L207] var_76 = var_76 & mask_SORT_4 [L208] SORT_4 var_78_arg_0 = var_76; [L209] SORT_4 var_78_arg_1 = var_77; [L210] SORT_1 var_78 = var_78_arg_0 <= var_78_arg_1; [L211] SORT_1 var_79_arg_0 = ~state_73; VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_174=0, input_216=0, input_219=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_76=0, var_77=50, var_78=1, var_79_arg_0=-1, var_81=10, var_85=1, var_91=4, var_93=2] [L212] EXPR var_79_arg_0 & mask_SORT_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_174=0, input_216=0, input_219=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_76=0, var_77=50, var_78=1, var_81=10, var_85=1, var_91=4, var_93=2] [L212] var_79_arg_0 = var_79_arg_0 & mask_SORT_1 [L213] SORT_1 var_79_arg_1 = ~var_78; VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_174=0, input_216=0, input_219=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_76=0, var_77=50, var_79_arg_0=1, var_79_arg_1=-2, var_81=10, var_85=1, var_91=4, var_93=2] [L214] EXPR var_79_arg_1 & mask_SORT_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_174=0, input_216=0, input_219=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_76=0, var_77=50, var_79_arg_0=1, var_81=10, var_85=1, var_91=4, var_93=2] [L214] var_79_arg_1 = var_79_arg_1 & mask_SORT_1 [L215] EXPR var_79_arg_0 & var_79_arg_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_174=0, input_216=0, input_219=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_76=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L215] SORT_1 var_79 = var_79_arg_0 & var_79_arg_1; [L216] EXPR var_79 & mask_SORT_1 VAL [input_122=0, input_125=0, input_126=0, input_127=0, input_128=0, input_147=0, input_148=0, input_170=0, input_174=0, input_216=0, input_219=0, input_82=0, input_92=0, input_98=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_14=0, state_16=0, state_18=0, state_20=0, state_22=0, state_24=0, state_26=0, state_28=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_43=0, state_45=0, state_47=0, state_49=0, state_51=0, state_53=0, state_55=0, state_57=0, state_59=0, state_61=0, state_63=0, state_65=0, state_67=0, state_69=0, state_6=0, state_71=0, state_73=0, state_8=0, var_117=12, var_140=2, var_181=15, var_75=0, var_76=0, var_77=50, var_81=10, var_85=1, var_91=4, var_93=2] [L216] var_79 = var_79 & mask_SORT_1 [L217] SORT_1 bad_80_arg_0 = var_79; [L218] CALL __VERIFIER_assert(!(bad_80_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1570 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4502 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4502 mSDsluCounter, 42942 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 29803 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3948 IncrementalHoareTripleChecker+Invalid, 3950 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 13139 mSDtfsCounter, 3948 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1657occurred in iteration=6, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 1362 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 812 NumberOfCodeBlocks, 812 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 687 ConstructedInterpolants, 0 QuantifiedInterpolants, 1981 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-18 17:31:21,355 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.krebs.3.prop1-func-interl.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 7ea452f54e78c2d290c3e632eda9aad30263ed9e2c27aee3c4420815eb85a208 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-18 17:31:23,899 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-18 17:31:23,954 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-18 17:31:23,957 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-18 17:31:23,958 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-18 17:31:23,981 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-18 17:31:23,982 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-18 17:31:23,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-18 17:31:23,982 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-18 17:31:23,983 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-18 17:31:23,983 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-18 17:31:23,983 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-18 17:31:23,984 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-18 17:31:23,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-18 17:31:23,985 INFO L153 SettingsManager]: * Use SBE=true [2024-11-18 17:31:23,986 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-18 17:31:23,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-18 17:31:23,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-18 17:31:23,987 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-18 17:31:23,987 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-18 17:31:23,987 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-18 17:31:23,987 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-18 17:31:23,990 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-18 17:31:23,990 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-18 17:31:23,990 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-18 17:31:23,991 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-18 17:31:23,991 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-18 17:31:23,991 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-18 17:31:23,991 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-18 17:31:23,991 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-18 17:31:23,991 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-18 17:31:23,991 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 17:31:23,992 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-18 17:31:23,992 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-18 17:31:23,999 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-18 17:31:23,999 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-18 17:31:23,999 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-18 17:31:23,999 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-18 17:31:23,999 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-18 17:31:23,999 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-18 17:31:24,000 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-18 17:31:24,001 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 -> 7ea452f54e78c2d290c3e632eda9aad30263ed9e2c27aee3c4420815eb85a208 [2024-11-18 17:31:24,263 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-18 17:31:24,300 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-18 17:31:24,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-18 17:31:24,307 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-18 17:31:24,310 INFO L274 PluginConnector]: CDTParser initialized [2024-11-18 17:31:24,312 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.3.prop1-func-interl.c [2024-11-18 17:31:25,739 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-18 17:31:25,988 INFO L384 CDTParser]: Found 1 translation units. [2024-11-18 17:31:25,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.3.prop1-func-interl.c [2024-11-18 17:31:25,999 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ebebcfe8/967afe861c5c4bd88e4f0ac6a1c10e2a/FLAG89c0018eb [2024-11-18 17:31:26,301 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ebebcfe8/967afe861c5c4bd88e4f0ac6a1c10e2a [2024-11-18 17:31:26,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-18 17:31:26,305 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-18 17:31:26,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-18 17:31:26,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-18 17:31:26,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-18 17:31:26,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:31:26" (1/1) ... [2024-11-18 17:31:26,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34f139bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:26, skipping insertion in model container [2024-11-18 17:31:26,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 05:31:26" (1/1) ... [2024-11-18 17:31:26,366 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-18 17:31:26,586 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.krebs.3.prop1-func-interl.c[1172,1185] [2024-11-18 17:31:26,842 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 17:31:26,853 INFO L200 MainTranslator]: Completed pre-run [2024-11-18 17:31:26,862 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.krebs.3.prop1-func-interl.c[1172,1185] [2024-11-18 17:31:26,977 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-18 17:31:26,993 INFO L204 MainTranslator]: Completed translation [2024-11-18 17:31:26,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:26 WrapperNode [2024-11-18 17:31:26,993 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-18 17:31:26,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-18 17:31:26,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-18 17:31:26,995 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-18 17:31:27,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:26" (1/1) ... [2024-11-18 17:31:27,035 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:26" (1/1) ... [2024-11-18 17:31:27,109 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1537 [2024-11-18 17:31:27,109 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-18 17:31:27,110 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-18 17:31:27,110 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-18 17:31:27,110 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-18 17:31:27,118 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:26" (1/1) ... [2024-11-18 17:31:27,119 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:26" (1/1) ... [2024-11-18 17:31:27,126 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:26" (1/1) ... [2024-11-18 17:31:27,163 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-18 17:31:27,167 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:26" (1/1) ... [2024-11-18 17:31:27,167 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:26" (1/1) ... [2024-11-18 17:31:27,203 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:26" (1/1) ... [2024-11-18 17:31:27,211 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:26" (1/1) ... [2024-11-18 17:31:27,220 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:26" (1/1) ... [2024-11-18 17:31:27,225 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:26" (1/1) ... [2024-11-18 17:31:27,262 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-18 17:31:27,270 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-18 17:31:27,270 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-18 17:31:27,270 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-18 17:31:27,271 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:26" (1/1) ... [2024-11-18 17:31:27,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-18 17:31:27,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-18 17:31:27,299 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-18 17:31:27,303 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-18 17:31:27,350 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-18 17:31:27,351 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-18 17:31:27,351 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-18 17:31:27,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-18 17:31:27,633 INFO L238 CfgBuilder]: Building ICFG [2024-11-18 17:31:27,635 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-18 17:31:28,996 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2024-11-18 17:31:28,997 INFO L287 CfgBuilder]: Performing block encoding [2024-11-18 17:31:29,006 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-18 17:31:29,007 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-18 17:31:29,008 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:31:29 BoogieIcfgContainer [2024-11-18 17:31:29,008 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-18 17:31:29,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-18 17:31:29,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-18 17:31:29,013 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-18 17:31:29,013 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.11 05:31:26" (1/3) ... [2024-11-18 17:31:29,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29bf0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:31:29, skipping insertion in model container [2024-11-18 17:31:29,014 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 05:31:26" (2/3) ... [2024-11-18 17:31:29,014 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29bf0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.11 05:31:29, skipping insertion in model container [2024-11-18 17:31:29,015 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 05:31:29" (3/3) ... [2024-11-18 17:31:29,016 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.krebs.3.prop1-func-interl.c [2024-11-18 17:31:29,031 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-18 17:31:29,032 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-18 17:31:29,086 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-18 17:31:29,092 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;@73bcc2bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-18 17:31:29,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-18 17:31:29,097 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:31:29,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-18 17:31:29,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:31:29,102 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-18 17:31:29,103 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:31:29,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:31:29,108 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-18 17:31:29,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 17:31:29,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987612445] [2024-11-18 17:31:29,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:31:29,122 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-18 17:31:29,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 17:31:29,129 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-18 17:31:29,138 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-18 17:31:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:31:29,418 INFO L255 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-18 17:31:29,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:31:29,580 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-18 17:31:29,580 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-18 17:31:29,580 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 17:31:29,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987612445] [2024-11-18 17:31:29,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987612445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-18 17:31:29,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-18 17:31:29,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-18 17:31:29,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492749622] [2024-11-18 17:31:29,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-18 17:31:29,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-18 17:31:29,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 17:31:29,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-18 17:31:29,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-18 17:31:29,611 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:31:29,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:31:29,708 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-18 17:31:29,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-18 17:31:29,710 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-18 17:31:29,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:31:29,715 INFO L225 Difference]: With dead ends: 18 [2024-11-18 17:31:29,716 INFO L226 Difference]: Without dead ends: 10 [2024-11-18 17:31:29,718 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-18 17:31:29,721 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-18 17:31:29,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-18 17:31:29,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-18 17:31:29,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-18 17:31:29,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:31:29,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-18 17:31:29,761 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-18 17:31:29,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:31:29,761 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-18 17:31:29,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:31:29,762 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-18 17:31:29,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-18 17:31:29,762 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:31:29,762 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-18 17:31:29,775 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-18 17:31:29,963 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-18 17:31:29,963 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:31:29,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:31:29,964 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-18 17:31:29,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 17:31:29,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1809240320] [2024-11-18 17:31:29,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-18 17:31:29,966 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-18 17:31:29,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 17:31:29,968 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-18 17:31:29,970 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-18 17:31:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-18 17:31:30,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-18 17:31:30,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:31:30,623 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-18 17:31:30,624 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 17:31:46,268 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-18 17:31:46,268 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 17:31:46,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1809240320] [2024-11-18 17:31:46,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1809240320] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-18 17:31:46,270 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-18 17:31:46,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-18 17:31:46,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1219205288] [2024-11-18 17:31:46,270 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-18 17:31:46,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-18 17:31:46,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-18 17:31:46,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-18 17:31:46,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=59, Unknown=3, NotChecked=0, Total=90 [2024-11-18 17:31:46,275 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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-18 17:31:50,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-18 17:31:50,446 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-18 17:31:50,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-18 17:31:50,447 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-18 17:31:50,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-18 17:31:50,447 INFO L225 Difference]: With dead ends: 18 [2024-11-18 17:31:50,447 INFO L226 Difference]: Without dead ends: 16 [2024-11-18 17:31:50,448 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=73, Invalid=134, Unknown=3, NotChecked=0, Total=210 [2024-11-18 17:31:50,449 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-18 17:31:50,449 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 20 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-18 17:31:50,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-18 17:31:50,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-18 17:31:50,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-18 17:31:50,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-18 17:31:50,454 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-18 17:31:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-18 17:31:50,454 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-18 17:31:50,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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-18 17:31:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-18 17:31:50,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-18 17:31:50,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-18 17:31:50,455 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-18 17:31:50,462 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-18 17:31:50,659 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-18 17:31:50,660 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-18 17:31:50,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-18 17:31:50,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times [2024-11-18 17:31:50,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-18 17:31:50,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [543817988] [2024-11-18 17:31:50,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-18 17:31:50,662 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-18 17:31:50,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-18 17:31:50,685 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-18 17:31:50,690 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-18 17:31:51,477 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-18 17:31:51,478 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-18 17:31:51,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-18 17:31:51,510 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-18 17:31:58,730 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-18 17:31:58,731 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-18 17:32:25,625 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-18 17:32:25,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-18 17:32:25,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [543817988] [2024-11-18 17:32:25,626 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-18 17:32:25,634 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-18 17:32:25,637 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-18 17:32:25,831 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-18 17:32:25,831 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 45 more [2024-11-18 17:32:25,837 INFO L158 Benchmark]: Toolchain (without parser) took 59531.45ms. Allocated memory was 83.9MB in the beginning and 192.9MB in the end (delta: 109.1MB). Free memory was 45.0MB in the beginning and 50.4MB in the end (delta: -5.4MB). Peak memory consumption was 103.5MB. Max. memory is 16.1GB. [2024-11-18 17:32:25,837 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 50.3MB. Free memory is still 25.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-18 17:32:25,837 INFO L158 Benchmark]: CACSL2BoogieTranslator took 687.08ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 44.9MB in the beginning and 65.0MB in the end (delta: -20.2MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. [2024-11-18 17:32:25,837 INFO L158 Benchmark]: Boogie Procedure Inliner took 115.13ms. Allocated memory is still 100.7MB. Free memory was 65.0MB in the beginning and 53.2MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-18 17:32:25,838 INFO L158 Benchmark]: Boogie Preprocessor took 152.29ms. Allocated memory is still 100.7MB. Free memory was 53.2MB in the beginning and 64.9MB in the end (delta: -11.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-11-18 17:32:25,843 INFO L158 Benchmark]: RCFGBuilder took 1738.61ms. Allocated memory was 100.7MB in the beginning and 159.4MB in the end (delta: 58.7MB). Free memory was 64.9MB in the beginning and 45.0MB in the end (delta: 19.9MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. [2024-11-18 17:32:25,843 INFO L158 Benchmark]: TraceAbstraction took 56826.12ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 43.9MB in the beginning and 50.4MB in the end (delta: -6.4MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. [2024-11-18 17:32:25,845 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 50.3MB. Free memory is still 25.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 687.08ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 44.9MB in the beginning and 65.0MB in the end (delta: -20.2MB). Peak memory consumption was 23.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 115.13ms. Allocated memory is still 100.7MB. Free memory was 65.0MB in the beginning and 53.2MB in the end (delta: 11.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 152.29ms. Allocated memory is still 100.7MB. Free memory was 53.2MB in the beginning and 64.9MB in the end (delta: -11.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1738.61ms. Allocated memory was 100.7MB in the beginning and 159.4MB in the end (delta: 58.7MB). Free memory was 64.9MB in the beginning and 45.0MB in the end (delta: 19.9MB). Peak memory consumption was 83.4MB. Max. memory is 16.1GB. * TraceAbstraction took 56826.12ms. Allocated memory was 159.4MB in the beginning and 192.9MB in the end (delta: 33.6MB). Free memory was 43.9MB in the beginning and 50.4MB in the end (delta: -6.4MB). Peak memory consumption was 26.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory")