./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mcs.2.prop1-func-interl.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mcs.2.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3c22b85d347581119638421811f37a37cce681028ee2583c8ff4c6119cb50fe4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 01:31:48,050 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 01:31:48,120 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-20 01:31:48,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 01:31:48,125 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 01:31:48,153 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 01:31:48,154 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 01:31:48,154 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 01:31:48,155 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 01:31:48,156 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 01:31:48,157 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 01:31:48,158 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 01:31:48,158 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 01:31:48,159 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 01:31:48,159 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 01:31:48,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 01:31:48,162 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 01:31:48,163 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 01:31:48,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 01:31:48,163 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 01:31:48,163 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 01:31:48,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 01:31:48,164 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 01:31:48,164 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 01:31:48,164 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 01:31:48,165 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 01:31:48,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 01:31:48,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 01:31:48,165 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 01:31:48,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 01:31:48,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 01:31:48,166 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 01:31:48,166 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 01:31:48,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 01:31:48,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 01:31:48,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 01:31:48,169 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 01:31:48,170 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 01:31:48,170 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 01:31:48,170 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3c22b85d347581119638421811f37a37cce681028ee2583c8ff4c6119cb50fe4 [2024-11-20 01:31:48,424 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 01:31:48,453 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 01:31:48,457 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 01:31:48,458 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 01:31:48,459 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 01:31:48,460 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mcs.2.prop1-func-interl.c [2024-11-20 01:31:49,930 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 01:31:50,267 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 01:31:50,268 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mcs.2.prop1-func-interl.c [2024-11-20 01:31:50,296 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/669094632/9c54bef6830d4aee9c99ac5d623a5e68/FLAGfbb96ee75 [2024-11-20 01:31:50,519 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/669094632/9c54bef6830d4aee9c99ac5d623a5e68 [2024-11-20 01:31:50,522 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 01:31:50,524 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 01:31:50,525 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 01:31:50,525 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 01:31:50,531 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 01:31:50,531 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:31:50" (1/1) ... [2024-11-20 01:31:50,532 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10d8775b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:31:50, skipping insertion in model container [2024-11-20 01:31:50,532 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:31:50" (1/1) ... [2024-11-20 01:31:50,604 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 01:31:50,878 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mcs.2.prop1-func-interl.c[1170,1183] [2024-11-20 01:31:51,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 01:31:51,344 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 01:31:51,355 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mcs.2.prop1-func-interl.c[1170,1183] [2024-11-20 01:31:51,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 01:31:51,539 INFO L204 MainTranslator]: Completed translation [2024-11-20 01:31:51,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:31:51 WrapperNode [2024-11-20 01:31:51,540 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 01:31:51,541 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 01:31:51,541 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 01:31:51,541 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 01:31:51,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:31:51" (1/1) ... [2024-11-20 01:31:51,625 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:31:51" (1/1) ... [2024-11-20 01:31:52,848 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 7700 [2024-11-20 01:31:52,848 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 01:31:52,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 01:31:52,854 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 01:31:52,854 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 01:31:52,870 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:31:51" (1/1) ... [2024-11-20 01:31:52,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:31:51" (1/1) ... [2024-11-20 01:31:53,213 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:31:51" (1/1) ... [2024-11-20 01:31:53,521 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 01:31:53,522 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:31:51" (1/1) ... [2024-11-20 01:31:53,522 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:31:51" (1/1) ... [2024-11-20 01:31:53,828 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:31:51" (1/1) ... [2024-11-20 01:31:53,880 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:31:51" (1/1) ... [2024-11-20 01:31:53,941 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:31:51" (1/1) ... [2024-11-20 01:31:53,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:31:51" (1/1) ... [2024-11-20 01:31:54,177 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 01:31:54,179 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 01:31:54,179 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 01:31:54,179 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 01:31:54,180 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:31:51" (1/1) ... [2024-11-20 01:31:54,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 01:31:54,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 01:31:54,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 01:31:54,220 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 01:31:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 01:31:54,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 01:31:54,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 01:31:54,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 01:31:54,708 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 01:31:54,710 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 01:32:03,731 INFO L? ?]: Removed 4338 outVars from TransFormulas that were not future-live. [2024-11-20 01:32:03,732 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 01:32:03,802 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 01:32:03,802 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 01:32:03,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:32:03 BoogieIcfgContainer [2024-11-20 01:32:03,803 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 01:32:03,807 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 01:32:03,807 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 01:32:03,810 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 01:32:03,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:31:50" (1/3) ... [2024-11-20 01:32:03,811 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15700131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:32:03, skipping insertion in model container [2024-11-20 01:32:03,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:31:51" (2/3) ... [2024-11-20 01:32:03,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15700131 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:32:03, skipping insertion in model container [2024-11-20 01:32:03,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:32:03" (3/3) ... [2024-11-20 01:32:03,814 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mcs.2.prop1-func-interl.c [2024-11-20 01:32:03,831 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 01:32:03,831 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 01:32:03,965 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 01:32:03,972 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;@4cbb8b63, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 01:32:03,973 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 01:32:03,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 2726 states, 2724 states have (on average 1.501101321585903) internal successors, (4089), 2725 states have internal predecessors, (4089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:04,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-20 01:32:04,003 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 01:32:04,003 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 01:32:04,004 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 01:32:04,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 01:32:04,011 INFO L85 PathProgramCache]: Analyzing trace with hash 1194632520, now seen corresponding path program 1 times [2024-11-20 01:32:04,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 01:32:04,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815901916] [2024-11-20 01:32:04,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 01:32:04,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 01:32:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 01:32:05,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 01:32:05,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 01:32:05,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815901916] [2024-11-20 01:32:05,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815901916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 01:32:05,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 01:32:05,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 01:32:05,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694954575] [2024-11-20 01:32:05,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 01:32:05,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 01:32:05,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 01:32:05,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 01:32:05,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 01:32:05,073 INFO L87 Difference]: Start difference. First operand has 2726 states, 2724 states have (on average 1.501101321585903) internal successors, (4089), 2725 states have internal predecessors, (4089), 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 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:05,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 01:32:05,280 INFO L93 Difference]: Finished difference Result 5285 states and 7931 transitions. [2024-11-20 01:32:05,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 01:32:05,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 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 127 [2024-11-20 01:32:05,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 01:32:05,318 INFO L225 Difference]: With dead ends: 5285 [2024-11-20 01:32:05,318 INFO L226 Difference]: Without dead ends: 2725 [2024-11-20 01:32:05,330 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 01:32:05,334 INFO L432 NwaCegarLoop]: 4083 mSDtfsCounter, 0 mSDsluCounter, 8160 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12243 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 [2024-11-20 01:32:05,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12243 Invalid, 11 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 01:32:05,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2725 states. [2024-11-20 01:32:05,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2725 to 2725. [2024-11-20 01:32:05,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2725 states, 2724 states have (on average 1.500367107195301) internal successors, (4087), 2724 states have internal predecessors, (4087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:05,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2725 states to 2725 states and 4087 transitions. [2024-11-20 01:32:05,477 INFO L78 Accepts]: Start accepts. Automaton has 2725 states and 4087 transitions. Word has length 127 [2024-11-20 01:32:05,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 01:32:05,479 INFO L471 AbstractCegarLoop]: Abstraction has 2725 states and 4087 transitions. [2024-11-20 01:32:05,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:05,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2725 states and 4087 transitions. [2024-11-20 01:32:05,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-20 01:32:05,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 01:32:05,484 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 01:32:05,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 01:32:05,485 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 01:32:05,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 01:32:05,485 INFO L85 PathProgramCache]: Analyzing trace with hash -1619401598, now seen corresponding path program 1 times [2024-11-20 01:32:05,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 01:32:05,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959172471] [2024-11-20 01:32:05,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 01:32:05,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 01:32:05,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 01:32:05,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 01:32:05,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 01:32:05,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959172471] [2024-11-20 01:32:05,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959172471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 01:32:05,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 01:32:05,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 01:32:05,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592303022] [2024-11-20 01:32:05,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 01:32:05,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 01:32:05,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 01:32:05,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 01:32:05,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 01:32:05,871 INFO L87 Difference]: Start difference. First operand 2725 states and 4087 transitions. Second operand has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:05,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 01:32:05,970 INFO L93 Difference]: Finished difference Result 5286 states and 7929 transitions. [2024-11-20 01:32:05,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 01:32:05,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 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 128 [2024-11-20 01:32:05,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 01:32:05,984 INFO L225 Difference]: With dead ends: 5286 [2024-11-20 01:32:05,984 INFO L226 Difference]: Without dead ends: 2727 [2024-11-20 01:32:05,988 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 01:32:05,991 INFO L432 NwaCegarLoop]: 4083 mSDtfsCounter, 0 mSDsluCounter, 8156 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12239 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 01:32:05,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12239 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 01:32:05,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2024-11-20 01:32:06,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2727. [2024-11-20 01:32:06,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2727 states, 2726 states have (on average 1.5) internal successors, (4089), 2726 states have internal predecessors, (4089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:06,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2727 states to 2727 states and 4089 transitions. [2024-11-20 01:32:06,051 INFO L78 Accepts]: Start accepts. Automaton has 2727 states and 4089 transitions. Word has length 128 [2024-11-20 01:32:06,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 01:32:06,053 INFO L471 AbstractCegarLoop]: Abstraction has 2727 states and 4089 transitions. [2024-11-20 01:32:06,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.0) internal successors, (128), 4 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:06,053 INFO L276 IsEmpty]: Start isEmpty. Operand 2727 states and 4089 transitions. [2024-11-20 01:32:06,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-20 01:32:06,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 01:32:06,057 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 01:32:06,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 01:32:06,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 01:32:06,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 01:32:06,062 INFO L85 PathProgramCache]: Analyzing trace with hash 240192865, now seen corresponding path program 1 times [2024-11-20 01:32:06,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 01:32:06,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82841379] [2024-11-20 01:32:06,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 01:32:06,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 01:32:06,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 01:32:06,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 01:32:06,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 01:32:06,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82841379] [2024-11-20 01:32:06,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82841379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 01:32:06,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 01:32:06,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 01:32:06,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543598739] [2024-11-20 01:32:06,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 01:32:06,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 01:32:06,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 01:32:06,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 01:32:06,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 01:32:06,474 INFO L87 Difference]: Start difference. First operand 2727 states and 4089 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:06,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 01:32:06,592 INFO L93 Difference]: Finished difference Result 5290 states and 7933 transitions. [2024-11-20 01:32:06,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 01:32:06,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 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 129 [2024-11-20 01:32:06,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 01:32:06,605 INFO L225 Difference]: With dead ends: 5290 [2024-11-20 01:32:06,605 INFO L226 Difference]: Without dead ends: 2729 [2024-11-20 01:32:06,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 01:32:06,613 INFO L432 NwaCegarLoop]: 4083 mSDtfsCounter, 0 mSDsluCounter, 8150 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 12233 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 01:32:06,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 12233 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 01:32:06,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2024-11-20 01:32:06,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 2729. [2024-11-20 01:32:06,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2729 states, 2728 states have (on average 1.4996334310850439) internal successors, (4091), 2728 states have internal predecessors, (4091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:06,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2729 states to 2729 states and 4091 transitions. [2024-11-20 01:32:06,685 INFO L78 Accepts]: Start accepts. Automaton has 2729 states and 4091 transitions. Word has length 129 [2024-11-20 01:32:06,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 01:32:06,686 INFO L471 AbstractCegarLoop]: Abstraction has 2729 states and 4091 transitions. [2024-11-20 01:32:06,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:06,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2729 states and 4091 transitions. [2024-11-20 01:32:06,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-20 01:32:06,689 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 01:32:06,690 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 01:32:06,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 01:32:06,690 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 01:32:06,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 01:32:06,692 INFO L85 PathProgramCache]: Analyzing trace with hash -235068183, now seen corresponding path program 1 times [2024-11-20 01:32:06,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 01:32:06,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42112118] [2024-11-20 01:32:06,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 01:32:06,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 01:32:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 01:32:07,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 01:32:07,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 01:32:07,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42112118] [2024-11-20 01:32:07,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42112118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 01:32:07,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 01:32:07,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 01:32:07,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356830701] [2024-11-20 01:32:07,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 01:32:07,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 01:32:07,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 01:32:07,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 01:32:07,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 01:32:07,025 INFO L87 Difference]: Start difference. First operand 2729 states and 4091 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:07,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 01:32:07,144 INFO L93 Difference]: Finished difference Result 5300 states and 7945 transitions. [2024-11-20 01:32:07,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 01:32:07,144 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 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 130 [2024-11-20 01:32:07,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 01:32:07,155 INFO L225 Difference]: With dead ends: 5300 [2024-11-20 01:32:07,156 INFO L226 Difference]: Without dead ends: 2737 [2024-11-20 01:32:07,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 01:32:07,164 INFO L432 NwaCegarLoop]: 4083 mSDtfsCounter, 3 mSDsluCounter, 8150 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 12233 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 01:32:07,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 12233 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 01:32:07,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2737 states. [2024-11-20 01:32:07,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 2733. [2024-11-20 01:32:07,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2733 states, 2732 states have (on average 1.4996339677891655) internal successors, (4097), 2732 states have internal predecessors, (4097), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:07,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2733 states to 2733 states and 4097 transitions. [2024-11-20 01:32:07,236 INFO L78 Accepts]: Start accepts. Automaton has 2733 states and 4097 transitions. Word has length 130 [2024-11-20 01:32:07,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 01:32:07,236 INFO L471 AbstractCegarLoop]: Abstraction has 2733 states and 4097 transitions. [2024-11-20 01:32:07,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:07,237 INFO L276 IsEmpty]: Start isEmpty. Operand 2733 states and 4097 transitions. [2024-11-20 01:32:07,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-20 01:32:07,240 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 01:32:07,240 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 01:32:07,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 01:32:07,240 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 01:32:07,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 01:32:07,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1877952390, now seen corresponding path program 1 times [2024-11-20 01:32:07,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 01:32:07,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600898101] [2024-11-20 01:32:07,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 01:32:07,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 01:32:07,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 01:32:07,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 01:32:07,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 01:32:07,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600898101] [2024-11-20 01:32:07,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600898101] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 01:32:07,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 01:32:07,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 01:32:07,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706284312] [2024-11-20 01:32:07,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 01:32:07,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 01:32:07,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 01:32:07,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 01:32:07,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 01:32:07,735 INFO L87 Difference]: Start difference. First operand 2733 states and 4097 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:10,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 01:32:10,515 INFO L93 Difference]: Finished difference Result 7851 states and 11771 transitions. [2024-11-20 01:32:10,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 01:32:10,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 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 131 [2024-11-20 01:32:10,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 01:32:10,536 INFO L225 Difference]: With dead ends: 7851 [2024-11-20 01:32:10,537 INFO L226 Difference]: Without dead ends: 5284 [2024-11-20 01:32:10,543 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 01:32:10,544 INFO L432 NwaCegarLoop]: 3219 mSDtfsCounter, 3949 mSDsluCounter, 9520 mSDsCounter, 0 mSdLazyCounter, 3354 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3949 SdHoareTripleChecker+Valid, 12739 SdHoareTripleChecker+Invalid, 3355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-20 01:32:10,545 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3949 Valid, 12739 Invalid, 3355 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1 Valid, 3354 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-20 01:32:10,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5284 states. [2024-11-20 01:32:10,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5284 to 2800. [2024-11-20 01:32:10,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2800 states, 2799 states have (on average 1.4991068238656664) internal successors, (4196), 2799 states have internal predecessors, (4196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:10,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2800 states to 2800 states and 4196 transitions. [2024-11-20 01:32:10,632 INFO L78 Accepts]: Start accepts. Automaton has 2800 states and 4196 transitions. Word has length 131 [2024-11-20 01:32:10,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 01:32:10,632 INFO L471 AbstractCegarLoop]: Abstraction has 2800 states and 4196 transitions. [2024-11-20 01:32:10,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:10,633 INFO L276 IsEmpty]: Start isEmpty. Operand 2800 states and 4196 transitions. [2024-11-20 01:32:10,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-20 01:32:10,635 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 01:32:10,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 01:32:10,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 01:32:10,635 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 01:32:10,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 01:32:10,636 INFO L85 PathProgramCache]: Analyzing trace with hash 2147003020, now seen corresponding path program 1 times [2024-11-20 01:32:10,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 01:32:10,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323930402] [2024-11-20 01:32:10,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 01:32:10,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 01:32:10,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 01:32:11,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 01:32:11,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 01:32:11,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323930402] [2024-11-20 01:32:11,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323930402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 01:32:11,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 01:32:11,330 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 01:32:11,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374974795] [2024-11-20 01:32:11,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 01:32:11,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 01:32:11,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 01:32:11,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 01:32:11,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 01:32:11,333 INFO L87 Difference]: Start difference. First operand 2800 states and 4196 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:13,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 01:32:13,514 INFO L93 Difference]: Finished difference Result 5382 states and 8066 transitions. [2024-11-20 01:32:13,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 01:32:13,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 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 132 [2024-11-20 01:32:13,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 01:32:13,525 INFO L225 Difference]: With dead ends: 5382 [2024-11-20 01:32:13,526 INFO L226 Difference]: Without dead ends: 2815 [2024-11-20 01:32:13,530 INFO L431 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 [2024-11-20 01:32:13,532 INFO L432 NwaCegarLoop]: 3207 mSDtfsCounter, 3982 mSDsluCounter, 9607 mSDsCounter, 0 mSdLazyCounter, 3525 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3982 SdHoareTripleChecker+Valid, 12814 SdHoareTripleChecker+Invalid, 3526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-20 01:32:13,532 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3982 Valid, 12814 Invalid, 3526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3525 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-20 01:32:13,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2024-11-20 01:32:13,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2813. [2024-11-20 01:32:13,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2813 states, 2812 states have (on average 1.4975106685633002) internal successors, (4211), 2812 states have internal predecessors, (4211), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:13,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2813 states to 2813 states and 4211 transitions. [2024-11-20 01:32:13,587 INFO L78 Accepts]: Start accepts. Automaton has 2813 states and 4211 transitions. Word has length 132 [2024-11-20 01:32:13,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 01:32:13,588 INFO L471 AbstractCegarLoop]: Abstraction has 2813 states and 4211 transitions. [2024-11-20 01:32:13,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:13,591 INFO L276 IsEmpty]: Start isEmpty. Operand 2813 states and 4211 transitions. [2024-11-20 01:32:13,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-20 01:32:13,594 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 01:32:13,594 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 01:32:13,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 01:32:13,594 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 01:32:13,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 01:32:13,595 INFO L85 PathProgramCache]: Analyzing trace with hash -1843036037, now seen corresponding path program 1 times [2024-11-20 01:32:13,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 01:32:13,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519070759] [2024-11-20 01:32:13,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 01:32:13,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 01:32:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 01:32:13,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 01:32:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 01:32:13,831 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 01:32:13,831 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 01:32:13,832 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 01:32:13,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 01:32:13,837 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-20 01:32:13,937 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 01:32:13,941 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:32:13 BoogieIcfgContainer [2024-11-20 01:32:13,943 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 01:32:13,943 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 01:32:13,943 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 01:32:13,943 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 01:32:13,944 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:32:03" (3/4) ... [2024-11-20 01:32:13,946 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 01:32:13,947 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 01:32:13,948 INFO L158 Benchmark]: Toolchain (without parser) took 23424.55ms. Allocated memory was 167.8MB in the beginning and 2.7GB in the end (delta: 2.5GB). Free memory was 93.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.3GB. Max. memory is 16.1GB. [2024-11-20 01:32:13,948 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 01:32:13,948 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1015.44ms. Allocated memory is still 167.8MB. Free memory was 92.7MB in the beginning and 56.2MB in the end (delta: 36.5MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. [2024-11-20 01:32:13,949 INFO L158 Benchmark]: Boogie Procedure Inliner took 1311.12ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 56.2MB in the beginning and 260.0MB in the end (delta: -203.8MB). Peak memory consumption was 155.8MB. Max. memory is 16.1GB. [2024-11-20 01:32:13,949 INFO L158 Benchmark]: Boogie Preprocessor took 1324.09ms. Allocated memory is still 436.2MB. Free memory was 260.0MB in the beginning and 188.5MB in the end (delta: 71.6MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. [2024-11-20 01:32:13,949 INFO L158 Benchmark]: RCFGBuilder took 9624.64ms. Allocated memory was 436.2MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 188.5MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 554.4MB. Max. memory is 16.1GB. [2024-11-20 01:32:13,949 INFO L158 Benchmark]: TraceAbstraction took 10136.15ms. Allocated memory was 1.7GB in the beginning and 2.7GB in the end (delta: 968.9MB). Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: -5.2MB). Peak memory consumption was 963.6MB. Max. memory is 16.1GB. [2024-11-20 01:32:13,949 INFO L158 Benchmark]: Witness Printer took 4.35ms. Allocated memory is still 2.7GB. Free memory is still 1.4GB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 01:32:13,952 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 167.8MB. Free memory is still 121.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1015.44ms. Allocated memory is still 167.8MB. Free memory was 92.7MB in the beginning and 56.2MB in the end (delta: 36.5MB). Peak memory consumption was 43.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 1311.12ms. Allocated memory was 167.8MB in the beginning and 436.2MB in the end (delta: 268.4MB). Free memory was 56.2MB in the beginning and 260.0MB in the end (delta: -203.8MB). Peak memory consumption was 155.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 1324.09ms. Allocated memory is still 436.2MB. Free memory was 260.0MB in the beginning and 188.5MB in the end (delta: 71.6MB). Peak memory consumption was 75.8MB. Max. memory is 16.1GB. * RCFGBuilder took 9624.64ms. Allocated memory was 436.2MB in the beginning and 1.7GB in the end (delta: 1.3GB). Free memory was 188.5MB in the beginning and 1.4GB in the end (delta: -1.2GB). Peak memory consumption was 554.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10136.15ms. Allocated memory was 1.7GB in the beginning and 2.7GB in the end (delta: 968.9MB). Free memory was 1.4GB in the beginning and 1.4GB in the end (delta: -5.2MB). Peak memory consumption was 963.6MB. Max. memory is 16.1GB. * Witness Printer took 4.35ms. Allocated memory is still 2.7GB. Free memory is still 1.4GB. 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 291. 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 - 32); [L33] const SORT_3 msb_SORT_3 = (SORT_3)1 << (32 - 1); [L35] const SORT_2 var_4 = 0; [L36] const SORT_1 var_25 = 0; [L37] const SORT_3 var_88 = 1; [L38] const SORT_3 var_89 = 0; [L39] const SORT_2 var_98 = 255; [L40] const SORT_2 var_100 = 0; [L41] const SORT_2 var_103 = 2; [L42] const SORT_2 var_107 = 1; [L44] SORT_1 input_99; [L45] SORT_1 input_104; [L46] SORT_1 input_108; [L47] SORT_1 input_111; [L48] SORT_1 input_123; [L49] SORT_1 input_135; [L50] SORT_1 input_147; [L51] SORT_1 input_148; [L52] SORT_1 input_152; [L53] SORT_1 input_153; [L54] SORT_1 input_157; [L55] SORT_1 input_158; [L56] SORT_1 input_162; [L57] SORT_1 input_163; [L58] SORT_1 input_164; [L59] SORT_1 input_165; [L60] SORT_1 input_166; [L61] SORT_1 input_167; [L62] SORT_1 input_191; [L63] SORT_1 input_193; [L64] SORT_1 input_203; [L65] SORT_1 input_208; [L66] SORT_1 input_210; [L67] SORT_1 input_215; [L68] SORT_1 input_219; [L69] SORT_1 input_234; [L70] SORT_1 input_236; [L71] SORT_1 input_246; [L72] SORT_1 input_251; [L73] SORT_1 input_253; [L74] SORT_1 input_258; [L75] SORT_1 input_262; [L76] SORT_1 input_277; [L77] SORT_1 input_279; [L78] SORT_1 input_289; [L79] SORT_1 input_294; [L80] SORT_1 input_296; [L81] SORT_1 input_301; [L82] SORT_1 input_305; [L84] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L84] SORT_2 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L85] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L85] SORT_2 state_7 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L86] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L86] SORT_2 state_9 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L87] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L87] SORT_2 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L88] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L88] SORT_2 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L89] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L89] SORT_2 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L90] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L90] SORT_2 state_17 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L91] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L91] SORT_2 state_19 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L92] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L92] SORT_2 state_21 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L93] EXPR __VERIFIER_nondet_uchar() & mask_SORT_2 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L93] SORT_2 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L94] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L94] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L95] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L95] SORT_1 state_28 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L96] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L96] SORT_1 state_30 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L97] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L97] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L98] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L98] SORT_1 state_34 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L99] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L99] SORT_1 state_36 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L100] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L100] SORT_1 state_38 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L101] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L101] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L102] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L102] SORT_1 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L103] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L103] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L104] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L104] SORT_1 state_46 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L105] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L105] SORT_1 state_48 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L106] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L106] SORT_1 state_50 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L107] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L107] SORT_1 state_52 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L108] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L108] SORT_1 state_54 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L109] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L109] SORT_1 state_56 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L110] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L110] SORT_1 state_58 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L111] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L111] SORT_1 state_60 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L112] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L112] SORT_1 state_62 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L113] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L113] SORT_1 state_64 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L114] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L114] SORT_1 state_66 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L115] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L115] SORT_1 state_68 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L116] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L116] SORT_1 state_70 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L117] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L117] SORT_1 state_72 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L118] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L118] SORT_1 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L119] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L119] SORT_1 state_76 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L120] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L120] SORT_1 state_78 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L121] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L121] SORT_1 state_80 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L122] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L122] SORT_1 state_82 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L123] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L123] SORT_1 state_84 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L124] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, var_100=0, var_103=2, var_107=1, var_25=0, var_4=0, var_88=1, var_89=0, var_98=255] [L124] SORT_1 state_86 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L126] SORT_2 init_6_arg_1 = var_4; [L127] state_5 = init_6_arg_1 [L128] SORT_2 init_8_arg_1 = var_4; [L129] state_7 = init_8_arg_1 [L130] SORT_2 init_10_arg_1 = var_4; [L131] state_9 = init_10_arg_1 [L132] SORT_2 init_12_arg_1 = var_4; [L133] state_11 = init_12_arg_1 [L134] SORT_2 init_14_arg_1 = var_4; [L135] state_13 = init_14_arg_1 [L136] SORT_2 init_16_arg_1 = var_4; [L137] state_15 = init_16_arg_1 [L138] SORT_2 init_18_arg_1 = var_4; [L139] state_17 = init_18_arg_1 [L140] SORT_2 init_20_arg_1 = var_4; [L141] state_19 = init_20_arg_1 [L142] SORT_2 init_22_arg_1 = var_4; [L143] state_21 = init_22_arg_1 [L144] SORT_2 init_24_arg_1 = var_4; [L145] state_23 = init_24_arg_1 [L146] SORT_1 init_27_arg_1 = var_25; [L147] state_26 = init_27_arg_1 [L148] SORT_1 init_29_arg_1 = var_25; [L149] state_28 = init_29_arg_1 [L150] SORT_1 init_31_arg_1 = var_25; [L151] state_30 = init_31_arg_1 [L152] SORT_1 init_33_arg_1 = var_25; [L153] state_32 = init_33_arg_1 [L154] SORT_1 init_35_arg_1 = var_25; [L155] state_34 = init_35_arg_1 [L156] SORT_1 init_37_arg_1 = var_25; [L157] state_36 = init_37_arg_1 [L158] SORT_1 init_39_arg_1 = var_25; [L159] state_38 = init_39_arg_1 [L160] SORT_1 init_41_arg_1 = var_25; [L161] state_40 = init_41_arg_1 [L162] SORT_1 init_43_arg_1 = var_25; [L163] state_42 = init_43_arg_1 [L164] SORT_1 init_45_arg_1 = var_25; [L165] state_44 = init_45_arg_1 [L166] SORT_1 init_47_arg_1 = var_25; [L167] state_46 = init_47_arg_1 [L168] SORT_1 init_49_arg_1 = var_25; [L169] state_48 = init_49_arg_1 [L170] SORT_1 init_51_arg_1 = var_25; [L171] state_50 = init_51_arg_1 [L172] SORT_1 init_53_arg_1 = var_25; [L173] state_52 = init_53_arg_1 [L174] SORT_1 init_55_arg_1 = var_25; [L175] state_54 = init_55_arg_1 [L176] SORT_1 init_57_arg_1 = var_25; [L177] state_56 = init_57_arg_1 [L178] SORT_1 init_59_arg_1 = var_25; [L179] state_58 = init_59_arg_1 [L180] SORT_1 init_61_arg_1 = var_25; [L181] state_60 = init_61_arg_1 [L182] SORT_1 init_63_arg_1 = var_25; [L183] state_62 = init_63_arg_1 [L184] SORT_1 init_65_arg_1 = var_25; [L185] state_64 = init_65_arg_1 [L186] SORT_1 init_67_arg_1 = var_25; [L187] state_66 = init_67_arg_1 [L188] SORT_1 init_69_arg_1 = var_25; [L189] state_68 = init_69_arg_1 [L190] SORT_1 init_71_arg_1 = var_25; [L191] state_70 = init_71_arg_1 [L192] SORT_1 init_73_arg_1 = var_25; [L193] state_72 = init_73_arg_1 [L194] SORT_1 init_75_arg_1 = var_25; [L195] state_74 = init_75_arg_1 [L196] SORT_1 init_77_arg_1 = var_25; [L197] state_76 = init_77_arg_1 [L198] SORT_1 init_79_arg_1 = var_25; [L199] state_78 = init_79_arg_1 [L200] SORT_1 init_81_arg_1 = var_25; [L201] state_80 = init_81_arg_1 [L202] SORT_1 init_83_arg_1 = var_25; [L203] state_82 = init_83_arg_1 [L204] SORT_1 init_85_arg_1 = var_25; [L205] state_84 = init_85_arg_1 [L206] SORT_1 init_87_arg_1 = var_25; [L207] state_86 = init_87_arg_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L210] input_99 = __VERIFIER_nondet_uchar() [L211] input_104 = __VERIFIER_nondet_uchar() [L212] input_108 = __VERIFIER_nondet_uchar() [L213] input_111 = __VERIFIER_nondet_uchar() [L214] EXPR input_111 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L214] input_111 = input_111 & mask_SORT_1 [L215] input_123 = __VERIFIER_nondet_uchar() [L216] EXPR input_123 & mask_SORT_1 VAL [input_111=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L216] input_123 = input_123 & mask_SORT_1 [L217] input_135 = __VERIFIER_nondet_uchar() [L218] EXPR input_135 & mask_SORT_1 VAL [input_111=0, input_123=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L218] input_135 = input_135 & mask_SORT_1 [L219] input_147 = __VERIFIER_nondet_uchar() [L220] EXPR input_147 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L220] input_147 = input_147 & mask_SORT_1 [L221] input_148 = __VERIFIER_nondet_uchar() [L222] EXPR input_148 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_147=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L222] input_148 = input_148 & mask_SORT_1 [L223] input_152 = __VERIFIER_nondet_uchar() [L224] EXPR input_152 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_147=0, input_148=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L224] input_152 = input_152 & mask_SORT_1 [L225] input_153 = __VERIFIER_nondet_uchar() [L226] EXPR input_153 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_147=0, input_148=0, input_152=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L226] input_153 = input_153 & mask_SORT_1 [L227] input_157 = __VERIFIER_nondet_uchar() [L228] EXPR input_157 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_147=0, input_148=0, input_152=0, input_153=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L228] input_157 = input_157 & mask_SORT_1 [L229] input_158 = __VERIFIER_nondet_uchar() [L230] EXPR input_158 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_147=0, input_148=0, input_152=0, input_153=0, input_157=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L230] input_158 = input_158 & mask_SORT_1 [L231] input_162 = __VERIFIER_nondet_uchar() [L232] EXPR input_162 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_147=0, input_148=0, input_152=0, input_153=0, input_157=0, input_158=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L232] input_162 = input_162 & mask_SORT_1 [L233] input_163 = __VERIFIER_nondet_uchar() [L234] EXPR input_163 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_147=0, input_148=0, input_152=0, input_153=0, input_157=0, input_158=0, input_162=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L234] input_163 = input_163 & mask_SORT_1 [L235] input_164 = __VERIFIER_nondet_uchar() [L236] EXPR input_164 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_147=0, input_148=0, input_152=0, input_153=0, input_157=0, input_158=0, input_162=0, input_163=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L236] input_164 = input_164 & mask_SORT_1 [L237] input_165 = __VERIFIER_nondet_uchar() [L238] EXPR input_165 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_147=0, input_148=0, input_152=0, input_153=0, input_157=0, input_158=0, input_162=0, input_163=0, input_164=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L238] input_165 = input_165 & mask_SORT_1 [L239] input_166 = __VERIFIER_nondet_uchar() [L240] EXPR input_166 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_147=0, input_148=0, input_152=0, input_153=0, input_157=0, input_158=0, input_162=0, input_163=0, input_164=0, input_165=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L240] input_166 = input_166 & mask_SORT_1 [L241] input_167 = __VERIFIER_nondet_uchar() [L242] EXPR input_167 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_147=0, input_148=0, input_152=0, input_153=0, input_157=0, input_158=0, input_162=0, input_163=0, input_164=0, input_165=0, input_166=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L242] input_167 = input_167 & mask_SORT_1 [L243] input_191 = __VERIFIER_nondet_uchar() [L244] input_193 = __VERIFIER_nondet_uchar() [L245] input_203 = __VERIFIER_nondet_uchar() [L246] input_208 = __VERIFIER_nondet_uchar() [L247] input_210 = __VERIFIER_nondet_uchar() [L248] input_215 = __VERIFIER_nondet_uchar() [L249] input_219 = __VERIFIER_nondet_uchar() [L250] input_234 = __VERIFIER_nondet_uchar() [L251] input_236 = __VERIFIER_nondet_uchar() [L252] input_246 = __VERIFIER_nondet_uchar() [L253] input_251 = __VERIFIER_nondet_uchar() [L254] input_253 = __VERIFIER_nondet_uchar() [L255] input_258 = __VERIFIER_nondet_uchar() [L256] input_262 = __VERIFIER_nondet_uchar() [L257] input_277 = __VERIFIER_nondet_uchar() [L258] input_279 = __VERIFIER_nondet_uchar() [L259] input_289 = __VERIFIER_nondet_uchar() [L260] input_294 = __VERIFIER_nondet_uchar() [L261] input_296 = __VERIFIER_nondet_uchar() [L262] input_301 = __VERIFIER_nondet_uchar() [L263] input_305 = __VERIFIER_nondet_uchar() [L266] SORT_1 var_90_arg_0 = state_38; [L267] SORT_3 var_90_arg_1 = var_88; [L268] SORT_3 var_90_arg_2 = var_89; [L269] SORT_3 var_90 = var_90_arg_0 ? var_90_arg_1 : var_90_arg_2; [L270] SORT_1 var_91_arg_0 = state_58; [L271] SORT_3 var_91_arg_1 = var_88; [L272] SORT_3 var_91_arg_2 = var_89; [L273] SORT_3 var_91 = var_91_arg_0 ? var_91_arg_1 : var_91_arg_2; [L274] SORT_3 var_92_arg_0 = var_90; [L275] SORT_3 var_92_arg_1 = var_91; [L276] SORT_3 var_92 = var_92_arg_0 + var_92_arg_1; [L277] SORT_1 var_93_arg_0 = state_78; [L278] SORT_3 var_93_arg_1 = var_88; [L279] SORT_3 var_93_arg_2 = var_89; [L280] SORT_3 var_93 = var_93_arg_0 ? var_93_arg_1 : var_93_arg_2; [L281] SORT_3 var_94_arg_0 = var_92; [L282] SORT_3 var_94_arg_1 = var_93; [L283] SORT_3 var_94 = var_94_arg_0 + var_94_arg_1; VAL [input_111=0, input_123=0, input_135=0, input_147=0, input_148=0, input_152=0, input_153=0, input_157=0, input_158=0, input_162=0, input_163=0, input_164=0, input_165=0, input_166=0, input_167=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_94=0, var_98=255] [L284] EXPR var_94 & mask_SORT_3 VAL [input_111=0, input_123=0, input_135=0, input_147=0, input_148=0, input_152=0, input_153=0, input_157=0, input_158=0, input_162=0, input_163=0, input_164=0, input_165=0, input_166=0, input_167=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L284] var_94 = var_94 & mask_SORT_3 [L285] SORT_3 var_95_arg_0 = var_94; [L286] SORT_3 var_95_arg_1 = var_88; [L287] SORT_1 var_95 = var_95_arg_0 <= var_95_arg_1; [L288] SORT_1 var_96_arg_0 = ~state_86; VAL [input_111=0, input_123=0, input_135=0, input_147=0, input_148=0, input_152=0, input_153=0, input_157=0, input_158=0, input_162=0, input_163=0, input_164=0, input_165=0, input_166=0, input_167=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_95=1, var_96_arg_0=-1, var_98=255] [L289] EXPR var_96_arg_0 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_147=0, input_148=0, input_152=0, input_153=0, input_157=0, input_158=0, input_162=0, input_163=0, input_164=0, input_165=0, input_166=0, input_167=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_95=1, var_98=255] [L289] var_96_arg_0 = var_96_arg_0 & mask_SORT_1 [L290] SORT_1 var_96_arg_1 = ~var_95; VAL [input_111=0, input_123=0, input_135=0, input_147=0, input_148=0, input_152=0, input_153=0, input_157=0, input_158=0, input_162=0, input_163=0, input_164=0, input_165=0, input_166=0, input_167=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_96_arg_0=1, var_96_arg_1=-2, var_98=255] [L291] EXPR var_96_arg_1 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_147=0, input_148=0, input_152=0, input_153=0, input_157=0, input_158=0, input_162=0, input_163=0, input_164=0, input_165=0, input_166=0, input_167=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_96_arg_0=1, var_98=255] [L291] var_96_arg_1 = var_96_arg_1 & mask_SORT_1 [L292] EXPR var_96_arg_0 & var_96_arg_1 VAL [input_111=0, input_123=0, input_135=0, input_147=0, input_148=0, input_152=0, input_153=0, input_157=0, input_158=0, input_162=0, input_163=0, input_164=0, input_165=0, input_166=0, input_167=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L292] SORT_1 var_96 = var_96_arg_0 & var_96_arg_1; [L293] EXPR var_96 & mask_SORT_1 VAL [input_111=0, input_123=0, input_135=0, input_147=0, input_148=0, input_152=0, input_153=0, input_157=0, input_158=0, input_162=0, input_163=0, input_164=0, input_165=0, input_166=0, input_167=0, mask_SORT_1=1, mask_SORT_2=255, mask_SORT_3=-1, state_11=0, state_13=0, state_15=0, state_17=0, state_19=0, state_21=0, state_23=0, state_26=0, state_28=0, state_30=0, state_32=0, state_34=0, state_36=0, state_38=0, state_40=0, state_42=0, state_44=0, state_46=0, state_48=0, state_50=0, state_52=0, state_54=0, state_56=0, state_58=0, state_5=0, state_60=0, state_62=0, state_64=0, state_66=0, state_68=0, state_70=0, state_72=0, state_74=0, state_76=0, state_78=0, state_7=0, state_80=0, state_82=0, state_84=0, state_86=0, state_9=0, var_100=0, var_103=2, var_107=1, var_88=1, var_89=0, var_98=255] [L293] var_96 = var_96 & mask_SORT_1 [L294] SORT_1 bad_97_arg_0 = var_96; [L295] CALL __VERIFIER_assert(!(bad_97_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 2726 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7934 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7934 mSDsluCounter, 74501 SdHoareTripleChecker+Invalid, 3.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 51743 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6947 IncrementalHoareTripleChecker+Invalid, 6949 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 22758 mSDtfsCounter, 6947 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2813occurred 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.5s AutomataMinimizationTime, 6 MinimizatonAttempts, 2490 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 910 NumberOfCodeBlocks, 910 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 771 ConstructedInterpolants, 0 QuantifiedInterpolants, 2233 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-20 01:32:13,978 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mcs.2.prop1-func-interl.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3c22b85d347581119638421811f37a37cce681028ee2583c8ff4c6119cb50fe4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 01:32:16,558 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 01:32:16,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-20 01:32:16,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 01:32:16,646 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 01:32:16,679 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 01:32:16,682 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 01:32:16,682 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 01:32:16,683 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 01:32:16,685 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 01:32:16,685 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 01:32:16,686 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 01:32:16,686 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 01:32:16,687 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 01:32:16,690 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 01:32:16,690 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 01:32:16,691 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 01:32:16,691 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 01:32:16,691 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 01:32:16,691 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 01:32:16,692 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 01:32:16,692 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 01:32:16,692 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 01:32:16,693 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 01:32:16,693 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 01:32:16,693 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 01:32:16,693 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 01:32:16,693 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 01:32:16,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 01:32:16,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 01:32:16,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 01:32:16,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 01:32:16,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 01:32:16,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 01:32:16,696 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 01:32:16,696 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 01:32:16,696 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 01:32:16,697 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 01:32:16,697 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 01:32:16,697 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 01:32:16,697 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 01:32:16,698 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3c22b85d347581119638421811f37a37cce681028ee2583c8ff4c6119cb50fe4 [2024-11-20 01:32:17,027 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 01:32:17,051 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 01:32:17,055 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 01:32:17,056 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 01:32:17,056 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 01:32:17,058 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mcs.2.prop1-func-interl.c [2024-11-20 01:32:18,647 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 01:32:19,032 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 01:32:19,032 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mcs.2.prop1-func-interl.c [2024-11-20 01:32:19,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6591d7fa9/81ad5cffa59a42549478bb28fa472ba3/FLAG7e3f7ad77 [2024-11-20 01:32:19,080 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6591d7fa9/81ad5cffa59a42549478bb28fa472ba3 [2024-11-20 01:32:19,082 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 01:32:19,084 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 01:32:19,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 01:32:19,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 01:32:19,091 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 01:32:19,092 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:32:19" (1/1) ... [2024-11-20 01:32:19,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ae9f81e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:19, skipping insertion in model container [2024-11-20 01:32:19,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:32:19" (1/1) ... [2024-11-20 01:32:19,165 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 01:32:19,385 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mcs.2.prop1-func-interl.c[1170,1183] [2024-11-20 01:32:19,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 01:32:19,738 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 01:32:19,761 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mcs.2.prop1-func-interl.c[1170,1183] [2024-11-20 01:32:19,912 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 01:32:19,931 INFO L204 MainTranslator]: Completed translation [2024-11-20 01:32:19,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:19 WrapperNode [2024-11-20 01:32:19,932 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 01:32:19,933 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 01:32:19,933 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 01:32:19,934 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 01:32:19,941 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:19" (1/1) ... [2024-11-20 01:32:20,010 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:19" (1/1) ... [2024-11-20 01:32:20,142 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 2268 [2024-11-20 01:32:20,143 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 01:32:20,144 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 01:32:20,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 01:32:20,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 01:32:20,157 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:19" (1/1) ... [2024-11-20 01:32:20,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:19" (1/1) ... [2024-11-20 01:32:20,174 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:19" (1/1) ... [2024-11-20 01:32:20,251 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 01:32:20,252 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:19" (1/1) ... [2024-11-20 01:32:20,252 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:19" (1/1) ... [2024-11-20 01:32:20,297 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:19" (1/1) ... [2024-11-20 01:32:20,308 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:19" (1/1) ... [2024-11-20 01:32:20,316 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:19" (1/1) ... [2024-11-20 01:32:20,337 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:19" (1/1) ... [2024-11-20 01:32:20,374 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 01:32:20,375 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 01:32:20,375 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 01:32:20,375 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 01:32:20,376 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:19" (1/1) ... [2024-11-20 01:32:20,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 01:32:20,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 01:32:20,430 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 01:32:20,434 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 01:32:20,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 01:32:20,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 01:32:20,489 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 01:32:20,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 01:32:21,040 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 01:32:21,046 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 01:32:23,389 INFO L? ?]: Removed 115 outVars from TransFormulas that were not future-live. [2024-11-20 01:32:23,390 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 01:32:23,402 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 01:32:23,402 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 01:32:23,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:32:23 BoogieIcfgContainer [2024-11-20 01:32:23,403 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 01:32:23,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 01:32:23,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 01:32:23,409 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 01:32:23,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:32:19" (1/3) ... [2024-11-20 01:32:23,410 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b60e0cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:32:23, skipping insertion in model container [2024-11-20 01:32:23,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:32:19" (2/3) ... [2024-11-20 01:32:23,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b60e0cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:32:23, skipping insertion in model container [2024-11-20 01:32:23,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:32:23" (3/3) ... [2024-11-20 01:32:23,413 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mcs.2.prop1-func-interl.c [2024-11-20 01:32:23,429 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 01:32:23,429 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 01:32:23,489 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 01:32:23,495 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;@6eacd2ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 01:32:23,495 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 01:32:23,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:23,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 01:32:23,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 01:32:23,507 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 01:32:23,508 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 01:32:23,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 01:32:23,513 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-20 01:32:23,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 01:32:23,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [740849145] [2024-11-20 01:32:23,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 01:32:23,525 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 01:32:23,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 01:32:23,527 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 01:32:23,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-20 01:32:24,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 01:32:24,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-20 01:32:24,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 01:32:24,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 01:32:24,313 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 01:32:24,327 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 01:32:24,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [740849145] [2024-11-20 01:32:24,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [740849145] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 01:32:24,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 01:32:24,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 01:32:24,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300290415] [2024-11-20 01:32:24,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 01:32:24,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 01:32:24,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 01:32:24,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 01:32:24,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 01:32:24,360 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:24,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 01:32:24,553 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-20 01:32:24,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 01:32:24,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-20 01:32:24,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 01:32:24,563 INFO L225 Difference]: With dead ends: 18 [2024-11-20 01:32:24,563 INFO L226 Difference]: Without dead ends: 10 [2024-11-20 01:32:24,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 01:32:24,571 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 01:32:24,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 01:32:24,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-20 01:32:24,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-20 01:32:24,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:24,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-20 01:32:24,601 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-20 01:32:24,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 01:32:24,601 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-20 01:32:24,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 01:32:24,602 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-20 01:32:24,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-20 01:32:24,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 01:32:24,603 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-20 01:32:24,609 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 01:32:24,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 01:32:24,804 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 01:32:24,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 01:32:24,805 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-20 01:32:24,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 01:32:24,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394613311] [2024-11-20 01:32:24,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 01:32:24,807 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 01:32:24,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 01:32:24,811 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 01:32:24,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-20 01:32:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 01:32:25,508 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-20 01:32:25,531 INFO L278 TraceCheckSpWp]: Computing forward predicates...