/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml --traceabstraction.trace.refinement.strategy FIXED_PREFERENCES --cacsl2boogietranslator.allow.undefined.functions true --traceabstraction.smt.solver External_ModelsAndUnsatCoreMode --traceabstraction.command.for.external.solver 'cvc4 --incremental --print-success --lang smt' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-356b6ba-m [2024-11-01 08:55:15,298 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-01 08:55:15,403 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-01 08:55:15,412 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-01 08:55:15,413 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-01 08:55:15,446 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-01 08:55:15,447 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-01 08:55:15,447 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-01 08:55:15,448 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-01 08:55:15,449 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-01 08:55:15,450 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-01 08:55:15,450 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-01 08:55:15,451 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-01 08:55:15,451 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-01 08:55:15,451 INFO L153 SettingsManager]: * Use SBE=true [2024-11-01 08:55:15,452 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-01 08:55:15,454 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-01 08:55:15,456 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-01 08:55:15,457 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-01 08:55:15,457 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-01 08:55:15,457 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-01 08:55:15,458 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-01 08:55:15,458 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-01 08:55:15,458 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-01 08:55:15,458 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-01 08:55:15,459 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-01 08:55:15,459 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-01 08:55:15,460 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-01 08:55:15,461 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-01 08:55:15,461 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-01 08:55:15,462 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-01 08:55:15,462 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 08:55:15,462 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-01 08:55:15,462 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-01 08:55:15,463 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-01 08:55:15,463 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-01 08:55:15,463 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-01 08:55:15,463 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-01 08:55:15,463 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-01 08:55:15,464 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-01 08:55:15,464 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-01 08:55:15,465 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-11-01 08:55:15,465 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.traceabstraction: Trace refinement strategy -> FIXED_PREFERENCES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Allow undefined functions -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMT solver -> External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Command for external solver -> cvc4 --incremental --print-success --lang smt [2024-11-01 08:55:15,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-01 08:55:15,842 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-01 08:55:15,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-01 08:55:15,848 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-01 08:55:15,849 INFO L274 PluginConnector]: CDTParser initialized [2024-11-01 08:55:15,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c [2024-11-01 08:55:17,452 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-01 08:55:17,686 INFO L384 CDTParser]: Found 1 translation units. [2024-11-01 08:55:17,688 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c [2024-11-01 08:55:17,701 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0765efb/cff79139df46424b9f25f20528e3f890/FLAGe185056df [2024-11-01 08:55:18,019 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9f0765efb/cff79139df46424b9f25f20528e3f890 [2024-11-01 08:55:18,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-01 08:55:18,022 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-01 08:55:18,023 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-01 08:55:18,024 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-01 08:55:18,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-01 08:55:18,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 08:55:18" (1/1) ... [2024-11-01 08:55:18,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b461608 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 08:55:18, skipping insertion in model container [2024-11-01 08:55:18,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 08:55:18" (1/1) ... [2024-11-01 08:55:18,065 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-01 08:55:18,219 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c[1249,1262] [2024-11-01 08:55:18,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 08:55:18,297 INFO L200 MainTranslator]: Completed pre-run [2024-11-01 08:55:18,308 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v3.c[1249,1262] [2024-11-01 08:55:18,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 08:55:18,360 INFO L204 MainTranslator]: Completed translation [2024-11-01 08:55:18,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 08:55:18 WrapperNode [2024-11-01 08:55:18,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-01 08:55:18,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-01 08:55:18,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-01 08:55:18,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-01 08:55:18,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 08:55:18" (1/1) ... [2024-11-01 08:55:18,383 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 08:55:18" (1/1) ... [2024-11-01 08:55:18,413 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 252 [2024-11-01 08:55:18,413 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-01 08:55:18,414 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-01 08:55:18,414 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-01 08:55:18,414 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-01 08:55:18,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 08:55:18" (1/1) ... [2024-11-01 08:55:18,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 08:55:18" (1/1) ... [2024-11-01 08:55:18,430 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 08:55:18" (1/1) ... [2024-11-01 08:55:18,444 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-01 08:55:18,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 08:55:18" (1/1) ... [2024-11-01 08:55:18,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 08:55:18" (1/1) ... [2024-11-01 08:55:18,456 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 08:55:18" (1/1) ... [2024-11-01 08:55:18,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 08:55:18" (1/1) ... [2024-11-01 08:55:18,461 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 08:55:18" (1/1) ... [2024-11-01 08:55:18,463 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 08:55:18" (1/1) ... [2024-11-01 08:55:18,466 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-01 08:55:18,467 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-01 08:55:18,467 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-01 08:55:18,468 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-01 08:55:18,468 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 08:55:18" (1/1) ... [2024-11-01 08:55:18,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 08:55:18,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 08:55:18,499 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-01 08:55:18,501 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-01 08:55:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-01 08:55:18,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-01 08:55:18,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-01 08:55:18,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-01 08:55:18,621 INFO L238 CfgBuilder]: Building ICFG [2024-11-01 08:55:18,623 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-01 08:55:18,959 INFO L? ?]: Removed 36 outVars from TransFormulas that were not future-live. [2024-11-01 08:55:18,959 INFO L287 CfgBuilder]: Performing block encoding [2024-11-01 08:55:18,973 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-01 08:55:18,974 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-01 08:55:18,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 08:55:18 BoogieIcfgContainer [2024-11-01 08:55:18,975 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-01 08:55:18,977 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-01 08:55:18,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-01 08:55:18,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-01 08:55:18,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 08:55:18" (1/3) ... [2024-11-01 08:55:18,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcd4b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 08:55:18, skipping insertion in model container [2024-11-01 08:55:18,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 08:55:18" (2/3) ... [2024-11-01 08:55:18,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bcd4b18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 08:55:18, skipping insertion in model container [2024-11-01 08:55:18,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 08:55:18" (3/3) ... [2024-11-01 08:55:18,985 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v3.c [2024-11-01 08:55:19,004 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-01 08:55:19,005 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-01 08:55:19,077 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-01 08:55:19,085 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;@2ff0645d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-01 08:55:19,085 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-01 08:55:19,090 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-01 08:55:19,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-01 08:55:19,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 08:55:19,100 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-01 08:55:19,100 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 08:55:19,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 08:55:19,109 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-01 08:55:19,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 08:55:19,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1338046481] [2024-11-01 08:55:19,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 08:55:19,123 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-01 08:55:19,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-01 08:55:19,126 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-01 08:55:19,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (2)] Waiting until timeout for monitored process [2024-11-01 08:55:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 08:55:19,315 INFO L255 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-01 08:55:19,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 08:55:19,495 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-01 08:55:19,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 08:55:19,658 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-01 08:55:19,659 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 08:55:19,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1338046481] [2024-11-01 08:55:19,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1338046481] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 08:55:19,660 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 08:55:19,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-01 08:55:19,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161789560] [2024-11-01 08:55:19,663 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 08:55:19,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-01 08:55:19,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 08:55:19,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-01 08:55:19,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-01 08:55:19,694 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 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 08:55:19,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 08:55:19,797 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-01 08:55:19,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-01 08:55:19,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-01 08:55:19,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 08:55:19,807 INFO L225 Difference]: With dead ends: 17 [2024-11-01 08:55:19,807 INFO L226 Difference]: Without dead ends: 9 [2024-11-01 08:55:19,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-01 08:55:19,816 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-01 08:55:19,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-01 08:55:19,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-01 08:55:19,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-01 08:55:19,845 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-01 08:55:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-01 08:55:19,847 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-01 08:55:19,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 08:55:19,848 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-01 08:55:19,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 08:55:19,848 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-01 08:55:19,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-01 08:55:19,849 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 08:55:19,849 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-01 08:55:19,854 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (2)] Ended with exit code 0 [2024-11-01 08:55:20,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-01 08:55:20,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 08:55:20,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 08:55:20,052 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-01 08:55:20,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 08:55:20,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1105265663] [2024-11-01 08:55:20,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 08:55:20,053 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-01 08:55:20,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-01 08:55:20,057 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-01 08:55:20,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Waiting until timeout for monitored process [2024-11-01 08:55:20,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 08:55:20,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-01 08:55:20,241 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 08:55:20,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 08:55:20,468 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 08:55:24,885 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 08:55:24,885 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 08:55:24,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1105265663] [2024-11-01 08:55:24,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1105265663] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 08:55:24,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 08:55:24,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-01 08:55:24,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35942614] [2024-11-01 08:55:24,887 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 08:55:24,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-01 08:55:24,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 08:55:24,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-01 08:55:24,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-01 08:55:24,889 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 08:55:25,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 08:55:25,409 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-01 08:55:25,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-01 08:55:25,411 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-11-01 08:55:25,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 08:55:25,412 INFO L225 Difference]: With dead ends: 14 [2024-11-01 08:55:25,412 INFO L226 Difference]: Without dead ends: 12 [2024-11-01 08:55:25,413 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-01 08:55:25,415 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-01 08:55:25,416 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-01 08:55:25,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-01 08:55:25,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-01 08:55:25,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-01 08:55:25,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-01 08:55:25,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-01 08:55:25,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 08:55:25,421 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-01 08:55:25,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 08:55:25,422 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-01 08:55:25,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-01 08:55:25,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 08:55:25,423 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-01 08:55:25,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (3)] Forceful destruction successful, exit code 0 [2024-11-01 08:55:25,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-01 08:55:25,626 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 08:55:25,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 08:55:25,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-01 08:55:25,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 08:55:25,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2068682650] [2024-11-01 08:55:25,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 08:55:25,627 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-01 08:55:25,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-01 08:55:25,630 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-01 08:55:25,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-11-01 08:55:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 08:55:25,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-01 08:55:25,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 08:55:27,928 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 08:55:27,928 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 08:55:39,542 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse23 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_5~0#1|))) (let ((.cse7 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_17| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_17|)))) .cse23))))) (.cse6 (forall ((|v_ULTIMATE.start_main_~var_20_arg_0~0#1_17| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_20_arg_0~0#1_17|)))) .cse23))))) (.cse0 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_29~0#1|)))) .cse23)))) (.cse1 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_31~0#1|))) .cse23)))) (.cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_26~0#1|))))) (let ((.cse8 (bvneg .cse3)) (.cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_40~0#1|)))))) (.cse10 (not .cse1)) (.cse11 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_24~0#1|)) (.cse12 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_22~0#1|)) (.cse17 (not .cse0)) (.cse13 (let ((.cse19 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_10~0#1|))))) (let ((.cse21 ((_ zero_extend 24) ((_ extract 7 0) .cse19))) (.cse18 (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_28~0#1|))) .cse23)) (_ bv0 8)))) (and .cse7 (or (not .cse18) (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse20 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse19 (bvneg .cse19)))))))) .cse20))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse20 .cse21)))))) .cse6) (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse22 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvmul .cse19 (_ bv2 32)))))))) .cse22))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse22 .cse21)))))) .cse18 .cse6)))))) (and (or .cse0 (let ((.cse2 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse11 .cse12))))))))) (and (or .cse1 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse4 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse2 .cse3))))))) .cse4))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse4)))))) .cse6) .cse7 (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse9 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse2 .cse8))))))) .cse9))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse9)))))) .cse10 .cse6)))) (or .cse0 .cse13) (or (let ((.cse14 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg .cse11) .cse12))))))))) (and (or .cse1 .cse6 (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse14 .cse3))))))) .cse15))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse15))))))) .cse7 (or (forall ((|ULTIMATE.start_main_~mask_SORT_1~0#1| (_ BitVec 8))) (let ((.cse16 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_1~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse14 .cse8))))))) .cse16))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse5 .cse16)))))) .cse10 .cse6))) .cse17) (or .cse17 .cse13))))) is different from false [2024-11-01 08:55:42,403 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-01 08:55:42,404 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 08:55:42,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2068682650] [2024-11-01 08:55:42,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [2068682650] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 08:55:42,404 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 08:55:42,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-01 08:55:42,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851211156] [2024-11-01 08:55:42,405 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 08:55:42,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-01 08:55:42,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 08:55:42,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-01 08:55:42,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=55, Unknown=1, NotChecked=14, Total=90 [2024-11-01 08:55:42,406 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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-01 08:55:46,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 08:55:46,915 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-11-01 08:55:46,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-01 08:55:46,916 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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 11 [2024-11-01 08:55:46,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 08:55:46,916 INFO L225 Difference]: With dead ends: 17 [2024-11-01 08:55:46,917 INFO L226 Difference]: Without dead ends: 15 [2024-11-01 08:55:46,917 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=55, Invalid=130, Unknown=1, NotChecked=24, Total=210 [2024-11-01 08:55:46,918 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-01 08:55:46,918 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 8 Unchecked, 0.5s Time] [2024-11-01 08:55:46,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-01 08:55:46,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-01 08:55:46,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-01 08:55:46,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-01 08:55:46,923 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2024-11-01 08:55:46,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 08:55:46,923 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-01 08:55:46,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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-01 08:55:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-01 08:55:46,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-01 08:55:46,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 08:55:46,924 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-01 08:55:46,927 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (4)] Ended with exit code 0 [2024-11-01 08:55:47,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-01 08:55:47,125 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 08:55:47,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 08:55:47,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 3 times [2024-11-01 08:55:47,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 08:55:47,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [187305190] [2024-11-01 08:55:47,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 08:55:47,126 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-01 08:55:47,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-01 08:55:47,129 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-01 08:55:47,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-01 08:55:47,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-01 08:55:47,355 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-01 08:55:47,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-01 08:55:47,675 INFO L130 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found a feasible trace [2024-11-01 08:55:47,676 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-01 08:55:47,677 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-01 08:55:47,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-01 08:55:47,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-01 08:55:47,883 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-11-01 08:55:47,929 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-01 08:55:47,932 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.11 08:55:47 BoogieIcfgContainer [2024-11-01 08:55:47,932 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-01 08:55:47,933 INFO L158 Benchmark]: Toolchain (without parser) took 29910.11ms. Allocated memory was 183.5MB in the beginning and 263.2MB in the end (delta: 79.7MB). Free memory was 158.3MB in the beginning and 119.9MB in the end (delta: 38.4MB). Peak memory consumption was 119.2MB. Max. memory is 8.0GB. [2024-11-01 08:55:47,933 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 183.5MB. Free memory is still 159.2MB. There was no memory consumed. Max. memory is 8.0GB. [2024-11-01 08:55:47,933 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.56ms. Allocated memory is still 183.5MB. Free memory was 158.3MB in the beginning and 140.4MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-11-01 08:55:47,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.70ms. Allocated memory is still 183.5MB. Free memory was 140.4MB in the beginning and 137.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-01 08:55:47,934 INFO L158 Benchmark]: Boogie Preprocessor took 52.29ms. Allocated memory is still 183.5MB. Free memory was 137.8MB in the beginning and 134.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-01 08:55:47,934 INFO L158 Benchmark]: RCFGBuilder took 507.35ms. Allocated memory is still 183.5MB. Free memory was 134.7MB in the beginning and 109.0MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2024-11-01 08:55:47,935 INFO L158 Benchmark]: TraceAbstraction took 28954.59ms. Allocated memory was 183.5MB in the beginning and 263.2MB in the end (delta: 79.7MB). Free memory was 107.9MB in the beginning and 119.9MB in the end (delta: -11.9MB). Peak memory consumption was 68.8MB. Max. memory is 8.0GB. [2024-11-01 08:55:47,936 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.17ms. Allocated memory is still 183.5MB. Free memory is still 159.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 340.56ms. Allocated memory is still 183.5MB. Free memory was 158.3MB in the beginning and 140.4MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 48.70ms. Allocated memory is still 183.5MB. Free memory was 140.4MB in the beginning and 137.8MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 52.29ms. Allocated memory is still 183.5MB. Free memory was 137.8MB in the beginning and 134.7MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 507.35ms. Allocated memory is still 183.5MB. Free memory was 134.7MB in the beginning and 109.0MB in the end (delta: 25.7MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * TraceAbstraction took 28954.59ms. Allocated memory was 183.5MB in the beginning and 263.2MB in the end (delta: 79.7MB). Free memory was 107.9MB in the beginning and 119.9MB in the end (delta: -11.9MB). Peak memory consumption was 68.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 8); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (8 - 1); [L29] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 1); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (1 - 1); [L32] const SORT_1 var_10 = 0; [L33] const SORT_5 var_18 = 1; [L34] const SORT_5 var_28 = 0; [L36] SORT_1 input_2; [L37] SORT_1 input_3; [L38] SORT_1 input_4; [L39] SORT_5 input_6; [L40] SORT_5 input_7; [L41] SORT_5 input_8; [L42] SORT_5 input_9; [L44] SORT_1 state_11 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L45] SORT_1 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L46] SORT_1 state_22 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] SORT_1 state_24 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L48] SORT_1 state_26 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] SORT_5 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L50] SORT_5 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] SORT_1 state_33 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] SORT_5 state_35 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L53] SORT_1 state_37 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L54] SORT_1 state_40 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L55] SORT_1 state_42 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] SORT_1 init_12_arg_1 = var_10; [L58] state_11 = init_12_arg_1 [L59] SORT_1 init_14_arg_1 = var_10; [L60] state_13 = init_14_arg_1 [L61] SORT_1 init_23_arg_1 = var_10; [L62] state_22 = init_23_arg_1 [L63] SORT_1 init_25_arg_1 = var_10; [L64] state_24 = init_25_arg_1 [L65] SORT_1 init_27_arg_1 = var_10; [L66] state_26 = init_27_arg_1 [L67] SORT_5 init_30_arg_1 = var_28; [L68] state_29 = init_30_arg_1 [L69] SORT_5 init_32_arg_1 = var_28; [L70] state_31 = init_32_arg_1 [L71] SORT_1 init_34_arg_1 = var_10; [L72] state_33 = init_34_arg_1 [L73] SORT_5 init_36_arg_1 = var_28; [L74] state_35 = init_36_arg_1 [L75] SORT_1 init_38_arg_1 = var_10; [L76] state_37 = init_38_arg_1 [L77] SORT_1 init_41_arg_1 = var_10; [L78] state_40 = init_41_arg_1 [L79] SORT_1 init_43_arg_1 = var_10; [L80] state_42 = init_43_arg_1 VAL [mask_SORT_1=-1, mask_SORT_5=1, state_11=0, state_13=0, state_22=0, state_24=0, state_26=0, state_29=0, state_31=0, state_33=0, state_35=0, state_37=0, state_40=0, state_42=0, var_10=0, var_18=1, var_28=0] [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) [L105] RET __VERIFIER_assert(!(bad_21_arg_0)) [L107] SORT_5 var_52_arg_0 = input_9; [L108] SORT_5 var_52_arg_1 = var_18; [L109] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L110] SORT_5 var_53_arg_0 = var_52; [L111] SORT_1 var_53_arg_1 = var_10; [L112] SORT_1 var_53_arg_2 = state_42; [L113] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L114] var_53 = var_53 & mask_SORT_1 [L115] SORT_1 next_54_arg_1 = var_53; [L116] SORT_5 var_58_arg_0 = input_9; [L117] SORT_5 var_58_arg_1 = var_18; [L118] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L119] SORT_1 var_56_arg_0 = state_37; [L120] SORT_1 var_56_arg_1 = state_33; [L121] SORT_1 var_56 = var_56_arg_0 + var_56_arg_1; [L122] SORT_1 var_55_arg_0 = state_37; [L123] SORT_1 var_55_arg_1 = state_33; [L124] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L125] SORT_5 var_57_arg_0 = state_35; [L126] SORT_1 var_57_arg_1 = var_56; [L127] SORT_1 var_57_arg_2 = var_55; [L128] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L129] SORT_5 var_59_arg_0 = var_58; [L130] SORT_1 var_59_arg_1 = var_10; [L131] SORT_1 var_59_arg_2 = var_57; [L132] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L133] var_59 = var_59 & mask_SORT_1 [L134] SORT_1 next_60_arg_1 = var_59; [L135] SORT_5 var_61_arg_0 = var_58; [L136] SORT_1 var_61_arg_1 = var_10; [L137] SORT_1 var_61_arg_2 = input_2; [L138] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L139] SORT_1 next_62_arg_1 = var_61; [L140] SORT_5 var_63_arg_0 = var_58; [L141] SORT_1 var_63_arg_1 = var_10; [L142] SORT_1 var_63_arg_2 = input_3; [L143] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L144] SORT_1 next_64_arg_1 = var_63; [L145] SORT_5 var_65_arg_0 = var_58; [L146] SORT_1 var_65_arg_1 = var_10; [L147] SORT_1 var_65_arg_2 = input_4; [L148] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L149] SORT_1 next_66_arg_1 = var_65; [L150] SORT_5 var_67_arg_0 = var_58; [L151] SORT_5 var_67_arg_1 = var_28; [L152] SORT_5 var_67_arg_2 = input_7; [L153] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L154] SORT_5 next_68_arg_1 = var_67; [L155] SORT_5 var_69_arg_0 = var_58; [L156] SORT_5 var_69_arg_1 = var_28; [L157] SORT_5 var_69_arg_2 = input_8; [L158] SORT_5 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L159] SORT_5 next_70_arg_1 = var_69; [L160] SORT_5 var_71_arg_0 = var_58; [L161] SORT_1 var_71_arg_1 = var_10; [L162] SORT_1 var_71_arg_2 = state_26; [L163] SORT_1 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L164] SORT_1 next_72_arg_1 = var_71; [L165] SORT_5 var_73_arg_0 = var_58; [L166] SORT_5 var_73_arg_1 = var_28; [L167] SORT_5 var_73_arg_2 = state_31; [L168] SORT_5 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L169] var_73 = var_73 & mask_SORT_5 [L170] SORT_5 next_74_arg_1 = var_73; [L171] SORT_5 var_77_arg_0 = state_29; [L172] SORT_5 var_77 = ~var_77_arg_0; [L173] var_77 = var_77 & mask_SORT_5 [L174] SORT_1 var_76_arg_0 = state_22; [L175] SORT_1 var_76_arg_1 = state_24; [L176] SORT_1 var_76 = var_76_arg_0 + var_76_arg_1; [L177] SORT_1 var_75_arg_0 = state_22; [L178] SORT_1 var_75_arg_1 = state_24; [L179] SORT_1 var_75 = var_75_arg_0 - var_75_arg_1; [L180] SORT_5 var_78_arg_0 = var_77; [L181] SORT_1 var_78_arg_1 = var_76; [L182] SORT_1 var_78_arg_2 = var_75; [L183] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L184] SORT_5 var_79_arg_0 = var_58; [L185] SORT_1 var_79_arg_1 = var_10; [L186] SORT_1 var_79_arg_2 = var_78; [L187] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L188] SORT_1 next_80_arg_1 = var_79; [L189] SORT_1 var_45_arg_0 = input_2; [L190] SORT_1 var_45_arg_1 = input_3; [L191] SORT_1 var_45 = var_45_arg_0 + var_45_arg_1; [L192] SORT_1 var_44_arg_0 = input_2; [L193] SORT_1 var_44_arg_1 = input_3; [L194] SORT_1 var_44 = var_44_arg_0 - var_44_arg_1; [L195] SORT_5 var_46_arg_0 = input_7; [L196] SORT_1 var_46_arg_1 = var_45; [L197] SORT_1 var_46_arg_2 = var_44; [L198] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L199] SORT_1 var_48_arg_0 = var_46; [L200] SORT_1 var_48_arg_1 = input_4; [L201] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L202] SORT_1 var_47_arg_0 = var_46; [L203] SORT_1 var_47_arg_1 = input_4; [L204] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L205] SORT_5 var_49_arg_0 = input_8; [L206] SORT_1 var_49_arg_1 = var_48; [L207] SORT_1 var_49_arg_2 = var_47; [L208] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L209] SORT_5 var_81_arg_0 = var_52; [L210] SORT_1 var_81_arg_1 = var_10; [L211] SORT_1 var_81_arg_2 = var_49; [L212] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L213] SORT_1 next_82_arg_1 = var_81; [L214] SORT_5 var_83_arg_0 = var_52; [L215] SORT_1 var_83_arg_1 = var_10; [L216] SORT_1 var_83_arg_2 = state_40; [L217] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L218] SORT_1 next_84_arg_1 = var_83; [L220] state_11 = next_54_arg_1 [L221] state_13 = next_60_arg_1 [L222] state_22 = next_62_arg_1 [L223] state_24 = next_64_arg_1 [L224] state_26 = next_66_arg_1 [L225] state_29 = next_68_arg_1 [L226] state_31 = next_70_arg_1 [L227] state_33 = next_72_arg_1 [L228] state_35 = next_74_arg_1 [L229] state_37 = next_80_arg_1 [L230] state_40 = next_82_arg_1 [L231] state_42 = next_84_arg_1 [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) [L105] RET __VERIFIER_assert(!(bad_21_arg_0)) [L107] SORT_5 var_52_arg_0 = input_9; [L108] SORT_5 var_52_arg_1 = var_18; [L109] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L110] SORT_5 var_53_arg_0 = var_52; [L111] SORT_1 var_53_arg_1 = var_10; [L112] SORT_1 var_53_arg_2 = state_42; [L113] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L114] var_53 = var_53 & mask_SORT_1 [L115] SORT_1 next_54_arg_1 = var_53; [L116] SORT_5 var_58_arg_0 = input_9; [L117] SORT_5 var_58_arg_1 = var_18; [L118] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L119] SORT_1 var_56_arg_0 = state_37; [L120] SORT_1 var_56_arg_1 = state_33; [L121] SORT_1 var_56 = var_56_arg_0 + var_56_arg_1; [L122] SORT_1 var_55_arg_0 = state_37; [L123] SORT_1 var_55_arg_1 = state_33; [L124] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L125] SORT_5 var_57_arg_0 = state_35; [L126] SORT_1 var_57_arg_1 = var_56; [L127] SORT_1 var_57_arg_2 = var_55; [L128] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L129] SORT_5 var_59_arg_0 = var_58; [L130] SORT_1 var_59_arg_1 = var_10; [L131] SORT_1 var_59_arg_2 = var_57; [L132] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L133] var_59 = var_59 & mask_SORT_1 [L134] SORT_1 next_60_arg_1 = var_59; [L135] SORT_5 var_61_arg_0 = var_58; [L136] SORT_1 var_61_arg_1 = var_10; [L137] SORT_1 var_61_arg_2 = input_2; [L138] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L139] SORT_1 next_62_arg_1 = var_61; [L140] SORT_5 var_63_arg_0 = var_58; [L141] SORT_1 var_63_arg_1 = var_10; [L142] SORT_1 var_63_arg_2 = input_3; [L143] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L144] SORT_1 next_64_arg_1 = var_63; [L145] SORT_5 var_65_arg_0 = var_58; [L146] SORT_1 var_65_arg_1 = var_10; [L147] SORT_1 var_65_arg_2 = input_4; [L148] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L149] SORT_1 next_66_arg_1 = var_65; [L150] SORT_5 var_67_arg_0 = var_58; [L151] SORT_5 var_67_arg_1 = var_28; [L152] SORT_5 var_67_arg_2 = input_7; [L153] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L154] SORT_5 next_68_arg_1 = var_67; [L155] SORT_5 var_69_arg_0 = var_58; [L156] SORT_5 var_69_arg_1 = var_28; [L157] SORT_5 var_69_arg_2 = input_8; [L158] SORT_5 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L159] SORT_5 next_70_arg_1 = var_69; [L160] SORT_5 var_71_arg_0 = var_58; [L161] SORT_1 var_71_arg_1 = var_10; [L162] SORT_1 var_71_arg_2 = state_26; [L163] SORT_1 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L164] SORT_1 next_72_arg_1 = var_71; [L165] SORT_5 var_73_arg_0 = var_58; [L166] SORT_5 var_73_arg_1 = var_28; [L167] SORT_5 var_73_arg_2 = state_31; [L168] SORT_5 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L169] var_73 = var_73 & mask_SORT_5 [L170] SORT_5 next_74_arg_1 = var_73; [L171] SORT_5 var_77_arg_0 = state_29; [L172] SORT_5 var_77 = ~var_77_arg_0; [L173] var_77 = var_77 & mask_SORT_5 [L174] SORT_1 var_76_arg_0 = state_22; [L175] SORT_1 var_76_arg_1 = state_24; [L176] SORT_1 var_76 = var_76_arg_0 + var_76_arg_1; [L177] SORT_1 var_75_arg_0 = state_22; [L178] SORT_1 var_75_arg_1 = state_24; [L179] SORT_1 var_75 = var_75_arg_0 - var_75_arg_1; [L180] SORT_5 var_78_arg_0 = var_77; [L181] SORT_1 var_78_arg_1 = var_76; [L182] SORT_1 var_78_arg_2 = var_75; [L183] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L184] SORT_5 var_79_arg_0 = var_58; [L185] SORT_1 var_79_arg_1 = var_10; [L186] SORT_1 var_79_arg_2 = var_78; [L187] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L188] SORT_1 next_80_arg_1 = var_79; [L189] SORT_1 var_45_arg_0 = input_2; [L190] SORT_1 var_45_arg_1 = input_3; [L191] SORT_1 var_45 = var_45_arg_0 + var_45_arg_1; [L192] SORT_1 var_44_arg_0 = input_2; [L193] SORT_1 var_44_arg_1 = input_3; [L194] SORT_1 var_44 = var_44_arg_0 - var_44_arg_1; [L195] SORT_5 var_46_arg_0 = input_7; [L196] SORT_1 var_46_arg_1 = var_45; [L197] SORT_1 var_46_arg_2 = var_44; [L198] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L199] SORT_1 var_48_arg_0 = var_46; [L200] SORT_1 var_48_arg_1 = input_4; [L201] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L202] SORT_1 var_47_arg_0 = var_46; [L203] SORT_1 var_47_arg_1 = input_4; [L204] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L205] SORT_5 var_49_arg_0 = input_8; [L206] SORT_1 var_49_arg_1 = var_48; [L207] SORT_1 var_49_arg_2 = var_47; [L208] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L209] SORT_5 var_81_arg_0 = var_52; [L210] SORT_1 var_81_arg_1 = var_10; [L211] SORT_1 var_81_arg_2 = var_49; [L212] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L213] SORT_1 next_82_arg_1 = var_81; [L214] SORT_5 var_83_arg_0 = var_52; [L215] SORT_1 var_83_arg_1 = var_10; [L216] SORT_1 var_83_arg_2 = state_40; [L217] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L218] SORT_1 next_84_arg_1 = var_83; [L220] state_11 = next_54_arg_1 [L221] state_13 = next_60_arg_1 [L222] state_22 = next_62_arg_1 [L223] state_24 = next_64_arg_1 [L224] state_26 = next_66_arg_1 [L225] state_29 = next_68_arg_1 [L226] state_31 = next_70_arg_1 [L227] state_33 = next_72_arg_1 [L228] state_35 = next_74_arg_1 [L229] state_37 = next_80_arg_1 [L230] state_40 = next_82_arg_1 [L231] state_42 = next_84_arg_1 [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) [L105] RET __VERIFIER_assert(!(bad_21_arg_0)) [L107] SORT_5 var_52_arg_0 = input_9; [L108] SORT_5 var_52_arg_1 = var_18; [L109] SORT_5 var_52 = var_52_arg_0 == var_52_arg_1; [L110] SORT_5 var_53_arg_0 = var_52; [L111] SORT_1 var_53_arg_1 = var_10; [L112] SORT_1 var_53_arg_2 = state_42; [L113] SORT_1 var_53 = var_53_arg_0 ? var_53_arg_1 : var_53_arg_2; [L114] var_53 = var_53 & mask_SORT_1 [L115] SORT_1 next_54_arg_1 = var_53; [L116] SORT_5 var_58_arg_0 = input_9; [L117] SORT_5 var_58_arg_1 = var_18; [L118] SORT_5 var_58 = var_58_arg_0 == var_58_arg_1; [L119] SORT_1 var_56_arg_0 = state_37; [L120] SORT_1 var_56_arg_1 = state_33; [L121] SORT_1 var_56 = var_56_arg_0 + var_56_arg_1; [L122] SORT_1 var_55_arg_0 = state_37; [L123] SORT_1 var_55_arg_1 = state_33; [L124] SORT_1 var_55 = var_55_arg_0 - var_55_arg_1; [L125] SORT_5 var_57_arg_0 = state_35; [L126] SORT_1 var_57_arg_1 = var_56; [L127] SORT_1 var_57_arg_2 = var_55; [L128] SORT_1 var_57 = var_57_arg_0 ? var_57_arg_1 : var_57_arg_2; [L129] SORT_5 var_59_arg_0 = var_58; [L130] SORT_1 var_59_arg_1 = var_10; [L131] SORT_1 var_59_arg_2 = var_57; [L132] SORT_1 var_59 = var_59_arg_0 ? var_59_arg_1 : var_59_arg_2; [L133] var_59 = var_59 & mask_SORT_1 [L134] SORT_1 next_60_arg_1 = var_59; [L135] SORT_5 var_61_arg_0 = var_58; [L136] SORT_1 var_61_arg_1 = var_10; [L137] SORT_1 var_61_arg_2 = input_2; [L138] SORT_1 var_61 = var_61_arg_0 ? var_61_arg_1 : var_61_arg_2; [L139] SORT_1 next_62_arg_1 = var_61; [L140] SORT_5 var_63_arg_0 = var_58; [L141] SORT_1 var_63_arg_1 = var_10; [L142] SORT_1 var_63_arg_2 = input_3; [L143] SORT_1 var_63 = var_63_arg_0 ? var_63_arg_1 : var_63_arg_2; [L144] SORT_1 next_64_arg_1 = var_63; [L145] SORT_5 var_65_arg_0 = var_58; [L146] SORT_1 var_65_arg_1 = var_10; [L147] SORT_1 var_65_arg_2 = input_4; [L148] SORT_1 var_65 = var_65_arg_0 ? var_65_arg_1 : var_65_arg_2; [L149] SORT_1 next_66_arg_1 = var_65; [L150] SORT_5 var_67_arg_0 = var_58; [L151] SORT_5 var_67_arg_1 = var_28; [L152] SORT_5 var_67_arg_2 = input_7; [L153] SORT_5 var_67 = var_67_arg_0 ? var_67_arg_1 : var_67_arg_2; [L154] SORT_5 next_68_arg_1 = var_67; [L155] SORT_5 var_69_arg_0 = var_58; [L156] SORT_5 var_69_arg_1 = var_28; [L157] SORT_5 var_69_arg_2 = input_8; [L158] SORT_5 var_69 = var_69_arg_0 ? var_69_arg_1 : var_69_arg_2; [L159] SORT_5 next_70_arg_1 = var_69; [L160] SORT_5 var_71_arg_0 = var_58; [L161] SORT_1 var_71_arg_1 = var_10; [L162] SORT_1 var_71_arg_2 = state_26; [L163] SORT_1 var_71 = var_71_arg_0 ? var_71_arg_1 : var_71_arg_2; [L164] SORT_1 next_72_arg_1 = var_71; [L165] SORT_5 var_73_arg_0 = var_58; [L166] SORT_5 var_73_arg_1 = var_28; [L167] SORT_5 var_73_arg_2 = state_31; [L168] SORT_5 var_73 = var_73_arg_0 ? var_73_arg_1 : var_73_arg_2; [L169] var_73 = var_73 & mask_SORT_5 [L170] SORT_5 next_74_arg_1 = var_73; [L171] SORT_5 var_77_arg_0 = state_29; [L172] SORT_5 var_77 = ~var_77_arg_0; [L173] var_77 = var_77 & mask_SORT_5 [L174] SORT_1 var_76_arg_0 = state_22; [L175] SORT_1 var_76_arg_1 = state_24; [L176] SORT_1 var_76 = var_76_arg_0 + var_76_arg_1; [L177] SORT_1 var_75_arg_0 = state_22; [L178] SORT_1 var_75_arg_1 = state_24; [L179] SORT_1 var_75 = var_75_arg_0 - var_75_arg_1; [L180] SORT_5 var_78_arg_0 = var_77; [L181] SORT_1 var_78_arg_1 = var_76; [L182] SORT_1 var_78_arg_2 = var_75; [L183] SORT_1 var_78 = var_78_arg_0 ? var_78_arg_1 : var_78_arg_2; [L184] SORT_5 var_79_arg_0 = var_58; [L185] SORT_1 var_79_arg_1 = var_10; [L186] SORT_1 var_79_arg_2 = var_78; [L187] SORT_1 var_79 = var_79_arg_0 ? var_79_arg_1 : var_79_arg_2; [L188] SORT_1 next_80_arg_1 = var_79; [L189] SORT_1 var_45_arg_0 = input_2; [L190] SORT_1 var_45_arg_1 = input_3; [L191] SORT_1 var_45 = var_45_arg_0 + var_45_arg_1; [L192] SORT_1 var_44_arg_0 = input_2; [L193] SORT_1 var_44_arg_1 = input_3; [L194] SORT_1 var_44 = var_44_arg_0 - var_44_arg_1; [L195] SORT_5 var_46_arg_0 = input_7; [L196] SORT_1 var_46_arg_1 = var_45; [L197] SORT_1 var_46_arg_2 = var_44; [L198] SORT_1 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; [L199] SORT_1 var_48_arg_0 = var_46; [L200] SORT_1 var_48_arg_1 = input_4; [L201] SORT_1 var_48 = var_48_arg_0 + var_48_arg_1; [L202] SORT_1 var_47_arg_0 = var_46; [L203] SORT_1 var_47_arg_1 = input_4; [L204] SORT_1 var_47 = var_47_arg_0 - var_47_arg_1; [L205] SORT_5 var_49_arg_0 = input_8; [L206] SORT_1 var_49_arg_1 = var_48; [L207] SORT_1 var_49_arg_2 = var_47; [L208] SORT_1 var_49 = var_49_arg_0 ? var_49_arg_1 : var_49_arg_2; [L209] SORT_5 var_81_arg_0 = var_52; [L210] SORT_1 var_81_arg_1 = var_10; [L211] SORT_1 var_81_arg_2 = var_49; [L212] SORT_1 var_81 = var_81_arg_0 ? var_81_arg_1 : var_81_arg_2; [L213] SORT_1 next_82_arg_1 = var_81; [L214] SORT_5 var_83_arg_0 = var_52; [L215] SORT_1 var_83_arg_1 = var_10; [L216] SORT_1 var_83_arg_2 = state_40; [L217] SORT_1 var_83 = var_83_arg_0 ? var_83_arg_1 : var_83_arg_2; [L218] SORT_1 next_84_arg_1 = var_83; [L220] state_11 = next_54_arg_1 [L221] state_13 = next_60_arg_1 [L222] state_22 = next_62_arg_1 [L223] state_24 = next_64_arg_1 [L224] state_26 = next_66_arg_1 [L225] state_29 = next_68_arg_1 [L226] state_31 = next_70_arg_1 [L227] state_33 = next_72_arg_1 [L228] state_35 = next_74_arg_1 [L229] state_37 = next_80_arg_1 [L230] state_40 = next_82_arg_1 [L231] state_42 = next_84_arg_1 [L83] input_2 = __VERIFIER_nondet_uchar() [L84] input_3 = __VERIFIER_nondet_uchar() [L85] input_4 = __VERIFIER_nondet_uchar() [L86] input_6 = __VERIFIER_nondet_uchar() [L87] input_7 = __VERIFIER_nondet_uchar() [L88] input_7 = input_7 & mask_SORT_5 [L89] input_8 = __VERIFIER_nondet_uchar() [L90] input_8 = input_8 & mask_SORT_5 [L91] input_9 = __VERIFIER_nondet_uchar() [L92] input_9 = input_9 & mask_SORT_5 [L95] SORT_1 var_15_arg_0 = state_11; [L96] SORT_1 var_15_arg_1 = state_13; [L97] SORT_5 var_15 = var_15_arg_0 == var_15_arg_1; [L98] SORT_5 var_19_arg_0 = var_15; [L99] SORT_5 var_19 = ~var_19_arg_0; [L100] SORT_5 var_20_arg_0 = var_18; [L101] SORT_5 var_20_arg_1 = var_19; [L102] SORT_5 var_20 = var_20_arg_0 & var_20_arg_1; [L103] var_20 = var_20 & mask_SORT_5 [L104] SORT_5 bad_21_arg_0 = var_20; [L105] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 28.8s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 56 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8 IncrementalHoareTripleChecker+Unchecked, 43 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53 IncrementalHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 13 mSDtfsCounter, 53 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 49 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 15.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=3, InterpolantAutomatonStates: 21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 21.6s InterpolantComputationTime, 38 NumberOfCodeBlocks, 38 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 42 ConstructedInterpolants, 15 QuantifiedInterpolants, 3186 SizeOfPredicates, 17 NumberOfNonLiveVariables, 258 ConjunctsInSsa, 72 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 0/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-01 08:55:48,155 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-01 08:55:48,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request...