/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 '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' -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.miim.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-356b6ba-m [2024-11-01 17:44:23,525 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-01 17:44:23,627 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 17:44:23,632 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-01 17:44:23,633 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-01 17:44:23,664 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-01 17:44:23,665 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-01 17:44:23,665 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-01 17:44:23,666 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-01 17:44:23,667 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-01 17:44:23,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-01 17:44:23,668 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-01 17:44:23,668 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-01 17:44:23,669 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-01 17:44:23,669 INFO L153 SettingsManager]: * Use SBE=true [2024-11-01 17:44:23,669 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-01 17:44:23,670 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-01 17:44:23,670 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-01 17:44:23,670 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-01 17:44:23,671 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-01 17:44:23,671 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-01 17:44:23,672 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-01 17:44:23,672 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-01 17:44:23,672 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-01 17:44:23,672 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-01 17:44:23,673 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-01 17:44:23,673 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-01 17:44:23,673 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-01 17:44:23,674 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-01 17:44:23,674 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-01 17:44:23,674 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-01 17:44:23,675 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 17:44:23,675 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-01 17:44:23,675 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-01 17:44:23,675 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-01 17:44:23,676 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-01 17:44:23,676 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-01 17:44:23,676 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-01 17:44:23,676 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-01 17:44:23,677 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-01 17:44:23,677 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-01 17:44:23,677 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-11-01 17:44:23,677 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 -> 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-01 17:44:24,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-01 17:44:24,034 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-01 17:44:24,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-01 17:44:24,039 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-01 17:44:24,040 INFO L274 PluginConnector]: CDTParser initialized [2024-11-01 17:44:24,041 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.miim.c [2024-11-01 17:44:25,481 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-01 17:44:25,757 INFO L384 CDTParser]: Found 1 translation units. [2024-11-01 17:44:25,758 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.miim.c [2024-11-01 17:44:25,774 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/499b94a15/2f10b0d5fa4e49019aaae5ad1b2369b4/FLAG619b8842f [2024-11-01 17:44:25,791 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/499b94a15/2f10b0d5fa4e49019aaae5ad1b2369b4 [2024-11-01 17:44:25,794 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-01 17:44:25,795 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-01 17:44:25,798 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-01 17:44:25,798 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-01 17:44:25,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-01 17:44:25,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 05:44:25" (1/1) ... [2024-11-01 17:44:25,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1374abf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:44:25, skipping insertion in model container [2024-11-01 17:44:25,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 05:44:25" (1/1) ... [2024-11-01 17:44:25,861 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-01 17:44:26,058 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.miim.c[1244,1257] [2024-11-01 17:44:26,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 17:44:26,284 INFO L200 MainTranslator]: Completed pre-run [2024-11-01 17:44:26,296 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.miim.c[1244,1257] [2024-11-01 17:44:26,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 17:44:26,405 INFO L204 MainTranslator]: Completed translation [2024-11-01 17:44:26,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:44:26 WrapperNode [2024-11-01 17:44:26,410 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-01 17:44:26,411 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-01 17:44:26,411 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-01 17:44:26,411 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-01 17:44:26,419 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:44:26" (1/1) ... [2024-11-01 17:44:26,457 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:44:26" (1/1) ... [2024-11-01 17:44:26,528 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1086 [2024-11-01 17:44:26,528 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-01 17:44:26,529 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-01 17:44:26,529 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-01 17:44:26,529 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-01 17:44:26,543 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:44:26" (1/1) ... [2024-11-01 17:44:26,544 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:44:26" (1/1) ... [2024-11-01 17:44:26,552 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:44:26" (1/1) ... [2024-11-01 17:44:26,577 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-01 17:44:26,577 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:44:26" (1/1) ... [2024-11-01 17:44:26,578 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:44:26" (1/1) ... [2024-11-01 17:44:26,599 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:44:26" (1/1) ... [2024-11-01 17:44:26,603 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:44:26" (1/1) ... [2024-11-01 17:44:26,608 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:44:26" (1/1) ... [2024-11-01 17:44:26,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:44:26" (1/1) ... [2024-11-01 17:44:26,633 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-01 17:44:26,634 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-01 17:44:26,634 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-01 17:44:26,634 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-01 17:44:26,635 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:44:26" (1/1) ... [2024-11-01 17:44:26,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 17:44:26,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 17:44:26,667 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 17:44:26,679 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 17:44:26,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-01 17:44:26,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-01 17:44:26,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-01 17:44:26,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-01 17:44:26,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-01 17:44:26,975 INFO L238 CfgBuilder]: Building ICFG [2024-11-01 17:44:26,977 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-01 17:44:27,708 INFO L? ?]: Removed 126 outVars from TransFormulas that were not future-live. [2024-11-01 17:44:27,709 INFO L287 CfgBuilder]: Performing block encoding [2024-11-01 17:44:27,721 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-01 17:44:27,721 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-01 17:44:27,721 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 05:44:27 BoogieIcfgContainer [2024-11-01 17:44:27,722 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-01 17:44:27,724 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-01 17:44:27,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-01 17:44:27,726 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-01 17:44:27,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 05:44:25" (1/3) ... [2024-11-01 17:44:27,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99a9148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 05:44:27, skipping insertion in model container [2024-11-01 17:44:27,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 05:44:26" (2/3) ... [2024-11-01 17:44:27,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@99a9148 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 05:44:27, skipping insertion in model container [2024-11-01 17:44:27,729 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 05:44:27" (3/3) ... [2024-11-01 17:44:27,731 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.miim.c [2024-11-01 17:44:27,746 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-01 17:44:27,746 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-01 17:44:27,805 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-01 17:44:27,812 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;@60d0a279, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-01 17:44:27,812 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-01 17:44:27,816 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 17:44:27,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-01 17:44:27,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 17:44:27,823 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-01 17:44:27,824 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 17:44:27,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 17:44:27,829 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-01 17:44:27,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 17:44:27,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1886776228] [2024-11-01 17:44:27,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 17:44:27,840 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-01 17:44:27,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 17:44:27,844 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-01 17:44:27,846 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-01 17:44:28,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 17:44:28,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-01 17:44:28,165 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 17:44:28,359 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 17:44:28,360 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 17:44:28,479 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 17:44:28,480 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 17:44:28,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1886776228] [2024-11-01 17:44:28,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [1886776228] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 17:44:28,481 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 17:44:28,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-01 17:44:28,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434160328] [2024-11-01 17:44:28,484 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 17:44:28,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-01 17:44:28,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 17:44:28,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-01 17:44:28,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-01 17:44:28,517 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 17:44:28,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 17:44:28,597 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-01 17:44:28,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-01 17:44:28,600 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 17:44:28,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 17:44:28,607 INFO L225 Difference]: With dead ends: 17 [2024-11-01 17:44:28,607 INFO L226 Difference]: Without dead ends: 9 [2024-11-01 17:44:28,610 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-01 17:44:28,615 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 17:44:28,616 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 17:44:28,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-01 17:44:28,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-01 17:44:28,640 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 17:44:28,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-01 17:44:28,642 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-01 17:44:28,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 17:44:28,642 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-01 17:44:28,642 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 17:44:28,642 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-01 17:44:28,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-01 17:44:28,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 17:44:28,643 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-01 17:44:28,649 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-01 17:44:28,848 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-01 17:44:28,849 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 17:44:28,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 17:44:28,850 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-01 17:44:28,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 17:44:28,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [760568250] [2024-11-01 17:44:28,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 17:44:28,851 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-01 17:44:28,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 17:44:28,852 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-01 17:44:28,853 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-01 17:44:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 17:44:29,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 203 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-01 17:44:29,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 17:44:29,432 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 17:44:29,432 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 17:44:29,639 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 17:44:29,641 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 17:44:29,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [760568250] [2024-11-01 17:44:29,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [760568250] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 17:44:29,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 17:44:29,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-01 17:44:29,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113434298] [2024-11-01 17:44:29,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 17:44:29,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-01 17:44:29,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 17:44:29,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-01 17:44:29,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-01 17:44:29,645 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 17:44:29,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 17:44:29,764 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-01 17:44:29,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-01 17:44:29,764 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 17:44:29,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 17:44:29,765 INFO L225 Difference]: With dead ends: 14 [2024-11-01 17:44:29,765 INFO L226 Difference]: Without dead ends: 12 [2024-11-01 17:44:29,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-01 17:44:29,767 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-11-01 17:44:29,767 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.1s Time] [2024-11-01 17:44:29,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-01 17:44:29,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-01 17:44:29,772 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 17:44:29,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-01 17:44:29,773 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-01 17:44:29,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 17:44:29,773 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-01 17:44:29,773 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 17:44:29,774 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-01 17:44:29,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-01 17:44:29,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 17:44:29,775 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-01 17:44:29,783 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-01 17:44:29,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 17:44:29,979 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 17:44:29,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 17:44:29,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-01 17:44:29,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 17:44:29,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [617991482] [2024-11-01 17:44:29,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 17:44:29,980 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-01 17:44:29,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 17:44:29,983 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-01 17:44:29,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-01 17:44:30,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 17:44:30,424 INFO L255 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-01 17:44:30,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 17:44:30,871 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 17:44:30,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 17:44:32,864 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 17:44:32,865 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 17:44:32,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [617991482] [2024-11-01 17:44:32,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [617991482] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 17:44:32,869 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 17:44:32,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-01 17:44:32,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100259160] [2024-11-01 17:44:32,869 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 17:44:32,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-01 17:44:32,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 17:44:32,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-01 17:44:32,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-11-01 17:44:32,871 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 17:44:33,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 17:44:33,138 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-11-01 17:44:33,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-01 17:44:33,138 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 17:44:33,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 17:44:33,139 INFO L225 Difference]: With dead ends: 17 [2024-11-01 17:44:33,139 INFO L226 Difference]: Without dead ends: 15 [2024-11-01 17:44:33,140 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-01 17:44:33,140 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-01 17:44:33,141 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 25 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-01 17:44:33,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-01 17:44:33,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-01 17:44:33,146 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 17:44:33,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-01 17:44:33,146 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2024-11-01 17:44:33,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 17:44:33,147 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-01 17:44:33,147 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 17:44:33,147 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-01 17:44:33,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-01 17:44:33,147 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 17:44:33,148 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-01 17:44:33,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-01 17:44:33,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-01 17:44:33,349 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 17:44:33,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 17:44:33,349 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 3 times [2024-11-01 17:44:33,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 17:44:33,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1031752388] [2024-11-01 17:44:33,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 17:44:33,350 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-01 17:44:33,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-01 17:44:33,353 INFO L229 MonitoredProcess]: Starting monitored process 5 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-01 17:44:33,354 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 (5)] Waiting until timeout for monitored process [2024-11-01 17:44:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 17:44:33,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-01 17:44:33,885 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 17:44:36,056 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 17:44:36,057 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 17:44:41,892 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (or (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_17~0#1|))))) (let ((.cse18 (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse31))) |c_ULTIMATE.start_main_~var_22~0#1|))) (.cse30 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_56~0#1|)) (.cse12 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_51~0#1|))) (let ((.cse5 (forall ((|ULTIMATE.start_main_~state_53~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 ((_ zero_extend 24) |ULTIMATE.start_main_~state_53~0#1|)))) |c_ULTIMATE.start_main_~var_116~0#1|))) (.cse3 (forall ((|ULTIMATE.start_main_~state_53~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 ((_ zero_extend 24) |ULTIMATE.start_main_~state_53~0#1|)))) |c_ULTIMATE.start_main_~var_116~0#1|)))) (.cse1 (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) .cse31))))) |c_ULTIMATE.start_main_~var_22~0#1|))) (.cse4 (forall ((|ULTIMATE.start_main_~state_57~0#1| (_ BitVec 8))) (not (= .cse30 ((_ zero_extend 24) |ULTIMATE.start_main_~state_57~0#1|))))) (.cse6 (and .cse18 (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_107~0#1|)))))))))))) |c_ULTIMATE.start_main_~var_22~0#1|)))) (.cse2 (forall ((|ULTIMATE.start_main_~state_57~0#1| (_ BitVec 8))) (= .cse30 ((_ zero_extend 24) |ULTIMATE.start_main_~state_57~0#1|))))) (and (or (forall ((|ULTIMATE.start_main_~state_74~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_74~0#1|))))))))))) (let ((.cse8 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_36~0#1|)) (.cse13 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_126~0#1|))) (and (or .cse1 .cse2 .cse3) (or .cse4 .cse1 .cse5) (or .cse6 .cse5 .cse2) (or .cse6 .cse2 .cse3) (or .cse4 (and (forall ((|ULTIMATE.start_main_~state_111~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_10~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_53~0#1| (_ BitVec 8))) (let ((.cse10 ((_ zero_extend 24) |ULTIMATE.start_main_~state_53~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse10 (_ bv5 32)))))) (bvor ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_10~0#1|) (_ bv1 32))))) (.cse7 ((_ zero_extend 24) |ULTIMATE.start_main_~state_111~0#1|))) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse7))) .cse8))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse10 (_ bv4 32))))))) .cse11)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse9 .cse11))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse7)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse11))) .cse8)))))))))))))))))) |c_ULTIMATE.start_main_~var_22~0#1|)) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse10))) |c_ULTIMATE.start_main_~var_116~0#1|)) (not (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse10 (_ bv1 32)))))))))))) (forall ((|ULTIMATE.start_main_~state_111~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_10~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_53~0#1| (_ BitVec 8))) (let ((.cse17 ((_ zero_extend 24) |ULTIMATE.start_main_~state_53~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse14 ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse17 (_ bv5 32)))))) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse14))) .cse8))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_10~0#1|) (_ bv1 32))))) (.cse15 ((_ zero_extend 24) |ULTIMATE.start_main_~state_111~0#1|))) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse15))) .cse8))) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse16 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse17 (_ bv4 32))))))) .cse14)))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse16 .cse14))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse15))))))))))))))))))))))))) |c_ULTIMATE.start_main_~var_22~0#1|)) (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse17 (_ bv1 32)))))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse17))) |c_ULTIMATE.start_main_~var_116~0#1|))))) (or .cse18 (and (forall ((|ULTIMATE.start_main_~state_53~0#1| (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) |ULTIMATE.start_main_~state_53~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse19))) |c_ULTIMATE.start_main_~var_116~0#1|)) (not (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse19 (_ bv1 32)))))))))))) (forall ((|ULTIMATE.start_main_~state_53~0#1| (_ BitVec 8))) (let ((.cse20 ((_ zero_extend 24) |ULTIMATE.start_main_~state_53~0#1|))) (or (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse20 (_ bv1 32)))))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse20))) |c_ULTIMATE.start_main_~var_116~0#1|))))))))) (or .cse4 .cse1 .cse3) (or .cse4 (and (forall ((|ULTIMATE.start_main_~state_111~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_53~0#1| (_ BitVec 8))) (let ((.cse21 ((_ zero_extend 24) |ULTIMATE.start_main_~state_53~0#1|))) (or (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse21 (_ bv1 32)))))))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse22 ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse21 (_ bv5 32)))))) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse22))) .cse8))) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse23 ((_ zero_extend 24) |ULTIMATE.start_main_~state_111~0#1|))) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse21 (_ bv4 32))))))) .cse22))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse23))) .cse8)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) .cse22))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse23))))))))))))))))))))))))) |c_ULTIMATE.start_main_~var_22~0#1|)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse21))) |c_ULTIMATE.start_main_~var_116~0#1|)))) (or .cse18 (and (forall ((|ULTIMATE.start_main_~state_53~0#1| (_ BitVec 8))) (let ((.cse24 ((_ zero_extend 24) |ULTIMATE.start_main_~state_53~0#1|))) (or (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse24))) |c_ULTIMATE.start_main_~var_116~0#1|) (not (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse24 (_ bv1 32)))))))))))) (forall ((|ULTIMATE.start_main_~state_53~0#1| (_ BitVec 8))) (let ((.cse25 ((_ zero_extend 24) |ULTIMATE.start_main_~state_53~0#1|))) (or (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse25 (_ bv1 32)))))))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse25))) |c_ULTIMATE.start_main_~var_116~0#1|)))))) (forall ((|ULTIMATE.start_main_~state_111~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~state_53~0#1| (_ BitVec 8))) (let ((.cse26 ((_ zero_extend 24) |ULTIMATE.start_main_~state_53~0#1|))) (or (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse27 ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse26 (_ bv5 32)))))) (bvor ((_ zero_extend 24) ((_ extract 7 0) (let ((.cse28 ((_ zero_extend 24) |ULTIMATE.start_main_~state_111~0#1|))) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse26 (_ bv4 32))))))) .cse27))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse28))) .cse8)))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv0 32) .cse27))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse28)))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse27))) .cse8)))))))))))))))))) |c_ULTIMATE.start_main_~var_22~0#1|)) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 .cse26))) |c_ULTIMATE.start_main_~var_116~0#1|) (not (= .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse13 ((_ zero_extend 24) ((_ extract 7 0) (bvashr .cse26 (_ bv1 32)))))))))))))) (or .cse1 .cse5 .cse2)))) (or (forall ((|ULTIMATE.start_main_~state_74~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) |ULTIMATE.start_main_~state_74~0#1|)))))))))))) (let ((.cse29 (and (or .cse1 .cse2) (or .cse4 .cse1) (or .cse6 .cse4) (or .cse6 .cse2)))) (and (or .cse29 .cse5) (or .cse29 .cse3)))))))) (forall ((|v_ULTIMATE.start_main_~var_49_arg_0~0#1_25| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_44_arg_1~0#1_25| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_49_arg_0~0#1_25|) ((_ zero_extend 24) ((_ extract 7 0) (bvnot ((_ zero_extend 24) ((_ extract 7 0) (bvor (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_44_arg_1~0#1_25|)))))))))))))))) is different from false