./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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_fillercodestructure_filler-pe-ci_file-23.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 fe87987a4c3b43d3e816779d5565e54008de65667868ef23ae879587f6bedbbd --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 02:46:44,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 02:46:44,960 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 02:46:44,965 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 02:46:44,966 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 02:46:44,994 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 02:46:44,994 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 02:46:44,995 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 02:46:44,996 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 02:46:44,999 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 02:46:45,000 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 02:46:45,000 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 02:46:45,001 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 02:46:45,001 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 02:46:45,001 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 02:46:45,001 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 02:46:45,002 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 02:46:45,002 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 02:46:45,002 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 02:46:45,002 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 02:46:45,002 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 02:46:45,004 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 02:46:45,005 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 02:46:45,005 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 02:46:45,005 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 02:46:45,005 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 02:46:45,005 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 02:46:45,006 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 02:46:45,006 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 02:46:45,006 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 02:46:45,006 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 02:46:45,006 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 02:46:45,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:46:45,007 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 02:46:45,007 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 02:46:45,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 02:46:45,008 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 02:46:45,008 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 02:46:45,008 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 02:46:45,010 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 02:46:45,011 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 02:46:45,011 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 02:46:45,011 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 -> fe87987a4c3b43d3e816779d5565e54008de65667868ef23ae879587f6bedbbd [2024-11-12 02:46:45,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 02:46:45,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 02:46:45,318 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 02:46:45,320 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 02:46:45,320 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 02:46:45,321 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.i [2024-11-12 02:46:46,755 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 02:46:47,016 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 02:46:47,018 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.i [2024-11-12 02:46:47,034 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35ef5e70b/85b0533e15884bfc94a7018b063251e1/FLAG3e5902e99 [2024-11-12 02:46:47,052 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35ef5e70b/85b0533e15884bfc94a7018b063251e1 [2024-11-12 02:46:47,055 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 02:46:47,057 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 02:46:47,061 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 02:46:47,061 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 02:46:47,067 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 02:46:47,067 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:46:47" (1/1) ... [2024-11-12 02:46:47,068 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b9d6525 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:46:47, skipping insertion in model container [2024-11-12 02:46:47,070 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:46:47" (1/1) ... [2024-11-12 02:46:47,106 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 02:46:47,307 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_fillercodestructure_filler-pe-ci_file-23.i[919,932] [2024-11-12 02:46:47,447 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:46:47,481 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 02:46:47,495 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_fillercodestructure_filler-pe-ci_file-23.i[919,932] [2024-11-12 02:46:47,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 02:46:47,562 INFO L204 MainTranslator]: Completed translation [2024-11-12 02:46:47,563 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:46:47 WrapperNode [2024-11-12 02:46:47,563 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 02:46:47,564 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 02:46:47,564 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 02:46:47,564 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 02:46:47,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:46:47" (1/1) ... [2024-11-12 02:46:47,585 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:46:47" (1/1) ... [2024-11-12 02:46:47,638 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 187 [2024-11-12 02:46:47,639 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 02:46:47,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 02:46:47,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 02:46:47,640 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 02:46:47,652 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:46:47" (1/1) ... [2024-11-12 02:46:47,653 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:46:47" (1/1) ... [2024-11-12 02:46:47,659 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:46:47" (1/1) ... [2024-11-12 02:46:47,684 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-12 02:46:47,684 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:46:47" (1/1) ... [2024-11-12 02:46:47,685 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:46:47" (1/1) ... [2024-11-12 02:46:47,701 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:46:47" (1/1) ... [2024-11-12 02:46:47,705 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:46:47" (1/1) ... [2024-11-12 02:46:47,708 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:46:47" (1/1) ... [2024-11-12 02:46:47,714 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:46:47" (1/1) ... [2024-11-12 02:46:47,719 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 02:46:47,720 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 02:46:47,720 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 02:46:47,720 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 02:46:47,722 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:46:47" (1/1) ... [2024-11-12 02:46:47,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 02:46:47,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:46:47,767 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-12 02:46:47,771 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-12 02:46:47,819 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 02:46:47,820 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 02:46:47,821 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 02:46:47,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 02:46:47,821 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 02:46:47,821 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 02:46:47,919 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 02:46:47,922 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 02:46:48,364 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-12 02:46:48,364 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 02:46:48,377 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 02:46:48,377 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 02:46:48,377 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:46:48 BoogieIcfgContainer [2024-11-12 02:46:48,377 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 02:46:48,379 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 02:46:48,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 02:46:48,382 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 02:46:48,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:46:47" (1/3) ... [2024-11-12 02:46:48,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8b130c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:46:48, skipping insertion in model container [2024-11-12 02:46:48,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:46:47" (2/3) ... [2024-11-12 02:46:48,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f8b130c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:46:48, skipping insertion in model container [2024-11-12 02:46:48,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:46:48" (3/3) ... [2024-11-12 02:46:48,388 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-23.i [2024-11-12 02:46:48,405 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 02:46:48,405 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 02:46:48,477 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 02:46:48,486 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;@540d5fda, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 02:46:48,486 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 02:46:48,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 02:46:48,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-12 02:46:48,505 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:46:48,506 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:46:48,507 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:46:48,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:46:48,513 INFO L85 PathProgramCache]: Analyzing trace with hash -1896747236, now seen corresponding path program 1 times [2024-11-12 02:46:48,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:46:48,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781204730] [2024-11-12 02:46:48,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:46:48,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:46:48,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:48,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 02:46:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:48,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 02:46:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:48,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-12 02:46:48,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:48,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 02:46:48,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:48,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-12 02:46:48,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:48,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 02:46:48,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:48,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 02:46:48,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:48,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2024-11-12 02:46:48,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:48,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-12 02:46:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:48,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-12 02:46:48,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:48,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-12 02:46:48,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:48,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-12 02:46:48,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:48,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-12 02:46:48,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:48,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-12 02:46:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:48,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-12 02:46:48,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:48,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-12 02:46:48,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:48,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-12 02:46:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:48,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-12 02:46:48,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:48,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-12 02:46:48,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:48,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 02:46:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:48,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-12 02:46:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:48,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-12 02:46:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:49,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-12 02:46:49,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:49,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-12 02:46:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:49,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-12 02:46:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:49,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1200 trivial. 0 not checked. [2024-11-12 02:46:49,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 02:46:49,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781204730] [2024-11-12 02:46:49,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781204730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 02:46:49,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 02:46:49,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 02:46:49,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330308502] [2024-11-12 02:46:49,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 02:46:49,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 02:46:49,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 02:46:49,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 02:46:49,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 02:46:49,059 INFO L87 Difference]: Start difference. First operand has 83 states, 55 states have (on average 1.4545454545454546) internal successors, (80), 56 states have internal predecessors, (80), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 02:46:49,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 02:46:49,098 INFO L93 Difference]: Finished difference Result 159 states and 279 transitions. [2024-11-12 02:46:49,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 02:46:49,101 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) Word has length 164 [2024-11-12 02:46:49,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 02:46:49,108 INFO L225 Difference]: With dead ends: 159 [2024-11-12 02:46:49,109 INFO L226 Difference]: Without dead ends: 79 [2024-11-12 02:46:49,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 77 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-12 02:46:49,119 INFO L435 NwaCegarLoop]: 122 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, 122 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-12 02:46:49,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 02:46:49,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-12 02:46:49,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-12 02:46:49,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.3846153846153846) internal successors, (72), 52 states have internal predecessors, (72), 25 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 25 states have call predecessors, (25), 25 states have call successors, (25) [2024-11-12 02:46:49,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 122 transitions. [2024-11-12 02:46:49,168 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 122 transitions. Word has length 164 [2024-11-12 02:46:49,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 02:46:49,169 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 122 transitions. [2024-11-12 02:46:49,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (25), 1 states have call predecessors, (25), 1 states have return successors, (25), 1 states have call predecessors, (25), 2 states have call successors, (25) [2024-11-12 02:46:49,169 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 122 transitions. [2024-11-12 02:46:49,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-12 02:46:49,172 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 02:46:49,173 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-12 02:46:49,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 02:46:49,177 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 02:46:49,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 02:46:49,178 INFO L85 PathProgramCache]: Analyzing trace with hash 640768746, now seen corresponding path program 1 times [2024-11-12 02:46:49,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 02:46:49,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201408213] [2024-11-12 02:46:49,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:46:49,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 02:46:49,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 02:46:49,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2027939170] [2024-11-12 02:46:49,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 02:46:49,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 02:46:49,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 02:46:49,495 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-12 02:46:49,496 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-12 02:46:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 02:46:49,730 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-12 02:46:49,746 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 02:46:52,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 869 proven. 44 refuted. 0 times theorem prover too weak. 287 trivial. 0 not checked. [2024-11-12 02:46:52,005 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 02:47:13,601 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (mod c_~var_1_13~0 256))) (or (let ((.cse11 (div c_~last_1_var_1_19~0 c_~var_1_20~0))) (let ((.cse10 (= (mod c_~last_1_var_1_19~0 c_~var_1_20~0) 0)) (.cse2 (+ 65536 .cse11)) (.cse0 (< 0 (+ c_~last_1_var_1_19~0 1))) (.cse6 (mod c_~var_1_22~0 65536))) (let ((.cse9 (< c_~var_1_20~0 0)) (.cse122 (and (or .cse0 (forall ((v_z_15 Int) (v_y_15 Int)) (let ((.cse160 (+ (* v_z_15 65535) (* 65536 v_y_15))) (.cse161 (+ v_z_15 .cse6))) (or (= (mod c_~last_1_var_1_19~0 .cse160) 0) (< .cse160 0) (< v_z_15 0) (< .cse11 .cse161) (< .cse160 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (= .cse11 .cse161) (< 65535 v_z_15) (< (div c_~last_1_var_1_19~0 .cse160) .cse161))))) (forall ((v_z_15 Int)) (let ((.cse162 (+ v_z_15 .cse6))) (or (< v_z_15 0) (< .cse11 .cse162) (= .cse11 .cse162) (< 65535 v_z_15) (forall ((v_y_15 Int)) (let ((.cse163 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse164 (div c_~last_1_var_1_19~0 .cse163))) (or (< .cse163 0) (< .cse4 .cse163) (< .cse163 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse164 .cse162) (= .cse164 .cse162)))))))) (forall ((v_z_15 Int)) (let ((.cse165 (+ v_z_15 .cse6))) (or (= .cse2 .cse165) (< .cse165 65536) (< .cse2 .cse165) (forall ((v_y_15 Int)) (let ((.cse166 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse167 (+ 65536 (div c_~last_1_var_1_19~0 .cse166)))) (or (< .cse166 0) (< .cse4 .cse166) (< .cse166 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse167 .cse165) (= .cse167 .cse165))))) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse168 (+ v_z_15 .cse6))) (or (= .cse2 .cse168) (< .cse168 65536) (< .cse2 .cse168) (< 65535 v_z_15) (forall ((v_y_15 Int)) (let ((.cse169 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse170 (div c_~last_1_var_1_19~0 .cse169))) (or (< .cse169 0) (< .cse4 .cse169) (< .cse169 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse170 .cse168) (= .cse170 .cse168)))))))) (forall ((v_z_15 Int)) (let ((.cse171 (+ v_z_15 .cse6))) (or (< .cse11 .cse171) (< .cse171 65536) (forall ((v_y_15 Int)) (let ((.cse172 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse173 (+ 65536 (div c_~last_1_var_1_19~0 .cse172)))) (or (< .cse172 0) (< .cse4 .cse172) (< .cse172 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse173 .cse171) (= .cse173 .cse171))))) (= .cse11 .cse171) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse174 (+ v_z_15 .cse6))) (or (= .cse2 .cse174) (< .cse174 65536) (< .cse2 .cse174) (< 65535 v_z_15) (forall ((v_y_15 Int)) (let ((.cse175 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse175 0) (< .cse4 .cse175) (< .cse175 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse175) .cse174))))))) (forall ((v_z_15 Int)) (let ((.cse176 (+ v_z_15 .cse6))) (or (< .cse11 .cse176) (< .cse176 65536) (< 65535 v_z_15) (forall ((v_y_15 Int)) (let ((.cse177 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse178 (div c_~last_1_var_1_19~0 .cse177))) (or (< .cse177 0) (< .cse4 .cse177) (< .cse177 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse178 .cse176) (= .cse178 .cse176)))))))) (forall ((v_z_15 Int)) (let ((.cse179 (+ v_z_15 .cse6))) (or (< .cse11 .cse179) (< .cse179 65536) (forall ((v_y_15 Int)) (let ((.cse180 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse181 (+ 65536 (div c_~last_1_var_1_19~0 .cse180)))) (or (< .cse180 0) (< .cse4 .cse180) (< .cse180 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse181 .cse179) (= .cse181 .cse179))))) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse182 (+ v_z_15 .cse6))) (or (< .cse11 .cse182) (< .cse182 65536) (= .cse11 .cse182) (< 65535 v_z_15) (forall ((v_y_15 Int)) (let ((.cse183 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse183 0) (< .cse4 .cse183) (< .cse183 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse183) .cse182))))))) (or (forall ((v_z_15 Int) (v_y_15 Int)) (let ((.cse184 (+ (* v_z_15 65535) (* 65536 v_y_15))) (.cse185 (+ v_z_15 .cse6))) (or (= (mod c_~last_1_var_1_19~0 .cse184) 0) (< .cse184 0) (< v_z_15 0) (< .cse11 .cse185) (< .cse184 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 .cse185) (= .cse11 .cse185) (< (div c_~last_1_var_1_19~0 .cse184) .cse185)))) .cse0) (forall ((v_z_15 Int)) (let ((.cse186 (+ v_z_15 .cse6))) (or (< .cse11 .cse186) (< .cse186 65536) (< 65535 v_z_15) (forall ((v_y_15 Int)) (let ((.cse187 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse187 0) (< .cse4 .cse187) (< .cse187 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse187) .cse186))))))) (forall ((v_z_15 Int)) (let ((.cse188 (+ v_z_15 .cse6))) (or (< v_z_15 0) (< .cse11 .cse188) (< 65535 .cse188) (= .cse11 .cse188) (forall ((v_y_15 Int)) (let ((.cse189 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse190 (div c_~last_1_var_1_19~0 .cse189))) (or (< .cse189 0) (< .cse4 .cse189) (< .cse189 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse190 .cse188) (= .cse190 .cse188)))))))))) (.cse61 (not .cse10)) (.cse5 (+ .cse11 65535))) (and (or .cse0 (and (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse3 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse1 (+ .cse6 v_z_6))) (or (= .cse1 .cse2) (< .cse3 0) (< .cse2 .cse1) (< .cse4 .cse3) (< .cse3 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 v_z_6) (< .cse1 65536) (= .cse5 .cse1)))) (or (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse7 (+ .cse6 v_z_6)) (.cse8 (+ (* 65536 v_y_6) (* v_z_6 65535)))) (or (< .cse2 .cse7) (< .cse4 .cse8) (< .cse8 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 v_z_6) (< .cse7 65536) (< .cse8 c_~var_1_20~0)))) .cse9)) .cse10) (or (and (forall ((v_z_15 Int)) (let ((.cse12 (+ v_z_15 .cse6))) (or (< v_z_15 0) (< .cse11 .cse12) (= .cse11 .cse12) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11) (forall ((v_y_15 Int)) (let ((.cse13 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (= (mod c_~last_1_var_1_19~0 .cse13) 0) (< .cse13 0) (< .cse13 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse13) .cse12))))))) (forall ((v_z_15 Int)) (let ((.cse14 (+ v_z_15 .cse6))) (or (< v_z_15 0) (< .cse11 .cse14) (< 65535 .cse14) (forall ((v_y_15 Int)) (let ((.cse15 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse16 (div c_~last_1_var_1_19~0 .cse15))) (or (< .cse15 0) (< .cse15 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse16 .cse14) (= .cse16 .cse14))))) (= .cse11 .cse14) (= (+ v_z_15 .cse6 1) .cse11)))) (forall ((v_z_15 Int)) (let ((.cse17 (+ v_z_15 .cse6))) (or (< v_z_15 0) (< .cse11 .cse17) (forall ((v_y_15 Int)) (let ((.cse18 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse19 (div c_~last_1_var_1_19~0 .cse18))) (or (< .cse18 0) (< .cse18 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse19 .cse17) (= .cse19 .cse17))))) (= .cse11 .cse17) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11)))) (forall ((v_z_15 Int)) (let ((.cse20 (+ v_z_15 .cse6))) (or (< v_z_15 0) (< .cse11 .cse20) (< 65535 .cse20) (= .cse11 .cse20) (= (+ v_z_15 .cse6 1) .cse11) (forall ((v_y_15 Int)) (let ((.cse21 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (= (mod c_~last_1_var_1_19~0 .cse21) 0) (< .cse21 0) (< .cse21 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse21) .cse20))))))) (or .cse9 (and (forall ((v_z_15 Int)) (let ((.cse22 (+ v_z_15 .cse6))) (or (< v_z_15 0) (< .cse11 .cse22) (< 65535 v_z_15) (forall ((v_y_15 Int)) (let ((.cse23 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse23 0) (< .cse23 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse23) .cse22))))))) (forall ((v_z_15 Int)) (let ((.cse24 (+ v_z_15 .cse6))) (or (< v_z_15 0) (< .cse11 .cse24) (forall ((v_y_15 Int)) (let ((.cse25 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse26 (div c_~last_1_var_1_19~0 .cse25))) (or (< .cse25 0) (< .cse25 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse26 .cse24) (= .cse26 .cse24))))) (< 65535 v_z_15))))))) .cse0 .cse10) (forall ((v_z_9 Int)) (let ((.cse27 (+ .cse6 v_z_9 1))) (or (< .cse11 .cse27) (forall ((v_y_9 Int)) (let ((.cse28 (* 65536 v_y_9)) (.cse29 (* v_z_9 65535))) (let ((.cse30 (+ .cse28 .cse29))) (or (< c_~var_1_20~0 (+ .cse28 .cse29 1)) (< .cse30 0) (< .cse4 .cse30) (< .cse30 |c_ULTIMATE.start_step_~stepLocal_4~0#1|))))) (= .cse11 .cse27) (< 65535 v_z_9) (< (+ .cse6 v_z_9) 65536)))) (forall ((v_z_9 Int)) (let ((.cse31 (+ .cse6 v_z_9 1))) (or (< .cse11 .cse31) (< v_z_9 0) (forall ((v_y_9 Int)) (let ((.cse32 (* 65536 v_y_9)) (.cse33 (* v_z_9 65535))) (let ((.cse34 (+ .cse32 .cse33))) (let ((.cse35 (div c_~last_1_var_1_19~0 .cse34)) (.cse36 (+ .cse6 v_z_9))) (or (< c_~var_1_20~0 (+ .cse32 .cse33 1)) (< .cse34 0) (= .cse35 .cse36) (< .cse4 .cse34) (< .cse35 .cse36) (< .cse34 |c_ULTIMATE.start_step_~stepLocal_4~0#1|)))))) (= .cse11 .cse31) (< 65535 v_z_9)))) (forall ((v_z_15 Int)) (let ((.cse37 (+ v_z_15 .cse6))) (or (< .cse11 .cse37) (< .cse37 65536) (= .cse11 .cse37) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11) (forall ((v_y_15 Int)) (let ((.cse38 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse38 0) (< .cse4 .cse38) (< .cse38 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse38) .cse37))))))) (forall ((v_z_9 Int)) (let ((.cse39 (+ .cse6 v_z_9))) (or (= .cse5 .cse39) (< .cse5 .cse39) (< 65535 v_z_9) (forall ((v_y_9 Int)) (let ((.cse40 (* 65536 v_y_9)) (.cse41 (* v_z_9 65535))) (let ((.cse42 (+ .cse40 .cse41))) (or (< c_~var_1_20~0 (+ .cse40 .cse41 1)) (< .cse42 0) (< .cse4 .cse42) (< (div c_~last_1_var_1_19~0 .cse42) .cse39) (< .cse42 |c_ULTIMATE.start_step_~stepLocal_4~0#1|))))) (< .cse39 65536)))) (forall ((v_z_15 Int)) (let ((.cse43 (+ v_z_15 .cse6))) (or (= .cse5 .cse43) (= .cse2 .cse43) (< .cse43 65536) (< .cse2 .cse43) (forall ((v_y_15 Int)) (let ((.cse44 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse45 (+ 65536 (div c_~last_1_var_1_19~0 .cse44)))) (or (< .cse44 0) (< .cse4 .cse44) (< .cse44 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse45 .cse43) (= .cse45 .cse43))))) (< 65535 v_z_15)))) (forall ((v_z_15 Int)) (let ((.cse46 (+ v_z_15 .cse6))) (or (< .cse11 .cse46) (< .cse46 65536) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11) (forall ((v_y_15 Int)) (let ((.cse47 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse48 (div c_~last_1_var_1_19~0 .cse47))) (or (< .cse47 0) (< .cse4 .cse47) (< .cse47 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse48 .cse46) (= .cse48 .cse46)))))))) (or (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse49 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse50 (+ .cse6 v_z_6))) (or (< .cse4 .cse49) (< .cse49 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< v_z_6 0) (< 65535 v_z_6) (< .cse11 .cse50) (< .cse49 c_~var_1_20~0) (= .cse50 .cse11)))) .cse9) (forall ((v_z_15 Int)) (let ((.cse51 (+ v_z_15 .cse6))) (or (< .cse11 .cse51) (< .cse51 65536) (forall ((v_y_15 Int)) (let ((.cse52 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse53 (+ 65536 (div c_~last_1_var_1_19~0 .cse52)))) (or (< .cse52 0) (< .cse4 .cse52) (< .cse52 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse53 .cse51) (= .cse53 .cse51))))) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11)))) (or .cse0 (and (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse54 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse55 (+ .cse6 v_z_6))) (or (< .cse54 0) (< .cse4 .cse54) (< .cse54 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< v_z_6 0) (< 65535 v_z_6) (< .cse11 .cse55) (= .cse55 .cse11) (= (+ .cse6 v_z_6 1) .cse11)))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse56 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse57 (+ .cse6 v_z_6))) (or (< .cse56 0) (< .cse4 .cse56) (< .cse56 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 v_z_6) (< .cse11 .cse57) (< .cse57 65536)))) (or (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse58 (+ (* 65536 v_y_6) (* v_z_6 65535)))) (or (< .cse4 .cse58) (< .cse58 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< v_z_6 0) (< 65535 v_z_6) (< .cse11 (+ .cse6 v_z_6)) (< .cse58 c_~var_1_20~0)))) .cse9) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse59 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse60 (+ .cse6 v_z_6))) (or (< .cse59 0) (< .cse4 .cse59) (< .cse59 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 v_z_6) (< .cse11 .cse60) (< .cse60 65536) (= (+ .cse6 v_z_6 1) .cse11))))) .cse10) (or .cse61 (and (forall ((v_z_9 Int)) (let ((.cse65 (+ .cse6 v_z_9))) (or (forall ((v_y_9 Int)) (let ((.cse62 (* 65536 v_y_9)) (.cse63 (* v_z_9 65535))) (let ((.cse64 (+ .cse62 .cse63))) (or (< c_~var_1_20~0 (+ .cse62 .cse63 1)) (< .cse64 0) (< .cse4 .cse64) (< .cse64 |c_ULTIMATE.start_step_~stepLocal_4~0#1|))))) (< .cse5 .cse65) (< 65535 v_z_9) (< .cse65 65536)))) (forall ((v_z_9 Int)) (let ((.cse70 (+ .cse6 v_z_9))) (or (forall ((v_y_9 Int)) (let ((.cse66 (* 65536 v_y_9)) (.cse67 (* v_z_9 65535))) (let ((.cse68 (+ .cse66 .cse67))) (let ((.cse69 (div c_~last_1_var_1_19~0 .cse68))) (or (< c_~var_1_20~0 (+ .cse66 .cse67 1)) (< .cse68 0) (= .cse69 .cse70) (< .cse4 .cse68) (< .cse69 .cse70) (< .cse68 |c_ULTIMATE.start_step_~stepLocal_4~0#1|)))))) (< .cse5 .cse70) (< 65535 v_z_9) (< .cse70 65536)))) (forall ((v_z_9 Int)) (let ((.cse71 (+ .cse6 v_z_9))) (or (< .cse5 .cse71) (< 65535 v_z_9) (forall ((v_y_9 Int)) (let ((.cse72 (* 65536 v_y_9)) (.cse73 (* v_z_9 65535))) (let ((.cse74 (+ .cse72 .cse73))) (or (< c_~var_1_20~0 (+ .cse72 .cse73 1)) (< .cse74 0) (< .cse4 .cse74) (< (div c_~last_1_var_1_19~0 .cse74) .cse71) (< .cse74 |c_ULTIMATE.start_step_~stepLocal_4~0#1|))))) (< .cse71 65536)))) (forall ((v_z_9 Int)) (or (< .cse11 (+ .cse6 v_z_9 1)) (< v_z_9 0) (forall ((v_y_9 Int)) (let ((.cse75 (* 65536 v_y_9)) (.cse76 (* v_z_9 65535))) (let ((.cse77 (+ .cse75 .cse76))) (let ((.cse78 (div c_~last_1_var_1_19~0 .cse77)) (.cse79 (+ .cse6 v_z_9))) (or (< c_~var_1_20~0 (+ .cse75 .cse76 1)) (< .cse77 0) (= .cse78 .cse79) (< .cse4 .cse77) (< .cse78 .cse79) (< .cse77 |c_ULTIMATE.start_step_~stepLocal_4~0#1|)))))) (< 65535 v_z_9))))) (forall ((v_z_15 Int)) (let ((.cse80 (+ v_z_15 .cse6))) (or (= .cse5 .cse80) (= .cse2 .cse80) (< .cse80 65536) (< .cse2 .cse80) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11) (forall ((v_y_15 Int)) (let ((.cse81 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse81 0) (< .cse4 .cse81) (< .cse81 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse81) .cse80))))))) (forall ((v_z_15 Int)) (let ((.cse82 (+ v_z_15 .cse6))) (or (< .cse11 .cse82) (< .cse82 65536) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11) (forall ((v_y_15 Int)) (let ((.cse83 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse83 0) (< .cse4 .cse83) (< .cse83 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse83) .cse82))))))) (or .cse61 (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse84 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse85 (+ .cse6 v_z_6))) (or (< .cse84 0) (< .cse4 .cse84) (< .cse84 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< v_z_6 0) (< 65535 v_z_6) (< .cse11 .cse85) (< .cse84 c_~var_1_20~0) (= .cse85 .cse11))))) (forall ((v_z_15 Int)) (let ((.cse86 (+ v_z_15 .cse6))) (or (= .cse5 .cse86) (= .cse2 .cse86) (< .cse86 65536) (< .cse2 .cse86) (< 65535 v_z_15) (forall ((v_y_15 Int)) (let ((.cse87 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (or (< .cse87 0) (< .cse4 .cse87) (< .cse87 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< (div c_~last_1_var_1_19~0 .cse87) .cse86))))))) (forall ((v_z_15 Int)) (let ((.cse88 (+ v_z_15 .cse6))) (or (< .cse11 .cse88) (< .cse88 65536) (forall ((v_y_15 Int)) (let ((.cse89 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse90 (+ 65536 (div c_~last_1_var_1_19~0 .cse89)))) (or (< .cse89 0) (< .cse4 .cse89) (< .cse89 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse90 .cse88) (= .cse90 .cse88))))) (= .cse11 .cse88) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11)))) (forall ((v_z_15 Int)) (let ((.cse91 (+ v_z_15 .cse6))) (or (= .cse5 .cse91) (= .cse2 .cse91) (< .cse91 65536) (< .cse2 .cse91) (< 65535 v_z_15) (forall ((v_y_15 Int)) (let ((.cse92 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse93 (div c_~last_1_var_1_19~0 .cse92))) (or (< .cse92 0) (< .cse4 .cse92) (< .cse92 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse93 .cse91) (= .cse93 .cse91)))))))) (forall ((v_z_15 Int)) (let ((.cse94 (+ v_z_15 .cse6))) (or (< v_z_15 0) (< .cse11 .cse94) (< 65535 .cse94) (= .cse11 .cse94) (= (+ v_z_15 .cse6 1) .cse11) (forall ((v_y_15 Int)) (let ((.cse95 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse96 (div c_~last_1_var_1_19~0 .cse95))) (or (< .cse95 0) (< .cse4 .cse95) (< .cse95 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse96 .cse94) (= .cse96 .cse94)))))))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse97 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse98 (+ .cse6 v_z_6))) (or (< .cse97 0) (< .cse4 .cse97) (< .cse97 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< v_z_6 0) (< 65535 v_z_6) (< .cse11 .cse98) (< .cse97 c_~var_1_20~0) (= .cse98 .cse11) (= (+ .cse6 v_z_6 1) .cse11)))) (forall ((v_z_9 Int)) (let ((.cse102 (+ .cse6 v_z_9))) (or (forall ((v_y_9 Int)) (let ((.cse99 (* 65536 v_y_9)) (.cse100 (* v_z_9 65535))) (let ((.cse101 (+ .cse99 .cse100))) (or (< c_~var_1_20~0 (+ .cse99 .cse100 1)) (< .cse101 0) (< .cse4 .cse101) (< .cse101 |c_ULTIMATE.start_step_~stepLocal_4~0#1|))))) (= .cse5 .cse102) (< .cse5 .cse102) (< 65535 v_z_9) (< .cse102 65536)))) (forall ((v_z_15 Int)) (let ((.cse103 (+ v_z_15 .cse6))) (or (= .cse5 .cse103) (= .cse2 .cse103) (< .cse103 65536) (< .cse2 .cse103) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11) (forall ((v_y_15 Int)) (let ((.cse104 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse105 (div c_~last_1_var_1_19~0 .cse104))) (or (< .cse104 0) (< .cse4 .cse104) (< .cse104 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse105 .cse103) (= .cse105 .cse103)))))))) (or (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse106 (+ .cse6 v_z_6)) (.cse107 (+ (* 65536 v_y_6) (* v_z_6 65535)))) (or (= .cse106 .cse2) (< .cse2 .cse106) (< .cse4 .cse107) (< .cse107 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 v_z_6) (< .cse106 65536) (< .cse107 c_~var_1_20~0)))) .cse9) (or (forall ((v_z_15 Int) (v_y_15 Int)) (let ((.cse108 (+ (* v_z_15 65535) (* 65536 v_y_15))) (.cse109 (+ v_z_15 .cse6))) (or (= (mod c_~last_1_var_1_19~0 .cse108) 0) (< .cse108 0) (< v_z_15 0) (< .cse11 .cse109) (< .cse108 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 .cse109) (= .cse11 .cse109) (= (+ v_z_15 .cse6 1) .cse11) (< (div c_~last_1_var_1_19~0 .cse108) .cse109)))) .cse0) (forall ((v_z_9 Int)) (let ((.cse110 (+ .cse6 v_z_9))) (or (= .cse5 .cse110) (forall ((v_y_9 Int)) (let ((.cse111 (* 65536 v_y_9)) (.cse112 (* v_z_9 65535))) (let ((.cse113 (+ .cse111 .cse112))) (let ((.cse114 (div c_~last_1_var_1_19~0 .cse113))) (or (< c_~var_1_20~0 (+ .cse111 .cse112 1)) (< .cse113 0) (= .cse114 .cse110) (< .cse4 .cse113) (< .cse114 .cse110) (< .cse113 |c_ULTIMATE.start_step_~stepLocal_4~0#1|)))))) (< .cse5 .cse110) (< 65535 v_z_9) (< .cse110 65536)))) (or (forall ((v_z_15 Int) (v_y_15 Int)) (let ((.cse115 (+ (* v_z_15 65535) (* 65536 v_y_15))) (.cse116 (+ v_z_15 .cse6))) (or (= (mod c_~last_1_var_1_19~0 .cse115) 0) (< .cse115 0) (< v_z_15 0) (< .cse11 .cse116) (< .cse115 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (= .cse11 .cse116) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11) (< (div c_~last_1_var_1_19~0 .cse115) .cse116)))) .cse0) (forall ((v_z_15 Int)) (let ((.cse117 (+ v_z_15 .cse6))) (or (< v_z_15 0) (< .cse11 .cse117) (= .cse11 .cse117) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11) (forall ((v_y_15 Int)) (let ((.cse118 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse119 (div c_~last_1_var_1_19~0 .cse118))) (or (< .cse118 0) (< .cse4 .cse118) (< .cse118 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse119 .cse117) (= .cse119 .cse117)))))))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse120 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse121 (+ .cse6 v_z_6))) (or (< .cse120 0) (< .cse4 .cse120) (< .cse120 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 v_z_6) (< .cse11 .cse121) (< .cse121 65536) (< .cse120 c_~var_1_20~0) (= .cse121 .cse11)))) (or .cse9 .cse122) (forall ((v_z_9 Int)) (let ((.cse123 (+ .cse6 v_z_9 1)) (.cse128 (+ .cse6 v_z_9))) (or (< .cse11 .cse123) (< v_z_9 0) (forall ((v_y_9 Int)) (let ((.cse124 (* 65536 v_y_9)) (.cse125 (* v_z_9 65535))) (let ((.cse126 (+ .cse124 .cse125))) (let ((.cse127 (div c_~last_1_var_1_19~0 .cse126))) (or (< c_~var_1_20~0 (+ .cse124 .cse125 1)) (< .cse126 0) (= .cse127 .cse128) (< .cse4 .cse126) (< .cse127 .cse128) (< .cse126 |c_ULTIMATE.start_step_~stepLocal_4~0#1|)))))) (= .cse11 .cse123) (< 65535 .cse128)))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse130 (+ (* 65536 v_y_6) (* v_z_6 65535))) (.cse129 (+ .cse6 v_z_6))) (or (= .cse129 .cse2) (< .cse130 0) (< .cse2 .cse129) (< .cse4 .cse130) (< .cse130 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 v_z_6) (< .cse129 65536) (< .cse130 c_~var_1_20~0) (= .cse5 .cse129)))) (or .cse9 (and (forall ((v_z_12 Int)) (or (< 65535 v_z_12) (< v_z_12 0) (forall ((v_y_12 Int)) (let ((.cse134 (* 65536 v_y_12)) (.cse135 (* v_z_12 65535))) (let ((.cse133 (+ .cse134 .cse135))) (let ((.cse132 (div c_~last_1_var_1_19~0 .cse133)) (.cse131 (+ v_z_12 .cse6))) (or (= .cse131 .cse132) (< .cse132 .cse131) (< .cse133 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< c_~var_1_20~0 (+ .cse134 .cse135 1)) (< .cse4 .cse133) (< .cse133 0)))))))) (or (forall ((v_z_14 Int) (v_y_14 Int)) (let ((.cse137 (* 65536 v_y_14)) (.cse138 (* v_z_14 65535))) (let ((.cse136 (+ .cse137 .cse138))) (or (< .cse136 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (= (mod c_~last_1_var_1_19~0 .cse136) 0) (< .cse136 0) (< c_~var_1_20~0 (+ .cse137 .cse138 1)) (< 65535 v_z_14) (< (div c_~last_1_var_1_19~0 .cse136) (+ v_z_14 .cse6)) (< v_z_14 0))))) .cse0) (forall ((v_z_12 Int)) (let ((.cse139 (+ v_z_12 .cse6))) (or (forall ((v_y_12 Int)) (let ((.cse143 (* 65536 v_y_12)) (.cse144 (* v_z_12 65535))) (let ((.cse141 (+ .cse143 .cse144))) (let ((.cse140 (div c_~last_1_var_1_19~0 .cse141))) (let ((.cse142 (+ 65536 .cse140))) (or (= .cse139 .cse140) (< .cse141 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (= .cse139 .cse142) (< c_~var_1_20~0 (+ .cse143 .cse144 1)) (< .cse4 .cse141) (< .cse141 0) (< .cse142 .cse139))))))) (< 65535 v_z_12) (< .cse139 65536)))) (forall ((v_z_12 Int)) (let ((.cse146 (+ v_z_12 .cse6))) (or (< 65535 v_z_12) (forall ((v_y_12 Int)) (let ((.cse148 (* 65536 v_y_12)) (.cse149 (* v_z_12 65535))) (let ((.cse145 (+ .cse148 .cse149))) (let ((.cse147 (+ 65536 (div c_~last_1_var_1_19~0 .cse145)))) (or (< .cse145 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (= .cse146 .cse147) (< c_~var_1_20~0 (+ .cse148 .cse149 1)) (< .cse4 .cse145) (< .cse145 0) (< .cse147 .cse146)))))) (< .cse146 65536)))))) (forall ((v_z_9 Int)) (or (< .cse11 (+ .cse6 v_z_9 1)) (forall ((v_y_9 Int)) (let ((.cse150 (* 65536 v_y_9)) (.cse151 (* v_z_9 65535))) (let ((.cse152 (+ .cse150 .cse151))) (or (< c_~var_1_20~0 (+ .cse150 .cse151 1)) (< .cse152 0) (< .cse4 .cse152) (< .cse152 |c_ULTIMATE.start_step_~stepLocal_4~0#1|))))) (< 65535 v_z_9) (< (+ .cse6 v_z_9) 65536))) (or .cse61 .cse122) (or .cse61 (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse153 (+ .cse6 v_z_6)) (.cse154 (+ (* 65536 v_y_6) (* v_z_6 65535)))) (or (= .cse153 .cse2) (< .cse154 0) (< .cse2 .cse153) (< .cse4 .cse154) (< .cse154 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 v_z_6) (< .cse153 65536) (< .cse154 c_~var_1_20~0))))) (forall ((v_y_6 Int) (v_z_6 Int)) (let ((.cse156 (+ .cse6 v_z_6)) (.cse155 (+ (* 65536 v_y_6) (* v_z_6 65535)))) (or (< .cse155 0) (< .cse4 .cse155) (< .cse155 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< 65535 v_z_6) (< .cse11 .cse156) (< .cse156 65536) (< .cse155 c_~var_1_20~0)))) (forall ((v_z_15 Int)) (let ((.cse157 (+ v_z_15 .cse6))) (or (= .cse5 .cse157) (= .cse2 .cse157) (< .cse157 65536) (< .cse2 .cse157) (forall ((v_y_15 Int)) (let ((.cse158 (+ (* v_z_15 65535) (* 65536 v_y_15)))) (let ((.cse159 (+ 65536 (div c_~last_1_var_1_19~0 .cse158)))) (or (< .cse158 0) (< .cse4 .cse158) (< .cse158 |c_ULTIMATE.start_step_~stepLocal_4~0#1|) (< .cse159 .cse157) (= .cse159 .cse157))))) (< 65535 v_z_15) (= (+ v_z_15 .cse6 1) .cse11)))))))) (< .cse4 (mod c_~var_1_40~0 256)))) is different from true [2024-11-12 02:48:09,952 WARN L286 SmtUtils]: Spent 14.55s on a formula simplification. DAG size of input: 226 DAG size of output: 223 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)