./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 05:31:32,806 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 05:31:32,869 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-22 05:31:32,878 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 05:31:32,878 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 05:31:32,905 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 05:31:32,906 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 05:31:32,906 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 05:31:32,907 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 05:31:32,907 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 05:31:32,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 05:31:32,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 05:31:32,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 05:31:32,910 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 05:31:32,910 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 05:31:32,911 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 05:31:32,911 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 05:31:32,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 05:31:32,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 05:31:32,912 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 05:31:32,916 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 05:31:32,917 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 05:31:32,917 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 05:31:32,917 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 05:31:32,917 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 05:31:32,918 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 05:31:32,918 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 05:31:32,918 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 05:31:32,919 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 05:31:32,919 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:31:32,919 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 05:31:32,920 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 05:31:32,920 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 05:31:32,921 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 05:31:32,921 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 05:31:32,922 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 05:31:32,922 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 05:31:32,922 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 05:31:32,922 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 05:31:32,923 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b [2024-11-22 05:31:33,188 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 05:31:33,213 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 05:31:33,215 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 05:31:33,216 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 05:31:33,217 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 05:31:33,218 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2024-11-22 05:31:34,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 05:31:34,938 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 05:31:34,938 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2024-11-22 05:31:34,952 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b4661212/598b4352521c40c99d4e3a9f40cc6ccc/FLAG42fc66023 [2024-11-22 05:31:35,310 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8b4661212/598b4352521c40c99d4e3a9f40cc6ccc [2024-11-22 05:31:35,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 05:31:35,315 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 05:31:35,316 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 05:31:35,317 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 05:31:35,323 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 05:31:35,324 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:31:35" (1/1) ... [2024-11-22 05:31:35,325 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@376c2a14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:35, skipping insertion in model container [2024-11-22 05:31:35,325 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:31:35" (1/1) ... [2024-11-22 05:31:35,362 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 05:31:35,532 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2024-11-22 05:31:35,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:31:35,651 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 05:31:35,661 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2024-11-22 05:31:35,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:31:35,725 INFO L204 MainTranslator]: Completed translation [2024-11-22 05:31:35,726 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:35 WrapperNode [2024-11-22 05:31:35,726 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 05:31:35,727 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 05:31:35,727 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 05:31:35,728 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 05:31:35,734 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:35" (1/1) ... [2024-11-22 05:31:35,754 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:35" (1/1) ... [2024-11-22 05:31:35,821 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 643 [2024-11-22 05:31:35,822 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 05:31:35,823 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 05:31:35,825 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 05:31:35,825 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 05:31:35,836 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:35" (1/1) ... [2024-11-22 05:31:35,836 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:35" (1/1) ... [2024-11-22 05:31:35,845 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:35" (1/1) ... [2024-11-22 05:31:35,883 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-22 05:31:35,887 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:35" (1/1) ... [2024-11-22 05:31:35,887 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:35" (1/1) ... [2024-11-22 05:31:35,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:35" (1/1) ... [2024-11-22 05:31:35,931 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:35" (1/1) ... [2024-11-22 05:31:35,938 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:35" (1/1) ... [2024-11-22 05:31:35,944 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:35" (1/1) ... [2024-11-22 05:31:35,958 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 05:31:35,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 05:31:35,963 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 05:31:35,963 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 05:31:35,964 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:35" (1/1) ... [2024-11-22 05:31:35,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:31:35,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 05:31:35,999 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-22 05:31:36,005 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-22 05:31:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 05:31:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 05:31:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 05:31:36,053 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 05:31:36,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 05:31:36,192 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 05:31:36,194 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 05:31:37,177 INFO L? ?]: Removed 297 outVars from TransFormulas that were not future-live. [2024-11-22 05:31:37,177 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 05:31:37,203 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 05:31:37,203 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 05:31:37,204 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:31:37 BoogieIcfgContainer [2024-11-22 05:31:37,204 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 05:31:37,208 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 05:31:37,208 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 05:31:37,211 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 05:31:37,212 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 05:31:35" (1/3) ... [2024-11-22 05:31:37,213 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582d0ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:31:37, skipping insertion in model container [2024-11-22 05:31:37,213 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:35" (2/3) ... [2024-11-22 05:31:37,214 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@582d0ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:31:37, skipping insertion in model container [2024-11-22 05:31:37,214 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:31:37" (3/3) ... [2024-11-22 05:31:37,216 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul4.c [2024-11-22 05:31:37,234 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 05:31:37,235 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 05:31:37,311 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 05:31:37,318 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;@5ebe1169, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 05:31:37,319 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 05:31:37,325 INFO L276 IsEmpty]: Start isEmpty. Operand has 182 states, 180 states have (on average 1.4944444444444445) internal successors, (269), 181 states have internal predecessors, (269), 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-22 05:31:37,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-11-22 05:31:37,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:31:37,336 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:31:37,337 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:31:37,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:31:37,346 INFO L85 PathProgramCache]: Analyzing trace with hash -461519839, now seen corresponding path program 1 times [2024-11-22 05:31:37,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:31:37,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581372905] [2024-11-22 05:31:37,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:31:37,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:31:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:31:38,239 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-22 05:31:38,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:31:38,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581372905] [2024-11-22 05:31:38,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581372905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:31:38,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:31:38,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 05:31:38,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166193900] [2024-11-22 05:31:38,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:31:38,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 05:31:38,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:31:38,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 05:31:38,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:31:38,277 INFO L87 Difference]: Start difference. First operand has 182 states, 180 states have (on average 1.4944444444444445) internal successors, (269), 181 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-22 05:31:38,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:31:38,342 INFO L93 Difference]: Finished difference Result 297 states and 441 transitions. [2024-11-22 05:31:38,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 05:31:38,345 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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 65 [2024-11-22 05:31:38,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:31:38,357 INFO L225 Difference]: With dead ends: 297 [2024-11-22 05:31:38,357 INFO L226 Difference]: Without dead ends: 181 [2024-11-22 05:31:38,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:31:38,363 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:31:38,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 783 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:31:38,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-22 05:31:38,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-11-22 05:31:38,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.4833333333333334) internal successors, (267), 180 states have internal predecessors, (267), 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-22 05:31:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 267 transitions. [2024-11-22 05:31:38,406 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 267 transitions. Word has length 65 [2024-11-22 05:31:38,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:31:38,407 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 267 transitions. [2024-11-22 05:31:38,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 4 states have internal predecessors, (65), 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-22 05:31:38,407 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 267 transitions. [2024-11-22 05:31:38,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-22 05:31:38,409 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:31:38,409 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:31:38,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 05:31:38,410 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:31:38,411 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:31:38,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1420517578, now seen corresponding path program 1 times [2024-11-22 05:31:38,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:31:38,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745625898] [2024-11-22 05:31:38,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:31:38,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:31:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:31:38,721 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-22 05:31:38,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:31:38,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745625898] [2024-11-22 05:31:38,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745625898] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:31:38,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:31:38,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 05:31:38,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34498647] [2024-11-22 05:31:38,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:31:38,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 05:31:38,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:31:38,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 05:31:38,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:31:38,727 INFO L87 Difference]: Start difference. First operand 181 states and 267 transitions. Second operand has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-22 05:31:38,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:31:38,777 INFO L93 Difference]: Finished difference Result 298 states and 439 transitions. [2024-11-22 05:31:38,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 05:31:38,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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 66 [2024-11-22 05:31:38,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:31:38,781 INFO L225 Difference]: With dead ends: 298 [2024-11-22 05:31:38,781 INFO L226 Difference]: Without dead ends: 183 [2024-11-22 05:31:38,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:31:38,783 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 0 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 779 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:31:38,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 779 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:31:38,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-22 05:31:38,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2024-11-22 05:31:38,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 1.478021978021978) internal successors, (269), 182 states have internal predecessors, (269), 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-22 05:31:38,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 269 transitions. [2024-11-22 05:31:38,794 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 269 transitions. Word has length 66 [2024-11-22 05:31:38,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:31:38,795 INFO L471 AbstractCegarLoop]: Abstraction has 183 states and 269 transitions. [2024-11-22 05:31:38,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 4 states have internal predecessors, (66), 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-22 05:31:38,795 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 269 transitions. [2024-11-22 05:31:38,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-11-22 05:31:38,797 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:31:38,797 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:31:38,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 05:31:38,798 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:31:38,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:31:38,799 INFO L85 PathProgramCache]: Analyzing trace with hash 2110629786, now seen corresponding path program 1 times [2024-11-22 05:31:38,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:31:38,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435024773] [2024-11-22 05:31:38,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:31:38,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:31:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:31:39,250 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-22 05:31:39,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:31:39,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435024773] [2024-11-22 05:31:39,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435024773] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:31:39,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:31:39,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 05:31:39,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884392554] [2024-11-22 05:31:39,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:31:39,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 05:31:39,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:31:39,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 05:31:39,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 05:31:39,256 INFO L87 Difference]: Start difference. First operand 183 states and 269 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-22 05:31:39,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:31:39,324 INFO L93 Difference]: Finished difference Result 304 states and 446 transitions. [2024-11-22 05:31:39,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 05:31:39,325 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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 67 [2024-11-22 05:31:39,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:31:39,330 INFO L225 Difference]: With dead ends: 304 [2024-11-22 05:31:39,331 INFO L226 Difference]: Without dead ends: 187 [2024-11-22 05:31:39,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-22 05:31:39,332 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 212 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:31:39,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 775 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:31:39,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-11-22 05:31:39,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2024-11-22 05:31:39,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 1.4702702702702704) internal successors, (272), 185 states have internal predecessors, (272), 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-22 05:31:39,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 272 transitions. [2024-11-22 05:31:39,352 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 272 transitions. Word has length 67 [2024-11-22 05:31:39,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:31:39,353 INFO L471 AbstractCegarLoop]: Abstraction has 186 states and 272 transitions. [2024-11-22 05:31:39,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 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-22 05:31:39,353 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 272 transitions. [2024-11-22 05:31:39,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-11-22 05:31:39,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:31:39,357 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:31:39,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 05:31:39,358 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:31:39,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:31:39,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1725407879, now seen corresponding path program 1 times [2024-11-22 05:31:39,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:31:39,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104852558] [2024-11-22 05:31:39,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:31:39,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:31:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:31:40,440 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-22 05:31:40,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:31:40,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104852558] [2024-11-22 05:31:40,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104852558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:31:40,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:31:40,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 05:31:40,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431092306] [2024-11-22 05:31:40,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:31:40,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 05:31:40,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:31:40,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 05:31:40,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-22 05:31:40,444 INFO L87 Difference]: Start difference. First operand 186 states and 272 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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-22 05:31:40,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:31:40,552 INFO L93 Difference]: Finished difference Result 329 states and 479 transitions. [2024-11-22 05:31:40,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 05:31:40,553 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 68 [2024-11-22 05:31:40,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:31:40,555 INFO L225 Difference]: With dead ends: 329 [2024-11-22 05:31:40,555 INFO L226 Difference]: Without dead ends: 209 [2024-11-22 05:31:40,557 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-11-22 05:31:40,558 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 24 mSDsluCounter, 1273 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1530 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 05:31:40,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1530 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 05:31:40,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-22 05:31:40,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 194. [2024-11-22 05:31:40,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 193 states have (on average 1.4663212435233162) internal successors, (283), 193 states have internal predecessors, (283), 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-22 05:31:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 283 transitions. [2024-11-22 05:31:40,566 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 283 transitions. Word has length 68 [2024-11-22 05:31:40,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:31:40,567 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 283 transitions. [2024-11-22 05:31:40,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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-22 05:31:40,567 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 283 transitions. [2024-11-22 05:31:40,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-22 05:31:40,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:31:40,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:31:40,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 05:31:40,569 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:31:40,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:31:40,569 INFO L85 PathProgramCache]: Analyzing trace with hash -158687039, now seen corresponding path program 1 times [2024-11-22 05:31:40,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:31:40,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162632600] [2024-11-22 05:31:40,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:31:40,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:31:40,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:31:41,245 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-22 05:31:41,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:31:41,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162632600] [2024-11-22 05:31:41,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162632600] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:31:41,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:31:41,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 05:31:41,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416608773] [2024-11-22 05:31:41,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:31:41,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 05:31:41,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:31:41,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 05:31:41,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-22 05:31:41,250 INFO L87 Difference]: Start difference. First operand 194 states and 283 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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-22 05:31:41,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:31:41,355 INFO L93 Difference]: Finished difference Result 340 states and 494 transitions. [2024-11-22 05:31:41,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 05:31:41,356 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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 69 [2024-11-22 05:31:41,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:31:41,357 INFO L225 Difference]: With dead ends: 340 [2024-11-22 05:31:41,357 INFO L226 Difference]: Without dead ends: 212 [2024-11-22 05:31:41,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-22 05:31:41,358 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 21 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1521 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 05:31:41,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1521 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 05:31:41,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2024-11-22 05:31:41,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 200. [2024-11-22 05:31:41,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 199 states have (on average 1.4623115577889447) internal successors, (291), 199 states have internal predecessors, (291), 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-22 05:31:41,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 291 transitions. [2024-11-22 05:31:41,369 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 291 transitions. Word has length 69 [2024-11-22 05:31:41,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:31:41,370 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 291 transitions. [2024-11-22 05:31:41,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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-22 05:31:41,370 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 291 transitions. [2024-11-22 05:31:41,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-22 05:31:41,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:31:41,371 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:31:41,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 05:31:41,375 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:31:41,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:31:41,376 INFO L85 PathProgramCache]: Analyzing trace with hash -814345339, now seen corresponding path program 1 times [2024-11-22 05:31:41,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:31:41,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957709504] [2024-11-22 05:31:41,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:31:41,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:31:41,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:31:41,883 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-22 05:31:41,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:31:41,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957709504] [2024-11-22 05:31:41,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957709504] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:31:41,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:31:41,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-22 05:31:41,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061448911] [2024-11-22 05:31:41,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:31:41,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 05:31:41,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:31:41,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 05:31:41,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-22 05:31:41,887 INFO L87 Difference]: Start difference. First operand 200 states and 291 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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-22 05:31:41,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:31:41,992 INFO L93 Difference]: Finished difference Result 332 states and 482 transitions. [2024-11-22 05:31:41,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 05:31:41,993 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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 69 [2024-11-22 05:31:41,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:31:41,995 INFO L225 Difference]: With dead ends: 332 [2024-11-22 05:31:41,996 INFO L226 Difference]: Without dead ends: 198 [2024-11-22 05:31:41,997 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2024-11-22 05:31:42,001 INFO L432 NwaCegarLoop]: 247 mSDtfsCounter, 214 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 05:31:42,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 1703 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 05:31:42,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-22 05:31:42,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 195. [2024-11-22 05:31:42,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.4639175257731958) internal successors, (284), 194 states have internal predecessors, (284), 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-22 05:31:42,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 284 transitions. [2024-11-22 05:31:42,007 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 284 transitions. Word has length 69 [2024-11-22 05:31:42,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:31:42,008 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 284 transitions. [2024-11-22 05:31:42,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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-22 05:31:42,008 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 284 transitions. [2024-11-22 05:31:42,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-22 05:31:42,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:31:42,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:31:42,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 05:31:42,009 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:31:42,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:31:42,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1464837146, now seen corresponding path program 1 times [2024-11-22 05:31:42,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:31:42,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852188967] [2024-11-22 05:31:42,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:31:42,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:31:42,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:31:42,312 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-22 05:31:42,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:31:42,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852188967] [2024-11-22 05:31:42,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852188967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:31:42,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:31:42,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 05:31:42,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477233609] [2024-11-22 05:31:42,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:31:42,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 05:31:42,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:31:42,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 05:31:42,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 05:31:42,316 INFO L87 Difference]: Start difference. First operand 195 states and 284 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-22 05:31:42,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:31:42,367 INFO L93 Difference]: Finished difference Result 443 states and 641 transitions. [2024-11-22 05:31:42,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 05:31:42,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 69 [2024-11-22 05:31:42,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:31:42,370 INFO L225 Difference]: With dead ends: 443 [2024-11-22 05:31:42,370 INFO L226 Difference]: Without dead ends: 314 [2024-11-22 05:31:42,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-22 05:31:42,372 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 364 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:31:42,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 759 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:31:42,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-22 05:31:42,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 231. [2024-11-22 05:31:42,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 230 states have (on average 1.4608695652173913) internal successors, (336), 230 states have internal predecessors, (336), 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-22 05:31:42,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 336 transitions. [2024-11-22 05:31:42,380 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 336 transitions. Word has length 69 [2024-11-22 05:31:42,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:31:42,381 INFO L471 AbstractCegarLoop]: Abstraction has 231 states and 336 transitions. [2024-11-22 05:31:42,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-22 05:31:42,381 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 336 transitions. [2024-11-22 05:31:42,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-22 05:31:42,382 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:31:42,382 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:31:42,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 05:31:42,382 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:31:42,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:31:42,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1696516813, now seen corresponding path program 1 times [2024-11-22 05:31:42,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:31:42,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159395282] [2024-11-22 05:31:42,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:31:42,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:31:42,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:31:42,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 05:31:42,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:31:42,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159395282] [2024-11-22 05:31:42,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159395282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:31:42,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:31:42,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 05:31:42,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825677178] [2024-11-22 05:31:42,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:31:42,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 05:31:42,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:31:42,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 05:31:42,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 05:31:42,733 INFO L87 Difference]: Start difference. First operand 231 states and 336 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-22 05:31:42,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:31:42,868 INFO L93 Difference]: Finished difference Result 401 states and 575 transitions. [2024-11-22 05:31:42,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 05:31:42,869 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 69 [2024-11-22 05:31:42,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:31:42,870 INFO L225 Difference]: With dead ends: 401 [2024-11-22 05:31:42,870 INFO L226 Difference]: Without dead ends: 268 [2024-11-22 05:31:42,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-22 05:31:42,871 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 296 mSDsluCounter, 699 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 296 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 05:31:42,871 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [296 Valid, 955 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 05:31:42,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-22 05:31:42,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 229. [2024-11-22 05:31:42,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.4517543859649122) internal successors, (331), 228 states have internal predecessors, (331), 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-22 05:31:42,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 331 transitions. [2024-11-22 05:31:42,877 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 331 transitions. Word has length 69 [2024-11-22 05:31:42,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:31:42,878 INFO L471 AbstractCegarLoop]: Abstraction has 229 states and 331 transitions. [2024-11-22 05:31:42,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-22 05:31:42,878 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 331 transitions. [2024-11-22 05:31:42,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-22 05:31:42,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:31:42,879 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:31:42,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 05:31:42,879 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:31:42,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:31:42,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1079174156, now seen corresponding path program 1 times [2024-11-22 05:31:42,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:31:42,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590910780] [2024-11-22 05:31:42,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:31:42,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:31:42,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:31:43,179 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-22 05:31:43,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:31:43,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590910780] [2024-11-22 05:31:43,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590910780] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:31:43,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:31:43,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 05:31:43,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83246904] [2024-11-22 05:31:43,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:31:43,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 05:31:43,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:31:43,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 05:31:43,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 05:31:43,182 INFO L87 Difference]: Start difference. First operand 229 states and 331 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-22 05:31:43,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:31:43,228 INFO L93 Difference]: Finished difference Result 433 states and 620 transitions. [2024-11-22 05:31:43,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 05:31:43,229 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 69 [2024-11-22 05:31:43,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:31:43,230 INFO L225 Difference]: With dead ends: 433 [2024-11-22 05:31:43,230 INFO L226 Difference]: Without dead ends: 298 [2024-11-22 05:31:43,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-22 05:31:43,231 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 454 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:31:43,231 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 764 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:31:43,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2024-11-22 05:31:43,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 227. [2024-11-22 05:31:43,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4424778761061947) internal successors, (326), 226 states have internal predecessors, (326), 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-22 05:31:43,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 326 transitions. [2024-11-22 05:31:43,237 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 326 transitions. Word has length 69 [2024-11-22 05:31:43,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:31:43,237 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 326 transitions. [2024-11-22 05:31:43,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-22 05:31:43,237 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 326 transitions. [2024-11-22 05:31:43,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-22 05:31:43,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:31:43,238 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:31:43,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 05:31:43,239 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:31:43,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:31:43,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1343504549, now seen corresponding path program 1 times [2024-11-22 05:31:43,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:31:43,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461900560] [2024-11-22 05:31:43,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:31:43,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:31:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:31:43,518 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-22 05:31:43,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:31:43,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461900560] [2024-11-22 05:31:43,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461900560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:31:43,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:31:43,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 05:31:43,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281356733] [2024-11-22 05:31:43,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:31:43,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 05:31:43,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:31:43,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 05:31:43,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 05:31:43,521 INFO L87 Difference]: Start difference. First operand 227 states and 326 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-22 05:31:43,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:31:43,563 INFO L93 Difference]: Finished difference Result 356 states and 512 transitions. [2024-11-22 05:31:43,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 05:31:43,563 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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 69 [2024-11-22 05:31:43,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:31:43,564 INFO L225 Difference]: With dead ends: 356 [2024-11-22 05:31:43,564 INFO L226 Difference]: Without dead ends: 219 [2024-11-22 05:31:43,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 05:31:43,565 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 247 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:31:43,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [247 Valid, 763 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:31:43,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-22 05:31:43,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2024-11-22 05:31:43,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 218 states have (on average 1.4495412844036697) internal successors, (316), 218 states have internal predecessors, (316), 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-22 05:31:43,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 316 transitions. [2024-11-22 05:31:43,570 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 316 transitions. Word has length 69 [2024-11-22 05:31:43,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:31:43,571 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 316 transitions. [2024-11-22 05:31:43,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 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-22 05:31:43,571 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 316 transitions. [2024-11-22 05:31:43,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-22 05:31:43,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:31:43,572 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:31:43,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 05:31:43,572 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:31:43,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:31:43,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2025898208, now seen corresponding path program 1 times [2024-11-22 05:31:43,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:31:43,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042545575] [2024-11-22 05:31:43,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:31:43,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:31:43,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:31:43,875 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-22 05:31:43,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 05:31:43,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042545575] [2024-11-22 05:31:43,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042545575] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:31:43,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:31:43,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 05:31:43,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733224778] [2024-11-22 05:31:43,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:31:43,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 05:31:43,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 05:31:43,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 05:31:43,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-22 05:31:43,878 INFO L87 Difference]: Start difference. First operand 219 states and 316 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-22 05:31:43,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:31:43,925 INFO L93 Difference]: Finished difference Result 387 states and 553 transitions. [2024-11-22 05:31:43,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 05:31:43,926 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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 70 [2024-11-22 05:31:43,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:31:43,927 INFO L225 Difference]: With dead ends: 387 [2024-11-22 05:31:43,927 INFO L226 Difference]: Without dead ends: 258 [2024-11-22 05:31:43,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-22 05:31:43,928 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 334 mSDsluCounter, 504 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 05:31:43,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 760 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 05:31:43,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-22 05:31:43,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 227. [2024-11-22 05:31:43,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 226 states have (on average 1.4380530973451326) internal successors, (325), 226 states have internal predecessors, (325), 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-22 05:31:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 325 transitions. [2024-11-22 05:31:43,933 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 325 transitions. Word has length 70 [2024-11-22 05:31:43,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:31:43,934 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 325 transitions. [2024-11-22 05:31:43,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 states have internal predecessors, (70), 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-22 05:31:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 325 transitions. [2024-11-22 05:31:43,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-22 05:31:43,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:31:43,934 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:31:43,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 05:31:43,935 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:31:43,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:31:43,935 INFO L85 PathProgramCache]: Analyzing trace with hash 2089643758, now seen corresponding path program 1 times [2024-11-22 05:31:43,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 05:31:43,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674430446] [2024-11-22 05:31:43,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:31:43,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 05:31:43,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 05:31:43,973 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 05:31:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 05:31:44,039 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 05:31:44,040 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 05:31:44,041 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 05:31:44,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 05:31:44,045 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 05:31:44,124 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 05:31:44,127 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 05:31:44 BoogieIcfgContainer [2024-11-22 05:31:44,127 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 05:31:44,128 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 05:31:44,128 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 05:31:44,128 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 05:31:44,129 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:31:37" (3/4) ... [2024-11-22 05:31:44,131 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 05:31:44,133 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 05:31:44,133 INFO L158 Benchmark]: Toolchain (without parser) took 8818.84ms. Allocated memory was 157.3MB in the beginning and 285.2MB in the end (delta: 127.9MB). Free memory was 86.6MB in the beginning and 105.0MB in the end (delta: -18.4MB). Peak memory consumption was 111.7MB. Max. memory is 16.1GB. [2024-11-22 05:31:44,133 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 157.3MB. Free memory was 109.7MB in the beginning and 109.6MB in the end (delta: 139.7kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 05:31:44,134 INFO L158 Benchmark]: CACSL2BoogieTranslator took 410.13ms. Allocated memory is still 157.3MB. Free memory was 86.5MB in the beginning and 124.4MB in the end (delta: -37.9MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. [2024-11-22 05:31:44,134 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.73ms. Allocated memory is still 157.3MB. Free memory was 124.4MB in the beginning and 114.8MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-22 05:31:44,134 INFO L158 Benchmark]: Boogie Preprocessor took 138.96ms. Allocated memory is still 157.3MB. Free memory was 114.8MB in the beginning and 108.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 05:31:44,135 INFO L158 Benchmark]: RCFGBuilder took 1241.04ms. Allocated memory was 157.3MB in the beginning and 195.0MB in the end (delta: 37.7MB). Free memory was 107.6MB in the beginning and 146.7MB in the end (delta: -39.1MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2024-11-22 05:31:44,135 INFO L158 Benchmark]: TraceAbstraction took 6919.85ms. Allocated memory was 195.0MB in the beginning and 285.2MB in the end (delta: 90.2MB). Free memory was 145.6MB in the beginning and 105.0MB in the end (delta: 40.6MB). Peak memory consumption was 133.9MB. Max. memory is 16.1GB. [2024-11-22 05:31:44,135 INFO L158 Benchmark]: Witness Printer took 4.62ms. Allocated memory is still 285.2MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 05:31:44,136 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.26ms. Allocated memory is still 157.3MB. Free memory was 109.7MB in the beginning and 109.6MB in the end (delta: 139.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 410.13ms. Allocated memory is still 157.3MB. Free memory was 86.5MB in the beginning and 124.4MB in the end (delta: -37.9MB). Peak memory consumption was 22.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.73ms. Allocated memory is still 157.3MB. Free memory was 124.4MB in the beginning and 114.8MB in the end (delta: 9.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 138.96ms. Allocated memory is still 157.3MB. Free memory was 114.8MB in the beginning and 108.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1241.04ms. Allocated memory was 157.3MB in the beginning and 195.0MB in the end (delta: 37.7MB). Free memory was 107.6MB in the beginning and 146.7MB in the end (delta: -39.1MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * TraceAbstraction took 6919.85ms. Allocated memory was 195.0MB in the beginning and 285.2MB in the end (delta: 90.2MB). Free memory was 145.6MB in the beginning and 105.0MB in the end (delta: 40.6MB). Peak memory consumption was 133.9MB. Max. memory is 16.1GB. * Witness Printer took 4.62ms. Allocated memory is still 285.2MB. Free memory is still 105.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 168. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_3 mask_SORT_3 = (SORT_3)-1 >> (sizeof(SORT_3) * 8 - 32); [L30] const SORT_3 msb_SORT_3 = (SORT_3)1 << (32 - 1); [L32] const SORT_10 mask_SORT_10 = (SORT_10)-1 >> (sizeof(SORT_10) * 8 - 64); [L33] const SORT_10 msb_SORT_10 = (SORT_10)1 << (64 - 1); [L35] const SORT_64 mask_SORT_64 = (SORT_64)-1 >> (sizeof(SORT_64) * 8 - 4); [L36] const SORT_64 msb_SORT_64 = (SORT_64)1 << (4 - 1); [L38] const SORT_66 mask_SORT_66 = (SORT_66)-1 >> (sizeof(SORT_66) * 8 - 60); [L39] const SORT_66 msb_SORT_66 = (SORT_66)1 << (60 - 1); [L41] const SORT_10 var_11 = 0; [L42] const SORT_1 var_14 = 0; [L43] const SORT_3 var_24 = 0; [L44] const SORT_1 var_51 = 1; [L45] const SORT_64 var_65 = 0; [L47] SORT_1 input_2; [L48] SORT_3 input_4; [L49] SORT_3 input_5; [L50] SORT_1 input_6; [L51] SORT_1 input_7; [L52] SORT_1 input_8; [L53] SORT_1 input_9; [L55] EXPR __VERIFIER_nondet_ulong() & mask_SORT_10 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L55] SORT_10 state_12 = __VERIFIER_nondet_ulong() & mask_SORT_10; [L56] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L56] SORT_1 state_15 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L57] EXPR __VERIFIER_nondet_ulong() & mask_SORT_10 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L57] SORT_10 state_18 = __VERIFIER_nondet_ulong() & mask_SORT_10; [L58] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L58] SORT_1 state_20 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L59] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L59] SORT_3 state_25 = __VERIFIER_nondet_uint() & mask_SORT_3; [L60] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L60] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L61] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L61] SORT_3 state_30 = __VERIFIER_nondet_uint() & mask_SORT_3; [L62] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L62] SORT_1 state_32 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L63] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L63] SORT_3 state_37 = __VERIFIER_nondet_uint() & mask_SORT_3; [L64] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L64] SORT_1 state_39 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L65] EXPR __VERIFIER_nondet_uint() & mask_SORT_3 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L65] SORT_3 state_42 = __VERIFIER_nondet_uint() & mask_SORT_3; [L66] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L66] SORT_1 state_44 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L67] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L67] SORT_1 state_69 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L68] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L68] SORT_1 state_74 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L69] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L69] SORT_1 state_87 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L70] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, var_11=0, var_14=0, var_24=0, var_51=1, var_65=0] [L70] SORT_1 state_92 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L72] SORT_10 init_13_arg_1 = var_11; [L73] state_12 = init_13_arg_1 [L74] SORT_1 init_16_arg_1 = var_14; [L75] state_15 = init_16_arg_1 [L76] SORT_10 init_19_arg_1 = var_11; [L77] state_18 = init_19_arg_1 [L78] SORT_1 init_21_arg_1 = var_14; [L79] state_20 = init_21_arg_1 [L80] SORT_3 init_26_arg_1 = var_24; [L81] state_25 = init_26_arg_1 [L82] SORT_1 init_28_arg_1 = var_14; [L83] state_27 = init_28_arg_1 [L84] SORT_3 init_31_arg_1 = var_24; [L85] state_30 = init_31_arg_1 [L86] SORT_1 init_33_arg_1 = var_14; [L87] state_32 = init_33_arg_1 [L88] SORT_3 init_38_arg_1 = var_24; [L89] state_37 = init_38_arg_1 [L90] SORT_1 init_40_arg_1 = var_14; [L91] state_39 = init_40_arg_1 [L92] SORT_3 init_43_arg_1 = var_24; [L93] state_42 = init_43_arg_1 [L94] SORT_1 init_45_arg_1 = var_14; [L95] state_44 = init_45_arg_1 [L96] SORT_1 init_70_arg_1 = var_14; [L97] state_69 = init_70_arg_1 [L98] SORT_1 init_75_arg_1 = var_14; [L99] state_74 = init_75_arg_1 [L100] SORT_1 init_88_arg_1 = var_14; [L101] state_87 = init_88_arg_1 [L102] SORT_1 init_93_arg_1 = var_14; [L103] state_92 = init_93_arg_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L106] input_2 = __VERIFIER_nondet_uchar() [L107] input_4 = __VERIFIER_nondet_uint() [L108] input_5 = __VERIFIER_nondet_uint() [L109] input_6 = __VERIFIER_nondet_uchar() [L110] EXPR input_6 & mask_SORT_1 VAL [mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L110] input_6 = input_6 & mask_SORT_1 [L111] input_7 = __VERIFIER_nondet_uchar() [L112] EXPR input_7 & mask_SORT_1 VAL [input_6=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L112] input_7 = input_7 & mask_SORT_1 [L113] input_8 = __VERIFIER_nondet_uchar() [L114] EXPR input_8 & mask_SORT_1 VAL [input_6=0, input_7=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L114] input_8 = input_8 & mask_SORT_1 [L115] input_9 = __VERIFIER_nondet_uchar() [L116] EXPR input_9 & mask_SORT_1 VAL [input_6=0, input_7=0, input_8=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_12=0, state_15=0, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L116] input_9 = input_9 & mask_SORT_1 [L119] SORT_1 var_17_arg_0 = state_15; [L120] SORT_10 var_17_arg_1 = state_12; [L121] SORT_10 var_17_arg_2 = var_11; [L122] SORT_10 var_17 = var_17_arg_0 ? var_17_arg_1 : var_17_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_17=0, var_24=0, var_51=1, var_65=0] [L123] EXPR var_17 & mask_SORT_10 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_20=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L123] var_17 = var_17 & mask_SORT_10 [L124] SORT_1 var_22_arg_0 = state_20; [L125] SORT_10 var_22_arg_1 = state_18; [L126] SORT_10 var_22_arg_2 = var_11; [L127] SORT_10 var_22 = var_22_arg_0 ? var_22_arg_1 : var_22_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_17=0, var_22=0, var_24=0, var_51=1, var_65=0] [L128] EXPR var_22 & mask_SORT_10 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_27=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_17=0, var_24=0, var_51=1, var_65=0] [L128] var_22 = var_22 & mask_SORT_10 [L129] SORT_10 var_23_arg_0 = var_17; [L130] SORT_10 var_23_arg_1 = var_22; [L131] SORT_1 var_23 = var_23_arg_0 == var_23_arg_1; [L132] SORT_1 var_29_arg_0 = state_27; [L133] SORT_3 var_29_arg_1 = state_25; [L134] SORT_3 var_29_arg_2 = var_24; [L135] SORT_3 var_29 = var_29_arg_0 ? var_29_arg_1 : var_29_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_29=0, var_51=1, var_65=0] [L136] EXPR var_29 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_32=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_51=1, var_65=0] [L136] var_29 = var_29 & mask_SORT_3 [L137] SORT_1 var_34_arg_0 = state_32; [L138] SORT_3 var_34_arg_1 = state_30; [L139] SORT_3 var_34_arg_2 = var_24; [L140] SORT_3 var_34 = var_34_arg_0 ? var_34_arg_1 : var_34_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_29=0, var_34=0, var_51=1, var_65=0] [L141] EXPR var_34 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_23=1, var_24=0, var_29=0, var_51=1, var_65=0] [L141] var_34 = var_34 & mask_SORT_3 [L142] SORT_3 var_35_arg_0 = var_29; [L143] SORT_3 var_35_arg_1 = var_34; [L144] SORT_1 var_35 = var_35_arg_0 == var_35_arg_1; [L145] SORT_1 var_36_arg_0 = var_23; [L146] SORT_1 var_36_arg_1 = var_35; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36_arg_0=1, var_36_arg_1=1, var_51=1, var_65=0] [L147] EXPR var_36_arg_0 & var_36_arg_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_39=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L147] SORT_1 var_36 = var_36_arg_0 & var_36_arg_1; [L148] SORT_1 var_41_arg_0 = state_39; [L149] SORT_3 var_41_arg_1 = state_37; [L150] SORT_3 var_41_arg_2 = var_24; [L151] SORT_3 var_41 = var_41_arg_0 ? var_41_arg_1 : var_41_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_41=0, var_51=1, var_65=0] [L152] EXPR var_41 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_44=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_51=1, var_65=0] [L152] var_41 = var_41 & mask_SORT_3 [L153] SORT_1 var_46_arg_0 = state_44; [L154] SORT_3 var_46_arg_1 = state_42; [L155] SORT_3 var_46_arg_2 = var_24; [L156] SORT_3 var_46 = var_46_arg_0 ? var_46_arg_1 : var_46_arg_2; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_41=0, var_46=0, var_51=1, var_65=0] [L157] EXPR var_46 & mask_SORT_3 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_36=1, var_41=0, var_51=1, var_65=0] [L157] var_46 = var_46 & mask_SORT_3 [L158] SORT_3 var_47_arg_0 = var_41; [L159] SORT_3 var_47_arg_1 = var_46; [L160] SORT_1 var_47 = var_47_arg_0 == var_47_arg_1; [L161] SORT_1 var_48_arg_0 = var_36; [L162] SORT_1 var_48_arg_1 = var_47; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_48_arg_0=1, var_48_arg_1=1, var_51=1, var_65=0] [L163] EXPR var_48_arg_0 & var_48_arg_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L163] SORT_1 var_48 = var_48_arg_0 & var_48_arg_1; [L164] SORT_1 var_52_arg_0 = var_48; [L165] SORT_1 var_52 = ~var_52_arg_0; [L166] SORT_1 var_53_arg_0 = var_51; [L167] SORT_1 var_53_arg_1 = var_52; VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_53_arg_0=1, var_53_arg_1=-2, var_65=0] [L168] EXPR var_53_arg_0 & var_53_arg_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L168] SORT_1 var_53 = var_53_arg_0 & var_53_arg_1; [L169] EXPR var_53 & mask_SORT_1 VAL [input_6=0, input_7=0, input_8=0, input_9=0, mask_SORT_10=-1, mask_SORT_1=1, mask_SORT_3=-1, mask_SORT_66=1152921504606846975, state_18=0, state_25=0, state_30=0, state_37=0, state_42=0, state_69=0, state_74=0, state_87=0, state_92=0, var_11=0, var_24=0, var_51=1, var_65=0] [L169] var_53 = var_53 & mask_SORT_1 [L170] SORT_1 bad_54_arg_0 = var_53; [L171] CALL __VERIFIER_assert(!(bad_54_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 182 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.8s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2166 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2166 mSDsluCounter, 11092 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8265 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 540 IncrementalHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 2827 mSDtfsCounter, 540 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 91 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=231occurred in iteration=7, InterpolantAutomatonStates: 66, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 255 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 820 NumberOfCodeBlocks, 820 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 739 ConstructedInterpolants, 0 QuantifiedInterpolants, 1982 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 05:31:44,162 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 05:31:46,510 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 05:31:46,599 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-22 05:31:46,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 05:31:46,610 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 05:31:46,643 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 05:31:46,643 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 05:31:46,644 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 05:31:46,646 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 05:31:46,648 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 05:31:46,648 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 05:31:46,648 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 05:31:46,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 05:31:46,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 05:31:46,650 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 05:31:46,653 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 05:31:46,653 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 05:31:46,654 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 05:31:46,654 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 05:31:46,654 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 05:31:46,654 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 05:31:46,655 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 05:31:46,655 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 05:31:46,655 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 05:31:46,656 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 05:31:46,656 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 05:31:46,657 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 05:31:46,658 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 05:31:46,658 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 05:31:46,658 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 05:31:46,659 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 05:31:46,659 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:31:46,660 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 05:31:46,660 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 05:31:46,661 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 05:31:46,661 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 05:31:46,662 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 05:31:46,662 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 05:31:46,662 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 05:31:46,662 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 05:31:46,663 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 05:31:46,663 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a17878a5128bf705eaf3e8cc839ad0f7d5b7dcfdf1e66ee241171f7fff28965b [2024-11-22 05:31:47,020 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 05:31:47,048 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 05:31:47,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 05:31:47,053 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 05:31:47,053 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 05:31:47,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2024-11-22 05:31:48,562 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 05:31:48,798 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 05:31:48,799 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c [2024-11-22 05:31:48,808 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/055f2270c/9822c0e596b14fa3be5c3d5ff949943f/FLAG4d4412c1b [2024-11-22 05:31:48,820 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/055f2270c/9822c0e596b14fa3be5c3d5ff949943f [2024-11-22 05:31:48,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 05:31:48,829 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 05:31:48,830 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 05:31:48,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 05:31:48,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 05:31:48,837 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:31:48" (1/1) ... [2024-11-22 05:31:48,838 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5725d4c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:48, skipping insertion in model container [2024-11-22 05:31:48,840 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 05:31:48" (1/1) ... [2024-11-22 05:31:48,879 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 05:31:49,071 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2024-11-22 05:31:49,169 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:31:49,188 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 05:31:49,205 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul4.c[1244,1257] [2024-11-22 05:31:49,264 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 05:31:49,288 INFO L204 MainTranslator]: Completed translation [2024-11-22 05:31:49,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:49 WrapperNode [2024-11-22 05:31:49,289 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 05:31:49,302 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 05:31:49,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 05:31:49,303 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 05:31:49,310 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:49" (1/1) ... [2024-11-22 05:31:49,327 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:49" (1/1) ... [2024-11-22 05:31:49,370 INFO L138 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 299 [2024-11-22 05:31:49,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 05:31:49,375 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 05:31:49,378 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 05:31:49,378 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 05:31:49,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:49" (1/1) ... [2024-11-22 05:31:49,388 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:49" (1/1) ... [2024-11-22 05:31:49,395 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:49" (1/1) ... [2024-11-22 05:31:49,416 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-22 05:31:49,418 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:49" (1/1) ... [2024-11-22 05:31:49,419 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:49" (1/1) ... [2024-11-22 05:31:49,430 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:49" (1/1) ... [2024-11-22 05:31:49,437 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:49" (1/1) ... [2024-11-22 05:31:49,442 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:49" (1/1) ... [2024-11-22 05:31:49,444 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:49" (1/1) ... [2024-11-22 05:31:49,452 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 05:31:49,455 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 05:31:49,456 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 05:31:49,456 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 05:31:49,457 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:49" (1/1) ... [2024-11-22 05:31:49,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 05:31:49,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 05:31:49,487 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-22 05:31:49,490 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-22 05:31:49,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 05:31:49,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 05:31:49,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 05:31:49,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 05:31:49,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 05:31:49,636 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 05:31:49,639 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 05:31:50,080 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2024-11-22 05:31:50,082 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 05:31:50,093 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 05:31:50,094 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 05:31:50,095 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:31:50 BoogieIcfgContainer [2024-11-22 05:31:50,095 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 05:31:50,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 05:31:50,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 05:31:50,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 05:31:50,100 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 05:31:48" (1/3) ... [2024-11-22 05:31:50,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@146a7a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:31:50, skipping insertion in model container [2024-11-22 05:31:50,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 05:31:49" (2/3) ... [2024-11-22 05:31:50,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@146a7a1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 05:31:50, skipping insertion in model container [2024-11-22 05:31:50,103 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 05:31:50" (3/3) ... [2024-11-22 05:31:50,104 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul4.c [2024-11-22 05:31:50,120 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 05:31:50,120 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 05:31:50,188 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 05:31:50,195 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;@1b842aac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 05:31:50,195 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 05:31:50,200 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-22 05:31:50,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 05:31:50,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:31:50,207 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 05:31:50,207 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:31:50,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:31:50,213 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-22 05:31:50,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 05:31:50,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1331054834] [2024-11-22 05:31:50,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:31:50,230 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:31:50,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 05:31:50,233 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 05:31:50,235 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 05:31:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:31:50,442 INFO L255 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-22 05:31:50,460 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:31:51,054 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-22 05:31:51,055 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 05:31:51,055 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 05:31:51,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1331054834] [2024-11-22 05:31:51,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1331054834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 05:31:51,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 05:31:51,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 05:31:51,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116598823] [2024-11-22 05:31:51,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 05:31:51,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 05:31:51,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 05:31:51,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 05:31:51,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:31:51,091 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:31:51,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:31:51,333 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-22 05:31:51,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 05:31:51,336 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-22 05:31:51,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:31:51,341 INFO L225 Difference]: With dead ends: 17 [2024-11-22 05:31:51,341 INFO L226 Difference]: Without dead ends: 9 [2024-11-22 05:31:51,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 05:31:51,346 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 05:31:51,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 05:31:51,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-22 05:31:51,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-22 05:31:51,371 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-22 05:31:51,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-22 05:31:51,372 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-22 05:31:51,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:31:51,373 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-22 05:31:51,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 05:31:51,374 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-22 05:31:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 05:31:51,374 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:31:51,374 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-22 05:31:51,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 05:31:51,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:31:51,576 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:31:51,577 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:31:51,577 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-22 05:31:51,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 05:31:51,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361732222] [2024-11-22 05:31:51,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 05:31:51,578 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:31:51,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 05:31:51,582 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 05:31:51,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 05:31:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 05:31:51,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-22 05:31:51,927 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:31:53,606 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-22 05:31:53,606 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 05:32:16,380 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|)) (.cse35 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_74~0#1|))) (let ((.cse30 (and (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 64))) (not (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|)))) (not .cse35))) (.cse31 (forall ((|v_ULTIMATE.start_main_~var_53_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_0~0#1_10|))))))))) (.cse36 (forall ((|v_ULTIMATE.start_main_~var_53_arg_0~0#1_10| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_53_arg_0~0#1_10|))))))))) (.cse33 (and (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| (_ BitVec 64))) (not (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|)))) .cse35))) (let ((.cse32 (or .cse36 .cse33)) (.cse34 (or (and (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| (_ BitVec 64))) (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_22_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|))) .cse35) .cse31)) (.cse25 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_9~0#1|)) (.cse28 (or .cse36 .cse30)) (.cse29 (or .cse31 (forall ((|ULTIMATE.start_main_~mask_SORT_10~0#1| (_ BitVec 64)) (|v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| (_ BitVec 64))) (= (bvand |c_ULTIMATE.start_main_~var_11~0#1| |ULTIMATE.start_main_~mask_SORT_10~0#1|) (bvand |v_ULTIMATE.start_main_~var_17_arg_1~0#1_10| |ULTIMATE.start_main_~mask_SORT_10~0#1|))) .cse35))) (let ((.cse27 (and .cse28 .cse29)) (.cse17 (not .cse25)) (.cse26 (and .cse32 .cse34)) (.cse22 (and .cse32 (or .cse31 .cse33) .cse34)) (.cse18 (and .cse28 .cse29 (or .cse30 .cse31)))) (let ((.cse10 (= (_ bv0 8) |c_ULTIMATE.start_main_~input_8~0#1|)) (.cse19 (or .cse25 .cse18)) (.cse21 (or .cse25 .cse22)) (.cse24 (or .cse17 .cse26)) (.cse23 (or .cse17 .cse27))) (let ((.cse0 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_92~0#1|)) (.cse11 (and .cse23 (or .cse25 .cse27))) (.cse16 (and .cse24 (or .cse25 .cse26))) (.cse14 (and .cse21 .cse24)) (.cse13 (and .cse23 .cse19)) (.cse20 (not .cse10))) (let ((.cse3 (or .cse13 .cse20)) (.cse2 (or .cse14 .cse20)) (.cse6 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_9~0#1|)) (.cse9 ((_ zero_extend 24) |c_ULTIMATE.start_main_~input_8~0#1|)) (.cse1 (or .cse10 (and .cse21 (or .cse17 .cse22)))) (.cse15 (or .cse16 .cse20)) (.cse12 (or .cse11 .cse20)) (.cse4 (or .cse10 (and (or .cse17 .cse18) .cse19))) (.cse5 (not .cse0))) (and (or (and (or .cse0 (and .cse1 .cse2)) (or (and .cse3 .cse4) .cse5)) (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (let ((.cse7 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|)))))) (or (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse6 .cse7))) .cse8)))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse7 .cse9))))))))))) (or (and (or .cse10 .cse11) .cse12) .cse5) (or (and (or (and (or .cse10 .cse13) .cse3) .cse5) (or (and .cse2 (or .cse10 .cse14)) .cse0)) (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse6 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|))))))) .cse8)))))) (or .cse0 (and .cse15 (or .cse10 .cse16))) (or (forall ((|ULTIMATE.start_main_~input_6~0#1| (_ BitVec 8)) (|ULTIMATE.start_main_~input_7~0#1| (_ BitVec 8))) (not (= (_ bv0 8) ((_ extract 7 0) (bvand .cse8 ((_ zero_extend 24) ((_ extract 7 0) (bvor ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~input_6~0#1|) ((_ zero_extend 24) |ULTIMATE.start_main_~input_7~0#1|)))) .cse9)))))))) (and (or (and .cse1 .cse15) .cse0) (or (and .cse12 .cse4) .cse5))))))))))) is different from false [2024-11-22 05:32:20,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-22 05:32:20,961 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 05:32:20,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361732222] [2024-11-22 05:32:20,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361732222] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 05:32:20,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 05:32:20,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-22 05:32:20,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632394667] [2024-11-22 05:32:20,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 05:32:20,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 05:32:20,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 05:32:20,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 05:32:20,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=53, Unknown=1, NotChecked=14, Total=90 [2024-11-22 05:32:20,965 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-22 05:32:21,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 05:32:21,865 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-22 05:32:21,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 05:32:21,866 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-22 05:32:21,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 05:32:21,866 INFO L225 Difference]: With dead ends: 14 [2024-11-22 05:32:21,866 INFO L226 Difference]: Without dead ends: 12 [2024-11-22 05:32:21,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=35, Invalid=78, Unknown=1, NotChecked=18, Total=132 [2024-11-22 05:32:21,868 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 05:32:21,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 6 Unchecked, 0.5s Time] [2024-11-22 05:32:21,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-22 05:32:21,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-22 05:32:21,872 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-22 05:32:21,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-22 05:32:21,872 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-22 05:32:21,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 05:32:21,873 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-22 05:32:21,873 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-22 05:32:21,873 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-22 05:32:21,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-22 05:32:21,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 05:32:21,874 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-22 05:32:21,881 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-22 05:32:22,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:32:22,075 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 05:32:22,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 05:32:22,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-22 05:32:22,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 05:32:22,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838633950] [2024-11-22 05:32:22,076 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 05:32:22,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 05:32:22,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 05:32:22,080 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 05:32:22,081 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 05:32:22,464 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 05:32:22,464 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 05:32:22,483 INFO L255 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 76 conjuncts are in the unsatisfiable core [2024-11-22 05:32:22,492 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 05:32:43,076 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~mask_SORT_1~0#1| (_ bv1 8)) (= (_ bv0 64) |c_ULTIMATE.start_main_~var_11~0#1|) (= |c_ULTIMATE.start_main_~state_27~0#1| |c_ULTIMATE.start_main_~state_32~0#1|) (exists ((|v_ULTIMATE.start_main_#t~nondet25#1_17| (_ BitVec 8))) (= ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet25#1_17|))) |c_ULTIMATE.start_main_~state_32~0#1|)) (exists ((|v_ULTIMATE.start_main_#t~nondet26#1_17| (_ BitVec 8))) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet26#1_17|) (_ bv1 32))) |c_ULTIMATE.start_main_~state_39~0#1|)) (= (_ bv0 32) |c_ULTIMATE.start_main_~var_24~0#1|) (= |c_ULTIMATE.start_main_~state_39~0#1| |c_ULTIMATE.start_main_~state_44~0#1|) (let ((.cse1 (= (_ bv0 8) |c_ULTIMATE.start_main_~state_20~0#1|)) (.cse21 ((_ zero_extend 32) (bvand |c_ULTIMATE.start_main_~state_30~0#1| (_ bv4294967295 32)))) (.cse2 ((_ zero_extend 32) (bvand |c_ULTIMATE.start_main_~state_42~0#1| (_ bv4294967295 32))))) (let ((.cse16 (= |c_ULTIMATE.start_main_~state_37~0#1| |c_ULTIMATE.start_main_~state_42~0#1|)) (.cse17 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)))) |c_ULTIMATE.start_main_~state_12~0#1|))) (.cse14 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_39~0#1|)) (.cse13 ((_ zero_extend 24) |c_ULTIMATE.start_main_~state_32~0#1|)) (.cse7 (exists ((|v_ULTIMATE.start_main_#t~nondet23#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_9~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_8~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet24#1_16| (_ BitVec 8))) (let ((.cse40 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet23#1_16|) (_ bv1 32)))) (.cse39 ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet24#1_16|))))) (let ((.cse41 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) .cse40) ((_ zero_extend 24) .cse39)))))) (and (= |c_ULTIMATE.start_main_~state_20~0#1| .cse39) (not (= (_ bv0 8) .cse40)) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse41 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_8~0#1_11|)))) (_ bv1 32))) (_ bv0 8)) (= |c_ULTIMATE.start_main_~state_15~0#1| .cse39) (not (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse41 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_9~0#1_11|))))))))))))) (.cse8 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|))) (.cse22 (exists ((|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= |c_ULTIMATE.start_main_~state_12~0#1| (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32))) .cse21) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|))))) (.cse6 (exists ((|v_ULTIMATE.start_main_#t~nondet23#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_9~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_8~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet24#1_16| (_ BitVec 8))) (let ((.cse38 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet23#1_16|) (_ bv1 32)))) (.cse36 ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet24#1_16|))))) (let ((.cse37 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) .cse38) ((_ zero_extend 24) .cse36)))))) (and (= |c_ULTIMATE.start_main_~state_20~0#1| .cse36) (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse37 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_9~0#1_11|))))))) (not (= (_ bv0 8) .cse38)) (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse37 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_8~0#1_11|)))) (_ bv1 32))) (_ bv0 8))) (= |c_ULTIMATE.start_main_~state_15~0#1| .cse36)))))) (.cse0 (exists ((|v_ULTIMATE.start_main_#t~nondet23#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_9~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_8~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet24#1_16| (_ BitVec 8))) (let ((.cse34 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet23#1_16|) (_ bv1 32)))) (.cse33 ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet24#1_16|))))) (let ((.cse35 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) .cse34) ((_ zero_extend 24) .cse33)))))) (and (= |c_ULTIMATE.start_main_~state_20~0#1| .cse33) (not (= (_ bv0 8) .cse34)) (not (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse35 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_8~0#1_11|)))) (_ bv1 32))) (_ bv0 8))) (= |c_ULTIMATE.start_main_~state_15~0#1| .cse33) (not (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse35 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_9~0#1_11|))))))))))))) (.cse10 (exists ((|v_ULTIMATE.start_main_#t~nondet23#1_16| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_9~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_8~0#1_11| (_ BitVec 8)) (|v_ULTIMATE.start_main_#t~nondet24#1_16| (_ BitVec 8))) (let ((.cse32 ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet23#1_16|) (_ bv1 32)))) (.cse30 ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet24#1_16|))))) (let ((.cse31 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) .cse32) ((_ zero_extend 24) .cse30)))))) (and (= |c_ULTIMATE.start_main_~state_20~0#1| .cse30) (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse31 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_9~0#1_11|))))))) (not (= (_ bv0 8) .cse32)) (= ((_ extract 7 0) (bvand ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse31 ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_8~0#1_11|)))) (_ bv1 32))) (_ bv0 8)) (= |c_ULTIMATE.start_main_~state_15~0#1| .cse30)))))) (.cse9 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|))) (.cse11 (and (exists ((|v_ULTIMATE.start_main_#t~nondet24#1_16| (_ BitVec 8))) (let ((.cse29 ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_#t~nondet24#1_16|))))) (and (= |c_ULTIMATE.start_main_~state_20~0#1| .cse29) (= |c_ULTIMATE.start_main_~state_15~0#1| .cse29)))) (= (_ bv0 64) |c_ULTIMATE.start_main_~state_12~0#1|) (or .cse1 (= (_ bv0 64) |c_ULTIMATE.start_main_~state_18~0#1|))))) (or (and (let ((.cse5 (exists ((|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32))) ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|)))) (or (and (or (and .cse0 (or (and .cse1 (exists ((|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= |c_ULTIMATE.start_main_~state_12~0#1| (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|))))) (exists ((|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse3 (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)))) (and (= |c_ULTIMATE.start_main_~state_18~0#1| .cse3) (= |c_ULTIMATE.start_main_~state_12~0#1| .cse3)))))) (and (or (exists ((|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse4 ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)))) (and (= |c_ULTIMATE.start_main_~state_18~0#1| (bvor (_ bv0 64) (bvand (bvlshr (bvmul .cse4 .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|))) (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32))) .cse4) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|)))) .cse5) .cse6) (and .cse7 (or (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|) (= |c_ULTIMATE.start_main_~state_18~0#1| (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|))))) .cse8)) (and (or .cse9 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= |c_ULTIMATE.start_main_~state_18~0#1| (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|))) (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|)))) .cse10) .cse11) (exists ((|v_ULTIMATE.start_main_~input_7~0#1_12| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_6~0#1_12| (_ BitVec 8))) (let ((.cse12 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_7~0#1_12|) ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_6~0#1_12|)))))) (and (not (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse12 .cse13))))))) (= ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse12 .cse14))))) (_ bv0 8)))))) (and (exists ((|v_ULTIMATE.start_main_~input_7~0#1_12| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_6~0#1_12| (_ BitVec 8))) (let ((.cse15 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_7~0#1_12|) ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_6~0#1_12|)))))) (and (not (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse15 .cse13))))))) (not (= ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse15 .cse14))))) (_ bv0 8)))))) .cse16 (or (and .cse7 (or .cse17 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse18 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32))))) (and (= (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) .cse18) (_ bv2 64)))) |c_ULTIMATE.start_main_~state_12~0#1|) (= (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) .cse18) (_ bv2 64)))) |c_ULTIMATE.start_main_~state_18~0#1|)))))) (and .cse6 (or .cse5 (exists ((|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse19 ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)))) (and (= (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul .cse19 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)))) |c_ULTIMATE.start_main_~state_18~0#1|) (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32))) .cse19) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|)))))) (and (or .cse9 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|) (= (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)))) |c_ULTIMATE.start_main_~state_18~0#1|)))) .cse10) .cse11 (and (or (exists ((|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse20 (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)))))) (and (= .cse20 |c_ULTIMATE.start_main_~state_12~0#1|) (= .cse20 |c_ULTIMATE.start_main_~state_18~0#1|)))) (and .cse1 (exists ((|v_ULTIMATE.start_main_~state_30~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul ((_ zero_extend 32) (bvand (_ bv4294967295 32) |v_ULTIMATE.start_main_~state_30~0#1_12|)) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)))) |c_ULTIMATE.start_main_~state_12~0#1|)))) .cse0))))) (= |c_ULTIMATE.start_main_~state_30~0#1| |c_ULTIMATE.start_main_~state_25~0#1|)) (and .cse16 (or (and (or (exists ((|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= |c_ULTIMATE.start_main_~state_18~0#1| (bvor (bvand (bvlshr (bvmul .cse21 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|) (_ bv0 64))) (= |c_ULTIMATE.start_main_~state_12~0#1| (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32))) .cse21) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|))))) .cse22) .cse6) (and .cse10 (or (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= |c_ULTIMATE.start_main_~state_18~0#1| (bvor (bvand (bvlshr (bvmul .cse21 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|) (_ bv0 64))) (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|))) .cse9)) (and .cse0 (or (and .cse1 (exists ((|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= |c_ULTIMATE.start_main_~state_12~0#1| (bvor (bvand (bvlshr (bvmul .cse21 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|) (_ bv0 64))))) (exists ((|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse23 (bvor (bvand (bvlshr (bvmul .cse21 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|) (_ bv0 64)))) (and (= |c_ULTIMATE.start_main_~state_18~0#1| .cse23) (= |c_ULTIMATE.start_main_~state_12~0#1| .cse23)))))) (and .cse7 (or .cse17 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_42~0#1_12| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse24 ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_42~0#1_12| (_ bv4294967295 32))))) (and (= (bvor (_ bv0 64) (bvand |ULTIMATE.start_main_~mask_SORT_66~0#1| (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) .cse24) (_ bv2 64)))) |c_ULTIMATE.start_main_~state_12~0#1|) (= |c_ULTIMATE.start_main_~state_18~0#1| (bvor (bvand (bvlshr (bvmul .cse21 .cse24) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|) (_ bv0 64)))))))) .cse11) (exists ((|v_ULTIMATE.start_main_~input_7~0#1_12| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_6~0#1_12| (_ BitVec 8))) (let ((.cse25 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_7~0#1_12|) ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_6~0#1_12|)))))) (and (not (= ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse25 .cse14))))) (_ bv0 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse25 .cse13)))))))))) (and (exists ((|v_ULTIMATE.start_main_~input_7~0#1_12| (_ BitVec 8)) (|v_ULTIMATE.start_main_~input_6~0#1_12| (_ BitVec 8))) (let ((.cse26 ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_7~0#1_12|) ((_ zero_extend 24) |v_ULTIMATE.start_main_~input_6~0#1_12|)))))) (and (= ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse26 .cse14))))) (_ bv0 8)) (= (_ bv0 8) ((_ extract 7 0) (bvand (_ bv1 32) ((_ zero_extend 24) ((_ extract 7 0) (bvor .cse26 .cse13))))))))) (let ((.cse27 (bvlshr (bvmul .cse21 .cse2) (_ bv2 64)))) (or (and .cse7 (or .cse8 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) .cse2) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|) (= (bvor (_ bv0 64) (bvand .cse27 |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_18~0#1|))))) (and (or (exists ((|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= |c_ULTIMATE.start_main_~state_12~0#1| (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32))) .cse21) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|))) (= (bvor (_ bv0 64) (bvand .cse27 |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_18~0#1|))) .cse22) .cse6) (and .cse0 (or (exists ((|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (let ((.cse28 (bvor (_ bv0 64) (bvand .cse27 |ULTIMATE.start_main_~mask_SORT_66~0#1|)))) (and (= .cse28 |c_ULTIMATE.start_main_~state_12~0#1|) (= .cse28 |c_ULTIMATE.start_main_~state_18~0#1|)))) (and .cse1 (exists ((|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (= (bvor (_ bv0 64) (bvand .cse27 |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|))))) (and .cse10 (or .cse9 (exists ((|v_ULTIMATE.start_main_~state_25~0#1_10| (_ BitVec 32)) (|v_ULTIMATE.start_main_~state_37~0#1_10| (_ BitVec 32)) (|ULTIMATE.start_main_~mask_SORT_66~0#1| (_ BitVec 64))) (and (= (bvor (_ bv0 64) (bvand (bvlshr (bvmul ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_25~0#1_10| (_ bv4294967295 32))) ((_ zero_extend 32) (bvand |v_ULTIMATE.start_main_~state_37~0#1_10| (_ bv4294967295 32)))) (_ bv2 64)) |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_12~0#1|) (= (bvor (_ bv0 64) (bvand .cse27 |ULTIMATE.start_main_~mask_SORT_66~0#1|)) |c_ULTIMATE.start_main_~state_18~0#1|))))) .cse11)))))) (= (_ bv0 32) (bvadd |c_ULTIMATE.start_main_~mask_SORT_3~0#1| (_ bv1 32)))) is different from false