/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 bitwuzla -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c -------------------------------------------------------------------------------- This is Ultimate 0.2.5-dev-356b6ba-m [2024-11-01 21:29:05,827 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-01 21:29:05,892 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 21:29:05,897 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-01 21:29:05,898 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-01 21:29:05,942 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-01 21:29:05,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-01 21:29:05,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-01 21:29:05,944 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-01 21:29:05,945 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-01 21:29:05,947 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-01 21:29:05,948 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-01 21:29:05,948 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-01 21:29:05,949 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-01 21:29:05,949 INFO L153 SettingsManager]: * Use SBE=true [2024-11-01 21:29:05,949 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-01 21:29:05,950 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-01 21:29:05,950 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-01 21:29:05,952 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-01 21:29:05,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-01 21:29:05,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-01 21:29:05,955 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-01 21:29:05,956 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-01 21:29:05,956 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-01 21:29:05,956 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-01 21:29:05,956 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-01 21:29:05,957 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-01 21:29:05,957 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-01 21:29:05,957 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-01 21:29:05,957 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-01 21:29:05,958 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-01 21:29:05,958 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 21:29:05,958 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-01 21:29:05,958 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-01 21:29:05,959 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-01 21:29:05,959 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-01 21:29:05,959 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-01 21:29:05,959 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-01 21:29:05,960 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-01 21:29:05,960 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-01 21:29:05,960 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-01 21:29:05,961 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-11-01 21:29:05,961 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 -> bitwuzla [2024-11-01 21:29:06,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-01 21:29:06,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-01 21:29:06,295 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-01 21:29:06,296 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-01 21:29:06,296 INFO L274 PluginConnector]: CDTParser initialized [2024-11-01 21:29:06,298 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c [2024-11-01 21:29:07,785 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-01 21:29:08,010 INFO L384 CDTParser]: Found 1 translation units. [2024-11-01 21:29:08,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c [2024-11-01 21:29:08,021 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ef7e3b5/cf10579ee81e40ccb1776759b1d4d964/FLAGa361e0515 [2024-11-01 21:29:08,033 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f7ef7e3b5/cf10579ee81e40ccb1776759b1d4d964 [2024-11-01 21:29:08,035 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-01 21:29:08,036 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2024-11-01 21:29:08,037 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-01 21:29:08,037 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-01 21:29:08,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-01 21:29:08,042 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 09:29:08" (1/1) ... [2024-11-01 21:29:08,043 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7f2b86ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:08, skipping insertion in model container [2024-11-01 21:29:08,043 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.11 09:29:08" (1/1) ... [2024-11-01 21:29:08,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-01 21:29:08,245 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c[1249,1262] [2024-11-01 21:29:08,332 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 21:29:08,346 INFO L200 MainTranslator]: Completed pre-run [2024-11-01 21:29:08,357 WARN L251 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/hardware-verification-bv/btor2c-lazyMod.eq_sdp_v4.c[1249,1262] [2024-11-01 21:29:08,411 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-01 21:29:08,432 INFO L204 MainTranslator]: Completed translation [2024-11-01 21:29:08,434 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:08 WrapperNode [2024-11-01 21:29:08,434 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-01 21:29:08,435 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-01 21:29:08,435 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-01 21:29:08,435 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-01 21:29:08,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:08" (1/1) ... [2024-11-01 21:29:08,454 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:08" (1/1) ... [2024-11-01 21:29:08,480 INFO L138 Inliner]: procedures = 17, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 248 [2024-11-01 21:29:08,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-01 21:29:08,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-01 21:29:08,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-01 21:29:08,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-01 21:29:08,493 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:08" (1/1) ... [2024-11-01 21:29:08,493 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:08" (1/1) ... [2024-11-01 21:29:08,503 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:08" (1/1) ... [2024-11-01 21:29:08,520 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 21:29:08,521 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:08" (1/1) ... [2024-11-01 21:29:08,521 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:08" (1/1) ... [2024-11-01 21:29:08,532 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:08" (1/1) ... [2024-11-01 21:29:08,535 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:08" (1/1) ... [2024-11-01 21:29:08,543 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:08" (1/1) ... [2024-11-01 21:29:08,544 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:08" (1/1) ... [2024-11-01 21:29:08,548 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-01 21:29:08,549 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-01 21:29:08,549 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-01 21:29:08,553 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-01 21:29:08,554 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:08" (1/1) ... [2024-11-01 21:29:08,559 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-01 21:29:08,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-01 21:29:08,579 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 21:29:08,583 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 21:29:08,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-01 21:29:08,601 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-01 21:29:08,601 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-01 21:29:08,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-01 21:29:08,695 INFO L238 CfgBuilder]: Building ICFG [2024-11-01 21:29:08,697 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-01 21:29:08,978 INFO L? ?]: Removed 34 outVars from TransFormulas that were not future-live. [2024-11-01 21:29:08,978 INFO L287 CfgBuilder]: Performing block encoding [2024-11-01 21:29:08,996 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-01 21:29:08,996 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-01 21:29:08,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 09:29:08 BoogieIcfgContainer [2024-11-01 21:29:08,997 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-01 21:29:09,000 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-01 21:29:09,000 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-01 21:29:09,003 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-01 21:29:09,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.11 09:29:08" (1/3) ... [2024-11-01 21:29:09,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e085d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 09:29:09, skipping insertion in model container [2024-11-01 21:29:09,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.11 09:29:08" (2/3) ... [2024-11-01 21:29:09,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52e085d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.11 09:29:09, skipping insertion in model container [2024-11-01 21:29:09,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.11 09:29:08" (3/3) ... [2024-11-01 21:29:09,006 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.eq_sdp_v4.c [2024-11-01 21:29:09,021 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-01 21:29:09,022 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-01 21:29:09,082 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-01 21:29:09,087 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;@7db05dac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-01 21:29:09,088 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-01 21:29:09,091 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 21:29:09,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-01 21:29:09,096 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 21:29:09,096 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-01 21:29:09,097 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 21:29:09,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 21:29:09,103 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-01 21:29:09,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 21:29:09,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [463549143] [2024-11-01 21:29:09,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 21:29:09,111 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-01 21:29:09,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:29:09,112 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-01 21:29:09,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Waiting until timeout for monitored process [2024-11-01 21:29:09,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 21:29:09,268 INFO L255 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-01 21:29:09,280 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 21:29:09,392 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 21:29:09,392 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 21:29:09,531 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 21:29:09,532 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 21:29:09,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [463549143] [2024-11-01 21:29:09,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [463549143] provided 2 perfect and 0 imperfect interpolant sequences [2024-11-01 21:29:09,533 INFO L185 FreeRefinementEngine]: Found 2 perfect and 0 imperfect interpolant sequences. [2024-11-01 21:29:09,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2024-11-01 21:29:09,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334954253] [2024-11-01 21:29:09,536 INFO L85 oduleStraightlineAll]: Using 2 perfect interpolants to construct interpolant automaton [2024-11-01 21:29:09,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-01 21:29:09,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 21:29:09,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-01 21:29:09,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-01 21:29:09,568 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 21:29:09,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 21:29:09,611 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-01 21:29:09,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-01 21:29:09,614 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 21:29:09,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 21:29:09,620 INFO L225 Difference]: With dead ends: 17 [2024-11-01 21:29:09,620 INFO L226 Difference]: Without dead ends: 9 [2024-11-01 21:29:09,624 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 21:29:09,627 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2024-11-01 21:29:09,630 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.0s Time] [2024-11-01 21:29:09,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-01 21:29:09,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-01 21:29:09,658 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 21:29:09,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-01 21:29:09,660 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-01 21:29:09,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 21:29:09,661 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-01 21:29:09,661 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 21:29:09,661 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-01 21:29:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-01 21:29:09,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 21:29:09,662 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-01 21:29:09,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (2)] Forceful destruction successful, exit code 0 [2024-11-01 21:29:09,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:29:09,864 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 21:29:09,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 21:29:09,865 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-01 21:29:09,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 21:29:09,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [357952649] [2024-11-01 21:29:09,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 21:29:09,866 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-01 21:29:09,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:29:09,869 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-01 21:29:09,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Waiting until timeout for monitored process [2024-11-01 21:29:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 21:29:09,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-01 21:29:09,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 21:29:10,317 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 21:29:10,317 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 21:29:10,921 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 21:29:10,922 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 21:29:10,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [357952649] [2024-11-01 21:29:10,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [357952649] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 21:29:10,923 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 21:29:10,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-01 21:29:10,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59958101] [2024-11-01 21:29:10,923 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 21:29:10,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-01 21:29:10,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 21:29:10,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-01 21:29:10,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-01 21:29:10,926 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 21:29:11,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 21:29:11,055 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-01 21:29:11,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-01 21:29:11,055 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 21:29:11,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 21:29:11,056 INFO L225 Difference]: With dead ends: 14 [2024-11-01 21:29:11,056 INFO L226 Difference]: Without dead ends: 12 [2024-11-01 21:29:11,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2024-11-01 21:29:11,057 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-01 21:29:11,058 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-01 21:29:11,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-01 21:29:11,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-01 21:29:11,061 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 21:29:11,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-01 21:29:11,062 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-01 21:29:11,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 21:29:11,062 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-01 21:29:11,062 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 21:29:11,063 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-01 21:29:11,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-01 21:29:11,063 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 21:29:11,063 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-01 21:29:11,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (3)] Forceful destruction successful, exit code 0 [2024-11-01 21:29:11,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:29:11,266 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 21:29:11,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 21:29:11,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-01 21:29:11,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 21:29:11,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [547386683] [2024-11-01 21:29:11,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 21:29:11,267 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-01 21:29:11,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:29:11,269 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-01 21:29:11,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Waiting until timeout for monitored process [2024-11-01 21:29:11,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 21:29:11,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-01 21:29:11,382 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 21:29:11,895 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 21:29:11,895 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 21:29:14,366 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 21:29:14,366 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 21:29:14,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [547386683] [2024-11-01 21:29:14,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModulePreferences [547386683] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-01 21:29:14,367 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-01 21:29:14,367 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-01 21:29:14,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120768574] [2024-11-01 21:29:14,367 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-01 21:29:14,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-01 21:29:14,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2024-11-01 21:29:14,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-01 21:29:14,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-01 21:29:14,369 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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 21:29:14,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-01 21:29:14,787 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-11-01 21:29:14,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-01 21:29:14,788 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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 21:29:14,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-01 21:29:14,788 INFO L225 Difference]: With dead ends: 17 [2024-11-01 21:29:14,789 INFO L226 Difference]: Without dead ends: 15 [2024-11-01 21:29:14,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=88, Invalid=254, Unknown=0, NotChecked=0, Total=342 [2024-11-01 21:29:14,790 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-01 21:29:14,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-01 21:29:14,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-01 21:29:14,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-01 21:29:14,796 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 21:29:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-01 21:29:14,797 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2024-11-01 21:29:14,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-01 21:29:14,797 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-01 21:29:14,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 14 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 21:29:14,797 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-01 21:29:14,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-01 21:29:14,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-01 21:29:14,798 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-01 21:29:14,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (4)] Forceful destruction successful, exit code 0 [2024-11-01 21:29:15,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:29:15,001 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-01 21:29:15,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-01 21:29:15,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 3 times [2024-11-01 21:29:15,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2024-11-01 21:29:15,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [546671039] [2024-11-01 21:29:15,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-01 21:29:15,003 INFO L173 SolverBuilder]: Constructing external solver with command: bitwuzla [2024-11-01 21:29:15,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:29:15,005 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (exit command is (exit), workingDir is null) [2024-11-01 21:29:15,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (5)] Waiting until timeout for monitored process [2024-11-01 21:29:15,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-01 21:29:15,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-01 21:29:15,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-01 21:29:19,549 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-01 21:29:19,550 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-01 21:29:29,234 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_5~0#1|)) (.cse69 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_17~0#1|)) (.cse68 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_9~0#1|))))) (let ((.cse66 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg .cse68) .cse68)))))))) (.cse24 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) .cse69))))))) (.cse64 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvmul (_ bv2 32) .cse68)))))))) (.cse10 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) .cse69))) .cse9)))) (.cse11 (forall ((|v_ULTIMATE.start_main_#t~nondet20#1_31| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet20#1_31|) .cse9))) .cse69))) (.cse67 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_29~0#1|)))) (.cse3 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse65 ((_ zero_extend 24) ((_ extract 7 0) .cse68)))) (let ((.cse38 (forall ((|v_ULTIMATE.start_main_#t~nondet20#1_30| (_ BitVec 8))) (not (= .cse69 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet20#1_30|) .cse9))))))) (.cse39 (let ((.cse71 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse65)))) (.cse70 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 .cse67))))) (and (or (not .cse70) (and .cse24 (or (= .cse71 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse66)))) .cse10 .cse11))) (or (and .cse24 (or (= .cse71 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 .cse64)))) .cse10 .cse11)) .cse70))))) (let ((.cse56 (or .cse38 .cse39)) (.cse13 (forall ((|v_ULTIMATE.start_main_#t~nondet20#1_30| (_ BitVec 8))) (= .cse69 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet20#1_30|) .cse9)))))) (.cse8 ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_75~0#1|)) (.cse59 (= .cse69 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_8~0#1|)))) (and (or (let ((.cse23 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_7~0#1|))))))))) (.cse53 (forall ((|ULTIMATE.start_main_~input_2~0#1| (_ BitVec 8))) (let ((.cse58 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_2~0#1|))))) (or (= .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse58))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 .cse58))))))) (.cse55 (forall ((|ULTIMATE.start_main_~input_2~0#1| (_ BitVec 8))) (let ((.cse57 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_2~0#1|))))) (or (not (= .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse57)))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 .cse57)))))))) (.cse22 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_7~0#1|))) (let ((.cse0 (not .cse22)) (.cse2 (and .cse56 (or .cse24 .cse13))) (.cse14 (or .cse38 .cse39 .cse55)) (.cse12 (or .cse24 .cse55)) (.cse1 (forall ((|ULTIMATE.start_main_~input_2~0#1| (_ BitVec 8))) (let ((.cse54 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_2~0#1|))))) (or (= .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse54))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 .cse54)))))))) (.cse15 (or .cse38 .cse39 .cse53)) (.cse16 (or .cse53 .cse24)) (.cse25 (not .cse23)) (.cse21 (forall ((|ULTIMATE.start_main_~input_2~0#1| (_ BitVec 8))) (let ((.cse52 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_2~0#1|))))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 .cse52))) (not (= .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse52))))))))))))) (and (or .cse0 (and (or .cse1 .cse2) (or (and (or (forall ((|ULTIMATE.start_main_~input_3~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_2~0#1| (_ BitVec 8))) (let ((.cse7 ((_ zero_extend 24) |ULTIMATE.start_main_~input_2~0#1|))) (let ((.cse5 ((_ zero_extend 24) ((_ extract 7 0) .cse7)))) (or (let ((.cse4 ((_ zero_extend 24) |ULTIMATE.start_main_~input_3~0#1|)) (.cse6 ((_ zero_extend 24) |ULTIMATE.start_main_~input_4~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) .cse4)) .cse5))))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse6))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ 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) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse7 (bvneg .cse4)))))) (bvneg .cse6))))))))))))))))) (not (= .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse5)))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 .cse5)))))))) .cse10 .cse11) .cse12) .cse13) .cse14)) (or .cse0 (and .cse15 (or (and .cse16 (or (forall ((|ULTIMATE.start_main_~input_3~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_2~0#1| (_ BitVec 8))) (let ((.cse19 ((_ zero_extend 24) |ULTIMATE.start_main_~input_2~0#1|))) (let ((.cse17 ((_ zero_extend 24) ((_ extract 7 0) .cse19)))) (or (= .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse17))))))) (let ((.cse18 ((_ zero_extend 24) |ULTIMATE.start_main_~input_3~0#1|)) (.cse20 ((_ zero_extend 24) |ULTIMATE.start_main_~input_4~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ 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) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse18 .cse19))))) (bvneg .cse20))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) .cse18))) .cse17))))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse20))))))))))))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 .cse17))))))) .cse10 .cse11)) .cse13) (or .cse21 .cse2))) (or .cse22 (and (or (and (or .cse1 .cse23 .cse24) (or .cse25 (and (or (forall ((|ULTIMATE.start_main_~input_3~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_2~0#1| (_ BitVec 8))) (let ((.cse26 ((_ zero_extend 24) |ULTIMATE.start_main_~input_2~0#1|))) (let ((.cse29 ((_ zero_extend 24) ((_ extract 7 0) .cse26)))) (or (let ((.cse27 ((_ zero_extend 24) |ULTIMATE.start_main_~input_3~0#1|)) (.cse28 ((_ zero_extend 24) |ULTIMATE.start_main_~input_4~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse26 (bvneg .cse27)))))) .cse28))))))))))) .cse3))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) .cse27))) .cse29))))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse28))))))))))))))))) (= .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse29))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 .cse29)))))))) .cse10 .cse11) (or .cse1 .cse24)))) .cse13) .cse14 (or (and (or .cse23 (and .cse12 (or (forall ((|ULTIMATE.start_main_~input_3~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_2~0#1| (_ BitVec 8))) (let ((.cse33 ((_ zero_extend 24) |ULTIMATE.start_main_~input_2~0#1|))) (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) .cse33)))) (or (let ((.cse30 ((_ zero_extend 24) |ULTIMATE.start_main_~input_3~0#1|)) (.cse32 ((_ zero_extend 24) |ULTIMATE.start_main_~input_4~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) .cse30)) .cse31))))))) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse32)))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse33 (bvneg .cse30)))))) .cse32))))))))))) .cse3))))) (not (= .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse31)))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 .cse31)))))))) .cse10 .cse11))) (or (and (or (forall ((|ULTIMATE.start_main_~input_3~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_2~0#1| (_ BitVec 8))) (let ((.cse37 ((_ zero_extend 24) |ULTIMATE.start_main_~input_2~0#1|))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) .cse37)))) (or (let ((.cse34 ((_ zero_extend 24) |ULTIMATE.start_main_~input_3~0#1|)) (.cse36 ((_ zero_extend 24) |ULTIMATE.start_main_~input_4~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) .cse34)) .cse35))))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse36))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse37 (bvneg .cse34)))))) .cse36))))))))))) .cse3))))) (not (= .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse35)))))))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 .cse35)))))))) .cse10 .cse11) .cse12) .cse25)) .cse13) (or .cse1 .cse38 .cse39))) (or (and .cse15 (or (and (or .cse25 (and .cse16 (or (forall ((|ULTIMATE.start_main_~input_3~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_2~0#1| (_ BitVec 8))) (let ((.cse42 ((_ zero_extend 24) |ULTIMATE.start_main_~input_2~0#1|))) (let ((.cse40 ((_ zero_extend 24) ((_ extract 7 0) .cse42)))) (or (= .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse40))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 .cse40))) (let ((.cse41 ((_ zero_extend 24) |ULTIMATE.start_main_~input_3~0#1|)) (.cse43 ((_ zero_extend 24) |ULTIMATE.start_main_~input_4~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse41 .cse42))))) .cse43))))))))))) .cse3))) ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) .cse41))) .cse40))))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse43))))))))))))))))))))) .cse10 .cse11))) (or .cse23 (and .cse16 (or (forall ((|ULTIMATE.start_main_~input_3~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_2~0#1| (_ BitVec 8))) (let ((.cse47 ((_ zero_extend 24) |ULTIMATE.start_main_~input_2~0#1|))) (let ((.cse44 ((_ zero_extend 24) ((_ extract 7 0) .cse47)))) (or (= .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse44))))))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 .cse44))) (let ((.cse45 ((_ zero_extend 24) |ULTIMATE.start_main_~input_3~0#1|)) (.cse46 ((_ zero_extend 24) |ULTIMATE.start_main_~input_4~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd (bvneg ((_ zero_extend 24) ((_ extract 7 0) .cse45))) .cse44))))))) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse46)))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse45 .cse47))))) .cse46))))))))))) .cse3))))))))) .cse10 .cse11)))) .cse13) (or .cse13 (and (or .cse25 (and (or .cse21 .cse24) (or (forall ((|ULTIMATE.start_main_~input_3~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_4~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_2~0#1| (_ BitVec 8))) (let ((.cse51 ((_ zero_extend 24) |ULTIMATE.start_main_~input_2~0#1|))) (let ((.cse48 ((_ zero_extend 24) ((_ extract 7 0) .cse51)))) (or (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 .cse48))) (not (= .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse48)))))))) (let ((.cse49 ((_ zero_extend 24) |ULTIMATE.start_main_~input_3~0#1|)) (.cse50 ((_ zero_extend 24) |ULTIMATE.start_main_~input_4~0#1|))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) .cse49)) .cse48))))))) (bvneg ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse50))))))))))))))) ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse49 .cse51))))) .cse50))))))))))) .cse3))))))))) .cse10 .cse11))) (or .cse23 .cse21 .cse24))) (or .cse38 .cse39 .cse21)) .cse22)))) .cse59) (or (let ((.cse60 (let ((.cse61 (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse8 .cse68)))))) .cse8)) (.cse62 (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse67)) .cse9)))) (.cse63 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) .cse65)) .cse3))))) (and (or (not .cse61) (and .cse56 (or (and .cse24 (or .cse62 .cse10 .cse11 (= .cse63 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse64 .cse65))))))) .cse3)))))) .cse13))) (or .cse61 (and .cse56 (or (and .cse24 (or (not .cse62) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse3 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) (bvadd .cse66 (bvneg .cse65))))))))))) .cse63) .cse10 .cse11)) .cse13))))))) (and (or (forall ((|ULTIMATE.start_main_~input_2~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_2~0#1|)))))))) .cse60) (or .cse60 (forall ((|ULTIMATE.start_main_~input_2~0#1| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |ULTIMATE.start_main_~input_2~0#1|)))))))))) (not .cse59))))))) is different from false [2024-11-01 21:30:02,502 WARN L249 Executor]: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) stderr output: (error "out of memory") [2024-11-01 21:30:02,503 INFO L136 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2024-11-01 21:30:02,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [546671039] [2024-11-01 21:30:02,504 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2024-11-01 21:30:02,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 101 [2024-11-01 21:30:02,509 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla (5)] Ended with exit code 0 [2024-11-01 21:30:02,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/bitwuzla [2024-11-01 21:30:02,705 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:281) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.checkSat(WrapperScript.java:163) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.checkSat(ManagedScript.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:85) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:912) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:786) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:374) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:323) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:553) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:416) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:395) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:267) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:324) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:180) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:159) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModulePreferences.construct(IpTcStrategyModulePreferences.java:113) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:210) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:407) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:342) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:324) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:426) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:167) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:143) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:150) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:127) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:233) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:227) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:144) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:319) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1518) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:701) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:383) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:258) ... 44 more [2024-11-01 21:30:02,709 INFO L158 Benchmark]: Toolchain (without parser) took 54673.29ms. Allocated memory was 221.2MB in the beginning and 553.6MB in the end (delta: 332.4MB). Free memory was 197.1MB in the beginning and 280.5MB in the end (delta: -83.4MB). Peak memory consumption was 249.5MB. Max. memory is 8.0GB. [2024-11-01 21:30:02,710 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 221.2MB. Free memory was 197.7MB in the beginning and 197.6MB in the end (delta: 65.5kB). There was no memory consumed. Max. memory is 8.0GB. [2024-11-01 21:30:02,710 INFO L158 Benchmark]: CACSL2BoogieTranslator took 397.56ms. Allocated memory is still 221.2MB. Free memory was 196.6MB in the beginning and 179.2MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2024-11-01 21:30:02,711 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.08ms. Allocated memory is still 221.2MB. Free memory was 179.2MB in the beginning and 176.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2024-11-01 21:30:02,712 INFO L158 Benchmark]: Boogie Preprocessor took 66.44ms. Allocated memory is still 221.2MB. Free memory was 176.6MB in the beginning and 173.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2024-11-01 21:30:02,712 INFO L158 Benchmark]: RCFGBuilder took 448.65ms. Allocated memory is still 221.2MB. Free memory was 173.5MB in the beginning and 148.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2024-11-01 21:30:02,712 INFO L158 Benchmark]: TraceAbstraction took 53708.77ms. Allocated memory was 221.2MB in the beginning and 553.6MB in the end (delta: 332.4MB). Free memory was 147.3MB in the beginning and 280.5MB in the end (delta: -133.2MB). Peak memory consumption was 200.2MB. Max. memory is 8.0GB. [2024-11-01 21:30:02,714 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13ms. Allocated memory is still 221.2MB. Free memory was 197.7MB in the beginning and 197.6MB in the end (delta: 65.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 397.56ms. Allocated memory is still 221.2MB. Free memory was 196.6MB in the beginning and 179.2MB in the end (delta: 17.3MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 46.08ms. Allocated memory is still 221.2MB. Free memory was 179.2MB in the beginning and 176.6MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 66.44ms. Allocated memory is still 221.2MB. Free memory was 176.6MB in the beginning and 173.5MB in the end (delta: 3.1MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 448.65ms. Allocated memory is still 221.2MB. Free memory was 173.5MB in the beginning and 148.3MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * TraceAbstraction took 53708.77ms. Allocated memory was 221.2MB in the beginning and 553.6MB in the end (delta: 332.4MB). Free memory was 147.3MB in the beginning and 280.5MB in the end (delta: -133.2MB). Peak memory consumption was 200.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: External (MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1) with exit command (exit)) Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:262) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...