./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 82abe2bc16b32af306db7c09a41c9db0587ba64425916c43bed05447e1d05407 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 07:17:31,216 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 07:17:31,252 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2025-01-09 07:17:31,256 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 07:17:31,256 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 07:17:31,278 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 07:17:31,279 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 07:17:31,279 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 07:17:31,279 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 07:17:31,279 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 07:17:31,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 07:17:31,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 07:17:31,280 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 07:17:31,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 07:17:31,280 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 07:17:31,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 07:17:31,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 07:17:31,280 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 07:17:31,281 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 07:17:31,281 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 07:17:31,281 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 07:17:31,281 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 07:17:31,281 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 07:17:31,281 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 07:17:31,281 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 07:17:31,281 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 07:17:31,281 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:17:31,281 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:17:31,281 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:17:31,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:17:31,282 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 07:17:31,282 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:17:31,282 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:17:31,282 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:17:31,282 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:17:31,282 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 07:17:31,282 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 07:17:31,282 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 07:17:31,282 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 07:17:31,283 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 07:17:31,283 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 07:17:31,283 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 07:17:31,283 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 07:17:31,283 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 07:17:31,283 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 07:17:31,283 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-jdk21/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 -> 82abe2bc16b32af306db7c09a41c9db0587ba64425916c43bed05447e1d05407 [2025-01-09 07:17:31,480 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 07:17:31,486 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 07:17:31,487 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 07:17:31,488 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 07:17:31,488 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 07:17:31,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c [2025-01-09 07:17:32,666 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0cc9af33c/10022e12fc73464eb82a4eff2dbb516a/FLAGd9846a312 [2025-01-09 07:17:33,012 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 07:17:33,012 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c [2025-01-09 07:17:33,027 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0cc9af33c/10022e12fc73464eb82a4eff2dbb516a/FLAGd9846a312 [2025-01-09 07:17:33,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0cc9af33c/10022e12fc73464eb82a4eff2dbb516a [2025-01-09 07:17:33,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 07:17:33,047 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 07:17:33,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 07:17:33,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 07:17:33,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 07:17:33,051 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:17:33" (1/1) ... [2025-01-09 07:17:33,052 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30eec23c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:33, skipping insertion in model container [2025-01-09 07:17:33,052 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:17:33" (1/1) ... [2025-01-09 07:17:33,090 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 07:17:33,229 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c[1174,1187] [2025-01-09 07:17:33,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:17:33,458 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 07:17:33,470 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c[1174,1187] [2025-01-09 07:17:33,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:17:33,578 INFO L204 MainTranslator]: Completed translation [2025-01-09 07:17:33,580 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:33 WrapperNode [2025-01-09 07:17:33,581 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 07:17:33,581 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 07:17:33,582 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 07:17:33,582 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 07:17:33,586 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:33" (1/1) ... [2025-01-09 07:17:33,617 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:33" (1/1) ... [2025-01-09 07:17:33,992 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 3784 [2025-01-09 07:17:33,994 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 07:17:33,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 07:17:33,995 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 07:17:33,995 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 07:17:34,002 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:33" (1/1) ... [2025-01-09 07:17:34,003 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:33" (1/1) ... [2025-01-09 07:17:34,062 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:33" (1/1) ... [2025-01-09 07:17:34,205 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-01-09 07:17:34,206 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:33" (1/1) ... [2025-01-09 07:17:34,206 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:33" (1/1) ... [2025-01-09 07:17:34,270 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:33" (1/1) ... [2025-01-09 07:17:34,285 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:33" (1/1) ... [2025-01-09 07:17:34,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:33" (1/1) ... [2025-01-09 07:17:34,342 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:33" (1/1) ... [2025-01-09 07:17:34,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:33" (1/1) ... [2025-01-09 07:17:34,407 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 07:17:34,409 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 07:17:34,409 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 07:17:34,410 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 07:17:34,410 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:33" (1/1) ... [2025-01-09 07:17:34,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:17:34,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:17:34,439 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 07:17:34,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 07:17:34,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 07:17:34,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 07:17:34,459 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 07:17:34,459 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 07:17:34,658 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 07:17:34,660 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 07:17:37,618 INFO L? ?]: Removed 2119 outVars from TransFormulas that were not future-live. [2025-01-09 07:17:37,618 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 07:17:37,639 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 07:17:37,639 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 07:17:37,640 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:17:37 BoogieIcfgContainer [2025-01-09 07:17:37,640 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 07:17:37,641 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 07:17:37,641 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 07:17:37,644 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 07:17:37,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:17:33" (1/3) ... [2025-01-09 07:17:37,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f71a916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:17:37, skipping insertion in model container [2025-01-09 07:17:37,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:33" (2/3) ... [2025-01-09 07:17:37,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f71a916 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:17:37, skipping insertion in model container [2025-01-09 07:17:37,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:17:37" (3/3) ... [2025-01-09 07:17:37,645 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.fischer.1.prop1-func-interl.c [2025-01-09 07:17:37,662 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 07:17:37,663 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.fischer.1.prop1-func-interl.c that has 1 procedures, 1328 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 07:17:37,750 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 07:17:37,759 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;@1e110e93, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 07:17:37,760 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 07:17:37,768 INFO L276 IsEmpty]: Start isEmpty. Operand has 1328 states, 1326 states have (on average 1.5015082956259427) internal successors, (1991), 1327 states have internal predecessors, (1991), 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-01-09 07:17:37,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2025-01-09 07:17:37,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:17:37,776 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] [2025-01-09 07:17:37,777 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:17:37,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:17:37,781 INFO L85 PathProgramCache]: Analyzing trace with hash 356374767, now seen corresponding path program 1 times [2025-01-09 07:17:37,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:17:37,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566066474] [2025-01-09 07:17:37,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:17:37,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:17:37,880 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 77 statements into 1 equivalence classes. [2025-01-09 07:17:37,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 77 of 77 statements. [2025-01-09 07:17:37,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:17:37,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:17:38,424 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:17:38,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:17:38,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566066474] [2025-01-09 07:17:38,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1566066474] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:17:38,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:17:38,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:17:38,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683257527] [2025-01-09 07:17:38,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:17:38,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:17:38,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:17:38,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:17:38,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:17:38,449 INFO L87 Difference]: Start difference. First operand has 1328 states, 1326 states have (on average 1.5015082956259427) internal successors, (1991), 1327 states have internal predecessors, (1991), 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 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-01-09 07:17:38,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:17:38,604 INFO L93 Difference]: Finished difference Result 2581 states and 3873 transitions. [2025-01-09 07:17:38,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:17:38,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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 77 [2025-01-09 07:17:38,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:17:38,620 INFO L225 Difference]: With dead ends: 2581 [2025-01-09 07:17:38,621 INFO L226 Difference]: Without dead ends: 1327 [2025-01-09 07:17:38,625 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-01-09 07:17:38,627 INFO L435 NwaCegarLoop]: 1985 mSDtfsCounter, 0 mSDsluCounter, 3964 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5949 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:17:38,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5949 Invalid, 11 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:17:38,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2025-01-09 07:17:38,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1327. [2025-01-09 07:17:38,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 1326 states have (on average 1.5) internal successors, (1989), 1326 states have internal predecessors, (1989), 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-01-09 07:17:38,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1989 transitions. [2025-01-09 07:17:38,689 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1989 transitions. Word has length 77 [2025-01-09 07:17:38,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:17:38,689 INFO L471 AbstractCegarLoop]: Abstraction has 1327 states and 1989 transitions. [2025-01-09 07:17:38,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.25) internal successors, (77), 4 states have internal predecessors, (77), 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-01-09 07:17:38,690 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1989 transitions. [2025-01-09 07:17:38,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 07:17:38,691 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:17:38,691 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] [2025-01-09 07:17:38,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 07:17:38,691 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:17:38,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:17:38,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1835588490, now seen corresponding path program 1 times [2025-01-09 07:17:38,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:17:38,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037620682] [2025-01-09 07:17:38,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:17:38,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:17:38,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 07:17:38,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 07:17:38,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:17:38,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:17:38,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:17:38,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:17:38,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037620682] [2025-01-09 07:17:38,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037620682] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:17:38,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:17:38,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:17:38,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449835769] [2025-01-09 07:17:38,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:17:38,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:17:38,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:17:38,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:17:38,912 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:17:38,913 INFO L87 Difference]: Start difference. First operand 1327 states and 1989 transitions. Second operand has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-01-09 07:17:38,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:17:38,973 INFO L93 Difference]: Finished difference Result 2582 states and 3871 transitions. [2025-01-09 07:17:38,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:17:38,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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 78 [2025-01-09 07:17:38,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:17:38,980 INFO L225 Difference]: With dead ends: 2582 [2025-01-09 07:17:38,980 INFO L226 Difference]: Without dead ends: 1329 [2025-01-09 07:17:38,982 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-01-09 07:17:38,982 INFO L435 NwaCegarLoop]: 1985 mSDtfsCounter, 0 mSDsluCounter, 3960 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 5945 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:17:38,982 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 5945 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:17:38,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2025-01-09 07:17:39,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 1329. [2025-01-09 07:17:39,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1329 states, 1328 states have (on average 1.4992469879518073) internal successors, (1991), 1328 states have internal predecessors, (1991), 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-01-09 07:17:39,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1329 states to 1329 states and 1991 transitions. [2025-01-09 07:17:39,009 INFO L78 Accepts]: Start accepts. Automaton has 1329 states and 1991 transitions. Word has length 78 [2025-01-09 07:17:39,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:17:39,011 INFO L471 AbstractCegarLoop]: Abstraction has 1329 states and 1991 transitions. [2025-01-09 07:17:39,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.5) internal successors, (78), 4 states have internal predecessors, (78), 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-01-09 07:17:39,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1329 states and 1991 transitions. [2025-01-09 07:17:39,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 07:17:39,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:17:39,012 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] [2025-01-09 07:17:39,012 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 07:17:39,013 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:17:39,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:17:39,013 INFO L85 PathProgramCache]: Analyzing trace with hash 2128333480, now seen corresponding path program 1 times [2025-01-09 07:17:39,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:17:39,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738964584] [2025-01-09 07:17:39,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:17:39,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:17:39,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 07:17:39,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 07:17:39,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:17:39,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:17:39,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:17:39,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:17:39,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738964584] [2025-01-09 07:17:39,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738964584] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:17:39,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:17:39,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:17:39,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769084644] [2025-01-09 07:17:39,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:17:39,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:17:39,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:17:39,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:17:39,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:17:39,219 INFO L87 Difference]: Start difference. First operand 1329 states and 1991 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-01-09 07:17:39,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:17:39,267 INFO L93 Difference]: Finished difference Result 2590 states and 3881 transitions. [2025-01-09 07:17:39,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:17:39,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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 79 [2025-01-09 07:17:39,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:17:39,276 INFO L225 Difference]: With dead ends: 2590 [2025-01-09 07:17:39,276 INFO L226 Difference]: Without dead ends: 1335 [2025-01-09 07:17:39,282 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-01-09 07:17:39,284 INFO L435 NwaCegarLoop]: 1985 mSDtfsCounter, 4 mSDsluCounter, 3954 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 5939 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:17:39,284 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 5939 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:17:39,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1335 states. [2025-01-09 07:17:39,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1335 to 1335. [2025-01-09 07:17:39,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1335 states, 1334 states have (on average 1.4985007496251874) internal successors, (1999), 1334 states have internal predecessors, (1999), 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-01-09 07:17:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1999 transitions. [2025-01-09 07:17:39,310 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1999 transitions. Word has length 79 [2025-01-09 07:17:39,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:17:39,311 INFO L471 AbstractCegarLoop]: Abstraction has 1335 states and 1999 transitions. [2025-01-09 07:17:39,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 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-01-09 07:17:39,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1999 transitions. [2025-01-09 07:17:39,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 07:17:39,314 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:17:39,315 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] [2025-01-09 07:17:39,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 07:17:39,315 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:17:39,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:17:39,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1687081468, now seen corresponding path program 1 times [2025-01-09 07:17:39,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:17:39,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364281665] [2025-01-09 07:17:39,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:17:39,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:17:39,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 07:17:39,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 07:17:39,368 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:17:39,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:17:39,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:17:39,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:17:39,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364281665] [2025-01-09 07:17:39,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364281665] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:17:39,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:17:39,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:17:39,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616238371] [2025-01-09 07:17:39,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:17:39,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:17:39,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:17:39,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:17:39,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:17:39,563 INFO L87 Difference]: Start difference. First operand 1335 states and 1999 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-01-09 07:17:39,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:17:39,633 INFO L93 Difference]: Finished difference Result 2600 states and 3893 transitions. [2025-01-09 07:17:39,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:17:39,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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 80 [2025-01-09 07:17:39,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:17:39,647 INFO L225 Difference]: With dead ends: 2600 [2025-01-09 07:17:39,647 INFO L226 Difference]: Without dead ends: 1339 [2025-01-09 07:17:39,649 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-01-09 07:17:39,650 INFO L435 NwaCegarLoop]: 1985 mSDtfsCounter, 0 mSDsluCounter, 5921 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7906 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 07:17:39,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7906 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 07:17:39,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2025-01-09 07:17:39,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1335. [2025-01-09 07:17:39,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1335 states, 1334 states have (on average 1.4985007496251874) internal successors, (1999), 1334 states have internal predecessors, (1999), 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-01-09 07:17:39,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 1999 transitions. [2025-01-09 07:17:39,704 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 1999 transitions. Word has length 80 [2025-01-09 07:17:39,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:17:39,704 INFO L471 AbstractCegarLoop]: Abstraction has 1335 states and 1999 transitions. [2025-01-09 07:17:39,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 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-01-09 07:17:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 1999 transitions. [2025-01-09 07:17:39,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 07:17:39,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:17:39,705 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] [2025-01-09 07:17:39,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 07:17:39,705 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:17:39,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:17:39,706 INFO L85 PathProgramCache]: Analyzing trace with hash 148969313, now seen corresponding path program 1 times [2025-01-09 07:17:39,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:17:39,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638834795] [2025-01-09 07:17:39,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:17:39,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:17:39,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-01-09 07:17:39,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-01-09 07:17:39,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:17:39,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:17:40,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:17:40,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:17:40,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638834795] [2025-01-09 07:17:40,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638834795] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:17:40,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:17:40,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 07:17:40,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272543194] [2025-01-09 07:17:40,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:17:40,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 07:17:40,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:17:40,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 07:17:40,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 07:17:40,051 INFO L87 Difference]: Start difference. First operand 1335 states and 1999 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-01-09 07:17:41,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:17:41,609 INFO L93 Difference]: Finished difference Result 3841 states and 5753 transitions. [2025-01-09 07:17:41,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 07:17:41,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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 81 [2025-01-09 07:17:41,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:17:41,618 INFO L225 Difference]: With dead ends: 3841 [2025-01-09 07:17:41,618 INFO L226 Difference]: Without dead ends: 2580 [2025-01-09 07:17:41,620 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-01-09 07:17:41,621 INFO L435 NwaCegarLoop]: 1496 mSDtfsCounter, 1901 mSDsluCounter, 4404 mSDsCounter, 0 mSdLazyCounter, 1939 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1901 SdHoareTripleChecker+Valid, 5900 SdHoareTripleChecker+Invalid, 1940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1939 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 07:17:41,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1901 Valid, 5900 Invalid, 1940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1939 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 07:17:41,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2580 states. [2025-01-09 07:17:41,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2580 to 1394. [2025-01-09 07:17:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1394 states, 1393 states have (on average 1.4974874371859297) internal successors, (2086), 1393 states have internal predecessors, (2086), 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-01-09 07:17:41,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1394 states to 1394 states and 2086 transitions. [2025-01-09 07:17:41,652 INFO L78 Accepts]: Start accepts. Automaton has 1394 states and 2086 transitions. Word has length 81 [2025-01-09 07:17:41,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:17:41,652 INFO L471 AbstractCegarLoop]: Abstraction has 1394 states and 2086 transitions. [2025-01-09 07:17:41,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 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-01-09 07:17:41,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1394 states and 2086 transitions. [2025-01-09 07:17:41,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 07:17:41,652 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:17:41,653 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] [2025-01-09 07:17:41,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 07:17:41,653 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:17:41,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:17:41,653 INFO L85 PathProgramCache]: Analyzing trace with hash 557066048, now seen corresponding path program 1 times [2025-01-09 07:17:41,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:17:41,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516980889] [2025-01-09 07:17:41,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:17:41,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:17:41,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 07:17:41,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 07:17:41,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:17:41,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:17:42,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:17:42,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 07:17:42,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516980889] [2025-01-09 07:17:42,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516980889] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:17:42,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:17:42,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 07:17:42,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382860282] [2025-01-09 07:17:42,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:17:42,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 07:17:42,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 07:17:42,112 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 07:17:42,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 07:17:42,112 INFO L87 Difference]: Start difference. First operand 1394 states and 2086 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-01-09 07:17:43,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:17:43,248 INFO L93 Difference]: Finished difference Result 2670 states and 3996 transitions. [2025-01-09 07:17:43,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 07:17:43,248 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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 82 [2025-01-09 07:17:43,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:17:43,254 INFO L225 Difference]: With dead ends: 2670 [2025-01-09 07:17:43,254 INFO L226 Difference]: Without dead ends: 1409 [2025-01-09 07:17:43,255 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-01-09 07:17:43,256 INFO L435 NwaCegarLoop]: 1481 mSDtfsCounter, 1934 mSDsluCounter, 4430 mSDsCounter, 0 mSdLazyCounter, 2037 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1934 SdHoareTripleChecker+Valid, 5911 SdHoareTripleChecker+Invalid, 2038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 07:17:43,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1934 Valid, 5911 Invalid, 2038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2037 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 07:17:43,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2025-01-09 07:17:43,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1407. [2025-01-09 07:17:43,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1407 states, 1406 states have (on average 1.4943100995732574) internal successors, (2101), 1406 states have internal predecessors, (2101), 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-01-09 07:17:43,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1407 states to 1407 states and 2101 transitions. [2025-01-09 07:17:43,274 INFO L78 Accepts]: Start accepts. Automaton has 1407 states and 2101 transitions. Word has length 82 [2025-01-09 07:17:43,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:17:43,274 INFO L471 AbstractCegarLoop]: Abstraction has 1407 states and 2101 transitions. [2025-01-09 07:17:43,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 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-01-09 07:17:43,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1407 states and 2101 transitions. [2025-01-09 07:17:43,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 07:17:43,275 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:17:43,275 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] [2025-01-09 07:17:43,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 07:17:43,275 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:17:43,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:17:43,276 INFO L85 PathProgramCache]: Analyzing trace with hash 408525058, now seen corresponding path program 1 times [2025-01-09 07:17:43,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 07:17:43,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106446577] [2025-01-09 07:17:43,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:17:43,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 07:17:43,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 07:17:43,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 07:17:43,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:17:43,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 07:17:43,315 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 07:17:43,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 07:17:43,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 07:17:43,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:17:43,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 07:17:43,394 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 07:17:43,394 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 07:17:43,395 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 07:17:43,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 07:17:43,399 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-01-09 07:17:43,527 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 07:17:43,531 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 07:17:43 BoogieIcfgContainer [2025-01-09 07:17:43,531 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 07:17:43,532 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 07:17:43,532 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 07:17:43,532 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 07:17:43,533 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:17:37" (3/4) ... [2025-01-09 07:17:43,534 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 07:17:43,534 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 07:17:43,535 INFO L158 Benchmark]: Toolchain (without parser) took 10488.67ms. Allocated memory was 201.3MB in the beginning and 553.6MB in the end (delta: 352.3MB). Free memory was 157.5MB in the beginning and 434.2MB in the end (delta: -276.7MB). Peak memory consumption was 75.9MB. Max. memory is 16.1GB. [2025-01-09 07:17:43,535 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 218.1MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 07:17:43,535 INFO L158 Benchmark]: CACSL2BoogieTranslator took 533.46ms. Allocated memory is still 201.3MB. Free memory was 157.4MB in the beginning and 106.3MB in the end (delta: 51.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-09 07:17:43,536 INFO L158 Benchmark]: Boogie Procedure Inliner took 412.49ms. Allocated memory was 201.3MB in the beginning and 209.7MB in the end (delta: 8.4MB). Free memory was 106.3MB in the beginning and 95.4MB in the end (delta: 10.9MB). Peak memory consumption was 104.4MB. Max. memory is 16.1GB. [2025-01-09 07:17:43,537 INFO L158 Benchmark]: Boogie Preprocessor took 413.32ms. Allocated memory is still 209.7MB. Free memory was 95.2MB in the beginning and 81.1MB in the end (delta: 14.1MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. [2025-01-09 07:17:43,537 INFO L158 Benchmark]: RCFGBuilder took 3230.60ms. Allocated memory was 209.7MB in the beginning and 453.0MB in the end (delta: 243.3MB). Free memory was 81.1MB in the beginning and 208.7MB in the end (delta: -127.6MB). Peak memory consumption was 247.1MB. Max. memory is 16.1GB. [2025-01-09 07:17:43,537 INFO L158 Benchmark]: TraceAbstraction took 5890.21ms. Allocated memory was 453.0MB in the beginning and 553.6MB in the end (delta: 100.7MB). Free memory was 208.7MB in the beginning and 434.2MB in the end (delta: -225.5MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. [2025-01-09 07:17:43,537 INFO L158 Benchmark]: Witness Printer took 2.80ms. Allocated memory is still 553.6MB. Free memory was 434.2MB in the beginning and 434.2MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 07:17:43,539 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 218.1MB. Free memory is still 133.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 533.46ms. Allocated memory is still 201.3MB. Free memory was 157.4MB in the beginning and 106.3MB in the end (delta: 51.1MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 412.49ms. Allocated memory was 201.3MB in the beginning and 209.7MB in the end (delta: 8.4MB). Free memory was 106.3MB in the beginning and 95.4MB in the end (delta: 10.9MB). Peak memory consumption was 104.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 413.32ms. Allocated memory is still 209.7MB. Free memory was 95.2MB in the beginning and 81.1MB in the end (delta: 14.1MB). Peak memory consumption was 35.3MB. Max. memory is 16.1GB. * RCFGBuilder took 3230.60ms. Allocated memory was 209.7MB in the beginning and 453.0MB in the end (delta: 243.3MB). Free memory was 81.1MB in the beginning and 208.7MB in the end (delta: -127.6MB). Peak memory consumption was 247.1MB. Max. memory is 16.1GB. * TraceAbstraction took 5890.21ms. Allocated memory was 453.0MB in the beginning and 553.6MB in the end (delta: 100.7MB). Free memory was 208.7MB in the beginning and 434.2MB in the end (delta: -225.5MB). Peak memory consumption was 132.1MB. Max. memory is 16.1GB. * Witness Printer took 2.80ms. Allocated memory is still 553.6MB. Free memory was 434.2MB in the beginning and 434.2MB in the end (delta: 38.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 186, overapproximation of bitwiseAnd at line 184. 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_14 = 0; [L40] const SORT_4 var_43 = 1; [L41] const SORT_4 var_44 = 0; [L42] const SORT_2 var_54 = 0; [L43] const SORT_2 var_56 = 3; [L44] const SORT_2 var_59 = 2; [L45] const SORT_2 var_62 = 1; [L46] const SORT_2 var_70 = 255; [L47] const SORT_3 var_74 = 0; [L48] const SORT_4 var_78 = 255; [L50] SORT_1 input_53; [L51] SORT_1 input_55; [L52] SORT_1 input_57; [L53] SORT_1 input_58; [L54] SORT_1 input_60; [L55] SORT_1 input_61; [L56] SORT_1 input_71; [L57] SORT_1 input_72; [L58] SORT_1 input_73; [L59] SORT_1 input_90; [L60] SORT_1 input_91; [L61] SORT_1 input_106; [L62] SORT_1 input_107; [L63] SORT_1 input_124; [L64] SORT_1 input_132; [L65] SORT_1 input_140; [L66] SORT_1 input_148; [L67] SORT_1 input_156; [L68] SORT_1 input_164; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L70] SORT_2 state_6 = __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_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L71] SORT_2 state_8 = __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_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L72] SORT_2 state_10 = __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_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L73] SORT_2 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L74] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L74] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L75] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L75] SORT_1 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L76] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L76] SORT_1 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L77] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L77] SORT_1 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L78] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L78] SORT_1 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L79] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, var_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L79] SORT_1 state_25 = __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_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L80] SORT_1 state_27 = __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_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L81] SORT_1 state_29 = __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_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L82] SORT_1 state_31 = __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_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L83] SORT_1 state_33 = __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_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L84] SORT_1 state_35 = __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_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L85] SORT_1 state_37 = __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_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L86] SORT_1 state_39 = __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_14=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_5=0, var_62=1, var_70=255, var_74=0, var_78=255] [L87] SORT_1 state_41 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L89] SORT_2 init_7_arg_1 = var_5; [L90] state_6 = init_7_arg_1 [L91] SORT_2 init_9_arg_1 = var_5; [L92] state_8 = init_9_arg_1 [L93] SORT_2 init_11_arg_1 = var_5; [L94] state_10 = init_11_arg_1 [L95] SORT_2 init_13_arg_1 = var_5; [L96] state_12 = init_13_arg_1 [L97] SORT_1 init_16_arg_1 = var_14; [L98] state_15 = init_16_arg_1 [L99] SORT_1 init_18_arg_1 = var_14; [L100] state_17 = init_18_arg_1 [L101] SORT_1 init_20_arg_1 = var_14; [L102] state_19 = init_20_arg_1 [L103] SORT_1 init_22_arg_1 = var_14; [L104] state_21 = init_22_arg_1 [L105] SORT_1 init_24_arg_1 = var_14; [L106] state_23 = init_24_arg_1 [L107] SORT_1 init_26_arg_1 = var_14; [L108] state_25 = init_26_arg_1 [L109] SORT_1 init_28_arg_1 = var_14; [L110] state_27 = init_28_arg_1 [L111] SORT_1 init_30_arg_1 = var_14; [L112] state_29 = init_30_arg_1 [L113] SORT_1 init_32_arg_1 = var_14; [L114] state_31 = init_32_arg_1 [L115] SORT_1 init_34_arg_1 = var_14; [L116] state_33 = init_34_arg_1 [L117] SORT_1 init_36_arg_1 = var_14; [L118] state_35 = init_36_arg_1 [L119] SORT_1 init_38_arg_1 = var_14; [L120] state_37 = init_38_arg_1 [L121] SORT_1 init_40_arg_1 = var_14; [L122] state_39 = init_40_arg_1 [L123] SORT_1 init_42_arg_1 = var_14; [L124] state_41 = init_42_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L127] input_53 = __VERIFIER_nondet_uchar() [L128] EXPR input_53 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L128] input_53 = input_53 & mask_SORT_1 [L129] input_55 = __VERIFIER_nondet_uchar() [L130] EXPR input_55 & mask_SORT_1 VAL [input_53=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L130] input_55 = input_55 & mask_SORT_1 [L131] input_57 = __VERIFIER_nondet_uchar() [L132] EXPR input_57 & mask_SORT_1 VAL [input_53=0, input_55=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L132] input_57 = input_57 & mask_SORT_1 [L133] input_58 = __VERIFIER_nondet_uchar() [L134] EXPR input_58 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L134] input_58 = input_58 & mask_SORT_1 [L135] input_60 = __VERIFIER_nondet_uchar() [L136] EXPR input_60 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L136] input_60 = input_60 & mask_SORT_1 [L137] input_61 = __VERIFIER_nondet_uchar() [L138] EXPR input_61 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L138] input_61 = input_61 & mask_SORT_1 [L139] input_71 = __VERIFIER_nondet_uchar() [L140] EXPR input_71 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L140] input_71 = input_71 & mask_SORT_1 [L141] input_72 = __VERIFIER_nondet_uchar() [L142] EXPR input_72 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L142] input_72 = input_72 & mask_SORT_1 [L143] input_73 = __VERIFIER_nondet_uchar() [L144] EXPR input_73 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L144] input_73 = input_73 & mask_SORT_1 [L145] input_90 = __VERIFIER_nondet_uchar() [L146] EXPR input_90 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L146] input_90 = input_90 & mask_SORT_1 [L147] input_91 = __VERIFIER_nondet_uchar() [L148] EXPR input_91 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L148] input_91 = input_91 & mask_SORT_1 [L149] input_106 = __VERIFIER_nondet_uchar() [L150] EXPR input_106 & mask_SORT_1 VAL [input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L150] input_106 = input_106 & mask_SORT_1 [L151] input_107 = __VERIFIER_nondet_uchar() [L152] EXPR input_107 & mask_SORT_1 VAL [input_106=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L152] input_107 = input_107 & mask_SORT_1 [L153] input_124 = __VERIFIER_nondet_uchar() [L154] input_132 = __VERIFIER_nondet_uchar() [L155] input_140 = __VERIFIER_nondet_uchar() [L156] input_148 = __VERIFIER_nondet_uchar() [L157] input_156 = __VERIFIER_nondet_uchar() [L158] input_164 = __VERIFIER_nondet_uchar() [L161] SORT_1 var_45_arg_0 = state_23; [L162] SORT_4 var_45_arg_1 = var_43; [L163] SORT_4 var_45_arg_2 = var_44; [L164] SORT_4 var_45 = var_45_arg_0 ? var_45_arg_1 : var_45_arg_2; [L165] SORT_1 var_46_arg_0 = state_31; [L166] SORT_4 var_46_arg_1 = var_43; [L167] SORT_4 var_46_arg_2 = var_44; [L168] SORT_4 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L169] SORT_4 var_47_arg_0 = var_45; [L170] SORT_4 var_47_arg_1 = var_46; [L171] SORT_4 var_47 = var_47_arg_0 + var_47_arg_1; [L172] SORT_1 var_48_arg_0 = state_39; [L173] SORT_4 var_48_arg_1 = var_43; [L174] SORT_4 var_48_arg_2 = var_44; [L175] SORT_4 var_48 = var_48_arg_0 ? var_48_arg_1 : var_48_arg_2; [L176] SORT_4 var_49_arg_0 = var_47; [L177] SORT_4 var_49_arg_1 = var_48; [L178] SORT_4 var_49 = var_49_arg_0 + var_49_arg_1; VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_49=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L179] EXPR var_49 & mask_SORT_4 VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L179] var_49 = var_49 & mask_SORT_4 [L180] SORT_4 var_50_arg_0 = var_49; [L181] SORT_4 var_50_arg_1 = var_43; [L182] SORT_1 var_50 = var_50_arg_0 <= var_50_arg_1; [L183] SORT_1 var_51_arg_0 = ~state_41; VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_50=1, var_51_arg_0=-1, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L184] EXPR var_51_arg_0 & mask_SORT_1 VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_50=1, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L184] var_51_arg_0 = var_51_arg_0 & mask_SORT_1 [L185] SORT_1 var_51_arg_1 = ~var_50; VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_51_arg_0=1, var_51_arg_1=-2, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L186] EXPR var_51_arg_1 & mask_SORT_1 VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_51_arg_0=1, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L186] var_51_arg_1 = var_51_arg_1 & mask_SORT_1 [L187] EXPR var_51_arg_0 & var_51_arg_1 VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L187] SORT_1 var_51 = var_51_arg_0 & var_51_arg_1; [L188] EXPR var_51 & mask_SORT_1 VAL [input_106=0, input_107=0, input_53=0, input_55=0, input_57=0, input_58=0, input_60=0, input_61=0, input_71=0, input_72=0, input_73=0, input_90=0, input_91=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_4=-1, state_10=0, state_12=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_25=0, state_27=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_39=0, state_41=0, state_6=0, state_8=0, var_43=1, var_44=0, var_54=0, var_56=3, var_59=2, var_62=1, var_70=255, var_74=0, var_78=255] [L188] var_51 = var_51 & mask_SORT_1 [L189] SORT_1 bad_52_arg_0 = var_51; [L190] CALL __VERIFIER_assert(!(bad_52_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 1328 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.7s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3839 SdHoareTripleChecker+Valid, 2.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3839 mSDsluCounter, 37550 SdHoareTripleChecker+Invalid, 2.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 26633 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4064 IncrementalHoareTripleChecker+Invalid, 4067 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 10917 mSDtfsCounter, 4064 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=1407occurred 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, 1192 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 560 NumberOfCodeBlocks, 560 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 471 ConstructedInterpolants, 0 QuantifiedInterpolants, 1339 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-01-09 07:17:43,564 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 82abe2bc16b32af306db7c09a41c9db0587ba64425916c43bed05447e1d05407 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 07:17:45,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 07:17:45,723 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2025-01-09 07:17:45,728 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 07:17:45,730 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 07:17:45,752 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 07:17:45,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 07:17:45,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 07:17:45,754 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 07:17:45,754 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 07:17:45,754 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 07:17:45,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 07:17:45,755 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 07:17:45,755 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 07:17:45,755 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 07:17:45,755 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 07:17:45,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 07:17:45,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 07:17:45,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 07:17:45,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 07:17:45,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 07:17:45,756 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 07:17:45,756 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 07:17:45,756 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 07:17:45,756 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 07:17:45,756 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 07:17:45,756 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 07:17:45,756 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 07:17:45,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:17:45,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:17:45,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:17:45,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:17:45,757 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 07:17:45,757 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 07:17:45,757 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 07:17:45,757 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 07:17:45,757 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:17:45,757 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 07:17:45,757 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 07:17:45,757 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 07:17:45,757 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 07:17:45,757 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 07:17:45,757 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 07:17:45,758 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 07:17:45,758 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 07:17:45,758 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 07:17:45,758 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 07:17:45,758 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-jdk21/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 -> 82abe2bc16b32af306db7c09a41c9db0587ba64425916c43bed05447e1d05407 [2025-01-09 07:17:46,005 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 07:17:46,012 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 07:17:46,013 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 07:17:46,015 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 07:17:46,015 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 07:17:46,016 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c [2025-01-09 07:17:47,518 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb5fa048f/9328ada9196b4dca9b9e759d713acd68/FLAG3db4d951a [2025-01-09 07:17:47,748 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 07:17:47,749 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c [2025-01-09 07:17:47,758 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb5fa048f/9328ada9196b4dca9b9e759d713acd68/FLAG3db4d951a [2025-01-09 07:17:48,092 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cb5fa048f/9328ada9196b4dca9b9e759d713acd68 [2025-01-09 07:17:48,094 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 07:17:48,096 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 07:17:48,097 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 07:17:48,098 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 07:17:48,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 07:17:48,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:17:48" (1/1) ... [2025-01-09 07:17:48,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b102258 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:48, skipping insertion in model container [2025-01-09 07:17:48,104 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 07:17:48" (1/1) ... [2025-01-09 07:17:48,140 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 07:17:48,295 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c[1174,1187] [2025-01-09 07:17:48,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:17:48,529 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 07:17:48,541 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.fischer.1.prop1-func-interl.c[1174,1187] [2025-01-09 07:17:48,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 07:17:48,662 INFO L204 MainTranslator]: Completed translation [2025-01-09 07:17:48,662 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:48 WrapperNode [2025-01-09 07:17:48,662 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 07:17:48,663 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 07:17:48,663 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 07:17:48,663 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 07:17:48,672 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:48" (1/1) ... [2025-01-09 07:17:48,700 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:48" (1/1) ... [2025-01-09 07:17:48,744 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1148 [2025-01-09 07:17:48,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 07:17:48,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 07:17:48,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 07:17:48,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 07:17:48,755 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:48" (1/1) ... [2025-01-09 07:17:48,756 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:48" (1/1) ... [2025-01-09 07:17:48,761 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:48" (1/1) ... [2025-01-09 07:17:48,784 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-01-09 07:17:48,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:48" (1/1) ... [2025-01-09 07:17:48,785 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:48" (1/1) ... [2025-01-09 07:17:48,801 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:48" (1/1) ... [2025-01-09 07:17:48,803 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:48" (1/1) ... [2025-01-09 07:17:48,806 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:48" (1/1) ... [2025-01-09 07:17:48,809 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:48" (1/1) ... [2025-01-09 07:17:48,812 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:48" (1/1) ... [2025-01-09 07:17:48,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 07:17:48,819 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 07:17:48,820 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 07:17:48,820 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 07:17:48,820 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:48" (1/1) ... [2025-01-09 07:17:48,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 07:17:48,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:17:48,851 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 07:17:48,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 07:17:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 07:17:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 07:17:48,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 07:17:48,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 07:17:49,117 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 07:17:49,118 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 07:17:50,006 INFO L? ?]: Removed 74 outVars from TransFormulas that were not future-live. [2025-01-09 07:17:50,006 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 07:17:50,013 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 07:17:50,013 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 07:17:50,013 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:17:50 BoogieIcfgContainer [2025-01-09 07:17:50,013 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 07:17:50,014 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 07:17:50,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 07:17:50,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 07:17:50,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 07:17:48" (1/3) ... [2025-01-09 07:17:50,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9187276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:17:50, skipping insertion in model container [2025-01-09 07:17:50,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 07:17:48" (2/3) ... [2025-01-09 07:17:50,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9187276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 07:17:50, skipping insertion in model container [2025-01-09 07:17:50,019 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 07:17:50" (3/3) ... [2025-01-09 07:17:50,020 INFO L128 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.fischer.1.prop1-func-interl.c [2025-01-09 07:17:50,029 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 07:17:50,030 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG btor2c-lazyMod.fischer.1.prop1-func-interl.c that has 1 procedures, 10 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 07:17:50,062 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 07:17:50,072 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;@792216b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 07:17:50,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 07:17:50,076 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-01-09 07:17:50,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-01-09 07:17:50,078 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:17:50,079 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-01-09 07:17:50,079 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:17:50,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:17:50,082 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2025-01-09 07:17:50,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 07:17:50,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [4220300] [2025-01-09 07:17:50,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:17:50,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:17:50,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:17:50,095 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:17:50,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 07:17:50,275 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-01-09 07:17:50,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-01-09 07:17:50,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:17:50,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:17:50,305 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-01-09 07:17:50,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 07:17:50,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 07:17:50,554 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 07:17:50,554 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 07:17:50,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4220300] [2025-01-09 07:17:50,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4220300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 07:17:50,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 07:17:50,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 07:17:50,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763681855] [2025-01-09 07:17:50,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 07:17:50,565 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 07:17:50,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 07:17:50,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 07:17:50,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 07:17:50,588 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-01-09 07:17:50,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 07:17:50,704 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2025-01-09 07:17:50,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 07:17:50,705 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-01-09 07:17:50,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 07:17:50,713 INFO L225 Difference]: With dead ends: 18 [2025-01-09 07:17:50,713 INFO L226 Difference]: Without dead ends: 10 [2025-01-09 07:17:50,714 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-01-09 07:17:50,720 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-01-09 07:17:50,720 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-01-09 07:17:50,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2025-01-09 07:17:50,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2025-01-09 07:17:50,746 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-01-09 07:17:50,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2025-01-09 07:17:50,752 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2025-01-09 07:17:50,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 07:17:50,752 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2025-01-09 07:17:50,753 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-01-09 07:17:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2025-01-09 07:17:50,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-01-09 07:17:50,753 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 07:17:50,753 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-01-09 07:17:50,767 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 07:17:50,955 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:17:50,955 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 07:17:50,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 07:17:50,955 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2025-01-09 07:17:50,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 07:17:50,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [223623114] [2025-01-09 07:17:50,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 07:17:50,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 07:17:50,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 07:17:50,963 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 07:17:50,964 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 07:17:51,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-09 07:17:51,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-09 07:17:51,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 07:17:51,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 07:17:51,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 48 conjuncts are in the unsatisfiable core [2025-01-09 07:17:51,303 INFO L279 TraceCheckSpWp]: Computing forward predicates...