./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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.3.0-?-798a7b3-m [2025-03-03 17:39:38,457 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:39:38,515 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-03-03 17:39:38,520 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:39:38,520 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:39:38,538 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:39:38,540 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:39:38,540 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:39:38,541 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:39:38,541 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:39:38,541 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:39:38,542 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:39:38,542 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:39:38,542 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:39:38,542 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:39:38,542 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:39:38,543 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:39:38,543 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 17:39:38,543 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:39:38,543 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:39:38,543 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:39:38,543 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:39:38,543 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:39:38,543 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:39:38,543 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:39:38,543 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:39:38,544 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:39:38,544 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:39:38,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:39:38,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:39:38,544 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:39:38,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:39:38,544 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:39:38,544 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:39:38,545 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 17:39:38,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 17:39:38,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:39:38,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:39:38,545 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:39:38,545 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:39:38,545 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2025-03-03 17:39:38,776 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:39:38,784 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:39:38,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:39:38,787 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:39:38,787 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:39:38,788 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 [2025-03-03 17:39:39,915 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/177fca5d6/f89c15d91dee43b48e391158cc0b531f/FLAG9dc3d3021 [2025-03-03 17:39:40,210 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:39:40,210 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.3.prop1-func-interl.c [2025-03-03 17:39:40,226 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/177fca5d6/f89c15d91dee43b48e391158cc0b531f/FLAG9dc3d3021 [2025-03-03 17:39:40,489 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/177fca5d6/f89c15d91dee43b48e391158cc0b531f [2025-03-03 17:39:40,491 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:39:40,492 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:39:40,493 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:39:40,493 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:39:40,495 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:39:40,496 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:39:40" (1/1) ... [2025-03-03 17:39:40,496 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6969ebf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:39:40, skipping insertion in model container [2025-03-03 17:39:40,496 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:39:40" (1/1) ... [2025-03-03 17:39:40,537 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:39:40,678 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] [2025-03-03 17:39:40,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:39:40,953 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:39:40,961 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] [2025-03-03 17:39:41,073 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:39:41,084 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:39:41,085 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:39:41 WrapperNode [2025-03-03 17:39:41,085 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:39:41,086 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:39:41,086 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:39:41,086 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:39:41,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:39:41" (1/1) ... [2025-03-03 17:39:41,130 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:39:41" (1/1) ... [2025-03-03 17:39:41,498 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 4656 [2025-03-03 17:39:41,498 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:39:41,498 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:39:41,498 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:39:41,498 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:39:41,505 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:39:41" (1/1) ... [2025-03-03 17:39:41,505 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:39:41" (1/1) ... [2025-03-03 17:39:41,567 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:39:41" (1/1) ... [2025-03-03 17:39:41,680 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]. [2025-03-03 17:39:41,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:39:41" (1/1) ... [2025-03-03 17:39:41,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:39:41" (1/1) ... [2025-03-03 17:39:41,818 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:39:41" (1/1) ... [2025-03-03 17:39:41,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:39:41" (1/1) ... [2025-03-03 17:39:41,878 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:39:41" (1/1) ... [2025-03-03 17:39:41,937 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:39:41" (1/1) ... [2025-03-03 17:39:41,993 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:39:41,995 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:39:41,996 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:39:41,996 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:39:41,997 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:39:41" (1/1) ... [2025-03-03 17:39:42,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:39:42,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:39:42,022 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) [2025-03-03 17:39:42,028 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 [2025-03-03 17:39:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:39:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 17:39:42,043 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:39:42,043 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:39:42,285 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:39:42,287 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:39:46,285 INFO L? ?]: Removed 2670 outVars from TransFormulas that were not future-live. [2025-03-03 17:39:46,285 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:39:46,438 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:39:46,438 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:39:46,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:39:46 BoogieIcfgContainer [2025-03-03 17:39:46,439 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:39:46,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:39:46,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:39:46,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:39:46,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:39:40" (1/3) ... [2025-03-03 17:39:46,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d2bea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:39:46, skipping insertion in model container [2025-03-03 17:39:46,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:39:41" (2/3) ... [2025-03-03 17:39:46,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d2bea0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:39:46, skipping insertion in model container [2025-03-03 17:39:46,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:39:46" (3/3) ... [2025-03-03 17:39:46,446 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.krebs.3.prop1-func-interl.c [2025-03-03 17:39:46,458 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:39:46,460 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.krebs.3.prop1-func-interl.c that has 1 procedures, 1570 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:39:46,535 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:39:46,543 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;@37bbc3a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:39:46,543 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:39:46,551 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) [2025-03-03 17:39:46,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 17:39:46,558 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:39:46,560 INFO L218 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] [2025-03-03 17:39:46,560 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:39:46,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:39:46,565 INFO L85 PathProgramCache]: Analyzing trace with hash 786601781, now seen corresponding path program 1 times [2025-03-03 17:39:46,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:39:46,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190951163] [2025-03-03 17:39:46,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:39:46,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:39:46,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 17:39:46,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 17:39:46,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:39:46,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:39:47,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:39:47,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:39:47,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190951163] [2025-03-03 17:39:47,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190951163] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:39:47,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:39:47,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:39:47,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425717358] [2025-03-03 17:39:47,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:39:47,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:39:47,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:39:47,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:39:47,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:39:47,408 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) [2025-03-03 17:39:48,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:39:48,194 INFO L93 Difference]: Finished difference Result 3001 states and 4513 transitions. [2025-03-03 17:39:48,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:39:48,196 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 [2025-03-03 17:39:48,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:39:48,214 INFO L225 Difference]: With dead ends: 3001 [2025-03-03 17:39:48,214 INFO L226 Difference]: Without dead ends: 1569 [2025-03-03 17:39:48,222 INFO L434 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 [2025-03-03 17:39:48,224 INFO L435 NwaCegarLoop]: 1967 mSDtfsCounter, 0 mSDsluCounter, 3929 mSDsCounter, 0 mSdLazyCounter, 1168 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5896 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 17:39:48,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5896 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1168 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 17:39:48,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2025-03-03 17:39:48,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1569. [2025-03-03 17:39:48,302 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) [2025-03-03 17:39:48,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1569 states to 1569 states and 2357 transitions. [2025-03-03 17:39:48,312 INFO L78 Accepts]: Start accepts. Automaton has 1569 states and 2357 transitions. Word has length 113 [2025-03-03 17:39:48,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:39:48,313 INFO L471 AbstractCegarLoop]: Abstraction has 1569 states and 2357 transitions. [2025-03-03 17:39:48,313 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) [2025-03-03 17:39:48,313 INFO L276 IsEmpty]: Start isEmpty. Operand 1569 states and 2357 transitions. [2025-03-03 17:39:48,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 17:39:48,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:39:48,317 INFO L218 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] [2025-03-03 17:39:48,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 17:39:48,318 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:39:48,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:39:48,319 INFO L85 PathProgramCache]: Analyzing trace with hash -1380467064, now seen corresponding path program 1 times [2025-03-03 17:39:48,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:39:48,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436237208] [2025-03-03 17:39:48,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:39:48,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:39:48,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 17:39:48,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 17:39:48,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:39:48,384 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:39:48,563 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:39:48,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:39:48,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436237208] [2025-03-03 17:39:48,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436237208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:39:48,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:39:48,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:39:48,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518544876] [2025-03-03 17:39:48,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:39:48,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:39:48,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:39:48,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:39:48,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:39:48,566 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) [2025-03-03 17:39:49,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:39:49,179 INFO L93 Difference]: Finished difference Result 3002 states and 4511 transitions. [2025-03-03 17:39:49,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:39:49,180 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 [2025-03-03 17:39:49,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:39:49,186 INFO L225 Difference]: With dead ends: 3002 [2025-03-03 17:39:49,186 INFO L226 Difference]: Without dead ends: 1571 [2025-03-03 17:39:49,189 INFO L434 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 [2025-03-03 17:39:49,189 INFO L435 NwaCegarLoop]: 1967 mSDtfsCounter, 0 mSDsluCounter, 3926 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5893 SdHoareTripleChecker+Invalid, 1171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:39:49,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5893 Invalid, 1171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:39:49,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1571 states. [2025-03-03 17:39:49,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1571 to 1571. [2025-03-03 17:39:49,212 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) [2025-03-03 17:39:49,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1571 states to 1571 states and 2359 transitions. [2025-03-03 17:39:49,217 INFO L78 Accepts]: Start accepts. Automaton has 1571 states and 2359 transitions. Word has length 114 [2025-03-03 17:39:49,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:39:49,218 INFO L471 AbstractCegarLoop]: Abstraction has 1571 states and 2359 transitions. [2025-03-03 17:39:49,218 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) [2025-03-03 17:39:49,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1571 states and 2359 transitions. [2025-03-03 17:39:49,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 17:39:49,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:39:49,223 INFO L218 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] [2025-03-03 17:39:49,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 17:39:49,223 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:39:49,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:39:49,223 INFO L85 PathProgramCache]: Analyzing trace with hash 2086705552, now seen corresponding path program 1 times [2025-03-03 17:39:49,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:39:49,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799565585] [2025-03-03 17:39:49,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:39:49,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:39:49,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 17:39:49,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 17:39:49,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:39:49,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:39:49,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:39:49,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:39:49,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799565585] [2025-03-03 17:39:49,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799565585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:39:49,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:39:49,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:39:49,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482021709] [2025-03-03 17:39:49,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:39:49,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:39:49,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:39:49,507 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:39:49,507 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:39:49,507 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) [2025-03-03 17:39:50,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:39:50,235 INFO L93 Difference]: Finished difference Result 3010 states and 4521 transitions. [2025-03-03 17:39:50,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:39:50,237 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 [2025-03-03 17:39:50,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:39:50,243 INFO L225 Difference]: With dead ends: 3010 [2025-03-03 17:39:50,244 INFO L226 Difference]: Without dead ends: 1577 [2025-03-03 17:39:50,246 INFO L434 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 [2025-03-03 17:39:50,248 INFO L435 NwaCegarLoop]: 1967 mSDtfsCounter, 4 mSDsluCounter, 3921 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5888 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 17:39:50,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5888 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 17:39:50,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1577 states. [2025-03-03 17:39:50,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1577 to 1577. [2025-03-03 17:39:50,271 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) [2025-03-03 17:39:50,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2367 transitions. [2025-03-03 17:39:50,275 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2367 transitions. Word has length 115 [2025-03-03 17:39:50,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:39:50,276 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2367 transitions. [2025-03-03 17:39:50,277 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) [2025-03-03 17:39:50,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2367 transitions. [2025-03-03 17:39:50,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 17:39:50,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:39:50,279 INFO L218 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] [2025-03-03 17:39:50,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 17:39:50,279 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:39:50,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:39:50,280 INFO L85 PathProgramCache]: Analyzing trace with hash -657559918, now seen corresponding path program 1 times [2025-03-03 17:39:50,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:39:50,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405449658] [2025-03-03 17:39:50,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:39:50,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:39:50,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 17:39:50,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 17:39:50,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:39:50,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:39:50,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:39:50,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:39:50,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405449658] [2025-03-03 17:39:50,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405449658] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:39:50,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:39:50,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:39:50,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023011263] [2025-03-03 17:39:50,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:39:50,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:39:50,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:39:50,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:39:50,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:39:50,491 INFO L87 Difference]: Start difference. First operand 1577 states and 2367 transitions. Second operand has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 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) [2025-03-03 17:39:51,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:39:51,099 INFO L93 Difference]: Finished difference Result 3020 states and 4533 transitions. [2025-03-03 17:39:51,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:39:51,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 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 [2025-03-03 17:39:51,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:39:51,105 INFO L225 Difference]: With dead ends: 3020 [2025-03-03 17:39:51,105 INFO L226 Difference]: Without dead ends: 1581 [2025-03-03 17:39:51,106 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:39:51,108 INFO L435 NwaCegarLoop]: 1967 mSDtfsCounter, 0 mSDsluCounter, 3921 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5888 SdHoareTripleChecker+Invalid, 1178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 17:39:51,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5888 Invalid, 1178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1177 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 17:39:51,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2025-03-03 17:39:51,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1577. [2025-03-03 17:39:51,129 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) [2025-03-03 17:39:51,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2367 transitions. [2025-03-03 17:39:51,133 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2367 transitions. Word has length 116 [2025-03-03 17:39:51,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:39:51,134 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2367 transitions. [2025-03-03 17:39:51,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.2) internal successors, (116), 5 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) [2025-03-03 17:39:51,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2367 transitions. [2025-03-03 17:39:51,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 17:39:51,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:39:51,135 INFO L218 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] [2025-03-03 17:39:51,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 17:39:51,135 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:39:51,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:39:51,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1316123413, now seen corresponding path program 1 times [2025-03-03 17:39:51,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:39:51,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200217070] [2025-03-03 17:39:51,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:39:51,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:39:51,162 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 17:39:51,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 17:39:51,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:39:51,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:39:51,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:39:51,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:39:51,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200217070] [2025-03-03 17:39:51,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200217070] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:39:51,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:39:51,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 17:39:51,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634651148] [2025-03-03 17:39:51,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:39:51,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 17:39:51,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:39:51,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 17:39:51,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 17:39:51,444 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) [2025-03-03 17:39:53,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:39:53,294 INFO L93 Difference]: Finished difference Result 4439 states and 6665 transitions. [2025-03-03 17:39:53,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 17:39:53,295 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 [2025-03-03 17:39:53,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:39:53,304 INFO L225 Difference]: With dead ends: 4439 [2025-03-03 17:39:53,304 INFO L226 Difference]: Without dead ends: 3000 [2025-03-03 17:39:53,307 INFO L434 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 [2025-03-03 17:39:53,308 INFO L435 NwaCegarLoop]: 1580 mSDtfsCounter, 2233 mSDsluCounter, 4619 mSDsCounter, 0 mSdLazyCounter, 3016 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2233 SdHoareTripleChecker+Valid, 6199 SdHoareTripleChecker+Invalid, 3017 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 17:39:53,308 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2233 Valid, 6199 Invalid, 3017 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3016 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 17:39:53,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3000 states. [2025-03-03 17:39:53,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3000 to 1644. [2025-03-03 17:39:53,340 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) [2025-03-03 17:39:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1644 states to 1644 states and 2466 transitions. [2025-03-03 17:39:53,342 INFO L78 Accepts]: Start accepts. Automaton has 1644 states and 2466 transitions. Word has length 117 [2025-03-03 17:39:53,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:39:53,343 INFO L471 AbstractCegarLoop]: Abstraction has 1644 states and 2466 transitions. [2025-03-03 17:39:53,343 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) [2025-03-03 17:39:53,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1644 states and 2466 transitions. [2025-03-03 17:39:53,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 17:39:53,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:39:53,344 INFO L218 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] [2025-03-03 17:39:53,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 17:39:53,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:39:53,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:39:53,344 INFO L85 PathProgramCache]: Analyzing trace with hash 2021292872, now seen corresponding path program 1 times [2025-03-03 17:39:53,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:39:53,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552652325] [2025-03-03 17:39:53,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:39:53,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:39:53,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 17:39:53,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 17:39:53,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:39:53,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:39:53,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:39:53,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 17:39:53,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552652325] [2025-03-03 17:39:53,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552652325] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:39:53,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:39:53,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 17:39:53,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236212935] [2025-03-03 17:39:53,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:39:53,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 17:39:53,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 17:39:53,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 17:39:53,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-03 17:39:53,763 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) [2025-03-03 17:39:55,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:39:55,211 INFO L93 Difference]: Finished difference Result 3098 states and 4648 transitions. [2025-03-03 17:39:55,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 17:39:55,212 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 [2025-03-03 17:39:55,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:39:55,223 INFO L225 Difference]: With dead ends: 3098 [2025-03-03 17:39:55,223 INFO L226 Difference]: Without dead ends: 1659 [2025-03-03 17:39:55,224 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 17:39:55,225 INFO L435 NwaCegarLoop]: 1571 mSDtfsCounter, 2266 mSDsluCounter, 4701 mSDsCounter, 0 mSdLazyCounter, 3147 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2266 SdHoareTripleChecker+Valid, 6272 SdHoareTripleChecker+Invalid, 3148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 17:39:55,225 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2266 Valid, 6272 Invalid, 3148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3147 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 17:39:55,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2025-03-03 17:39:55,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1657. [2025-03-03 17:39:55,268 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) [2025-03-03 17:39:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1657 states to 1657 states and 2481 transitions. [2025-03-03 17:39:55,280 INFO L78 Accepts]: Start accepts. Automaton has 1657 states and 2481 transitions. Word has length 118 [2025-03-03 17:39:55,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:39:55,280 INFO L471 AbstractCegarLoop]: Abstraction has 1657 states and 2481 transitions. [2025-03-03 17:39:55,280 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) [2025-03-03 17:39:55,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1657 states and 2481 transitions. [2025-03-03 17:39:55,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 17:39:55,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:39:55,282 INFO L218 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] [2025-03-03 17:39:55,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 17:39:55,283 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:39:55,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:39:55,286 INFO L85 PathProgramCache]: Analyzing trace with hash -1455354359, now seen corresponding path program 1 times [2025-03-03 17:39:55,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 17:39:55,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584023762] [2025-03-03 17:39:55,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:39:55,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 17:39:55,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 17:39:55,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 17:39:55,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:39:55,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:39:55,425 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 17:39:55,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 17:39:55,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 17:39:55,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:39:55,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 17:39:55,516 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 17:39:55,516 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 17:39:55,517 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 17:39:55,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 17:39:55,521 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-03 17:39:55,572 WARN L310 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2025-03-03 17:39:55,587 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 17:39:55,591 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 05:39:55 BoogieIcfgContainer [2025-03-03 17:39:55,592 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 17:39:55,593 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 17:39:55,593 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 17:39:55,593 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 17:39:55,594 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:39:46" (3/4) ... [2025-03-03 17:39:55,595 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-03 17:39:55,596 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 17:39:55,596 INFO L158 Benchmark]: Toolchain (without parser) took 15104.54ms. Allocated memory was 142.6MB in the beginning and 503.3MB in the end (delta: 360.7MB). Free memory was 102.9MB in the beginning and 301.1MB in the end (delta: -198.1MB). Peak memory consumption was 169.2MB. Max. memory is 16.1GB. [2025-03-03 17:39:55,597 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:39:55,597 INFO L158 Benchmark]: CACSL2BoogieTranslator took 592.70ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 41.4MB in the end (delta: 61.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-03-03 17:39:55,597 INFO L158 Benchmark]: Boogie Procedure Inliner took 412.28ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 41.4MB in the beginning and 62.5MB in the end (delta: -21.1MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. [2025-03-03 17:39:55,597 INFO L158 Benchmark]: Boogie Preprocessor took 495.34ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 62.5MB in the beginning and 263.1MB in the end (delta: -200.7MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2025-03-03 17:39:55,598 INFO L158 Benchmark]: IcfgBuilder took 4443.25ms. Allocated memory was 394.3MB in the beginning and 503.3MB in the end (delta: 109.1MB). Free memory was 263.1MB in the beginning and 245.8MB in the end (delta: 17.3MB). Peak memory consumption was 315.0MB. Max. memory is 16.1GB. [2025-03-03 17:39:55,598 INFO L158 Benchmark]: TraceAbstraction took 9151.90ms. Allocated memory is still 503.3MB. Free memory was 245.8MB in the beginning and 301.2MB in the end (delta: -55.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 17:39:55,598 INFO L158 Benchmark]: Witness Printer took 2.88ms. Allocated memory is still 503.3MB. Free memory was 301.2MB in the beginning and 301.1MB in the end (delta: 64.4kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 17:39:55,599 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.21ms. Allocated memory is still 201.3MB. Free memory is still 127.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 592.70ms. Allocated memory is still 142.6MB. Free memory was 102.9MB in the beginning and 41.4MB in the end (delta: 61.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 412.28ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 41.4MB in the beginning and 62.5MB in the end (delta: -21.1MB). Peak memory consumption was 88.0MB. Max. memory is 16.1GB. * Boogie Preprocessor took 495.34ms. Allocated memory was 167.8MB in the beginning and 394.3MB in the end (delta: 226.5MB). Free memory was 62.5MB in the beginning and 263.1MB in the end (delta: -200.7MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. * IcfgBuilder took 4443.25ms. Allocated memory was 394.3MB in the beginning and 503.3MB in the end (delta: 109.1MB). Free memory was 263.1MB in the beginning and 245.8MB in the end (delta: 17.3MB). Peak memory consumption was 315.0MB. Max. memory is 16.1GB. * TraceAbstraction took 9151.90ms. Allocated memory is still 503.3MB. Free memory was 245.8MB in the beginning and 301.2MB in the end (delta: -55.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 2.88ms. Allocated memory is still 503.3MB. Free memory was 301.2MB in the beginning and 301.1MB in the end (delta: 64.4kB). Peak memory consumption was 8.4MB. 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 212, 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: 9.0s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4503 SdHoareTripleChecker+Valid, 5.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4503 mSDsluCounter, 36036 SdHoareTripleChecker+Invalid, 4.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25017 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10855 IncrementalHoareTripleChecker+Invalid, 10858 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 11019 mSDtfsCounter, 10855 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 19 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.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 1362 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 812 NumberOfCodeBlocks, 812 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 687 ConstructedInterpolants, 0 QuantifiedInterpolants, 1987 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-03 17:39:55,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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.3.0-?-798a7b3-m [2025-03-03 17:39:57,474 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 17:39:57,540 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-03-03 17:39:57,545 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 17:39:57,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 17:39:57,567 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 17:39:57,568 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 17:39:57,568 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 17:39:57,568 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 17:39:57,568 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 17:39:57,569 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 17:39:57,569 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 17:39:57,569 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 17:39:57,569 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 17:39:57,570 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 17:39:57,570 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 17:39:57,570 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 17:39:57,570 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 17:39:57,571 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 17:39:57,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 17:39:57,571 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 17:39:57,571 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-03 17:39:57,571 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-03 17:39:57,571 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-03 17:39:57,571 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 17:39:57,571 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 17:39:57,571 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 17:39:57,571 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 17:39:57,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 17:39:57,571 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 17:39:57,572 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 17:39:57,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:39:57,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 17:39:57,572 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 17:39:57,572 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 17:39:57,572 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 17:39:57,572 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-03 17:39:57,572 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-03 17:39:57,572 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 17:39:57,573 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 17:39:57,573 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 17:39:57,573 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 17:39:57,573 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 [2025-03-03 17:39:57,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 17:39:57,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 17:39:57,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 17:39:57,838 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 17:39:57,839 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 17:39:57,839 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 [2025-03-03 17:39:59,045 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b1276d7/ef0e6fe2455e43e5b23d48441453a6a8/FLAGa7474f6db [2025-03-03 17:39:59,295 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 17:39:59,295 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.krebs.3.prop1-func-interl.c [2025-03-03 17:39:59,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b1276d7/ef0e6fe2455e43e5b23d48441453a6a8/FLAGa7474f6db [2025-03-03 17:39:59,591 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67b1276d7/ef0e6fe2455e43e5b23d48441453a6a8 [2025-03-03 17:39:59,593 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 17:39:59,594 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 17:39:59,595 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 17:39:59,595 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 17:39:59,598 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 17:39:59,599 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:39:59" (1/1) ... [2025-03-03 17:39:59,599 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c5aa578 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:39:59, skipping insertion in model container [2025-03-03 17:39:59,599 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 05:39:59" (1/1) ... [2025-03-03 17:39:59,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 17:39:59,746 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] [2025-03-03 17:39:59,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:39:59,932 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 17:39:59,940 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] [2025-03-03 17:40:00,026 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 17:40:00,037 INFO L204 MainTranslator]: Completed translation [2025-03-03 17:40:00,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:40:00 WrapperNode [2025-03-03 17:40:00,038 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 17:40:00,039 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 17:40:00,040 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 17:40:00,040 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 17:40:00,044 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:40:00" (1/1) ... [2025-03-03 17:40:00,063 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:40:00" (1/1) ... [2025-03-03 17:40:00,118 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1536 [2025-03-03 17:40:00,119 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 17:40:00,119 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 17:40:00,119 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 17:40:00,119 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 17:40:00,125 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:40:00" (1/1) ... [2025-03-03 17:40:00,125 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:40:00" (1/1) ... [2025-03-03 17:40:00,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:40:00" (1/1) ... [2025-03-03 17:40:00,189 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]. [2025-03-03 17:40:00,190 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:40:00" (1/1) ... [2025-03-03 17:40:00,191 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:40:00" (1/1) ... [2025-03-03 17:40:00,223 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:40:00" (1/1) ... [2025-03-03 17:40:00,230 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:40:00" (1/1) ... [2025-03-03 17:40:00,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:40:00" (1/1) ... [2025-03-03 17:40:00,241 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:40:00" (1/1) ... [2025-03-03 17:40:00,253 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 17:40:00,256 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 17:40:00,256 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 17:40:00,256 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 17:40:00,257 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:40:00" (1/1) ... [2025-03-03 17:40:00,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 17:40:00,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:40:00,282 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) [2025-03-03 17:40:00,288 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 [2025-03-03 17:40:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 17:40:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-03 17:40:00,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 17:40:00,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 17:40:00,520 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 17:40:00,522 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 17:40:01,574 INFO L? ?]: Removed 71 outVars from TransFormulas that were not future-live. [2025-03-03 17:40:01,575 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 17:40:01,581 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 17:40:01,583 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 17:40:01,583 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:40:01 BoogieIcfgContainer [2025-03-03 17:40:01,584 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 17:40:01,586 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 17:40:01,586 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 17:40:01,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 17:40:01,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 05:39:59" (1/3) ... [2025-03-03 17:40:01,590 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5d93ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:40:01, skipping insertion in model container [2025-03-03 17:40:01,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 05:40:00" (2/3) ... [2025-03-03 17:40:01,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d5d93ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 05:40:01, skipping insertion in model container [2025-03-03 17:40:01,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 05:40:01" (3/3) ... [2025-03-03 17:40:01,592 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.krebs.3.prop1-func-interl.c [2025-03-03 17:40:01,603 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 17:40:01,604 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.krebs.3.prop1-func-interl.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 17:40:01,641 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 17:40:01,649 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;@6f900079, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 17:40:01,649 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 17:40:01,653 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) [2025-03-03 17:40:01,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-03 17:40:01,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:40:01,658 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-03 17:40:01,658 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:40:01,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:40:01,662 INFO L85 PathProgramCache]: Analyzing trace with hash 38140359, now seen corresponding path program 1 times [2025-03-03 17:40:01,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:40:01,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [631253312] [2025-03-03 17:40:01,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:40:01,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:40:01,673 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:40:01,675 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:40:01,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 17:40:01,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-03 17:40:01,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-03 17:40:01,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:40:01,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:40:01,994 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 17:40:02,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:40:02,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:40:02,116 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 17:40:02,117 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:40:02,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [631253312] [2025-03-03 17:40:02,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [631253312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 17:40:02,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 17:40:02,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 17:40:02,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874063527] [2025-03-03 17:40:02,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 17:40:02,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 17:40:02,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:40:02,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 17:40:02,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 17:40:02,138 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) [2025-03-03 17:40:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:40:02,249 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-03-03 17:40:02,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 17:40:02,251 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 [2025-03-03 17:40:02,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:40:02,255 INFO L225 Difference]: With dead ends: 18 [2025-03-03 17:40:02,256 INFO L226 Difference]: Without dead ends: 10 [2025-03-03 17:40:02,258 INFO L434 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 [2025-03-03 17:40:02,260 INFO L435 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 [2025-03-03 17:40:02,260 INFO L436 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] [2025-03-03 17:40:02,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-03-03 17:40:02,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-03-03 17:40:02,279 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) [2025-03-03 17:40:02,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-03-03 17:40:02,283 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-03-03 17:40:02,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:40:02,284 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-03-03 17:40:02,284 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) [2025-03-03 17:40:02,284 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-03-03 17:40:02,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 17:40:02,284 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:40:02,284 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-03 17:40:02,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 17:40:02,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:40:02,488 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:40:02,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:40:02,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1926026653, now seen corresponding path program 1 times [2025-03-03 17:40:02,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:40:02,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1551343149] [2025-03-03 17:40:02,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 17:40:02,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:40:02,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:40:02,493 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:40:02,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 17:40:02,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 17:40:02,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 17:40:02,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 17:40:02,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:40:02,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 17:40:02,871 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 17:40:03,221 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:40:03,222 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 17:40:23,678 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 17:40:23,678 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-03 17:40:23,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551343149] [2025-03-03 17:40:23,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551343149] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 17:40:23,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 17:40:23,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2025-03-03 17:40:23,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422146661] [2025-03-03 17:40:23,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 17:40:23,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 17:40:23,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-03 17:40:23,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 17:40:23,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=87, Unknown=4, NotChecked=0, Total=132 [2025-03-03 17:40:23,681 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:40:28,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 17:40:28,276 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2025-03-03 17:40:28,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 17:40:28,277 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 17:40:28,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 17:40:28,277 INFO L225 Difference]: With dead ends: 18 [2025-03-03 17:40:28,277 INFO L226 Difference]: Without dead ends: 16 [2025-03-03 17:40:28,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=92, Invalid=176, Unknown=4, NotChecked=0, Total=272 [2025-03-03 17:40:28,278 INFO L435 NwaCegarLoop]: 4 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 17:40:28,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 19 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 17:40:28,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2025-03-03 17:40:28,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2025-03-03 17:40:28,281 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) [2025-03-03 17:40:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2025-03-03 17:40:28,281 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2025-03-03 17:40:28,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 17:40:28,281 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2025-03-03 17:40:28,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 17:40:28,282 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2025-03-03 17:40:28,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 17:40:28,282 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 17:40:28,282 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2025-03-03 17:40:28,292 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 17:40:28,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:40:28,486 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 17:40:28,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 17:40:28,487 INFO L85 PathProgramCache]: Analyzing trace with hash -506187805, now seen corresponding path program 2 times [2025-03-03 17:40:28,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-03 17:40:28,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [763134627] [2025-03-03 17:40:28,488 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 17:40:28,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 17:40:28,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 17:40:28,491 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 17:40:28,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 17:40:28,900 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 14 statements into 2 equivalence classes. [2025-03-03 17:40:29,069 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 17:40:29,069 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 17:40:29,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 17:40:29,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-03-03 17:40:29,110 INFO L279 TraceCheckSpWp]: Computing forward predicates...