./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-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 32bit --witnessprinter.graph.data.programhash 707a62cdbfecf08d6cd7391f672114e8110bcee31b0927d7d5b0c17b9e69700b --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 07:44:06,967 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 07:44:07,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 07:44:07,029 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 07:44:07,029 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 07:44:07,051 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 07:44:07,051 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 07:44:07,052 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 07:44:07,052 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 07:44:07,053 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 07:44:07,053 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 07:44:07,055 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 07:44:07,056 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 07:44:07,059 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 07:44:07,060 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 07:44:07,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 07:44:07,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 07:44:07,060 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 07:44:07,060 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 07:44:07,061 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 07:44:07,061 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 07:44:07,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 07:44:07,062 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 07:44:07,062 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 07:44:07,062 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 07:44:07,062 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 07:44:07,062 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 07:44:07,063 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 07:44:07,063 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 07:44:07,063 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 07:44:07,063 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 07:44:07,064 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 07:44:07,064 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 07:44:07,064 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 07:44:07,064 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 07:44:07,064 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 07:44:07,067 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 07:44:07,067 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 07:44:07,068 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 07:44:07,068 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 07:44:07,068 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 07:44:07,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 07:44:07,069 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 707a62cdbfecf08d6cd7391f672114e8110bcee31b0927d7d5b0c17b9e69700b [2024-11-22 07:44:07,300 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 07:44:07,326 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 07:44:07,328 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 07:44:07,329 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 07:44:07,329 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 07:44:07,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i [2024-11-22 07:44:08,589 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 07:44:08,793 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 07:44:08,793 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i [2024-11-22 07:44:08,812 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca03cb99f/eb5917c9aba44ce0b1b2629e01ea854d/FLAGd603c1570 [2024-11-22 07:44:08,825 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca03cb99f/eb5917c9aba44ce0b1b2629e01ea854d [2024-11-22 07:44:08,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 07:44:08,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 07:44:08,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 07:44:08,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 07:44:08,836 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 07:44:08,836 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:44:08" (1/1) ... [2024-11-22 07:44:08,837 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13f59079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:44:08, skipping insertion in model container [2024-11-22 07:44:08,837 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 07:44:08" (1/1) ... [2024-11-22 07:44:08,888 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 07:44:09,037 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i[916,929] [2024-11-22 07:44:09,218 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 07:44:09,239 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 07:44:09,251 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/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-44.i[916,929] [2024-11-22 07:44:09,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 07:44:09,362 INFO L204 MainTranslator]: Completed translation [2024-11-22 07:44:09,363 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:44:09 WrapperNode [2024-11-22 07:44:09,363 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 07:44:09,364 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 07:44:09,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 07:44:09,365 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 07:44:09,370 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:44:09" (1/1) ... [2024-11-22 07:44:09,395 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:44:09" (1/1) ... [2024-11-22 07:44:09,480 INFO L138 Inliner]: procedures = 26, calls = 123, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 806 [2024-11-22 07:44:09,481 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 07:44:09,482 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 07:44:09,482 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 07:44:09,482 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 07:44:09,492 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:44:09" (1/1) ... [2024-11-22 07:44:09,492 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:44:09" (1/1) ... [2024-11-22 07:44:09,505 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:44:09" (1/1) ... [2024-11-22 07:44:09,549 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-22 07:44:09,550 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:44:09" (1/1) ... [2024-11-22 07:44:09,550 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:44:09" (1/1) ... [2024-11-22 07:44:09,578 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:44:09" (1/1) ... [2024-11-22 07:44:09,587 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:44:09" (1/1) ... [2024-11-22 07:44:09,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:44:09" (1/1) ... [2024-11-22 07:44:09,606 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:44:09" (1/1) ... [2024-11-22 07:44:09,618 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 07:44:09,620 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 07:44:09,620 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 07:44:09,620 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 07:44:09,621 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:44:09" (1/1) ... [2024-11-22 07:44:09,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 07:44:09,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:44:09,651 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 07:44:09,653 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 07:44:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 07:44:09,696 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 07:44:09,697 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 07:44:09,697 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 07:44:09,698 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 07:44:09,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 07:44:09,829 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 07:44:09,831 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 07:44:10,787 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2024-11-22 07:44:10,788 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 07:44:10,808 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 07:44:10,812 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 07:44:10,812 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:44:10 BoogieIcfgContainer [2024-11-22 07:44:10,812 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 07:44:10,814 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 07:44:10,814 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 07:44:10,817 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 07:44:10,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 07:44:08" (1/3) ... [2024-11-22 07:44:10,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b6d0fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:44:10, skipping insertion in model container [2024-11-22 07:44:10,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 07:44:09" (2/3) ... [2024-11-22 07:44:10,819 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b6d0fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 07:44:10, skipping insertion in model container [2024-11-22 07:44:10,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 07:44:10" (3/3) ... [2024-11-22 07:44:10,820 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-44.i [2024-11-22 07:44:10,832 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 07:44:10,833 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 07:44:10,900 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 07:44:10,906 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;@45553bb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 07:44:10,906 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 07:44:10,912 INFO L276 IsEmpty]: Start isEmpty. Operand has 334 states, 221 states have (on average 1.5701357466063348) internal successors, (347), 222 states have internal predecessors, (347), 110 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-22 07:44:10,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 706 [2024-11-22 07:44:10,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:44:10,941 INFO L215 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:44:10,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:44:10,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:44:10,948 INFO L85 PathProgramCache]: Analyzing trace with hash -253850497, now seen corresponding path program 1 times [2024-11-22 07:44:10,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:44:10,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044011435] [2024-11-22 07:44:10,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:10,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:44:11,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 218 refuted. 0 times theorem prover too weak. 23762 trivial. 0 not checked. [2024-11-22 07:44:11,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:44:11,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044011435] [2024-11-22 07:44:11,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044011435] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:44:11,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [920592818] [2024-11-22 07:44:11,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:11,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:44:11,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:44:11,599 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 07:44:11,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 07:44:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:11,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 1606 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 07:44:11,989 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:44:12,054 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 218 proven. 0 refuted. 0 times theorem prover too weak. 23762 trivial. 0 not checked. [2024-11-22 07:44:12,054 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 07:44:12,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [920592818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:44:12,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 07:44:12,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 07:44:12,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776877663] [2024-11-22 07:44:12,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:44:12,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 07:44:12,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:44:12,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 07:44:12,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 07:44:12,084 INFO L87 Difference]: Start difference. First operand has 334 states, 221 states have (on average 1.5701357466063348) internal successors, (347), 222 states have internal predecessors, (347), 110 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) Second operand has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (110), 2 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 2 states have call successors, (110) [2024-11-22 07:44:12,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:44:12,135 INFO L93 Difference]: Finished difference Result 661 states and 1238 transitions. [2024-11-22 07:44:12,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 07:44:12,137 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (110), 2 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 2 states have call successors, (110) Word has length 705 [2024-11-22 07:44:12,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:44:12,145 INFO L225 Difference]: With dead ends: 661 [2024-11-22 07:44:12,145 INFO L226 Difference]: Without dead ends: 330 [2024-11-22 07:44:12,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 706 GetRequests, 706 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 07:44:12,153 INFO L432 NwaCegarLoop]: 558 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 07:44:12,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 07:44:12,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2024-11-22 07:44:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2024-11-22 07:44:12,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 218 states have (on average 1.5504587155963303) internal successors, (338), 218 states have internal predecessors, (338), 110 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 110 states have call predecessors, (110), 110 states have call successors, (110) [2024-11-22 07:44:12,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 558 transitions. [2024-11-22 07:44:12,229 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 558 transitions. Word has length 705 [2024-11-22 07:44:12,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:44:12,230 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 558 transitions. [2024-11-22 07:44:12,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 80.0) internal successors, (160), 2 states have internal predecessors, (160), 2 states have call successors, (110), 2 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 2 states have call successors, (110) [2024-11-22 07:44:12,230 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 558 transitions. [2024-11-22 07:44:12,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2024-11-22 07:44:12,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:44:12,247 INFO L215 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:44:12,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-22 07:44:12,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 07:44:12,448 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:44:12,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:44:12,449 INFO L85 PathProgramCache]: Analyzing trace with hash 12451270, now seen corresponding path program 1 times [2024-11-22 07:44:12,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:44:12,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967819101] [2024-11-22 07:44:12,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:12,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:44:12,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:13,567 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2024-11-22 07:44:13,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:44:13,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967819101] [2024-11-22 07:44:13,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967819101] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:44:13,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1431351772] [2024-11-22 07:44:13,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:13,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:44:13,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:44:13,571 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 07:44:13,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 07:44:13,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:13,914 INFO L255 TraceCheckSpWp]: Trace formula consists of 1610 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 07:44:13,925 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:44:14,019 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2024-11-22 07:44:14,019 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 07:44:14,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1431351772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:44:14,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 07:44:14,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2024-11-22 07:44:14,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602506327] [2024-11-22 07:44:14,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:44:14,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 07:44:14,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:44:14,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 07:44:14,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 07:44:14,023 INFO L87 Difference]: Start difference. First operand 330 states and 558 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-11-22 07:44:14,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:44:14,110 INFO L93 Difference]: Finished difference Result 829 states and 1406 transitions. [2024-11-22 07:44:14,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 07:44:14,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 706 [2024-11-22 07:44:14,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:44:14,121 INFO L225 Difference]: With dead ends: 829 [2024-11-22 07:44:14,121 INFO L226 Difference]: Without dead ends: 502 [2024-11-22 07:44:14,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 712 GetRequests, 707 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-22 07:44:14,126 INFO L432 NwaCegarLoop]: 707 mSDtfsCounter, 281 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 07:44:14,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 1240 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 07:44:14,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2024-11-22 07:44:14,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 499. [2024-11-22 07:44:14,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 499 states, 353 states have (on average 1.5920679886685551) internal successors, (562), 354 states have internal predecessors, (562), 143 states have call successors, (143), 2 states have call predecessors, (143), 2 states have return successors, (143), 142 states have call predecessors, (143), 143 states have call successors, (143) [2024-11-22 07:44:14,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 848 transitions. [2024-11-22 07:44:14,191 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 848 transitions. Word has length 706 [2024-11-22 07:44:14,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:44:14,193 INFO L471 AbstractCegarLoop]: Abstraction has 499 states and 848 transitions. [2024-11-22 07:44:14,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-11-22 07:44:14,193 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 848 transitions. [2024-11-22 07:44:14,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2024-11-22 07:44:14,198 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:44:14,198 INFO L215 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:44:14,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 07:44:14,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-22 07:44:14,404 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:44:14,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:44:14,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1920909060, now seen corresponding path program 1 times [2024-11-22 07:44:14,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:44:14,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656307429] [2024-11-22 07:44:14,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:14,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:44:14,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:14,944 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 327 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2024-11-22 07:44:14,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:44:14,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656307429] [2024-11-22 07:44:14,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656307429] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:44:14,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1682077753] [2024-11-22 07:44:14,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:14,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:44:14,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:44:14,949 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 07:44:14,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 07:44:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:15,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 1608 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 07:44:15,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:44:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2024-11-22 07:44:15,355 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 07:44:15,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1682077753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:44:15,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 07:44:15,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2024-11-22 07:44:15,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714327972] [2024-11-22 07:44:15,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:44:15,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 07:44:15,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:44:15,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 07:44:15,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-22 07:44:15,358 INFO L87 Difference]: Start difference. First operand 499 states and 848 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-11-22 07:44:15,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:44:15,496 INFO L93 Difference]: Finished difference Result 1499 states and 2550 transitions. [2024-11-22 07:44:15,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 07:44:15,496 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 706 [2024-11-22 07:44:15,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:44:15,508 INFO L225 Difference]: With dead ends: 1499 [2024-11-22 07:44:15,508 INFO L226 Difference]: Without dead ends: 1003 [2024-11-22 07:44:15,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 713 GetRequests, 706 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-22 07:44:15,512 INFO L432 NwaCegarLoop]: 1006 mSDtfsCounter, 535 mSDsluCounter, 1528 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 535 SdHoareTripleChecker+Valid, 2534 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 07:44:15,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [535 Valid, 2534 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 07:44:15,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2024-11-22 07:44:15,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 641. [2024-11-22 07:44:15,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 641 states, 495 states have (on average 1.6404040404040403) internal successors, (812), 496 states have internal predecessors, (812), 143 states have call successors, (143), 2 states have call predecessors, (143), 2 states have return successors, (143), 142 states have call predecessors, (143), 143 states have call successors, (143) [2024-11-22 07:44:15,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 1098 transitions. [2024-11-22 07:44:15,559 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 1098 transitions. Word has length 706 [2024-11-22 07:44:15,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:44:15,562 INFO L471 AbstractCegarLoop]: Abstraction has 641 states and 1098 transitions. [2024-11-22 07:44:15,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-11-22 07:44:15,563 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 1098 transitions. [2024-11-22 07:44:15,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2024-11-22 07:44:15,568 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:44:15,569 INFO L215 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:44:15,579 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 07:44:15,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:44:15,770 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:44:15,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:44:15,770 INFO L85 PathProgramCache]: Analyzing trace with hash -37665726, now seen corresponding path program 1 times [2024-11-22 07:44:15,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:44:15,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195931513] [2024-11-22 07:44:15,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:15,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:44:15,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:15,998 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2024-11-22 07:44:15,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:44:15,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195931513] [2024-11-22 07:44:15,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195931513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:44:15,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 07:44:15,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 07:44:15,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864701881] [2024-11-22 07:44:15,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:44:16,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 07:44:16,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:44:16,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 07:44:16,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 07:44:16,002 INFO L87 Difference]: Start difference. First operand 641 states and 1098 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-11-22 07:44:16,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:44:16,061 INFO L93 Difference]: Finished difference Result 1647 states and 2809 transitions. [2024-11-22 07:44:16,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 07:44:16,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 706 [2024-11-22 07:44:16,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:44:16,067 INFO L225 Difference]: With dead ends: 1647 [2024-11-22 07:44:16,068 INFO L226 Difference]: Without dead ends: 1009 [2024-11-22 07:44:16,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 07:44:16,072 INFO L432 NwaCegarLoop]: 603 mSDtfsCounter, 347 mSDsluCounter, 538 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 07:44:16,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 1141 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 07:44:16,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1009 states. [2024-11-22 07:44:16,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1009 to 1006. [2024-11-22 07:44:16,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1006 states, 737 states have (on average 1.6010854816824966) internal successors, (1180), 740 states have internal predecessors, (1180), 264 states have call successors, (264), 4 states have call predecessors, (264), 4 states have return successors, (264), 261 states have call predecessors, (264), 264 states have call successors, (264) [2024-11-22 07:44:16,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1006 states to 1006 states and 1708 transitions. [2024-11-22 07:44:16,126 INFO L78 Accepts]: Start accepts. Automaton has 1006 states and 1708 transitions. Word has length 706 [2024-11-22 07:44:16,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:44:16,128 INFO L471 AbstractCegarLoop]: Abstraction has 1006 states and 1708 transitions. [2024-11-22 07:44:16,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-11-22 07:44:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 1006 states and 1708 transitions. [2024-11-22 07:44:16,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2024-11-22 07:44:16,134 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:44:16,135 INFO L215 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:44:16,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 07:44:16,135 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:44:16,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:44:16,136 INFO L85 PathProgramCache]: Analyzing trace with hash -390754108, now seen corresponding path program 1 times [2024-11-22 07:44:16,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:44:16,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811137846] [2024-11-22 07:44:16,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:16,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:44:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:16,372 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2024-11-22 07:44:16,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:44:16,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811137846] [2024-11-22 07:44:16,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811137846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:44:16,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 07:44:16,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 07:44:16,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477133501] [2024-11-22 07:44:16,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:44:16,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 07:44:16,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:44:16,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 07:44:16,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 07:44:16,376 INFO L87 Difference]: Start difference. First operand 1006 states and 1708 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-11-22 07:44:16,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:44:16,435 INFO L93 Difference]: Finished difference Result 2016 states and 3418 transitions. [2024-11-22 07:44:16,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 07:44:16,435 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 706 [2024-11-22 07:44:16,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:44:16,442 INFO L225 Difference]: With dead ends: 2016 [2024-11-22 07:44:16,442 INFO L226 Difference]: Without dead ends: 1013 [2024-11-22 07:44:16,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 07:44:16,447 INFO L432 NwaCegarLoop]: 815 mSDtfsCounter, 327 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 327 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 07:44:16,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [327 Valid, 1360 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 07:44:16,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2024-11-22 07:44:16,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 755. [2024-11-22 07:44:16,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 608 states have (on average 1.662828947368421) internal successors, (1011), 609 states have internal predecessors, (1011), 143 states have call successors, (143), 3 states have call predecessors, (143), 3 states have return successors, (143), 142 states have call predecessors, (143), 143 states have call successors, (143) [2024-11-22 07:44:16,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1297 transitions. [2024-11-22 07:44:16,484 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1297 transitions. Word has length 706 [2024-11-22 07:44:16,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:44:16,484 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 1297 transitions. [2024-11-22 07:44:16,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-11-22 07:44:16,488 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1297 transitions. [2024-11-22 07:44:16,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2024-11-22 07:44:16,492 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:44:16,492 INFO L215 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:44:16,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 07:44:16,493 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:44:16,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:44:16,493 INFO L85 PathProgramCache]: Analyzing trace with hash -2079697850, now seen corresponding path program 1 times [2024-11-22 07:44:16,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:44:16,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901384130] [2024-11-22 07:44:16,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:16,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:44:16,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:16,821 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2024-11-22 07:44:16,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:44:16,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901384130] [2024-11-22 07:44:16,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901384130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:44:16,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 07:44:16,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 07:44:16,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048986377] [2024-11-22 07:44:16,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:44:16,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 07:44:16,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:44:16,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 07:44:16,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 07:44:16,824 INFO L87 Difference]: Start difference. First operand 755 states and 1297 transitions. Second operand has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-11-22 07:44:17,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:44:17,129 INFO L93 Difference]: Finished difference Result 2008 states and 3442 transitions. [2024-11-22 07:44:17,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 07:44:17,130 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 706 [2024-11-22 07:44:17,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:44:17,136 INFO L225 Difference]: With dead ends: 2008 [2024-11-22 07:44:17,136 INFO L226 Difference]: Without dead ends: 1256 [2024-11-22 07:44:17,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 07:44:17,139 INFO L432 NwaCegarLoop]: 692 mSDtfsCounter, 839 mSDsluCounter, 1122 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 839 SdHoareTripleChecker+Valid, 1814 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 07:44:17,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [839 Valid, 1814 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 07:44:17,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2024-11-22 07:44:17,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1249. [2024-11-22 07:44:17,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1249 states, 1019 states have (on average 1.6653581943081452) internal successors, (1697), 1023 states have internal predecessors, (1697), 222 states have call successors, (222), 7 states have call predecessors, (222), 7 states have return successors, (222), 218 states have call predecessors, (222), 222 states have call successors, (222) [2024-11-22 07:44:17,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 2141 transitions. [2024-11-22 07:44:17,207 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 2141 transitions. Word has length 706 [2024-11-22 07:44:17,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:44:17,208 INFO L471 AbstractCegarLoop]: Abstraction has 1249 states and 2141 transitions. [2024-11-22 07:44:17,209 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.75) internal successors, (159), 4 states have internal predecessors, (159), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-11-22 07:44:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 2141 transitions. [2024-11-22 07:44:17,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2024-11-22 07:44:17,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:44:17,217 INFO L215 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:44:17,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 07:44:17,217 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:44:17,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:44:17,218 INFO L85 PathProgramCache]: Analyzing trace with hash -208786095, now seen corresponding path program 1 times [2024-11-22 07:44:17,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:44:17,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145533558] [2024-11-22 07:44:17,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:17,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:44:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:17,723 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2024-11-22 07:44:17,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:44:17,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145533558] [2024-11-22 07:44:17,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145533558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:44:17,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 07:44:17,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 07:44:17,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626144970] [2024-11-22 07:44:17,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:44:17,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 07:44:17,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:44:17,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 07:44:17,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 07:44:17,728 INFO L87 Difference]: Start difference. First operand 1249 states and 2141 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-11-22 07:44:18,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:44:18,685 INFO L93 Difference]: Finished difference Result 3563 states and 6065 transitions. [2024-11-22 07:44:18,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 07:44:18,686 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 707 [2024-11-22 07:44:18,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:44:18,697 INFO L225 Difference]: With dead ends: 3563 [2024-11-22 07:44:18,697 INFO L226 Difference]: Without dead ends: 2317 [2024-11-22 07:44:18,701 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-22 07:44:18,701 INFO L432 NwaCegarLoop]: 953 mSDtfsCounter, 2296 mSDsluCounter, 2255 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2296 SdHoareTripleChecker+Valid, 3208 SdHoareTripleChecker+Invalid, 1040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 07:44:18,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2296 Valid, 3208 Invalid, 1040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 07:44:18,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2317 states. [2024-11-22 07:44:18,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2317 to 1940. [2024-11-22 07:44:18,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1940 states, 1527 states have (on average 1.641781270464964) internal successors, (2507), 1535 states have internal predecessors, (2507), 399 states have call successors, (399), 13 states have call predecessors, (399), 13 states have return successors, (399), 391 states have call predecessors, (399), 399 states have call successors, (399) [2024-11-22 07:44:18,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 3305 transitions. [2024-11-22 07:44:18,794 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 3305 transitions. Word has length 707 [2024-11-22 07:44:18,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:44:18,795 INFO L471 AbstractCegarLoop]: Abstraction has 1940 states and 3305 transitions. [2024-11-22 07:44:18,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-11-22 07:44:18,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 3305 transitions. [2024-11-22 07:44:18,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2024-11-22 07:44:18,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:44:18,816 INFO L215 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:44:18,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 07:44:18,817 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:44:18,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:44:18,818 INFO L85 PathProgramCache]: Analyzing trace with hash 2070080147, now seen corresponding path program 1 times [2024-11-22 07:44:18,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:44:18,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475372850] [2024-11-22 07:44:18,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:18,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:44:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:19,288 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2024-11-22 07:44:19,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:44:19,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475372850] [2024-11-22 07:44:19,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475372850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:44:19,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 07:44:19,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 07:44:19,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477222442] [2024-11-22 07:44:19,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:44:19,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 07:44:19,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:44:19,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 07:44:19,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 07:44:19,291 INFO L87 Difference]: Start difference. First operand 1940 states and 3305 transitions. Second operand has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-11-22 07:44:20,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:44:20,147 INFO L93 Difference]: Finished difference Result 5403 states and 9193 transitions. [2024-11-22 07:44:20,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 07:44:20,149 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 707 [2024-11-22 07:44:20,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:44:20,168 INFO L225 Difference]: With dead ends: 5403 [2024-11-22 07:44:20,168 INFO L226 Difference]: Without dead ends: 3503 [2024-11-22 07:44:20,175 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-22 07:44:20,176 INFO L432 NwaCegarLoop]: 1210 mSDtfsCounter, 1230 mSDsluCounter, 3078 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1230 SdHoareTripleChecker+Valid, 4288 SdHoareTripleChecker+Invalid, 992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 07:44:20,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1230 Valid, 4288 Invalid, 992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 07:44:20,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2024-11-22 07:44:20,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 2010. [2024-11-22 07:44:20,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2010 states, 1597 states have (on average 1.6455854727614276) internal successors, (2628), 1605 states have internal predecessors, (2628), 399 states have call successors, (399), 13 states have call predecessors, (399), 13 states have return successors, (399), 391 states have call predecessors, (399), 399 states have call successors, (399) [2024-11-22 07:44:20,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 3426 transitions. [2024-11-22 07:44:20,353 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 3426 transitions. Word has length 707 [2024-11-22 07:44:20,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:44:20,354 INFO L471 AbstractCegarLoop]: Abstraction has 2010 states and 3426 transitions. [2024-11-22 07:44:20,354 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.666666666666668) internal successors, (160), 6 states have internal predecessors, (160), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-11-22 07:44:20,354 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 3426 transitions. [2024-11-22 07:44:20,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2024-11-22 07:44:20,363 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:44:20,363 INFO L215 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:44:20,363 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 07:44:20,364 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:44:20,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:44:20,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1082384683, now seen corresponding path program 1 times [2024-11-22 07:44:20,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:44:20,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347582650] [2024-11-22 07:44:20,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:20,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:44:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:21,229 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 117 proven. 210 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2024-11-22 07:44:21,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:44:21,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347582650] [2024-11-22 07:44:21,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347582650] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:44:21,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1402755340] [2024-11-22 07:44:21,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:21,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:44:21,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:44:21,232 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 07:44:21,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 07:44:21,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:21,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 1613 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 07:44:21,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:44:22,304 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 11107 proven. 210 refuted. 0 times theorem prover too weak. 12663 trivial. 0 not checked. [2024-11-22 07:44:22,304 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 07:44:22,914 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 117 proven. 210 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2024-11-22 07:44:22,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1402755340] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 07:44:22,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 07:44:22,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-22 07:44:22,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344189506] [2024-11-22 07:44:22,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 07:44:22,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 07:44:22,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:44:22,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 07:44:22,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 07:44:22,918 INFO L87 Difference]: Start difference. First operand 2010 states and 3426 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 2 states have call predecessors, (181), 2 states have call successors, (181) [2024-11-22 07:44:23,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:44:23,441 INFO L93 Difference]: Finished difference Result 4018 states and 6825 transitions. [2024-11-22 07:44:23,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 07:44:23,442 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 2 states have call predecessors, (181), 2 states have call successors, (181) Word has length 707 [2024-11-22 07:44:23,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:44:23,453 INFO L225 Difference]: With dead ends: 4018 [2024-11-22 07:44:23,453 INFO L226 Difference]: Without dead ends: 2048 [2024-11-22 07:44:23,458 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1421 GetRequests, 1411 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-22 07:44:23,460 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 532 mSDsluCounter, 655 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 07:44:23,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1092 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 07:44:23,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2048 states. [2024-11-22 07:44:23,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2048 to 2018. [2024-11-22 07:44:23,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2018 states, 1603 states have (on average 1.620711166562695) internal successors, (2598), 1611 states have internal predecessors, (2598), 399 states have call successors, (399), 15 states have call predecessors, (399), 15 states have return successors, (399), 391 states have call predecessors, (399), 399 states have call successors, (399) [2024-11-22 07:44:23,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 3396 transitions. [2024-11-22 07:44:23,600 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 3396 transitions. Word has length 707 [2024-11-22 07:44:23,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:44:23,601 INFO L471 AbstractCegarLoop]: Abstraction has 2018 states and 3396 transitions. [2024-11-22 07:44:23,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (180), 2 states have call predecessors, (180), 4 states have return successors, (181), 2 states have call predecessors, (181), 2 states have call successors, (181) [2024-11-22 07:44:23,602 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 3396 transitions. [2024-11-22 07:44:23,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2024-11-22 07:44:23,607 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:44:23,607 INFO L215 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:44:23,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 07:44:23,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:44:23,808 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:44:23,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:44:23,810 INFO L85 PathProgramCache]: Analyzing trace with hash -525919279, now seen corresponding path program 1 times [2024-11-22 07:44:23,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:44:23,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463543428] [2024-11-22 07:44:23,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:23,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:44:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:25,457 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 123 proven. 204 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2024-11-22 07:44:25,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:44:25,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463543428] [2024-11-22 07:44:25,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463543428] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:44:25,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1184721044] [2024-11-22 07:44:25,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:25,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:44:25,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:44:25,461 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 07:44:25,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 07:44:25,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:25,788 INFO L255 TraceCheckSpWp]: Trace formula consists of 1611 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 07:44:25,796 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:44:26,307 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 12099 proven. 162 refuted. 0 times theorem prover too weak. 11719 trivial. 0 not checked. [2024-11-22 07:44:26,308 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 07:44:26,788 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 165 proven. 162 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2024-11-22 07:44:26,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1184721044] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 07:44:26,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 07:44:26,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5] total 13 [2024-11-22 07:44:26,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305123213] [2024-11-22 07:44:26,789 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 07:44:26,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 07:44:26,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:44:26,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 07:44:26,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2024-11-22 07:44:26,792 INFO L87 Difference]: Start difference. First operand 2018 states and 3396 transitions. Second operand has 13 states, 13 states have (on average 19.46153846153846) internal successors, (253), 13 states have internal predecessors, (253), 3 states have call successors, (232), 2 states have call predecessors, (232), 4 states have return successors, (234), 3 states have call predecessors, (234), 3 states have call successors, (234) [2024-11-22 07:44:29,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:44:29,228 INFO L93 Difference]: Finished difference Result 9945 states and 16711 transitions. [2024-11-22 07:44:29,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-22 07:44:29,233 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 19.46153846153846) internal successors, (253), 13 states have internal predecessors, (253), 3 states have call successors, (232), 2 states have call predecessors, (232), 4 states have return successors, (234), 3 states have call predecessors, (234), 3 states have call successors, (234) Word has length 707 [2024-11-22 07:44:29,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:44:29,261 INFO L225 Difference]: With dead ends: 9945 [2024-11-22 07:44:29,261 INFO L226 Difference]: Without dead ends: 7292 [2024-11-22 07:44:29,267 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1449 GetRequests, 1414 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 268 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=329, Invalid=931, Unknown=0, NotChecked=0, Total=1260 [2024-11-22 07:44:29,268 INFO L432 NwaCegarLoop]: 640 mSDtfsCounter, 2826 mSDsluCounter, 2980 mSDsCounter, 0 mSdLazyCounter, 2448 mSolverCounterSat, 688 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2828 SdHoareTripleChecker+Valid, 3620 SdHoareTripleChecker+Invalid, 3136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 688 IncrementalHoareTripleChecker+Valid, 2448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-22 07:44:29,269 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2828 Valid, 3620 Invalid, 3136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [688 Valid, 2448 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-22 07:44:29,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7292 states. [2024-11-22 07:44:29,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7292 to 4100. [2024-11-22 07:44:29,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4100 states, 3454 states have (on average 1.6077012159814708) internal successors, (5553), 3469 states have internal predecessors, (5553), 616 states have call successors, (616), 29 states have call predecessors, (616), 29 states have return successors, (616), 601 states have call predecessors, (616), 616 states have call successors, (616) [2024-11-22 07:44:29,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4100 states to 4100 states and 6785 transitions. [2024-11-22 07:44:29,480 INFO L78 Accepts]: Start accepts. Automaton has 4100 states and 6785 transitions. Word has length 707 [2024-11-22 07:44:29,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:44:29,481 INFO L471 AbstractCegarLoop]: Abstraction has 4100 states and 6785 transitions. [2024-11-22 07:44:29,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 19.46153846153846) internal successors, (253), 13 states have internal predecessors, (253), 3 states have call successors, (232), 2 states have call predecessors, (232), 4 states have return successors, (234), 3 states have call predecessors, (234), 3 states have call successors, (234) [2024-11-22 07:44:29,482 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 6785 transitions. [2024-11-22 07:44:29,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2024-11-22 07:44:29,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:44:29,490 INFO L215 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:44:29,500 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 07:44:29,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-11-22 07:44:29,694 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:44:29,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:44:29,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1719285387, now seen corresponding path program 1 times [2024-11-22 07:44:29,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:44:29,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869312886] [2024-11-22 07:44:29,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:29,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:44:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:30,300 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2024-11-22 07:44:30,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:44:30,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869312886] [2024-11-22 07:44:30,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869312886] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:44:30,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 07:44:30,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 07:44:30,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775175827] [2024-11-22 07:44:30,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:44:30,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 07:44:30,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:44:30,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 07:44:30,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 07:44:30,304 INFO L87 Difference]: Start difference. First operand 4100 states and 6785 transitions. Second operand has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-11-22 07:44:30,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:44:30,812 INFO L93 Difference]: Finished difference Result 13762 states and 22779 transitions. [2024-11-22 07:44:30,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 07:44:30,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 707 [2024-11-22 07:44:30,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:44:30,857 INFO L225 Difference]: With dead ends: 13762 [2024-11-22 07:44:30,857 INFO L226 Difference]: Without dead ends: 9702 [2024-11-22 07:44:30,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 07:44:30,869 INFO L432 NwaCegarLoop]: 575 mSDtfsCounter, 1062 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 07:44:30,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 1413 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 07:44:30,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9702 states. [2024-11-22 07:44:31,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9702 to 8731. [2024-11-22 07:44:31,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8731 states, 7564 states have (on average 1.6207033315705976) internal successors, (12259), 7592 states have internal predecessors, (12259), 1110 states have call successors, (1110), 56 states have call predecessors, (1110), 56 states have return successors, (1110), 1082 states have call predecessors, (1110), 1110 states have call successors, (1110) [2024-11-22 07:44:31,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8731 states to 8731 states and 14479 transitions. [2024-11-22 07:44:31,323 INFO L78 Accepts]: Start accepts. Automaton has 8731 states and 14479 transitions. Word has length 707 [2024-11-22 07:44:31,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:44:31,324 INFO L471 AbstractCegarLoop]: Abstraction has 8731 states and 14479 transitions. [2024-11-22 07:44:31,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.0) internal successors, (160), 4 states have internal predecessors, (160), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-11-22 07:44:31,324 INFO L276 IsEmpty]: Start isEmpty. Operand 8731 states and 14479 transitions. [2024-11-22 07:44:31,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 708 [2024-11-22 07:44:31,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:44:31,335 INFO L215 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:44:31,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 07:44:31,335 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:44:31,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:44:31,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1916150387, now seen corresponding path program 1 times [2024-11-22 07:44:31,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:44:31,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134181974] [2024-11-22 07:44:31,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:31,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:44:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 264 proven. 63 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2024-11-22 07:44:31,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:44:31,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134181974] [2024-11-22 07:44:31,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134181974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:44:31,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1852475217] [2024-11-22 07:44:31,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:31,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:44:31,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:44:31,896 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 07:44:31,898 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 07:44:32,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:32,261 INFO L255 TraceCheckSpWp]: Trace formula consists of 1605 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 07:44:32,268 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:44:32,497 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 7677 proven. 63 refuted. 0 times theorem prover too weak. 16240 trivial. 0 not checked. [2024-11-22 07:44:32,497 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 07:44:32,894 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 264 proven. 63 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2024-11-22 07:44:32,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1852475217] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 07:44:32,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 07:44:32,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-22 07:44:32,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425226479] [2024-11-22 07:44:32,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 07:44:32,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 07:44:32,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:44:32,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 07:44:32,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-22 07:44:32,901 INFO L87 Difference]: Start difference. First operand 8731 states and 14479 transitions. Second operand has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (131), 2 states have call predecessors, (131), 4 states have return successors, (132), 2 states have call predecessors, (132), 2 states have call successors, (132) [2024-11-22 07:44:33,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:44:33,675 INFO L93 Difference]: Finished difference Result 16367 states and 27004 transitions. [2024-11-22 07:44:33,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 07:44:33,676 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (131), 2 states have call predecessors, (131), 4 states have return successors, (132), 2 states have call predecessors, (132), 2 states have call successors, (132) Word has length 707 [2024-11-22 07:44:33,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:44:33,698 INFO L225 Difference]: With dead ends: 16367 [2024-11-22 07:44:33,698 INFO L226 Difference]: Without dead ends: 7676 [2024-11-22 07:44:33,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1420 GetRequests, 1411 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-22 07:44:33,713 INFO L432 NwaCegarLoop]: 427 mSDtfsCounter, 619 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 707 SdHoareTripleChecker+Valid, 1061 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 07:44:33,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [707 Valid, 1061 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 07:44:33,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7676 states. [2024-11-22 07:44:34,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7676 to 7568. [2024-11-22 07:44:34,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7568 states, 6399 states have (on average 1.5989998437255821) internal successors, (10232), 6427 states have internal predecessors, (10232), 1110 states have call successors, (1110), 58 states have call predecessors, (1110), 58 states have return successors, (1110), 1082 states have call predecessors, (1110), 1110 states have call successors, (1110) [2024-11-22 07:44:34,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7568 states to 7568 states and 12452 transitions. [2024-11-22 07:44:34,195 INFO L78 Accepts]: Start accepts. Automaton has 7568 states and 12452 transitions. Word has length 707 [2024-11-22 07:44:34,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:44:34,196 INFO L471 AbstractCegarLoop]: Abstraction has 7568 states and 12452 transitions. [2024-11-22 07:44:34,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 24.142857142857142) internal successors, (169), 7 states have internal predecessors, (169), 2 states have call successors, (131), 2 states have call predecessors, (131), 4 states have return successors, (132), 2 states have call predecessors, (132), 2 states have call successors, (132) [2024-11-22 07:44:34,196 INFO L276 IsEmpty]: Start isEmpty. Operand 7568 states and 12452 transitions. [2024-11-22 07:44:34,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2024-11-22 07:44:34,205 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:44:34,206 INFO L215 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:44:34,215 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 07:44:34,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:44:34,407 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:44:34,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:44:34,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1583863584, now seen corresponding path program 1 times [2024-11-22 07:44:34,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:44:34,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233862129] [2024-11-22 07:44:34,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:34,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:44:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:35,044 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 213 proven. 114 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2024-11-22 07:44:35,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:44:35,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233862129] [2024-11-22 07:44:35,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233862129] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 07:44:35,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1883378480] [2024-11-22 07:44:35,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:35,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:44:35,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:44:35,047 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 07:44:35,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 07:44:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:35,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 1604 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 07:44:35,426 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:44:36,106 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 11811 proven. 114 refuted. 0 times theorem prover too weak. 12055 trivial. 0 not checked. [2024-11-22 07:44:36,107 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 07:44:36,549 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 213 proven. 114 refuted. 0 times theorem prover too weak. 23653 trivial. 0 not checked. [2024-11-22 07:44:36,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1883378480] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 07:44:36,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 07:44:36,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-22 07:44:36,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681570902] [2024-11-22 07:44:36,550 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 07:44:36,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 07:44:36,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:44:36,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 07:44:36,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-22 07:44:36,554 INFO L87 Difference]: Start difference. First operand 7568 states and 12452 transitions. Second operand has 11 states, 11 states have (on average 30.454545454545453) internal successors, (335), 11 states have internal predecessors, (335), 6 states have call successors, (186), 3 states have call predecessors, (186), 5 states have return successors, (187), 6 states have call predecessors, (187), 6 states have call successors, (187) [2024-11-22 07:44:37,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:44:37,381 INFO L93 Difference]: Finished difference Result 15220 states and 24961 transitions. [2024-11-22 07:44:37,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 07:44:37,382 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 30.454545454545453) internal successors, (335), 11 states have internal predecessors, (335), 6 states have call successors, (186), 3 states have call predecessors, (186), 5 states have return successors, (187), 6 states have call predecessors, (187), 6 states have call successors, (187) Word has length 709 [2024-11-22 07:44:37,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:44:37,414 INFO L225 Difference]: With dead ends: 15220 [2024-11-22 07:44:37,414 INFO L226 Difference]: Without dead ends: 7692 [2024-11-22 07:44:37,431 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1427 GetRequests, 1413 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=154, Unknown=0, NotChecked=0, Total=240 [2024-11-22 07:44:37,432 INFO L432 NwaCegarLoop]: 412 mSDtfsCounter, 783 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 1030 SdHoareTripleChecker+Invalid, 939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 07:44:37,433 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [854 Valid, 1030 Invalid, 939 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 07:44:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7692 states. [2024-11-22 07:44:37,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7692 to 7584. [2024-11-22 07:44:37,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7584 states, 6411 states have (on average 1.5933551708001872) internal successors, (10215), 6439 states have internal predecessors, (10215), 1110 states have call successors, (1110), 62 states have call predecessors, (1110), 62 states have return successors, (1110), 1082 states have call predecessors, (1110), 1110 states have call successors, (1110) [2024-11-22 07:44:37,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7584 states to 7584 states and 12435 transitions. [2024-11-22 07:44:37,954 INFO L78 Accepts]: Start accepts. Automaton has 7584 states and 12435 transitions. Word has length 709 [2024-11-22 07:44:37,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:44:37,955 INFO L471 AbstractCegarLoop]: Abstraction has 7584 states and 12435 transitions. [2024-11-22 07:44:37,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 30.454545454545453) internal successors, (335), 11 states have internal predecessors, (335), 6 states have call successors, (186), 3 states have call predecessors, (186), 5 states have return successors, (187), 6 states have call predecessors, (187), 6 states have call successors, (187) [2024-11-22 07:44:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand 7584 states and 12435 transitions. [2024-11-22 07:44:37,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 710 [2024-11-22 07:44:37,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:44:37,965 INFO L215 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:44:37,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-22 07:44:38,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:44:38,167 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:44:38,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:44:38,167 INFO L85 PathProgramCache]: Analyzing trace with hash 1858623198, now seen corresponding path program 1 times [2024-11-22 07:44:38,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:44:38,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408265425] [2024-11-22 07:44:38,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:38,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:44:38,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 07:44:38,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1365864449] [2024-11-22 07:44:38,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:38,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:44:38,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:44:38,592 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 07:44:38,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-22 07:44:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:38,962 INFO L255 TraceCheckSpWp]: Trace formula consists of 1602 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 07:44:38,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:44:39,530 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2024-11-22 07:44:39,530 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 07:44:39,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:44:39,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408265425] [2024-11-22 07:44:39,531 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-22 07:44:39,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365864449] [2024-11-22 07:44:39,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365864449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:44:39,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 07:44:39,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 07:44:39,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652456557] [2024-11-22 07:44:39,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:44:39,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 07:44:39,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:44:39,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 07:44:39,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 07:44:39,534 INFO L87 Difference]: Start difference. First operand 7584 states and 12435 transitions. Second operand has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-11-22 07:44:41,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:44:41,023 INFO L93 Difference]: Finished difference Result 25426 states and 41574 transitions. [2024-11-22 07:44:41,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 07:44:41,024 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 709 [2024-11-22 07:44:41,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:44:41,078 INFO L225 Difference]: With dead ends: 25426 [2024-11-22 07:44:41,078 INFO L226 Difference]: Without dead ends: 17838 [2024-11-22 07:44:41,097 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 708 GetRequests, 705 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 07:44:41,097 INFO L432 NwaCegarLoop]: 900 mSDtfsCounter, 645 mSDsluCounter, 1253 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 07:44:41,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 2153 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 07:44:41,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17838 states. [2024-11-22 07:44:41,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17838 to 15831. [2024-11-22 07:44:41,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15831 states, 13544 states have (on average 1.5979031305375073) internal successors, (21642), 13598 states have internal predecessors, (21642), 2164 states have call successors, (2164), 122 states have call predecessors, (2164), 122 states have return successors, (2164), 2110 states have call predecessors, (2164), 2164 states have call successors, (2164) [2024-11-22 07:44:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15831 states to 15831 states and 25970 transitions. [2024-11-22 07:44:41,934 INFO L78 Accepts]: Start accepts. Automaton has 15831 states and 25970 transitions. Word has length 709 [2024-11-22 07:44:41,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:44:41,934 INFO L471 AbstractCegarLoop]: Abstraction has 15831 states and 25970 transitions. [2024-11-22 07:44:41,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 32.4) internal successors, (162), 4 states have internal predecessors, (162), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-11-22 07:44:41,935 INFO L276 IsEmpty]: Start isEmpty. Operand 15831 states and 25970 transitions. [2024-11-22 07:44:41,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2024-11-22 07:44:41,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:44:41,946 INFO L215 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:44:41,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-22 07:44:42,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-22 07:44:42,147 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:44:42,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:44:42,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1568956850, now seen corresponding path program 1 times [2024-11-22 07:44:42,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:44:42,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937989064] [2024-11-22 07:44:42,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:42,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:44:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:42,655 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2024-11-22 07:44:42,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:44:42,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937989064] [2024-11-22 07:44:42,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937989064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:44:42,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 07:44:42,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 07:44:42,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108994120] [2024-11-22 07:44:42,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:44:42,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 07:44:42,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:44:42,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 07:44:42,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 07:44:42,658 INFO L87 Difference]: Start difference. First operand 15831 states and 25970 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-11-22 07:44:43,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:44:43,508 INFO L93 Difference]: Finished difference Result 35825 states and 58653 transitions. [2024-11-22 07:44:43,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 07:44:43,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 710 [2024-11-22 07:44:43,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:44:43,582 INFO L225 Difference]: With dead ends: 35825 [2024-11-22 07:44:43,582 INFO L226 Difference]: Without dead ends: 20034 [2024-11-22 07:44:43,613 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 07:44:43,614 INFO L432 NwaCegarLoop]: 755 mSDtfsCounter, 348 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 07:44:43,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [348 Valid, 1285 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 07:44:43,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20034 states. [2024-11-22 07:44:44,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20034 to 19903. [2024-11-22 07:44:44,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19903 states, 16854 states have (on average 1.5848463272813575) internal successors, (26711), 16921 states have internal predecessors, (26711), 2879 states have call successors, (2879), 169 states have call predecessors, (2879), 169 states have return successors, (2879), 2812 states have call predecessors, (2879), 2879 states have call successors, (2879) [2024-11-22 07:44:45,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19903 states to 19903 states and 32469 transitions. [2024-11-22 07:44:45,031 INFO L78 Accepts]: Start accepts. Automaton has 19903 states and 32469 transitions. Word has length 710 [2024-11-22 07:44:45,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:44:45,032 INFO L471 AbstractCegarLoop]: Abstraction has 19903 states and 32469 transitions. [2024-11-22 07:44:45,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-11-22 07:44:45,033 INFO L276 IsEmpty]: Start isEmpty. Operand 19903 states and 32469 transitions. [2024-11-22 07:44:45,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2024-11-22 07:44:45,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:44:45,051 INFO L215 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:44:45,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 07:44:45,052 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:44:45,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:44:45,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1342183195, now seen corresponding path program 1 times [2024-11-22 07:44:45,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:44:45,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674825562] [2024-11-22 07:44:45,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:45,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:44:45,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:45,309 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 23980 trivial. 0 not checked. [2024-11-22 07:44:45,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 07:44:45,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674825562] [2024-11-22 07:44:45,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674825562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 07:44:45,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 07:44:45,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 07:44:45,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371565983] [2024-11-22 07:44:45,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 07:44:45,312 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 07:44:45,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 07:44:45,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 07:44:45,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 07:44:45,313 INFO L87 Difference]: Start difference. First operand 19903 states and 32469 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-11-22 07:44:46,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 07:44:46,919 INFO L93 Difference]: Finished difference Result 57940 states and 94262 transitions. [2024-11-22 07:44:46,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 07:44:46,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) Word has length 710 [2024-11-22 07:44:46,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 07:44:47,015 INFO L225 Difference]: With dead ends: 57940 [2024-11-22 07:44:47,015 INFO L226 Difference]: Without dead ends: 38097 [2024-11-22 07:44:47,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 07:44:47,051 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 496 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 07:44:47,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 1073 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 07:44:47,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38097 states. [2024-11-22 07:44:48,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38097 to 22117. [2024-11-22 07:44:48,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22117 states, 19068 states have (on average 1.5857457520453115) internal successors, (30237), 19135 states have internal predecessors, (30237), 2879 states have call successors, (2879), 169 states have call predecessors, (2879), 169 states have return successors, (2879), 2812 states have call predecessors, (2879), 2879 states have call successors, (2879) [2024-11-22 07:44:48,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22117 states to 22117 states and 35995 transitions. [2024-11-22 07:44:48,386 INFO L78 Accepts]: Start accepts. Automaton has 22117 states and 35995 transitions. Word has length 710 [2024-11-22 07:44:48,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 07:44:48,386 INFO L471 AbstractCegarLoop]: Abstraction has 22117 states and 35995 transitions. [2024-11-22 07:44:48,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 1 states have call successors, (110), 1 states have call predecessors, (110), 1 states have return successors, (110), 1 states have call predecessors, (110), 1 states have call successors, (110) [2024-11-22 07:44:48,387 INFO L276 IsEmpty]: Start isEmpty. Operand 22117 states and 35995 transitions. [2024-11-22 07:44:48,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2024-11-22 07:44:48,400 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 07:44:48,401 INFO L215 NwaCegarLoop]: trace histogram [110, 110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:44:48,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 07:44:48,401 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 07:44:48,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 07:44:48,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1286095579, now seen corresponding path program 1 times [2024-11-22 07:44:48,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 07:44:48,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796951] [2024-11-22 07:44:48,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:48,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 07:44:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 07:44:48,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [861452164] [2024-11-22 07:44:48,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 07:44:48,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 07:44:48,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 07:44:48,786 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 07:44:48,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-22 07:44:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 07:44:49,221 INFO L255 TraceCheckSpWp]: Trace formula consists of 1606 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 07:44:49,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 07:44:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 23980 backedges. 13440 proven. 255 refuted. 0 times theorem prover too weak. 10285 trivial. 0 not checked. [2024-11-22 07:44:51,640 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 07:45:04,199 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~var_1_66~0 256))) (let ((.cse175 (+ c_~var_1_65~0 1)) (.cse36 (+ |c_ULTIMATE.start_step_#t~bitwise5#1| 2)) (.cse5 (mod c_~var_1_73~0 65536)) (.cse15 (+ |c_ULTIMATE.start_step_#t~bitwise5#1| 1)) (.cse6 (* (- 1) .cse3))) (let ((.cse11 (forall ((v_z_3 Int)) (let ((.cse217 (+ .cse6 v_z_3))) (let ((.cse218 (div .cse217 c_~var_1_65~0))) (or (< (div .cse217 .cse5) .cse15) (< v_z_3 0) (= .cse218 .cse15) (< 8 v_z_3) (< .cse218 .cse15)))))) (.cse1 (forall ((v_z_3 Int)) (let ((.cse216 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse216 .cse5) 0) (< (div .cse216 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse18 (forall ((v_z_3 Int)) (or (< v_z_3 .cse3) (< 8 v_z_3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse15)))) (.cse48 (forall ((v_z_3 Int)) (let ((.cse215 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse215 .cse5) 0) (< (div .cse215 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (< (div .cse215 c_~var_1_65~0) .cse15))))) (.cse16 (forall ((v_z_3 Int)) (let ((.cse214 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse214 c_~var_1_65~0))) (< v_z_3 0) (< 8 v_z_3) (< (div .cse214 c_~var_1_65~0) .cse15))))) (.cse29 (forall ((v_z_3 Int)) (let ((.cse213 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse213 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse213 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse213 c_~var_1_65~0) .cse15))))) (.cse56 (forall ((v_z_3 Int)) (let ((.cse211 (+ .cse6 v_z_3))) (let ((.cse212 (div .cse211 c_~var_1_65~0))) (or (not (= 0 (mod .cse211 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse211 .cse5) 0) (< v_z_3 0) (= .cse212 .cse15) (< 8 v_z_3) (< .cse212 .cse15)))))) (.cse99 (forall ((v_z_3 Int)) (let ((.cse209 (+ .cse6 v_z_3))) (let ((.cse210 (div .cse209 c_~var_1_65~0))) (or (not (= 0 (mod .cse209 c_~var_1_65~0))) (< (div .cse209 .cse5) .cse15) (= (mod .cse209 .cse5) 0) (< v_z_3 0) (= .cse210 .cse15) (< 8 v_z_3) (< .cse210 .cse15)))))) (.cse23 (forall ((v_z_3 Int)) (let ((.cse207 (+ .cse6 v_z_3))) (let ((.cse208 (div .cse207 c_~var_1_65~0))) (or (not (= 0 (mod .cse207 c_~var_1_65~0))) (= (mod .cse207 .cse5) 0) (< v_z_3 0) (= .cse208 .cse15) (< 8 v_z_3) (< .cse208 .cse15)))))) (.cse43 (forall ((v_z_3 Int)) (let ((.cse206 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse206 c_~var_1_65~0))) (not (= (mod .cse206 .cse5) 0)) (< (div .cse206 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3))))) (.cse72 (forall ((v_z_3 Int)) (let ((.cse205 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse205 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse205 c_~var_1_65~0)))))) (.cse74 (forall ((v_z_3 Int)) (let ((.cse204 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (not (= (mod .cse204 .cse5) 0)) (< (div .cse204 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse204 c_~var_1_65~0)))))) (.cse61 (forall ((v_z_3 Int)) (let ((.cse203 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse203 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse203 .cse5) 0) (< (div .cse203 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse94 (forall ((v_z_3 Int)) (let ((.cse202 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse202 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse202 .cse5) 0) (< (div .cse202 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) (.cse97 (forall ((v_z_3 Int)) (let ((.cse200 (+ .cse6 v_z_3))) (let ((.cse201 (div .cse200 .cse5))) (or (not (= 0 (mod .cse200 c_~var_1_65~0))) (< .cse201 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse201) (< 8 v_z_3)))))) (.cse120 (forall ((v_z_3 Int)) (let ((.cse198 (+ .cse6 v_z_3))) (let ((.cse199 (div .cse198 .cse5))) (or (not (= 0 (mod .cse198 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse198 .cse5) 0) (< .cse199 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse199) (< 8 v_z_3) (< (div .cse198 c_~var_1_65~0) .cse15)))))) (.cse90 (forall ((v_z_3 Int)) (let ((.cse196 (+ .cse6 v_z_3))) (let ((.cse197 (div .cse196 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse196 .cse5) 0) (= .cse197 .cse15) (< 8 v_z_3) (< .cse197 .cse15)))))) (.cse26 (forall ((v_z_3 Int)) (let ((.cse194 (+ .cse6 v_z_3))) (let ((.cse195 (div .cse194 c_~var_1_65~0))) (or (= (mod .cse194 .cse5) 0) (< v_z_3 0) (= .cse195 .cse15) (< 8 v_z_3) (< .cse195 .cse15)))))) (.cse28 (forall ((v_z_3 Int)) (let ((.cse192 (+ .cse6 v_z_3))) (let ((.cse193 (div .cse192 c_~var_1_65~0))) (or (< (div .cse192 .cse5) .cse15) (= (mod .cse192 .cse5) 0) (< v_z_3 0) (= .cse193 .cse15) (< 8 v_z_3) (< .cse193 .cse15)))))) (.cse54 (forall ((v_z_3 Int)) (let ((.cse191 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse191 .cse5) 0) (< (div .cse191 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse191 c_~var_1_65~0)))))) (.cse133 (forall ((v_z_3 Int)) (let ((.cse189 (+ .cse6 v_z_3))) (let ((.cse190 (div .cse189 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse189 .cse5) 0) (< (div .cse189 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= .cse190 .cse15) (< 8 v_z_3) (< .cse190 .cse15)))))) (.cse27 (forall ((v_z_3 Int)) (let ((.cse187 (+ .cse6 v_z_3))) (let ((.cse188 (div .cse187 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse187 .cse5) 0) (< v_z_3 0) (= .cse188 .cse15) (< 8 v_z_3) (< .cse188 .cse15)))))) (.cse79 (forall ((v_z_3 Int)) (let ((.cse186 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse186 c_~var_1_65~0))) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse186 c_~var_1_65~0) .cse15))))) (.cse10 (forall ((v_z_3 Int)) (let ((.cse185 (div (+ .cse6 v_z_3) c_~var_1_65~0))) (or (< v_z_3 0) (= .cse185 .cse15) (< 8 v_z_3) (< .cse185 .cse15))))) (.cse107 (forall ((v_z_3 Int)) (let ((.cse184 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse184 c_~var_1_65~0))) (not (= (mod .cse184 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse184 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse108 (forall ((v_z_3 Int)) (let ((.cse183 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse183 c_~var_1_65~0))) (< v_z_3 .cse3) (< (div .cse183 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse89 (forall ((v_z_3 Int)) (let ((.cse181 (+ .cse6 v_z_3))) (let ((.cse182 (div .cse181 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse181 .cse5) 0) (< .cse182 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse182) (< 8 v_z_3) (< (div .cse181 c_~var_1_65~0) .cse15)))))) (.cse98 (forall ((v_z_3 Int)) (let ((.cse180 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse180 c_~var_1_65~0))) (not (= (mod .cse180 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse180 c_~var_1_65~0) .cse15))))) (.cse30 (forall ((v_z_3 Int)) (or (< v_z_3 .cse3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (.cse34 (forall ((v_z_3 Int)) (let ((.cse179 (+ .cse6 v_z_3))) (or (not (= (mod .cse179 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse179 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse21 (< c_~var_1_65~0 .cse5)) (.cse37 (forall ((v_z_3 Int)) (let ((.cse178 (+ .cse6 v_z_3))) (or (< (div .cse178 .cse5) .cse15) (not (= (mod .cse178 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse178 c_~var_1_65~0) .cse15))))) (.cse159 (forall ((v_z_3 Int)) (let ((.cse177 (+ .cse6 v_z_3))) (or (not (= (mod .cse177 .cse5) 0)) (< (div .cse177 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3))))) (.cse0 (< .cse5 .cse175)) (.cse49 (forall ((v_z_3 Int)) (let ((.cse176 (+ .cse6 v_z_3))) (or (< (div .cse176 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse176 .cse5) 0) (< 8 v_z_3) (< (div .cse176 c_~var_1_65~0) .cse15))))) (.cse7 (< c_~var_1_65~0 0)) (.cse9 (< 0 .cse175)) (.cse8 (forall ((v_z_3 Int)) (let ((.cse173 (+ .cse6 v_z_3))) (let ((.cse174 (div .cse173 c_~var_1_65~0))) (or (not (= 0 (mod .cse173 c_~var_1_65~0))) (< v_z_3 0) (= .cse174 .cse15) (< 8 v_z_3) (< .cse174 .cse15)))))) (.cse102 (forall ((v_z_3 Int)) (let ((.cse171 (+ .cse6 v_z_3))) (let ((.cse172 (div .cse171 c_~var_1_65~0))) (or (not (= 0 (mod .cse171 c_~var_1_65~0))) (< (div .cse171 .cse5) .cse15) (< v_z_3 0) (= .cse172 .cse15) (< 8 v_z_3) (< .cse172 .cse15))))))) (and (or .cse0 (and .cse1 (or (forall ((v_z_3 Int)) (let ((.cse4 (+ .cse6 v_z_3))) (let ((.cse2 (div .cse4 c_~var_1_65~0))) (or (< .cse2 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= (mod .cse4 .cse5) 0) (= .cse2 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7))) (or .cse0 .cse8) (or .cse9 (and .cse10 .cse11)) (forall ((v_z_3 Int)) (let ((.cse12 (+ .cse6 v_z_3))) (let ((.cse13 (div .cse12 .cse5)) (.cse14 (div .cse12 c_~var_1_65~0))) (or (= (mod .cse12 .cse5) 0) (< .cse13 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse13) (= .cse14 .cse15) (< 8 v_z_3) (< .cse14 .cse15))))) (or .cse0 .cse16) (forall ((v_z_3 Int)) (let ((.cse17 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse17 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse17 .cse5) 0) (< (div .cse17 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (< (div .cse17 c_~var_1_65~0) .cse15)))) (or .cse18 .cse9) (or (forall ((v_z_3 Int)) (let ((.cse19 (+ .cse6 v_z_3))) (let ((.cse20 (div .cse19 c_~var_1_65~0))) (or (not (= (mod .cse19 .cse5) 0)) (< v_z_3 0) (= .cse20 .cse15) (< 8 v_z_3) (< .cse20 .cse15))))) .cse0) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse22 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse22 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse22 c_~var_1_65~0)))))) (or .cse23 .cse0) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse24 (+ .cse6 v_z_3))) (let ((.cse25 (div .cse24 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse24 .cse5) .cse15) (= (mod .cse24 .cse5) 0) (< v_z_3 0) (= .cse25 .cse15) (< 8 v_z_3) (< .cse25 .cse15))))) .cse10 .cse26 .cse27 .cse28 .cse11)) (or .cse1 .cse9) (or (and .cse29 .cse16) .cse9) (or (and .cse30 (or (forall ((v_z_3 Int)) (let ((.cse31 (div (+ .cse6 v_z_3) c_~var_1_65~0))) (or (< .cse31 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= .cse31 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3)))) .cse7) (or (forall ((v_z_3 Int)) (let ((.cse33 (+ .cse6 v_z_3))) (let ((.cse32 (div .cse33 c_~var_1_65~0))) (or (< .cse32 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse33 .cse5) 0)) (< v_z_3 .cse3) (= .cse32 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7) .cse34) .cse0) (forall ((v_z_3 Int)) (let ((.cse35 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse35 c_~var_1_65~0))) (< (div .cse35 .cse5) .cse15) (< v_z_3 .cse3) (< (div .cse35 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (or .cse37 .cse7) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse38 (+ .cse6 v_z_3))) (let ((.cse39 (div .cse38 c_~var_1_65~0))) (or (not (= 0 (mod .cse38 c_~var_1_65~0))) (< (div .cse38 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse39 .cse15) (< 8 v_z_3) (< .cse39 .cse15)))))) (forall ((v_z_3 Int)) (let ((.cse40 (+ .cse6 v_z_3))) (let ((.cse41 (div .cse40 .cse5)) (.cse42 (div .cse40 c_~var_1_65~0))) (or (not (= 0 (mod .cse40 c_~var_1_65~0))) (< .cse41 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse41) (= .cse42 .cse15) (< 8 v_z_3) (< .cse42 .cse15))))) (or .cse9 .cse43) (forall ((v_z_3 Int)) (let ((.cse44 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse44 c_~var_1_65~0))) (< (div .cse44 .cse5) .cse15) (not (= (mod .cse44 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse44 c_~var_1_65~0) .cse15)))) (forall ((v_z_3 Int)) (let ((.cse45 (+ .cse6 v_z_3))) (let ((.cse46 (div .cse45 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse45 .cse5) 0) (< (div .cse45 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse46 .cse15) (< 8 v_z_3) (< .cse46 .cse15))))) (or (and (or .cse0 (forall ((v_z_3 Int)) (let ((.cse47 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse47 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse47 c_~var_1_65~0) .cse15))))) .cse48) .cse7) (or (and .cse49 (or .cse0 (forall ((v_z_3 Int)) (let ((.cse50 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse50 .cse5) 0) (< 8 v_z_3) (< (div .cse50 c_~var_1_65~0) .cse15)))))) .cse7) (or .cse18 .cse0) (or .cse21 .cse48) (forall ((v_z_3 Int)) (let ((.cse51 (+ .cse6 v_z_3))) (let ((.cse52 (div .cse51 .cse5)) (.cse53 (div .cse51 c_~var_1_65~0))) (or (not (= 0 (mod .cse51 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse51 .cse5) 0) (< .cse52 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse52) (= .cse53 .cse15) (< 8 v_z_3) (< .cse53 .cse15))))) (or (and .cse54 (or (forall ((v_z_3 Int)) (let ((.cse55 (+ .cse6 v_z_3))) (or (< (div .cse55 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (= (mod .cse55 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse55 c_~var_1_65~0))))) .cse7)) .cse0) (or .cse56 .cse0) (forall ((v_z_3 Int)) (let ((.cse57 (+ .cse6 v_z_3))) (let ((.cse58 (div .cse57 .cse5)) (.cse59 (div .cse57 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse57 .cse5) 0) (< .cse58 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse58) (= .cse59 .cse15) (< 8 v_z_3) (< .cse59 .cse15))))) (or (and (forall ((v_z_3 Int)) (let ((.cse60 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse60 c_~var_1_65~0))) (< (div .cse60 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse60 .cse5) 0) (< (div .cse60 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) .cse61) .cse9) (forall ((v_z_3 Int)) (let ((.cse62 (+ .cse6 v_z_3))) (let ((.cse63 (div .cse62 c_~var_1_65~0))) (or (not (= 0 (mod .cse62 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse62 .cse5) 0) (< (div .cse62 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse63 .cse15) (< 8 v_z_3) (< .cse63 .cse15))))) (forall ((v_z_3 Int)) (let ((.cse64 (+ .cse6 v_z_3))) (let ((.cse65 (div .cse64 c_~var_1_65~0))) (or (not (= 0 (mod .cse64 c_~var_1_65~0))) (< (div .cse64 .cse5) .cse15) (not (= (mod .cse64 .cse5) 0)) (< v_z_3 0) (= .cse65 .cse15) (< 8 v_z_3) (< .cse65 .cse15))))) (or .cse9 .cse16) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse66 (+ .cse6 v_z_3))) (let ((.cse67 (div .cse66 .cse5))) (or (not (= 0 (mod .cse66 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse66 .cse5) 0) (< .cse67 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse67) (< 8 v_z_3)))))) (forall ((v_z_3 Int)) (let ((.cse68 (+ .cse6 v_z_3))) (let ((.cse69 (div .cse68 c_~var_1_65~0))) (or (< (div .cse68 .cse5) .cse15) (not (= (mod .cse68 .cse5) 0)) (< v_z_3 0) (= .cse69 .cse15) (< 8 v_z_3) (< .cse69 .cse15))))) (forall ((v_z_3 Int)) (let ((.cse70 (+ .cse6 v_z_3))) (or (< (div .cse70 .cse5) .cse15) (< v_z_3 .cse3) (< (div .cse70 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse71 (+ .cse6 v_z_3))) (or (< (div .cse71 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse71 .cse5) 0) (< (div .cse71 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (or (and .cse72 (or (forall ((v_z_3 Int)) (let ((.cse73 (+ .cse6 v_z_3))) (or (< (div .cse73 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (not (= (mod .cse73 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse73 c_~var_1_65~0))))) .cse7) .cse74 (or (forall ((v_z_3 Int)) (let ((.cse75 (+ .cse6 v_z_3))) (or (< (div .cse75 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse75 c_~var_1_65~0))))) .cse7)) .cse0) (forall ((v_z_3 Int)) (let ((.cse78 (+ .cse6 v_z_3))) (let ((.cse76 (div .cse78 .cse5)) (.cse77 (div .cse78 c_~var_1_65~0))) (or (< .cse76 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse76) (= .cse77 .cse15) (< 8 v_z_3) (< .cse77 .cse15))))) (or .cse29 .cse0) (or .cse79 .cse0) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse80 (+ .cse6 v_z_3))) (let ((.cse81 (div .cse80 .cse5))) (or (not (= 0 (mod .cse80 c_~var_1_65~0))) (= (mod .cse80 .cse5) 0) (< .cse81 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse81) (< 8 v_z_3) (< (div .cse80 c_~var_1_65~0) .cse15)))))) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse82 (+ .cse6 v_z_3))) (let ((.cse83 (div .cse82 .cse5))) (or (not (= 0 (mod .cse82 c_~var_1_65~0))) (< .cse83 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse83) (< 8 v_z_3) (< (div .cse82 c_~var_1_65~0) .cse15)))))) (or (forall ((v_z_3 Int)) (let ((.cse84 (+ .cse6 v_z_3))) (or (< (div .cse84 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (< (div .cse84 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse84 c_~var_1_65~0))))) .cse7) (or (forall ((v_z_3 Int)) (let ((.cse85 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse85 c_~var_1_65~0))) (< (div .cse85 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3)))) .cse21) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse86 (+ .cse6 v_z_3))) (or (< (div .cse86 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse86 .cse5) 0) (< 8 v_z_3))))) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse88 (+ .cse6 v_z_3))) (let ((.cse87 (div .cse88 .cse5))) (or (< .cse87 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse87) (< 8 v_z_3) (< (div .cse88 c_~var_1_65~0) .cse15)))))) (or .cse21 .cse89) (or .cse56 .cse9) (or .cse0 .cse26) (or .cse90 .cse0) (forall ((v_z_3 Int)) (let ((.cse91 (+ .cse6 v_z_3))) (let ((.cse92 (div .cse91 .cse5)) (.cse93 (div .cse91 c_~var_1_65~0))) (or (not (= 0 (mod .cse91 c_~var_1_65~0))) (= (mod .cse91 .cse5) 0) (< .cse92 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse92) (= .cse93 .cse15) (< 8 v_z_3) (< .cse93 .cse15))))) (or .cse21 (and .cse94 (forall ((v_z_3 Int)) (let ((.cse95 (+ .cse6 v_z_3))) (let ((.cse96 (div .cse95 .cse5))) (or (not (= 0 (mod .cse95 c_~var_1_65~0))) (= (mod .cse95 .cse5) 0) (< .cse96 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse96) (< 8 v_z_3))))) .cse97)) (or .cse9 .cse98) (or (and .cse99 .cse23) .cse9) (or (and (forall ((v_z_3 Int)) (let ((.cse100 (+ .cse6 v_z_3))) (let ((.cse101 (div .cse100 c_~var_1_65~0))) (or (not (= 0 (mod .cse100 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (< (div .cse100 .cse5) .cse15) (= (mod .cse100 .cse5) 0) (< v_z_3 0) (= .cse101 .cse15) (< 8 v_z_3) (< .cse101 .cse15))))) .cse56 .cse99 .cse23 .cse8 .cse102) .cse9) (or (and .cse43 (or (forall ((v_z_3 Int)) (let ((.cse103 (+ .cse6 v_z_3))) (let ((.cse104 (div .cse103 c_~var_1_65~0))) (or (not (= 0 (mod .cse103 c_~var_1_65~0))) (< .cse104 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse103 .cse5) 0)) (= .cse104 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) .cse7)) .cse0) (or (and (or (forall ((v_z_3 Int)) (let ((.cse105 (+ .cse6 v_z_3))) (let ((.cse106 (div .cse105 c_~var_1_65~0))) (or (not (= 0 (mod .cse105 c_~var_1_65~0))) (< .cse106 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse105 .cse5) 0)) (< v_z_3 .cse3) (= .cse106 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7) .cse107 .cse108 (or (forall ((v_z_3 Int)) (let ((.cse109 (+ .cse6 v_z_3))) (let ((.cse110 (div .cse109 c_~var_1_65~0))) (or (not (= 0 (mod .cse109 c_~var_1_65~0))) (< .cse110 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= .cse110 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7)) .cse0) (or (and .cse72 (forall ((v_z_3 Int)) (let ((.cse112 (+ .cse6 v_z_3))) (let ((.cse111 (div .cse112 .cse5))) (or (< .cse3 (+ v_z_3 1)) (< .cse111 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse112 c_~var_1_65~0) .cse36) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse111) (< 8 v_z_3) (= 0 (mod .cse112 c_~var_1_65~0)))))) (forall ((v_z_3 Int)) (let ((.cse113 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse113 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse113 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse113 c_~var_1_65~0))))) .cse74 (forall ((v_z_3 Int)) (let ((.cse114 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse114 .cse5) .cse15) (not (= (mod .cse114 .cse5) 0)) (< (div .cse114 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse114 c_~var_1_65~0)))))) .cse9) (or .cse0 (and .cse61 (or (forall ((v_z_3 Int)) (let ((.cse115 (+ .cse6 v_z_3))) (let ((.cse116 (div .cse115 c_~var_1_65~0))) (or (not (= 0 (mod .cse115 c_~var_1_65~0))) (< .cse116 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= (mod .cse115 .cse5) 0) (= .cse116 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7))) (or .cse21 (and .cse94 .cse97)) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse117 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse117 c_~var_1_65~0))) (< (div .cse117 .cse5) .cse15) (not (= (mod .cse117 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3))))) (or (forall ((v_z_3 Int)) (or (< (div (+ .cse6 v_z_3) .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3))) .cse21) (or (forall ((v_z_3 Int)) (let ((.cse118 (+ .cse6 v_z_3))) (let ((.cse119 (div .cse118 c_~var_1_65~0))) (or (not (= 0 (mod .cse118 c_~var_1_65~0))) (not (= (mod .cse118 .cse5) 0)) (< v_z_3 0) (= .cse119 .cse15) (< 8 v_z_3) (< .cse119 .cse15))))) .cse0) (or .cse21 .cse120) (or .cse21 (and (forall ((v_z_3 Int)) (let ((.cse121 (+ .cse6 v_z_3))) (let ((.cse122 (div .cse121 .cse5))) (or (= (mod .cse121 .cse5) 0) (< .cse122 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse122) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse123 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse123 .cse5) 0) (< (div .cse123 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse124 (div (+ .cse6 v_z_3) .cse5))) (or (< .cse124 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse124) (< 8 v_z_3)))))) (or .cse120 .cse7) (or .cse9 (and .cse90 (forall ((v_z_3 Int)) (let ((.cse125 (+ .cse6 v_z_3))) (let ((.cse126 (div .cse125 c_~var_1_65~0))) (or (< (div .cse125 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse125 .cse5) 0) (= .cse126 .cse15) (< 8 v_z_3) (< .cse126 .cse15))))))) (forall ((v_z_3 Int)) (let ((.cse127 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse127 .cse5) .cse15) (< (div .cse127 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse127 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse128 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse128 .cse5) 0) (< (div .cse128 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse128 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse128 c_~var_1_65~0))))) (or (and .cse26 .cse28) .cse9) (or .cse0 .cse27) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse129 (+ .cse6 v_z_3))) (let ((.cse130 (div .cse129 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse129 .cse5) 0) (< .cse130 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse130) (< 8 v_z_3)))))) (or (forall ((v_z_3 Int)) (let ((.cse131 (+ .cse6 v_z_3))) (let ((.cse132 (div .cse131 c_~var_1_65~0))) (or (not (= 0 (mod .cse131 c_~var_1_65~0))) (= (mod .cse131 .cse5) 0) (< (div .cse131 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse132 .cse15) (< 8 v_z_3) (< .cse132 .cse15))))) .cse0) (or .cse54 .cse9) (or .cse133 .cse0) (or (and .cse133 (or (forall ((v_z_3 Int)) (let ((.cse134 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse134 .cse5) 0) (< (div .cse134 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3) (< (div .cse134 c_~var_1_65~0) .cse15)))) .cse7)) .cse0) (or .cse9 .cse27) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse135 (+ .cse6 v_z_3))) (let ((.cse136 (div .cse135 .cse5))) (or (= (mod .cse135 .cse5) 0) (< .cse136 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse136) (< 8 v_z_3) (< (div .cse135 c_~var_1_65~0) .cse15)))))) (or .cse9 .cse79) (or .cse10 .cse0) (or (and (or (forall ((v_z_3 Int)) (let ((.cse137 (+ .cse6 v_z_3))) (or (not (= (mod .cse137 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse137 c_~var_1_65~0) .cse15)))) .cse0) .cse37) .cse7) (or (and (or (forall ((v_z_3 Int)) (or (< v_z_3 0) (< 8 v_z_3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse15))) .cse0) (forall ((v_z_3 Int)) (let ((.cse138 (+ .cse6 v_z_3))) (or (< (div .cse138 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (< (div .cse138 c_~var_1_65~0) .cse15))))) .cse7) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse139 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse139 .cse5) 0) (< (div .cse139 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse139 c_~var_1_65~0)))))) (forall ((v_z_3 Int)) (let ((.cse140 (+ .cse6 v_z_3))) (or (< (div .cse140 .cse5) .cse15) (not (= (mod .cse140 .cse5) 0)) (< (div .cse140 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3)))) (or (and (forall ((v_z_3 Int)) (let ((.cse141 (+ .cse6 v_z_3))) (let ((.cse142 (div .cse141 .cse5))) (or (not (= 0 (mod .cse141 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse141 .cse5) 0) (< .cse142 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse141 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse142) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse143 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse143 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse143 .cse5) 0) (< (div .cse143 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse143 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) .cse9) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse144 (+ .cse6 v_z_3))) (let ((.cse145 (div .cse144 c_~var_1_65~0))) (or (< (div .cse144 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse145 .cse15) (< 8 v_z_3) (< .cse145 .cse15)))))) (or (forall ((v_z_3 Int)) (let ((.cse146 (+ .cse6 v_z_3))) (or (< (div .cse146 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (= (mod .cse146 .cse5) 0) (< (div .cse146 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse146 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse147 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse147 c_~var_1_65~0))) (< (div .cse147 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse147 c_~var_1_65~0) .cse15)))) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse148 (+ .cse6 v_z_3))) (let ((.cse149 (div .cse148 .cse5))) (or (not (= 0 (mod .cse148 c_~var_1_65~0))) (< v_z_3 .cse3) (< .cse149 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse148 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse149) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse150 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse150 c_~var_1_65~0))) (< v_z_3 .cse3) (< (div .cse150 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse150 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) .cse107 .cse108 (forall ((v_z_3 Int)) (let ((.cse151 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse151 c_~var_1_65~0))) (< (div .cse151 .cse5) .cse15) (not (= (mod .cse151 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse151 c_~var_1_65~0) .cse36) (< 8 v_z_3)))))) (or .cse89 .cse7) (or (forall ((v_z_3 Int)) (let ((.cse152 (+ .cse6 v_z_3))) (or (< (div .cse152 .cse5) .cse15) (not (= (mod .cse152 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3)))) .cse21) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse153 (+ .cse6 v_z_3))) (let ((.cse154 (div .cse153 c_~var_1_65~0))) (or (= (mod .cse153 .cse5) 0) (< (div .cse153 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse154 .cse15) (< 8 v_z_3) (< .cse154 .cse15)))))) (or .cse0 (and (or (forall ((v_z_3 Int)) (let ((.cse155 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse155 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse155 .cse5) 0) (< (div .cse155 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3) (< (div .cse155 c_~var_1_65~0) .cse15)))) .cse7) (forall ((v_z_3 Int)) (let ((.cse156 (+ .cse6 v_z_3))) (let ((.cse157 (div .cse156 c_~var_1_65~0))) (or (not (= 0 (mod .cse156 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse156 .cse5) 0) (< (div .cse156 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= .cse157 .cse15) (< 8 v_z_3) (< .cse157 .cse15))))))) (forall ((v_z_3 Int)) (let ((.cse158 (+ .cse6 v_z_3))) (or (< (div .cse158 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse158 c_~var_1_65~0) .cse15)))) (or .cse159 .cse9) (forall ((v_z_3 Int)) (let ((.cse160 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse160 c_~var_1_65~0))) (< (div .cse160 .cse5) .cse15) (not (= (mod .cse160 .cse5) 0)) (< (div .cse160 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3)))) (or .cse98 .cse0) (or .cse9 (and .cse30 (forall ((v_z_3 Int)) (let ((.cse161 (+ .cse6 v_z_3))) (or (< (div .cse161 .cse5) .cse15) (not (= (mod .cse161 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse161 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse163 (+ .cse6 v_z_3))) (let ((.cse162 (div .cse163 .cse5))) (or (< v_z_3 .cse3) (< .cse162 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse163 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse162) (< 8 v_z_3))))) .cse34 (forall ((v_z_3 Int)) (let ((.cse164 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (< (div .cse164 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse164 c_~var_1_65~0) .cse36) (< 8 v_z_3)))))) (or .cse21 .cse37) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse165 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse165 .cse5) 0) (< (div .cse165 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse165 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse166 (+ .cse6 v_z_3))) (let ((.cse167 (div .cse166 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse166 .cse5) 0) (< .cse167 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse166 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse167) (< 8 v_z_3))))))) (or (and .cse159 (or (forall ((v_z_3 Int)) (let ((.cse169 (+ .cse6 v_z_3))) (let ((.cse168 (div .cse169 c_~var_1_65~0))) (or (< .cse168 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse169 .cse5) 0)) (= .cse168 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) .cse7)) .cse0) (or .cse49 .cse7) (or .cse9 (and .cse8 .cse102)) (forall ((v_z_3 Int)) (let ((.cse170 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse170 c_~var_1_65~0))) (< (div .cse170 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (< (div .cse170 c_~var_1_65~0) .cse15)))))))) is different from false [2024-11-22 07:45:08,231 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (mod c_~var_1_66~0 256))) (let ((.cse175 (+ c_~var_1_65~0 1)) (.cse36 (+ |c_ULTIMATE.start_step_#t~bitwise5#1| 2)) (.cse5 (mod c_~var_1_73~0 65536)) (.cse15 (+ |c_ULTIMATE.start_step_#t~bitwise5#1| 1)) (.cse6 (* (- 1) .cse3))) (let ((.cse11 (forall ((v_z_3 Int)) (let ((.cse217 (+ .cse6 v_z_3))) (let ((.cse218 (div .cse217 c_~var_1_65~0))) (or (< (div .cse217 .cse5) .cse15) (< v_z_3 0) (= .cse218 .cse15) (< 8 v_z_3) (< .cse218 .cse15)))))) (.cse1 (forall ((v_z_3 Int)) (let ((.cse216 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse216 .cse5) 0) (< (div .cse216 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse18 (forall ((v_z_3 Int)) (or (< v_z_3 .cse3) (< 8 v_z_3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse15)))) (.cse48 (forall ((v_z_3 Int)) (let ((.cse215 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse215 .cse5) 0) (< (div .cse215 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (< (div .cse215 c_~var_1_65~0) .cse15))))) (.cse16 (forall ((v_z_3 Int)) (let ((.cse214 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse214 c_~var_1_65~0))) (< v_z_3 0) (< 8 v_z_3) (< (div .cse214 c_~var_1_65~0) .cse15))))) (.cse29 (forall ((v_z_3 Int)) (let ((.cse213 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse213 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse213 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse213 c_~var_1_65~0) .cse15))))) (.cse56 (forall ((v_z_3 Int)) (let ((.cse211 (+ .cse6 v_z_3))) (let ((.cse212 (div .cse211 c_~var_1_65~0))) (or (not (= 0 (mod .cse211 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse211 .cse5) 0) (< v_z_3 0) (= .cse212 .cse15) (< 8 v_z_3) (< .cse212 .cse15)))))) (.cse99 (forall ((v_z_3 Int)) (let ((.cse209 (+ .cse6 v_z_3))) (let ((.cse210 (div .cse209 c_~var_1_65~0))) (or (not (= 0 (mod .cse209 c_~var_1_65~0))) (< (div .cse209 .cse5) .cse15) (= (mod .cse209 .cse5) 0) (< v_z_3 0) (= .cse210 .cse15) (< 8 v_z_3) (< .cse210 .cse15)))))) (.cse23 (forall ((v_z_3 Int)) (let ((.cse207 (+ .cse6 v_z_3))) (let ((.cse208 (div .cse207 c_~var_1_65~0))) (or (not (= 0 (mod .cse207 c_~var_1_65~0))) (= (mod .cse207 .cse5) 0) (< v_z_3 0) (= .cse208 .cse15) (< 8 v_z_3) (< .cse208 .cse15)))))) (.cse43 (forall ((v_z_3 Int)) (let ((.cse206 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse206 c_~var_1_65~0))) (not (= (mod .cse206 .cse5) 0)) (< (div .cse206 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3))))) (.cse72 (forall ((v_z_3 Int)) (let ((.cse205 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse205 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse205 c_~var_1_65~0)))))) (.cse74 (forall ((v_z_3 Int)) (let ((.cse204 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (not (= (mod .cse204 .cse5) 0)) (< (div .cse204 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse204 c_~var_1_65~0)))))) (.cse61 (forall ((v_z_3 Int)) (let ((.cse203 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse203 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse203 .cse5) 0) (< (div .cse203 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse94 (forall ((v_z_3 Int)) (let ((.cse202 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse202 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse202 .cse5) 0) (< (div .cse202 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) (.cse97 (forall ((v_z_3 Int)) (let ((.cse200 (+ .cse6 v_z_3))) (let ((.cse201 (div .cse200 .cse5))) (or (not (= 0 (mod .cse200 c_~var_1_65~0))) (< .cse201 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse201) (< 8 v_z_3)))))) (.cse120 (forall ((v_z_3 Int)) (let ((.cse198 (+ .cse6 v_z_3))) (let ((.cse199 (div .cse198 .cse5))) (or (not (= 0 (mod .cse198 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse198 .cse5) 0) (< .cse199 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse199) (< 8 v_z_3) (< (div .cse198 c_~var_1_65~0) .cse15)))))) (.cse90 (forall ((v_z_3 Int)) (let ((.cse196 (+ .cse6 v_z_3))) (let ((.cse197 (div .cse196 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse196 .cse5) 0) (= .cse197 .cse15) (< 8 v_z_3) (< .cse197 .cse15)))))) (.cse26 (forall ((v_z_3 Int)) (let ((.cse194 (+ .cse6 v_z_3))) (let ((.cse195 (div .cse194 c_~var_1_65~0))) (or (= (mod .cse194 .cse5) 0) (< v_z_3 0) (= .cse195 .cse15) (< 8 v_z_3) (< .cse195 .cse15)))))) (.cse28 (forall ((v_z_3 Int)) (let ((.cse192 (+ .cse6 v_z_3))) (let ((.cse193 (div .cse192 c_~var_1_65~0))) (or (< (div .cse192 .cse5) .cse15) (= (mod .cse192 .cse5) 0) (< v_z_3 0) (= .cse193 .cse15) (< 8 v_z_3) (< .cse193 .cse15)))))) (.cse54 (forall ((v_z_3 Int)) (let ((.cse191 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse191 .cse5) 0) (< (div .cse191 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse191 c_~var_1_65~0)))))) (.cse133 (forall ((v_z_3 Int)) (let ((.cse189 (+ .cse6 v_z_3))) (let ((.cse190 (div .cse189 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse189 .cse5) 0) (< (div .cse189 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= .cse190 .cse15) (< 8 v_z_3) (< .cse190 .cse15)))))) (.cse27 (forall ((v_z_3 Int)) (let ((.cse187 (+ .cse6 v_z_3))) (let ((.cse188 (div .cse187 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse187 .cse5) 0) (< v_z_3 0) (= .cse188 .cse15) (< 8 v_z_3) (< .cse188 .cse15)))))) (.cse79 (forall ((v_z_3 Int)) (let ((.cse186 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse186 c_~var_1_65~0))) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse186 c_~var_1_65~0) .cse15))))) (.cse10 (forall ((v_z_3 Int)) (let ((.cse185 (div (+ .cse6 v_z_3) c_~var_1_65~0))) (or (< v_z_3 0) (= .cse185 .cse15) (< 8 v_z_3) (< .cse185 .cse15))))) (.cse107 (forall ((v_z_3 Int)) (let ((.cse184 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse184 c_~var_1_65~0))) (not (= (mod .cse184 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse184 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse108 (forall ((v_z_3 Int)) (let ((.cse183 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse183 c_~var_1_65~0))) (< v_z_3 .cse3) (< (div .cse183 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse89 (forall ((v_z_3 Int)) (let ((.cse181 (+ .cse6 v_z_3))) (let ((.cse182 (div .cse181 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse181 .cse5) 0) (< .cse182 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse182) (< 8 v_z_3) (< (div .cse181 c_~var_1_65~0) .cse15)))))) (.cse98 (forall ((v_z_3 Int)) (let ((.cse180 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse180 c_~var_1_65~0))) (not (= (mod .cse180 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse180 c_~var_1_65~0) .cse15))))) (.cse30 (forall ((v_z_3 Int)) (or (< v_z_3 .cse3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (.cse34 (forall ((v_z_3 Int)) (let ((.cse179 (+ .cse6 v_z_3))) (or (not (= (mod .cse179 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse179 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) (.cse21 (< c_~var_1_65~0 .cse5)) (.cse37 (forall ((v_z_3 Int)) (let ((.cse178 (+ .cse6 v_z_3))) (or (< (div .cse178 .cse5) .cse15) (not (= (mod .cse178 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse178 c_~var_1_65~0) .cse15))))) (.cse159 (forall ((v_z_3 Int)) (let ((.cse177 (+ .cse6 v_z_3))) (or (not (= (mod .cse177 .cse5) 0)) (< (div .cse177 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3))))) (.cse0 (< .cse5 .cse175)) (.cse49 (forall ((v_z_3 Int)) (let ((.cse176 (+ .cse6 v_z_3))) (or (< (div .cse176 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse176 .cse5) 0) (< 8 v_z_3) (< (div .cse176 c_~var_1_65~0) .cse15))))) (.cse7 (< c_~var_1_65~0 0)) (.cse9 (< 0 .cse175)) (.cse8 (forall ((v_z_3 Int)) (let ((.cse173 (+ .cse6 v_z_3))) (let ((.cse174 (div .cse173 c_~var_1_65~0))) (or (not (= 0 (mod .cse173 c_~var_1_65~0))) (< v_z_3 0) (= .cse174 .cse15) (< 8 v_z_3) (< .cse174 .cse15)))))) (.cse102 (forall ((v_z_3 Int)) (let ((.cse171 (+ .cse6 v_z_3))) (let ((.cse172 (div .cse171 c_~var_1_65~0))) (or (not (= 0 (mod .cse171 c_~var_1_65~0))) (< (div .cse171 .cse5) .cse15) (< v_z_3 0) (= .cse172 .cse15) (< 8 v_z_3) (< .cse172 .cse15))))))) (and (or .cse0 (and .cse1 (or (forall ((v_z_3 Int)) (let ((.cse4 (+ .cse6 v_z_3))) (let ((.cse2 (div .cse4 c_~var_1_65~0))) (or (< .cse2 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= (mod .cse4 .cse5) 0) (= .cse2 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7))) (or .cse0 .cse8) (or .cse9 (and .cse10 .cse11)) (forall ((v_z_3 Int)) (let ((.cse12 (+ .cse6 v_z_3))) (let ((.cse13 (div .cse12 .cse5)) (.cse14 (div .cse12 c_~var_1_65~0))) (or (= (mod .cse12 .cse5) 0) (< .cse13 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse13) (= .cse14 .cse15) (< 8 v_z_3) (< .cse14 .cse15))))) (or .cse0 .cse16) (forall ((v_z_3 Int)) (let ((.cse17 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse17 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse17 .cse5) 0) (< (div .cse17 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (< (div .cse17 c_~var_1_65~0) .cse15)))) (or .cse18 .cse9) (or (forall ((v_z_3 Int)) (let ((.cse19 (+ .cse6 v_z_3))) (let ((.cse20 (div .cse19 c_~var_1_65~0))) (or (not (= (mod .cse19 .cse5) 0)) (< v_z_3 0) (= .cse20 .cse15) (< 8 v_z_3) (< .cse20 .cse15))))) .cse0) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse22 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse22 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse22 c_~var_1_65~0)))))) (or .cse23 .cse0) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse24 (+ .cse6 v_z_3))) (let ((.cse25 (div .cse24 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse24 .cse5) .cse15) (= (mod .cse24 .cse5) 0) (< v_z_3 0) (= .cse25 .cse15) (< 8 v_z_3) (< .cse25 .cse15))))) .cse10 .cse26 .cse27 .cse28 .cse11)) (or .cse1 .cse9) (or (and .cse29 .cse16) .cse9) (or (and .cse30 (or (forall ((v_z_3 Int)) (let ((.cse31 (div (+ .cse6 v_z_3) c_~var_1_65~0))) (or (< .cse31 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= .cse31 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3)))) .cse7) (or (forall ((v_z_3 Int)) (let ((.cse33 (+ .cse6 v_z_3))) (let ((.cse32 (div .cse33 c_~var_1_65~0))) (or (< .cse32 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse33 .cse5) 0)) (< v_z_3 .cse3) (= .cse32 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7) .cse34) .cse0) (forall ((v_z_3 Int)) (let ((.cse35 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse35 c_~var_1_65~0))) (< (div .cse35 .cse5) .cse15) (< v_z_3 .cse3) (< (div .cse35 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (or .cse37 .cse7) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse38 (+ .cse6 v_z_3))) (let ((.cse39 (div .cse38 c_~var_1_65~0))) (or (not (= 0 (mod .cse38 c_~var_1_65~0))) (< (div .cse38 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse39 .cse15) (< 8 v_z_3) (< .cse39 .cse15)))))) (forall ((v_z_3 Int)) (let ((.cse40 (+ .cse6 v_z_3))) (let ((.cse41 (div .cse40 .cse5)) (.cse42 (div .cse40 c_~var_1_65~0))) (or (not (= 0 (mod .cse40 c_~var_1_65~0))) (< .cse41 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse41) (= .cse42 .cse15) (< 8 v_z_3) (< .cse42 .cse15))))) (or .cse9 .cse43) (forall ((v_z_3 Int)) (let ((.cse44 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse44 c_~var_1_65~0))) (< (div .cse44 .cse5) .cse15) (not (= (mod .cse44 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse44 c_~var_1_65~0) .cse15)))) (forall ((v_z_3 Int)) (let ((.cse45 (+ .cse6 v_z_3))) (let ((.cse46 (div .cse45 c_~var_1_65~0))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse45 .cse5) 0) (< (div .cse45 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse46 .cse15) (< 8 v_z_3) (< .cse46 .cse15))))) (or (and (or .cse0 (forall ((v_z_3 Int)) (let ((.cse47 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse47 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse47 c_~var_1_65~0) .cse15))))) .cse48) .cse7) (or (and .cse49 (or .cse0 (forall ((v_z_3 Int)) (let ((.cse50 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse50 .cse5) 0) (< 8 v_z_3) (< (div .cse50 c_~var_1_65~0) .cse15)))))) .cse7) (or .cse18 .cse0) (or .cse21 .cse48) (forall ((v_z_3 Int)) (let ((.cse51 (+ .cse6 v_z_3))) (let ((.cse52 (div .cse51 .cse5)) (.cse53 (div .cse51 c_~var_1_65~0))) (or (not (= 0 (mod .cse51 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse51 .cse5) 0) (< .cse52 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse52) (= .cse53 .cse15) (< 8 v_z_3) (< .cse53 .cse15))))) (or (and .cse54 (or (forall ((v_z_3 Int)) (let ((.cse55 (+ .cse6 v_z_3))) (or (< (div .cse55 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (= (mod .cse55 .cse5) 0) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse55 c_~var_1_65~0))))) .cse7)) .cse0) (or .cse56 .cse0) (forall ((v_z_3 Int)) (let ((.cse57 (+ .cse6 v_z_3))) (let ((.cse58 (div .cse57 .cse5)) (.cse59 (div .cse57 c_~var_1_65~0))) (or (< v_z_3 .cse3) (= (mod .cse57 .cse5) 0) (< .cse58 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse58) (= .cse59 .cse15) (< 8 v_z_3) (< .cse59 .cse15))))) (or (and (forall ((v_z_3 Int)) (let ((.cse60 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse60 c_~var_1_65~0))) (< (div .cse60 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse60 .cse5) 0) (< (div .cse60 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) .cse61) .cse9) (forall ((v_z_3 Int)) (let ((.cse62 (+ .cse6 v_z_3))) (let ((.cse63 (div .cse62 c_~var_1_65~0))) (or (not (= 0 (mod .cse62 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (= (mod .cse62 .cse5) 0) (< (div .cse62 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse63 .cse15) (< 8 v_z_3) (< .cse63 .cse15))))) (forall ((v_z_3 Int)) (let ((.cse64 (+ .cse6 v_z_3))) (let ((.cse65 (div .cse64 c_~var_1_65~0))) (or (not (= 0 (mod .cse64 c_~var_1_65~0))) (< (div .cse64 .cse5) .cse15) (not (= (mod .cse64 .cse5) 0)) (< v_z_3 0) (= .cse65 .cse15) (< 8 v_z_3) (< .cse65 .cse15))))) (or .cse9 .cse16) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse66 (+ .cse6 v_z_3))) (let ((.cse67 (div .cse66 .cse5))) (or (not (= 0 (mod .cse66 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse66 .cse5) 0) (< .cse67 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse67) (< 8 v_z_3)))))) (forall ((v_z_3 Int)) (let ((.cse68 (+ .cse6 v_z_3))) (let ((.cse69 (div .cse68 c_~var_1_65~0))) (or (< (div .cse68 .cse5) .cse15) (not (= (mod .cse68 .cse5) 0)) (< v_z_3 0) (= .cse69 .cse15) (< 8 v_z_3) (< .cse69 .cse15))))) (forall ((v_z_3 Int)) (let ((.cse70 (+ .cse6 v_z_3))) (or (< (div .cse70 .cse5) .cse15) (< v_z_3 .cse3) (< (div .cse70 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse71 (+ .cse6 v_z_3))) (or (< (div .cse71 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse71 .cse5) 0) (< (div .cse71 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (or (and .cse72 (or (forall ((v_z_3 Int)) (let ((.cse73 (+ .cse6 v_z_3))) (or (< (div .cse73 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (not (= (mod .cse73 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse73 c_~var_1_65~0))))) .cse7) .cse74 (or (forall ((v_z_3 Int)) (let ((.cse75 (+ .cse6 v_z_3))) (or (< (div .cse75 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse75 c_~var_1_65~0))))) .cse7)) .cse0) (forall ((v_z_3 Int)) (let ((.cse78 (+ .cse6 v_z_3))) (let ((.cse76 (div .cse78 .cse5)) (.cse77 (div .cse78 c_~var_1_65~0))) (or (< .cse76 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse76) (= .cse77 .cse15) (< 8 v_z_3) (< .cse77 .cse15))))) (or .cse29 .cse0) (or .cse79 .cse0) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse80 (+ .cse6 v_z_3))) (let ((.cse81 (div .cse80 .cse5))) (or (not (= 0 (mod .cse80 c_~var_1_65~0))) (= (mod .cse80 .cse5) 0) (< .cse81 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse81) (< 8 v_z_3) (< (div .cse80 c_~var_1_65~0) .cse15)))))) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse82 (+ .cse6 v_z_3))) (let ((.cse83 (div .cse82 .cse5))) (or (not (= 0 (mod .cse82 c_~var_1_65~0))) (< .cse83 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse83) (< 8 v_z_3) (< (div .cse82 c_~var_1_65~0) .cse15)))))) (or (forall ((v_z_3 Int)) (let ((.cse84 (+ .cse6 v_z_3))) (or (< (div .cse84 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (< (div .cse84 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse84 c_~var_1_65~0))))) .cse7) (or (forall ((v_z_3 Int)) (let ((.cse85 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse85 c_~var_1_65~0))) (< (div .cse85 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3)))) .cse21) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse86 (+ .cse6 v_z_3))) (or (< (div .cse86 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse86 .cse5) 0) (< 8 v_z_3))))) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse88 (+ .cse6 v_z_3))) (let ((.cse87 (div .cse88 .cse5))) (or (< .cse87 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse87) (< 8 v_z_3) (< (div .cse88 c_~var_1_65~0) .cse15)))))) (or .cse21 .cse89) (or .cse56 .cse9) (or .cse0 .cse26) (or .cse90 .cse0) (forall ((v_z_3 Int)) (let ((.cse91 (+ .cse6 v_z_3))) (let ((.cse92 (div .cse91 .cse5)) (.cse93 (div .cse91 c_~var_1_65~0))) (or (not (= 0 (mod .cse91 c_~var_1_65~0))) (= (mod .cse91 .cse5) 0) (< .cse92 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse92) (= .cse93 .cse15) (< 8 v_z_3) (< .cse93 .cse15))))) (or .cse21 (and .cse94 (forall ((v_z_3 Int)) (let ((.cse95 (+ .cse6 v_z_3))) (let ((.cse96 (div .cse95 .cse5))) (or (not (= 0 (mod .cse95 c_~var_1_65~0))) (= (mod .cse95 .cse5) 0) (< .cse96 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse96) (< 8 v_z_3))))) .cse97)) (or .cse9 .cse98) (or (and .cse99 .cse23) .cse9) (or (and (forall ((v_z_3 Int)) (let ((.cse100 (+ .cse6 v_z_3))) (let ((.cse101 (div .cse100 c_~var_1_65~0))) (or (not (= 0 (mod .cse100 c_~var_1_65~0))) (< .cse3 (+ v_z_3 1)) (< (div .cse100 .cse5) .cse15) (= (mod .cse100 .cse5) 0) (< v_z_3 0) (= .cse101 .cse15) (< 8 v_z_3) (< .cse101 .cse15))))) .cse56 .cse99 .cse23 .cse8 .cse102) .cse9) (or (and .cse43 (or (forall ((v_z_3 Int)) (let ((.cse103 (+ .cse6 v_z_3))) (let ((.cse104 (div .cse103 c_~var_1_65~0))) (or (not (= 0 (mod .cse103 c_~var_1_65~0))) (< .cse104 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse103 .cse5) 0)) (= .cse104 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) .cse7)) .cse0) (or (and (or (forall ((v_z_3 Int)) (let ((.cse105 (+ .cse6 v_z_3))) (let ((.cse106 (div .cse105 c_~var_1_65~0))) (or (not (= 0 (mod .cse105 c_~var_1_65~0))) (< .cse106 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse105 .cse5) 0)) (< v_z_3 .cse3) (= .cse106 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7) .cse107 .cse108 (or (forall ((v_z_3 Int)) (let ((.cse109 (+ .cse6 v_z_3))) (let ((.cse110 (div .cse109 c_~var_1_65~0))) (or (not (= 0 (mod .cse109 c_~var_1_65~0))) (< .cse110 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= .cse110 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7)) .cse0) (or (and .cse72 (forall ((v_z_3 Int)) (let ((.cse112 (+ .cse6 v_z_3))) (let ((.cse111 (div .cse112 .cse5))) (or (< .cse3 (+ v_z_3 1)) (< .cse111 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse112 c_~var_1_65~0) .cse36) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse111) (< 8 v_z_3) (= 0 (mod .cse112 c_~var_1_65~0)))))) (forall ((v_z_3 Int)) (let ((.cse113 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse113 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse113 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse113 c_~var_1_65~0))))) .cse74 (forall ((v_z_3 Int)) (let ((.cse114 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse114 .cse5) .cse15) (not (= (mod .cse114 .cse5) 0)) (< (div .cse114 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse114 c_~var_1_65~0)))))) .cse9) (or .cse0 (and .cse61 (or (forall ((v_z_3 Int)) (let ((.cse115 (+ .cse6 v_z_3))) (let ((.cse116 (div .cse115 c_~var_1_65~0))) (or (not (= 0 (mod .cse115 c_~var_1_65~0))) (< .cse116 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 .cse3) (= (mod .cse115 .cse5) 0) (= .cse116 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3))))) .cse7))) (or .cse21 (and .cse94 .cse97)) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse117 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse117 c_~var_1_65~0))) (< (div .cse117 .cse5) .cse15) (not (= (mod .cse117 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3))))) (or (forall ((v_z_3 Int)) (or (< (div (+ .cse6 v_z_3) .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3))) .cse21) (or (forall ((v_z_3 Int)) (let ((.cse118 (+ .cse6 v_z_3))) (let ((.cse119 (div .cse118 c_~var_1_65~0))) (or (not (= 0 (mod .cse118 c_~var_1_65~0))) (not (= (mod .cse118 .cse5) 0)) (< v_z_3 0) (= .cse119 .cse15) (< 8 v_z_3) (< .cse119 .cse15))))) .cse0) (or .cse21 .cse120) (or .cse21 (and (forall ((v_z_3 Int)) (let ((.cse121 (+ .cse6 v_z_3))) (let ((.cse122 (div .cse121 .cse5))) (or (= (mod .cse121 .cse5) 0) (< .cse122 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse122) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse123 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse123 .cse5) 0) (< (div .cse123 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse124 (div (+ .cse6 v_z_3) .cse5))) (or (< .cse124 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse124) (< 8 v_z_3)))))) (or .cse120 .cse7) (or .cse9 (and .cse90 (forall ((v_z_3 Int)) (let ((.cse125 (+ .cse6 v_z_3))) (let ((.cse126 (div .cse125 c_~var_1_65~0))) (or (< (div .cse125 .cse5) .cse15) (< v_z_3 .cse3) (= (mod .cse125 .cse5) 0) (= .cse126 .cse15) (< 8 v_z_3) (< .cse126 .cse15))))))) (forall ((v_z_3 Int)) (let ((.cse127 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (< (div .cse127 .cse5) .cse15) (< (div .cse127 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse127 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse128 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse128 .cse5) 0) (< (div .cse128 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse128 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse128 c_~var_1_65~0))))) (or (and .cse26 .cse28) .cse9) (or .cse0 .cse27) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse129 (+ .cse6 v_z_3))) (let ((.cse130 (div .cse129 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse129 .cse5) 0) (< .cse130 |c_ULTIMATE.start_step_#t~bitwise5#1|) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse130) (< 8 v_z_3)))))) (or (forall ((v_z_3 Int)) (let ((.cse131 (+ .cse6 v_z_3))) (let ((.cse132 (div .cse131 c_~var_1_65~0))) (or (not (= 0 (mod .cse131 c_~var_1_65~0))) (= (mod .cse131 .cse5) 0) (< (div .cse131 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse132 .cse15) (< 8 v_z_3) (< .cse132 .cse15))))) .cse0) (or .cse54 .cse9) (or .cse133 .cse0) (or (and .cse133 (or (forall ((v_z_3 Int)) (let ((.cse134 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse134 .cse5) 0) (< (div .cse134 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3) (< (div .cse134 c_~var_1_65~0) .cse15)))) .cse7)) .cse0) (or .cse9 .cse27) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse135 (+ .cse6 v_z_3))) (let ((.cse136 (div .cse135 .cse5))) (or (= (mod .cse135 .cse5) 0) (< .cse136 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse136) (< 8 v_z_3) (< (div .cse135 c_~var_1_65~0) .cse15)))))) (or .cse9 .cse79) (or .cse10 .cse0) (or (and (or (forall ((v_z_3 Int)) (let ((.cse137 (+ .cse6 v_z_3))) (or (not (= (mod .cse137 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3) (< (div .cse137 c_~var_1_65~0) .cse15)))) .cse0) .cse37) .cse7) (or (and (or (forall ((v_z_3 Int)) (or (< v_z_3 0) (< 8 v_z_3) (< (div (+ .cse6 v_z_3) c_~var_1_65~0) .cse15))) .cse0) (forall ((v_z_3 Int)) (let ((.cse138 (+ .cse6 v_z_3))) (or (< (div .cse138 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (< (div .cse138 c_~var_1_65~0) .cse15))))) .cse7) (or .cse21 (forall ((v_z_3 Int)) (let ((.cse139 (+ .cse6 v_z_3))) (or (< .cse3 (+ v_z_3 1)) (= (mod .cse139 .cse5) 0) (< (div .cse139 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse139 c_~var_1_65~0)))))) (forall ((v_z_3 Int)) (let ((.cse140 (+ .cse6 v_z_3))) (or (< (div .cse140 .cse5) .cse15) (not (= (mod .cse140 .cse5) 0)) (< (div .cse140 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3)))) (or (and (forall ((v_z_3 Int)) (let ((.cse141 (+ .cse6 v_z_3))) (let ((.cse142 (div .cse141 .cse5))) (or (not (= 0 (mod .cse141 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse141 .cse5) 0) (< .cse142 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse141 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse142) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse143 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse143 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse143 .cse5) 0) (< (div .cse143 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse143 c_~var_1_65~0) .cse36) (< 8 v_z_3))))) .cse9) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse144 (+ .cse6 v_z_3))) (let ((.cse145 (div .cse144 c_~var_1_65~0))) (or (< (div .cse144 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse145 .cse15) (< 8 v_z_3) (< .cse145 .cse15)))))) (or (forall ((v_z_3 Int)) (let ((.cse146 (+ .cse6 v_z_3))) (or (< (div .cse146 c_~var_1_65~0) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< .cse3 (+ v_z_3 1)) (= (mod .cse146 .cse5) 0) (< (div .cse146 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse146 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse147 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse147 c_~var_1_65~0))) (< (div .cse147 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse147 c_~var_1_65~0) .cse15)))) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse148 (+ .cse6 v_z_3))) (let ((.cse149 (div .cse148 .cse5))) (or (not (= 0 (mod .cse148 c_~var_1_65~0))) (< v_z_3 .cse3) (< .cse149 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse148 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse149) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse150 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse150 c_~var_1_65~0))) (< v_z_3 .cse3) (< (div .cse150 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse150 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) .cse107 .cse108 (forall ((v_z_3 Int)) (let ((.cse151 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse151 c_~var_1_65~0))) (< (div .cse151 .cse5) .cse15) (not (= (mod .cse151 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse151 c_~var_1_65~0) .cse36) (< 8 v_z_3)))))) (or .cse89 .cse7) (or (forall ((v_z_3 Int)) (let ((.cse152 (+ .cse6 v_z_3))) (or (< (div .cse152 .cse5) .cse15) (not (= (mod .cse152 .cse5) 0)) (< v_z_3 0) (< 8 v_z_3)))) .cse21) (or .cse0 (forall ((v_z_3 Int)) (let ((.cse153 (+ .cse6 v_z_3))) (let ((.cse154 (div .cse153 c_~var_1_65~0))) (or (= (mod .cse153 .cse5) 0) (< (div .cse153 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (= .cse154 .cse15) (< 8 v_z_3) (< .cse154 .cse15)))))) (or .cse0 (and (or (forall ((v_z_3 Int)) (let ((.cse155 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse155 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse155 .cse5) 0) (< (div .cse155 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< 8 v_z_3) (< (div .cse155 c_~var_1_65~0) .cse15)))) .cse7) (forall ((v_z_3 Int)) (let ((.cse156 (+ .cse6 v_z_3))) (let ((.cse157 (div .cse156 c_~var_1_65~0))) (or (not (= 0 (mod .cse156 c_~var_1_65~0))) (< v_z_3 .cse3) (= (mod .cse156 .cse5) 0) (< (div .cse156 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (= .cse157 .cse15) (< 8 v_z_3) (< .cse157 .cse15))))))) (forall ((v_z_3 Int)) (let ((.cse158 (+ .cse6 v_z_3))) (or (< (div .cse158 .cse5) .cse15) (< v_z_3 .cse3) (< 8 v_z_3) (< (div .cse158 c_~var_1_65~0) .cse15)))) (or .cse159 .cse9) (forall ((v_z_3 Int)) (let ((.cse160 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse160 c_~var_1_65~0))) (< (div .cse160 .cse5) .cse15) (not (= (mod .cse160 .cse5) 0)) (< (div .cse160 c_~var_1_65~0) .cse36) (< v_z_3 0) (< 8 v_z_3)))) (or .cse98 .cse0) (or .cse9 (and .cse30 (forall ((v_z_3 Int)) (let ((.cse161 (+ .cse6 v_z_3))) (or (< (div .cse161 .cse5) .cse15) (not (= (mod .cse161 .cse5) 0)) (< v_z_3 .cse3) (< (div .cse161 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse163 (+ .cse6 v_z_3))) (let ((.cse162 (div .cse163 .cse5))) (or (< v_z_3 .cse3) (< .cse162 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse163 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse162) (< 8 v_z_3))))) .cse34 (forall ((v_z_3 Int)) (let ((.cse164 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (< (div .cse164 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse164 c_~var_1_65~0) .cse36) (< 8 v_z_3)))))) (or .cse21 .cse37) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse165 (+ .cse6 v_z_3))) (or (< v_z_3 .cse3) (= (mod .cse165 .cse5) 0) (< (div .cse165 .cse5) |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse165 c_~var_1_65~0) .cse36) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse166 (+ .cse6 v_z_3))) (let ((.cse167 (div .cse166 .cse5))) (or (< v_z_3 .cse3) (= (mod .cse166 .cse5) 0) (< .cse167 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< (div .cse166 c_~var_1_65~0) .cse36) (= |c_ULTIMATE.start_step_#t~bitwise5#1| .cse167) (< 8 v_z_3))))))) (or (and .cse159 (or (forall ((v_z_3 Int)) (let ((.cse169 (+ .cse6 v_z_3))) (let ((.cse168 (div .cse169 c_~var_1_65~0))) (or (< .cse168 |c_ULTIMATE.start_step_#t~bitwise5#1|) (not (= (mod .cse169 .cse5) 0)) (= .cse168 |c_ULTIMATE.start_step_#t~bitwise5#1|) (< v_z_3 0) (< 8 v_z_3))))) .cse7)) .cse0) (or .cse49 .cse7) (or .cse9 (and .cse8 .cse102)) (forall ((v_z_3 Int)) (let ((.cse170 (+ .cse6 v_z_3))) (or (not (= 0 (mod .cse170 c_~var_1_65~0))) (< (div .cse170 .cse5) .cse15) (< v_z_3 0) (< 8 v_z_3) (< (div .cse170 c_~var_1_65~0) .cse15)))))))) is different from true [2024-11-22 07:45:22,188 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (mod c_~var_1_66~0 256))) (let ((.cse89 (+ c_~var_1_65~0 1)) (.cse2 (mod c_~var_1_73~0 65536)) (.cse3 (* (- 1) .cse0))) (let ((.cse26 (forall ((v_z_3 Int)) (let ((.cse108 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse108 c_~var_1_65~0))) (= (mod .cse108 .cse2) 0) (< (div .cse108 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse30 (forall ((v_z_3 Int)) (let ((.cse107 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse107 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse107 c_~var_1_65~0) 1) (< 8 v_z_3))))) (.cse11 (forall ((v_z_3 Int)) (let ((.cse106 (+ .cse3 v_z_3))) (or (not (= (mod .cse106 .cse2) 0)) (< (div .cse106 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse28 (forall ((v_z_3 Int)) (let ((.cse105 (+ .cse3 v_z_3))) (or (not (= (mod .cse105 .cse2) 0)) (< (div .cse105 .cse2) 1) (< (div .cse105 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse8 (forall ((v_z_3 Int)) (let ((.cse104 (+ .cse3 v_z_3))) (or (< (div .cse104 .cse2) 1) (< (div .cse104 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse12 (forall ((v_z_3 Int)) (let ((.cse103 (+ .cse3 v_z_3))) (or (not (= (mod .cse103 .cse2) 0)) (< (div .cse103 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse38 (forall ((v_z_3 Int)) (let ((.cse102 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse102 c_~var_1_65~0))) (< (div .cse102 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse51 (forall ((v_z_3 Int)) (let ((.cse101 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse101 c_~var_1_65~0))) (< v_z_3 .cse0) (= (mod .cse101 .cse2) 0) (< (div .cse101 c_~var_1_65~0) 2) (< 8 v_z_3))))) (.cse40 (forall ((v_z_3 Int)) (let ((.cse100 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse100 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse100 .cse2) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse100 .cse2) 0))))) (.cse41 (forall ((v_z_3 Int)) (let ((.cse99 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse99 c_~var_1_65~0))) (< (div .cse99 .cse2) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse20 (forall ((v_z_3 Int)) (let ((.cse98 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse98 .cse2) 0) (< (div .cse98 c_~var_1_65~0) 2) (< 8 v_z_3))))) (.cse25 (forall ((v_z_3 Int)) (let ((.cse97 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse97 c_~var_1_65~0))) (< (div .cse97 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse29 (forall ((v_z_3 Int)) (or (< (div (+ .cse3 v_z_3) c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (.cse16 (forall ((v_z_3 Int)) (or (< v_z_3 .cse0) (< (div (+ .cse3 v_z_3) c_~var_1_65~0) 1) (< 8 v_z_3)))) (.cse43 (forall ((v_z_3 Int)) (let ((.cse96 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse96 c_~var_1_65~0))) (= (mod .cse96 .cse2) 0) (< (div .cse96 .cse2) 1) (< (div .cse96 c_~var_1_65~0) 1) (< 8 v_z_3))))) (.cse22 (forall ((v_z_3 Int)) (let ((.cse95 (+ .cse3 v_z_3))) (or (= (mod .cse95 .cse2) 0) (< (div .cse95 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse18 (forall ((v_z_3 Int)) (let ((.cse94 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse94 .cse2) 0) (< (div .cse94 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse72 (forall ((v_z_3 Int)) (let ((.cse93 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse93 .cse2) 0) (< (div .cse93 c_~var_1_65~0) 1) (< 8 v_z_3))))) (.cse6 (forall ((v_z_3 Int)) (let ((.cse92 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse92 .cse2) 0) (< (div .cse92 .cse2) 1) (< (div .cse92 c_~var_1_65~0) 1) (< 8 v_z_3))))) (.cse7 (< c_~var_1_65~0 0)) (.cse13 (< c_~var_1_65~0 .cse2)) (.cse5 (< .cse2 .cse89)) (.cse17 (forall ((v_z_3 Int)) (let ((.cse91 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse91 c_~var_1_65~0))) (not (= (mod .cse91 .cse2) 0)) (< (div .cse91 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3))))) (.cse31 (forall ((v_z_3 Int)) (let ((.cse90 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse90 c_~var_1_65~0))) (not (= (mod .cse90 .cse2) 0)) (< (div .cse90 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (.cse9 (< 0 .cse89))) (and (forall ((v_z_3 Int)) (let ((.cse1 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse1 .cse2) 0) (< (div .cse1 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse1 .cse2) 0) (= 0 (mod .cse1 c_~var_1_65~0))))) (or (forall ((v_z_3 Int)) (let ((.cse4 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse4 .cse2) 0) (< (div .cse4 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) .cse5) (or .cse6 .cse7) (or (and (or (forall ((v_z_3 Int)) (or (< (div (+ .cse3 v_z_3) c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))) .cse5) .cse8) .cse7) (or .cse9 (forall ((v_z_3 Int)) (let ((.cse10 (+ .cse3 v_z_3))) (or (= (mod .cse10 .cse2) 0) (< (div .cse10 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse10 c_~var_1_65~0)))))) (or (and (or .cse11 .cse7) .cse12) .cse5) (or .cse13 .cse6) (or .cse5 (and (forall ((v_z_3 Int)) (let ((.cse14 (+ .cse3 v_z_3))) (or (not (= (mod .cse14 .cse2) 0)) (< v_z_3 .cse0) (< (div .cse14 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse15 (+ .cse3 v_z_3))) (or (not (= (mod .cse15 .cse2) 0)) (< v_z_3 .cse0) (< (div .cse15 c_~var_1_65~0) 1) (< 8 v_z_3)))) .cse7) (forall ((v_z_3 Int)) (or (< v_z_3 .cse0) (< (div (+ .cse3 v_z_3) c_~var_1_65~0) 2) (< 8 v_z_3))) (or .cse16 .cse7))) (or .cse17 .cse5) (or .cse13 .cse18) (or .cse5 (and (or (forall ((v_z_3 Int)) (let ((.cse19 (+ .cse3 v_z_3))) (or (= (mod .cse19 .cse2) 0) (< (div .cse19 c_~var_1_65~0) 1) (< 8 v_z_3) (< (div .cse19 .cse2) 0)))) .cse7) .cse20)) (or (forall ((v_z_3 Int)) (let ((.cse21 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse21 c_~var_1_65~0))) (< (div .cse21 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse21 .cse2) 0)))) .cse5) (or .cse22 .cse5) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse23 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse23 c_~var_1_65~0))) (not (= (mod .cse23 .cse2) 0)) (< (div .cse23 .cse2) 1) (< v_z_3 0) (< 8 v_z_3))))) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse24 (+ .cse3 v_z_3))) (or (not (= (mod .cse24 .cse2) 0)) (< (div .cse24 .cse2) 1) (< v_z_3 0) (< 8 v_z_3))))) (or (and .cse25 .cse26) .cse9) (forall ((v_z_3 Int)) (let ((.cse27 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse27 .cse2) 0) (< (div .cse27 .cse2) 1) (< (div .cse27 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or .cse28 .cse13) (or .cse29 .cse5) (or (and .cse22 .cse29) .cse9) (or .cse20 .cse5) (or .cse5 .cse30) (or .cse5 (and .cse17 (or .cse31 .cse7))) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse32 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse32 c_~var_1_65~0))) (< v_z_3 .cse0) (= (mod .cse32 .cse2) 0) (< (div .cse32 .cse2) 1) (< 8 v_z_3))))) (forall ((v_z_3 Int)) (let ((.cse33 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse33 c_~var_1_65~0))) (< v_z_3 .cse0) (= (mod .cse33 .cse2) 0) (< (div .cse33 .cse2) 1) (< (div .cse33 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse34 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse34 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse34 .cse2) 0) (< (div .cse34 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) .cse5) (or .cse5 (forall ((v_z_3 Int)) (let ((.cse35 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse35 c_~var_1_65~0))) (= (mod .cse35 .cse2) 0) (< (div .cse35 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse35 .cse2) 0))))) (or (forall ((v_z_3 Int)) (let ((.cse36 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse36 .cse2) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse36 .cse2) 0) (= 0 (mod .cse36 c_~var_1_65~0))))) .cse13) (forall ((v_z_3 Int)) (let ((.cse37 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse37 c_~var_1_65~0))) (not (= (mod .cse37 .cse2) 0)) (< (div .cse37 .cse2) 1) (< (div .cse37 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (or .cse38 .cse9) (or .cse9 .cse26) (or .cse13 (and (forall ((v_z_3 Int)) (let ((.cse39 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse39 c_~var_1_65~0))) (= (mod .cse39 .cse2) 0) (< (div .cse39 .cse2) 1) (< v_z_3 0) (< 8 v_z_3)))) .cse40 .cse41)) (or .cse13 (forall ((v_z_3 Int)) (or (< v_z_3 .cse0) (< (div (+ .cse3 v_z_3) .cse2) 1) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse42 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse42 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse42 .cse2) 0) (< (div .cse42 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3)))) .cse5) (or .cse43 .cse13) (or (forall ((v_z_3 Int)) (let ((.cse44 (+ .cse3 v_z_3))) (or (= (mod .cse44 .cse2) 0) (< (div .cse44 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse44 .cse2) 0)))) .cse5) (or .cse5 .cse26) (forall ((v_z_3 Int)) (let ((.cse45 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse45 c_~var_1_65~0))) (< (div .cse45 .cse2) 1) (< (div .cse45 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3)))) (or .cse5 (and (forall ((v_z_3 Int)) (let ((.cse46 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse46 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse46 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse47 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse47 c_~var_1_65~0))) (not (= (mod .cse47 .cse2) 0)) (< v_z_3 .cse0) (< (div .cse47 c_~var_1_65~0) 1) (< 8 v_z_3)))) .cse7) (forall ((v_z_3 Int)) (let ((.cse48 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse48 c_~var_1_65~0))) (not (= (mod .cse48 .cse2) 0)) (< v_z_3 .cse0) (< (div .cse48 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or .cse30 .cse7))) (or .cse5 (and (or (forall ((v_z_3 Int)) (let ((.cse49 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse49 .cse2) 0) (< v_z_3 0) (< (div .cse49 c_~var_1_65~0) 0) (< 8 v_z_3) (= 0 (mod .cse49 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse50 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse50 .cse2) 0) (< (div .cse50 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse50 c_~var_1_65~0))))))) (or (and .cse28 (or .cse5 .cse11)) .cse7) (or .cse28 .cse7) (or .cse5 (and .cse51 (or (forall ((v_z_3 Int)) (let ((.cse52 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse52 c_~var_1_65~0))) (= (mod .cse52 .cse2) 0) (< (div .cse52 c_~var_1_65~0) 1) (< 8 v_z_3) (< (div .cse52 .cse2) 0)))) .cse7))) (or .cse13 .cse8) (forall ((v_z_3 Int)) (let ((.cse53 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse53 c_~var_1_65~0))) (= (mod .cse53 .cse2) 0) (< (div .cse53 .cse2) 1) (< (div .cse53 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse54 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (< (div .cse54 .cse2) 1) (< (div .cse54 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or .cse25 .cse5) (or .cse12 .cse5) (forall ((v_z_3 Int)) (let ((.cse55 (+ .cse3 v_z_3))) (or (not (= (mod .cse55 .cse2) 0)) (< (div .cse55 .cse2) 1) (< (div .cse55 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse56 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse56 c_~var_1_65~0))) (< (div .cse56 .cse2) 1) (< (div .cse56 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (or (forall ((v_z_3 Int)) (let ((.cse57 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< (div .cse57 .cse2) 1) (< v_z_3 0) (< (div .cse57 c_~var_1_65~0) 0) (< 8 v_z_3) (= 0 (mod .cse57 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse58 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse58 .cse2) 0) (< (div .cse58 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse58 .cse2) 0)))) (or .cse5 (and (forall ((v_z_3 Int)) (let ((.cse59 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (not (= (mod .cse59 .cse2) 0)) (< (div .cse59 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse59 c_~var_1_65~0))))) (or (forall ((v_z_3 Int)) (let ((.cse60 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (not (= (mod .cse60 .cse2) 0)) (< v_z_3 0) (< (div .cse60 c_~var_1_65~0) 0) (< 8 v_z_3) (= 0 (mod .cse60 c_~var_1_65~0))))) .cse7) (forall ((v_z_3 Int)) (let ((.cse61 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< (div .cse61 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse61 c_~var_1_65~0))))) (or (forall ((v_z_3 Int)) (let ((.cse62 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< v_z_3 0) (< (div .cse62 c_~var_1_65~0) 0) (< 8 v_z_3) (= 0 (mod .cse62 c_~var_1_65~0))))) .cse7))) (or (forall ((v_z_3 Int)) (let ((.cse63 (+ .cse3 v_z_3))) (or (< (div .cse63 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse63 .cse2) 0)))) .cse5) (or (forall ((v_z_3 Int)) (let ((.cse64 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< v_z_3 0) (< (div .cse64 c_~var_1_65~0) 0) (< 8 v_z_3) (< (div .cse64 .cse2) 0) (= 0 (mod .cse64 c_~var_1_65~0))))) .cse7) (or .cse9 (and .cse38 (forall ((v_z_3 Int)) (let ((.cse65 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse65 c_~var_1_65~0))) (= (mod .cse65 .cse2) 0) (< (div .cse65 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3)))))) (or .cse9 .cse12) (or .cse38 .cse5) (forall ((v_z_3 Int)) (let ((.cse66 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse66 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse66 .cse2) 0) (< (div .cse66 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse66 .cse2) 0)))) (or (and .cse51 (or (forall ((v_z_3 Int)) (let ((.cse67 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse67 c_~var_1_65~0))) (< v_z_3 .cse0) (= (mod .cse67 .cse2) 0) (< (div .cse67 c_~var_1_65~0) 1) (< 8 v_z_3)))) .cse7)) .cse5) (forall ((v_z_3 Int)) (let ((.cse68 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse68 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse68 .cse2) 1) (< (div .cse68 c_~var_1_65~0) 1) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse69 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< (div .cse69 .cse2) 1) (< (div .cse69 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse69 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse70 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse70 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse70 .cse2) 1) (< (div .cse70 c_~var_1_65~0) 2) (< 8 v_z_3)))) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse71 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (< (div .cse71 .cse2) 1) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse71 c_~var_1_65~0)))))) (or .cse13 (and .cse40 .cse41)) (or (and (or .cse72 .cse7) .cse20) .cse5) (forall ((v_z_3 Int)) (let ((.cse73 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse73 c_~var_1_65~0))) (< .cse0 (+ v_z_3 1)) (= (mod .cse73 .cse2) 0) (< (div .cse73 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3) (< (div .cse73 .cse2) 0)))) (or .cse9 .cse25) (or .cse9 .cse29) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse74 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse74 c_~var_1_65~0))) (< v_z_3 .cse0) (< (div .cse74 .cse2) 1) (< 8 v_z_3))))) (or .cse16 .cse5) (or .cse13 (and (forall ((v_z_3 Int)) (let ((.cse75 (+ .cse3 v_z_3))) (or (= (mod .cse75 .cse2) 0) (< (div .cse75 .cse2) 1) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (or (< (div (+ .cse3 v_z_3) .cse2) 1) (< v_z_3 0) (< 8 v_z_3))) (forall ((v_z_3 Int)) (let ((.cse76 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse76 .cse2) 0) (< v_z_3 0) (< 8 v_z_3) (< (div .cse76 .cse2) 0)))))) (or .cse13 (forall ((v_z_3 Int)) (let ((.cse77 (+ .cse3 v_z_3))) (or (= (mod .cse77 .cse2) 0) (< (div .cse77 .cse2) 1) (< (div .cse77 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3))))) (or .cse43 .cse7) (forall ((v_z_3 Int)) (let ((.cse78 (+ .cse3 v_z_3))) (or (< (div .cse78 .cse2) 1) (< (div .cse78 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (forall ((v_z_3 Int)) (let ((.cse79 (+ .cse3 v_z_3))) (or (= (mod .cse79 .cse2) 0) (< (div .cse79 .cse2) 1) (< (div .cse79 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3)))) (or .cse22 .cse9) (forall ((v_z_3 Int)) (let ((.cse80 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (< (div .cse80 .cse2) 1) (< (div .cse80 c_~var_1_65~0) 1) (< 8 v_z_3)))) (or (and (forall ((v_z_3 Int)) (let ((.cse81 (+ .cse3 v_z_3))) (or (< .cse0 (+ v_z_3 1)) (= (mod .cse81 .cse2) 0) (< (div .cse81 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3) (< (div .cse81 .cse2) 0)))) (or .cse5 .cse18)) .cse7) (forall ((v_z_3 Int)) (let ((.cse82 (+ .cse3 v_z_3))) (or (not (= 0 (mod .cse82 c_~var_1_65~0))) (not (= (mod .cse82 .cse2) 0)) (< (div .cse82 .cse2) 1) (< (div .cse82 c_~var_1_65~0) 1) (< v_z_3 0) (< 8 v_z_3)))) (or (and (or .cse72 .cse5) .cse6) .cse7) (or .cse9 (and (forall ((v_z_3 Int)) (let ((.cse83 (+ .cse3 v_z_3))) (or (< (div .cse83 .cse2) 1) (< (div .cse83 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse83 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse84 (+ .cse3 v_z_3))) (or (not (= (mod .cse84 .cse2) 0)) (< (div .cse84 .cse2) 1) (< (div .cse84 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse84 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse85 (+ .cse3 v_z_3))) (or (< (div .cse85 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse85 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse86 (+ .cse3 v_z_3))) (or (< (div .cse86 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (< (div .cse86 .cse2) 0) (= 0 (mod .cse86 c_~var_1_65~0))))) (forall ((v_z_3 Int)) (let ((.cse87 (+ .cse3 v_z_3))) (or (not (= (mod .cse87 .cse2) 0)) (< (div .cse87 c_~var_1_65~0) 2) (< v_z_3 0) (< 8 v_z_3) (= 0 (mod .cse87 c_~var_1_65~0))))))) (or (forall ((v_z_3 Int)) (let ((.cse88 (+ .cse3 v_z_3))) (or (< v_z_3 .cse0) (= (mod .cse88 .cse2) 0) (< (div .cse88 .cse2) 1) (< 8 v_z_3)))) .cse13) (or .cse31 .cse5) (or .cse17 .cse9) (or .cse31 .cse9))))) is different from false