/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 Internal_SMTInterpol -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-356b6ba-m [2024-11-01 00:44:34,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-01 00:44:34,589 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 00:44:34,594 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-01 00:44:34,595 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-01 00:44:34,632 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-01 00:44:34,633 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-01 00:44:34,633 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-01 00:44:34,633 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-01 00:44:34,634 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-01 00:44:34,634 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-01 00:44:34,634 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-01 00:44:34,634 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-01 00:44:34,635 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-01 00:44:34,635 INFO L153 SettingsManager]: * Use SBE=true [2024-11-01 00:44:34,638 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-01 00:44:34,638 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-01 00:44:34,638 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-01 00:44:34,639 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-01 00:44:34,639 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-01 00:44:34,639 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-01 00:44:34,642 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-01 00:44:34,642 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-01 00:44:34,642 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-01 00:44:34,642 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-01 00:44:34,643 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-01 00:44:34,643 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-01 00:44:34,643 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-01 00:44:34,643 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-01 00:44:34,644 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-01 00:44:34,644 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-01 00:44:34,644 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 00:44:34,645 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-01 00:44:34,645 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-01 00:44:34,645 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-01 00:44:34,645 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-01 00:44:34,645 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-01 00:44:34,645 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-01 00:44:34,646 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-01 00:44:34,646 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-01 00:44:34,646 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-01 00:44:34,647 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-11-01 00:44:34,647 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 -> Internal_SMTInterpol [2024-11-01 00:44:34,892 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-01 00:44:34,914 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-01 00:44:34,916 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-01 00:44:34,917 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-01 00:44:34,917 INFO L274 PluginConnector]: CDTParser initialized [2024-11-01 00:44:34,918 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-11-01 00:44:36,416 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-01 00:44:36,583 INFO L384 CDTParser]: Found 1 translation units. [2024-11-01 00:44:36,584 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.dyn_partition.c [2024-11-01 00:44:36,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cbff40b5/deb1dfdc17c542e6ad889e6fe29301d1/FLAG698081a0a [2024-11-01 00:44:36,978 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4cbff40b5/deb1dfdc17c542e6ad889e6fe29301d1 [2024-11-01 00:44:36,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-01 00:44:36,980 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-01 00:44:36,981 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-01 00:44:36,981 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-01 00:44:36,985 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-01 00:44:36,986 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 12:44:36" (1/1) ... [2024-11-01 00:44:36,986 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30b4aebc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:44:36, skipping insertion in model container [2024-11-01 00:44:36,988 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 12:44:36" (1/1) ... [2024-11-01 00:44:37,013 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-01 00:44:37,154 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.dyn_partition.c[1253,1266] [2024-11-01 00:44:37,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 00:44:37,215 INFO L200 MainTranslator]: Completed pre-run [2024-11-01 00:44:37,247 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.dyn_partition.c[1253,1266] [2024-11-01 00:44:37,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 00:44:37,290 INFO L204 MainTranslator]: Completed translation [2024-11-01 00:44:37,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:44:37 WrapperNode [2024-11-01 00:44:37,292 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-01 00:44:37,293 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-01 00:44:37,293 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-01 00:44:37,293 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-01 00:44:37,298 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:44:37" (1/1) ... [2024-11-01 00:44:37,306 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:44:37" (1/1) ... [2024-11-01 00:44:37,325 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 108 [2024-11-01 00:44:37,325 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-01 00:44:37,325 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-01 00:44:37,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-01 00:44:37,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-01 00:44:37,335 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:44:37" (1/1) ... [2024-11-01 00:44:37,336 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:44:37" (1/1) ... [2024-11-01 00:44:37,339 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:44:37" (1/1) ... [2024-11-01 00:44:37,353 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 00:44:37,353 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:44:37" (1/1) ... [2024-11-01 00:44:37,353 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:44:37" (1/1) ... [2024-11-01 00:44:37,361 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:44:37" (1/1) ... [2024-11-01 00:44:37,362 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:44:37" (1/1) ... [2024-11-01 00:44:37,366 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:44:37" (1/1) ... [2024-11-01 00:44:37,367 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:44:37" (1/1) ... [2024-11-01 00:44:37,369 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-01 00:44:37,373 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-01 00:44:37,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-01 00:44:37,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-01 00:44:37,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:44:37" (1/1) ... [2024-11-01 00:44:37,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 00:44:37,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 00:44:37,398 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 00:44:37,404 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 00:44:37,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-01 00:44:37,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-01 00:44:37,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-01 00:44:37,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-01 00:44:37,482 INFO L238 CfgBuilder]: Building ICFG [2024-11-01 00:44:37,483 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-01 00:44:37,620 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-11-01 00:44:37,620 INFO L287 CfgBuilder]: Performing block encoding [2024-11-01 00:44:37,633 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-01 00:44:37,633 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-01 00:44:37,634 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 12:44:37 BoogieIcfgContainer [2024-11-01 00:44:37,634 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-01 00:44:37,636 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-01 00:44:37,637 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-01 00:44:37,639 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-01 00:44:37,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 12:44:36" (1/3) ... [2024-11-01 00:44:37,639 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a25b56f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 12:44:37, skipping insertion in model container [2024-11-01 00:44:37,639 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 12:44:37" (2/3) ... [2024-11-01 00:44:37,640 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a25b56f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 12:44:37, skipping insertion in model container [2024-11-01 00:44:37,640 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 12:44:37" (3/3) ... [2024-11-01 00:44:37,640 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.dyn_partition.c [2024-11-01 00:44:37,652 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-01 00:44:37,652 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-01 00:44:37,702 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-01 00:44:37,711 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;@72161bb2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-01 00:44:37,711 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-01 00:44:37,714 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 00:44:37,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-01 00:44:37,719 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 00:44:37,720 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-01 00:44:37,721 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 00:44:37,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 00:44:37,726 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-01 00:44:37,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 00:44:37,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [248515856] [2024-11-01 00:44:37,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 00:44:37,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-01 00:44:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 00:44:38,826 WARN L253 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-01 00:44:38,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 00:44:38,982 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 00:44:38,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 00:44:39,079 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 00:44:39,080 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 00:44:39,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [248515856] [2024-11-01 00:44:39,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [248515856] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 00:44:39,081 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 00:44:39,081 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-01 00:44:39,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299485018] [2024-11-01 00:44:39,083 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 00:44:39,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-01 00:44:39,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 00:44:39,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-01 00:44:39,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-01 00:44:39,106 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 00:44:39,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 00:44:39,148 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-01 00:44:39,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-01 00:44:39,151 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 00:44:39,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 00:44:39,156 INFO L225 Difference]: With dead ends: 18 [2024-11-01 00:44:39,156 INFO L226 Difference]: Without dead ends: 10 [2024-11-01 00:44:39,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-01 00:44:39,162 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 4 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 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.0s IncrementalHoareTripleChecker+Time [2024-11-01 00:44:39,163 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 14 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-01 00:44:39,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-01 00:44:39,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-01 00:44:39,182 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 00:44:39,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-01 00:44:39,184 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-01 00:44:39,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 00:44:39,184 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-01 00:44:39,185 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 00:44:39,185 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-01 00:44:39,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-01 00:44:39,185 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 00:44:39,185 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-01 00:44:39,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-01 00:44:39,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 00:44:39,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 00:44:39,186 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-01 00:44:39,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 00:44:39,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [436756399] [2024-11-01 00:44:39,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 00:44:39,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-01 00:44:43,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 00:44:43,023 WARN L253 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-01 00:44:43,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 00:44:43,270 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 00:44:43,270 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 00:44:43,682 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 00:44:43,682 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 00:44:43,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [436756399] [2024-11-01 00:44:43,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [436756399] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 00:44:43,683 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 00:44:43,683 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-01 00:44:43,683 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616775776] [2024-11-01 00:44:43,683 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 00:44:43,684 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-01 00:44:43,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 00:44:43,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-01 00:44:43,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-01 00:44:43,686 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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 00:44:43,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 00:44:43,869 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2024-11-01 00:44:43,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-01 00:44:43,869 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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 00:44:43,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 00:44:43,870 INFO L225 Difference]: With dead ends: 18 [2024-11-01 00:44:43,870 INFO L226 Difference]: Without dead ends: 16 [2024-11-01 00:44:43,870 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2024-11-01 00:44:43,871 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-01 00:44:43,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 16 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-01 00:44:43,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2024-11-01 00:44:43,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2024-11-01 00:44:43,874 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 00:44:43,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-01 00:44:43,874 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2024-11-01 00:44:43,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 00:44:43,875 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-01 00:44:43,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.4) internal successors, (14), 10 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 00:44:43,875 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-01 00:44:43,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-01 00:44:43,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 00:44:43,875 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-01 00:44:43,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-01 00:44:43,876 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 00:44:43,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 00:44:43,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 2 times [2024-11-01 00:44:43,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 00:44:43,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [126292418] [2024-11-01 00:44:43,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 00:44:43,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-01 00:45:06,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 00:45:06,800 WARN L253 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-01 00:45:06,811 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 00:45:07,303 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 00:45:07,303 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 00:45:20,724 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 00:45:20,727 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 00:45:20,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [126292418] [2024-11-01 00:45:20,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [126292418] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 00:45:20,727 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 00:45:20,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2024-11-01 00:45:20,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527474660] [2024-11-01 00:45:20,728 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 00:45:20,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-01 00:45:20,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 00:45:20,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-01 00:45:20,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=197, Unknown=2, NotChecked=0, Total=272 [2024-11-01 00:45:20,733 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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 00:45:27,343 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_20~0#1|)) (.cse14 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_18~0#1|))) (let ((.cse12 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse15 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_13~0#1|)) (.cse7 (= .cse13 .cse14)) (.cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_8~0#1|)) (.cse10 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse5 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 .cse5))) |c_ULTIMATE.start_main_~var_25~0#1|))))))))) (.cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse6)) .cse10)))) (.cse4 (not .cse7)) (.cse2 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) .cse15))))))) (.cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 ((_ zero_extend 24) ((_ extract 7 0) .cse5)))))) (.cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 .cse6))) |c_ULTIMATE.start_main_~var_25~0#1|))))))))) (.cse3 (= ((_ extract 7 0) (bvand .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) .cse15))))) (_ bv0 8)))) (and (or (and (or (bvsle .cse0 .cse1) .cse2) .cse3) .cse4) (or (bvsle .cse5 .cse6) .cse2) (or .cse7 (and .cse3 (or .cse2 (bvsle .cse8 .cse9)))) .cse3 (or (and (or (let ((.cse11 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse13)))))) .cse14))) (and (or (and (or .cse2 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 ((_ zero_extend 24) ((_ extract 7 0) .cse8))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 .cse10))) |c_ULTIMATE.start_main_~var_25~0#1|)))))))))) .cse3) (not .cse11)) (or .cse11 (and .cse3 (or (bvsle ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 .cse8))) |c_ULTIMATE.start_main_~var_25~0#1|)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse9)) .cse10)))) .cse2))))) .cse7) (or .cse4 (and (or .cse2 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse10))) |c_ULTIMATE.start_main_~var_25~0#1|)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse1)) .cse10))))) .cse3))) (forall ((|v_ULTIMATE.start_main_~var_15_arg_1~0#1_20| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_15_arg_0~0#1_20| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_15_arg_0~0#1_20|) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_15_arg_1~0#1_20|)))))))))))))) is different from false [2024-11-01 00:45:32,956 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_20~0#1|)) (.cse13 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_18~0#1|))) (let ((.cse11 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse14 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_13~0#1|)) (.cse6 (= .cse12 .cse13)) (.cse15 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_8~0#1|)) (.cse9 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse16 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse0 (= |c_ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv0 32))) (.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 .cse16))) |c_ULTIMATE.start_main_~var_25~0#1|))))))))) (.cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse15)) .cse9)))) (.cse5 (not .cse6)) (.cse3 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) .cse14))))))) (.cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) .cse16)))))) (.cse2 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 .cse15))) |c_ULTIMATE.start_main_~var_25~0#1|))))))))) (.cse4 (= ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) .cse14))))) (_ bv0 8)))) (and (not .cse0) (or .cse0 (and (or (and (or (bvsle .cse1 .cse2) .cse3) .cse4) .cse5) (or .cse6 (and .cse4 (or .cse3 (bvsle .cse7 .cse8)))))) (or (and (or (let ((.cse10 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse12)))))) .cse13))) (and (or (and (or .cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) .cse7))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse9))) |c_ULTIMATE.start_main_~var_25~0#1|)))))))))) .cse4) (not .cse10)) (or .cse10 (and .cse4 (or (bvsle ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 .cse7))) |c_ULTIMATE.start_main_~var_25~0#1|)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse8)) .cse9)))) .cse3))))) .cse6) (or .cse5 (and (or .cse3 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse1 .cse9))) |c_ULTIMATE.start_main_~var_25~0#1|)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse2)) .cse9))))) .cse4))) (forall ((|v_ULTIMATE.start_main_~var_15_arg_1~0#1_20| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_15_arg_0~0#1_20| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse11 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_15_arg_0~0#1_20|) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_15_arg_1~0#1_20|)))))))))))))) is different from false [2024-11-01 00:45:38,369 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse11 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_20~0#1|)) (.cse12 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_18~0#1|))) (let ((.cse10 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse13 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_13~0#1|)) (.cse5 (= .cse11 .cse12)) (.cse14 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_8~0#1|)) (.cse8 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|)) (.cse15 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_6~0#1|))) (let ((.cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse15))) |c_ULTIMATE.start_main_~var_25~0#1|))))))))) (.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse14)) .cse8)))) (.cse4 (not .cse5)) (.cse2 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) .cse13))))))) (.cse0 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) .cse15)))))) (.cse1 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse14))) |c_ULTIMATE.start_main_~var_25~0#1|))))))))) (.cse3 (= ((_ extract 7 0) (bvand .cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) .cse13))))) (_ bv0 8)))) (and (or (and (or (bvsle .cse0 .cse1) .cse2) .cse3) .cse4) (or .cse5 (and .cse3 (or .cse2 (bvsle .cse6 .cse7)))) (or (and (or (let ((.cse9 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvnot .cse11)))))) .cse12))) (and (or (and (or .cse2 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) .cse6))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse7 .cse8))) |c_ULTIMATE.start_main_~var_25~0#1|)))))))))) .cse3) (not .cse9)) (or .cse9 (and .cse3 (or (bvsle ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse6))) |c_ULTIMATE.start_main_~var_25~0#1|)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse7)) .cse8)))) .cse2))))) .cse5) (or .cse4 (and (or .cse2 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse0 .cse8))) |c_ULTIMATE.start_main_~var_25~0#1|)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse1)) .cse8))))) .cse3))) (forall ((|v_ULTIMATE.start_main_~var_15_arg_1~0#1_20| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_15_arg_0~0#1_20| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse10 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_15_arg_0~0#1_20|) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_15_arg_1~0#1_20|)))))))))))))) is different from false [2024-11-01 00:45:44,036 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse7 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_13~0#1|))) (let ((.cse2 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) .cse7))))))) (.cse0 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_6~0#1|)) (.cse1 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_8~0#1|)) (.cse4 (= ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) .cse7))))) (_ bv0 8)))) (and (or (bvsle .cse0 .cse1) .cse2) (or (let ((.cse5 (= ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_20~0#1|) ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_18~0#1|))) (.cse3 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_4~0#1|))) (and (or (and (or (bvsle ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) .cse0))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse1))) |c_ULTIMATE.start_main_~var_25~0#1|))))))))) .cse2) .cse4) (not .cse5)) (or .cse5 (and .cse4 (or .cse2 (bvsle ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse0))) |c_ULTIMATE.start_main_~var_25~0#1|)))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse1)) .cse3))))))))) (forall ((|v_ULTIMATE.start_main_~var_15_arg_1~0#1_20| (_ BitVec 8)) (|v_ULTIMATE.start_main_~var_15_arg_0~0#1_20| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_15_arg_0~0#1_20|) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_15_arg_1~0#1_20|)))))))))) .cse4))) is different from false [2024-11-01 00:45:44,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 00:45:44,700 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2024-11-01 00:45:44,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-01 00:45:44,703 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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 14 [2024-11-01 00:45:44,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 00:45:44,704 INFO L225 Difference]: With dead ends: 30 [2024-11-01 00:45:44,704 INFO L226 Difference]: Without dead ends: 28 [2024-11-01 00:45:44,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 35.4s TimeCoverageRelationStatistics Valid=161, Invalid=401, Unknown=6, NotChecked=188, Total=756 [2024-11-01 00:45:44,706 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 7 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-01 00:45:44,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 30 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 118 Invalid, 0 Unknown, 55 Unchecked, 0.5s Time] [2024-11-01 00:45:44,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-01 00:45:44,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2024-11-01 00:45:44,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 00:45:44,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2024-11-01 00:45:44,715 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2024-11-01 00:45:44,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 00:45:44,715 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2024-11-01 00:45:44,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 17 states have internal predecessors, (26), 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 00:45:44,715 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2024-11-01 00:45:44,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-01 00:45:44,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 00:45:44,716 INFO L215 NwaCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1] [2024-11-01 00:45:44,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-01 00:45:44,716 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 00:45:44,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 00:45:44,717 INFO L85 PathProgramCache]: Analyzing trace with hash 96933411, now seen corresponding path program 3 times [2024-11-01 00:45:44,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 00:45:44,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1098111982] [2024-11-01 00:45:44,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 00:45:44,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms