./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/weaver/chl-sre-symm.wvr.c --full-output --traceabstraction.positions.where.we.compute.the.hoare.annotation All --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 448d4d75 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 ../../../trunk/examples/svcomp/weaver/chl-sre-symm.wvr.c -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 c361ebc03d879240d418527d643e8a7b3c7ac084ceb3e66857b21a687a1c7f90 --traceabstraction.positions.where.we.compute.the.hoare.annotation All --- Real Ultimate output --- This is Ultimate 0.2.4-tmp.dk.owicki-witnesses-448d4d7-m [2024-02-20 11:53:54,033 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-02-20 11:53:54,081 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-02-20 11:53:54,089 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-02-20 11:53:54,090 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-02-20 11:53:54,118 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-02-20 11:53:54,122 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-02-20 11:53:54,122 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-02-20 11:53:54,123 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-02-20 11:53:54,123 INFO L153 SettingsManager]: * Use memory slicer=true [2024-02-20 11:53:54,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-02-20 11:53:54,124 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-02-20 11:53:54,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-02-20 11:53:54,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-02-20 11:53:54,127 INFO L153 SettingsManager]: * Use SBE=true [2024-02-20 11:53:54,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-02-20 11:53:54,128 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-02-20 11:53:54,132 INFO L153 SettingsManager]: * sizeof long=4 [2024-02-20 11:53:54,132 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-02-20 11:53:54,132 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-02-20 11:53:54,132 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-02-20 11:53:54,133 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-02-20 11:53:54,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-02-20 11:53:54,133 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-02-20 11:53:54,133 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-02-20 11:53:54,133 INFO L153 SettingsManager]: * sizeof long double=12 [2024-02-20 11:53:54,134 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-02-20 11:53:54,134 INFO L153 SettingsManager]: * Use constant arrays=true [2024-02-20 11:53:54,134 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-02-20 11:53:54,134 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-02-20 11:53:54,134 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-02-20 11:53:54,135 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-02-20 11:53:54,135 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:53:54,135 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-02-20 11:53:54,135 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-02-20 11:53:54,135 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-02-20 11:53:54,136 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-02-20 11:53:54,136 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-02-20 11:53:54,136 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-02-20 11:53:54,136 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-02-20 11:53:54,136 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2024-02-20 11:53:54,137 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-02-20 11:53:54,137 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-02-20 11:53:54,145 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 -> c361ebc03d879240d418527d643e8a7b3c7ac084ceb3e66857b21a687a1c7f90 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Positions where we compute the Hoare Annotation -> All [2024-02-20 11:53:54,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-02-20 11:53:54,397 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-02-20 11:53:54,399 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-02-20 11:53:54,400 INFO L270 PluginConnector]: Initializing CDTParser... [2024-02-20 11:53:54,401 INFO L274 PluginConnector]: CDTParser initialized [2024-02-20 11:53:54,402 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/chl-sre-symm.wvr.c [2024-02-20 11:53:55,476 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-02-20 11:53:55,634 INFO L384 CDTParser]: Found 1 translation units. [2024-02-20 11:53:55,635 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-sre-symm.wvr.c [2024-02-20 11:53:55,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3a334f2/38ecf7e91c6047ae9afba5c2f3b263d2/FLAGb6d4dcf1b [2024-02-20 11:53:55,651 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3a334f2/38ecf7e91c6047ae9afba5c2f3b263d2 [2024-02-20 11:53:55,653 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-02-20 11:53:55,654 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-02-20 11:53:55,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-02-20 11:53:55,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-02-20 11:53:55,659 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-02-20 11:53:55,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:53:55" (1/1) ... [2024-02-20 11:53:55,660 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75afccaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:55, skipping insertion in model container [2024-02-20 11:53:55,660 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:53:55" (1/1) ... [2024-02-20 11:53:55,675 INFO L177 MainTranslator]: Built tables and reachable declarations [2024-02-20 11:53:55,806 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-sre-symm.wvr.c[2133,2146] [2024-02-20 11:53:55,815 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:53:55,825 INFO L202 MainTranslator]: Completed pre-run [2024-02-20 11:53:55,839 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/chl-sre-symm.wvr.c[2133,2146] [2024-02-20 11:53:55,839 INFO L207 PostProcessor]: Analyzing one entry point: main [2024-02-20 11:53:55,851 INFO L206 MainTranslator]: Completed translation [2024-02-20 11:53:55,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:55 WrapperNode [2024-02-20 11:53:55,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-02-20 11:53:55,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-02-20 11:53:55,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-02-20 11:53:55,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-02-20 11:53:55,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:55" (1/1) ... [2024-02-20 11:53:55,864 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:55" (1/1) ... [2024-02-20 11:53:55,880 INFO L138 Inliner]: procedures = 21, calls = 21, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 61 [2024-02-20 11:53:55,881 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-02-20 11:53:55,881 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-02-20 11:53:55,881 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-02-20 11:53:55,881 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-02-20 11:53:55,890 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:55" (1/1) ... [2024-02-20 11:53:55,891 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:55" (1/1) ... [2024-02-20 11:53:55,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:55" (1/1) ... [2024-02-20 11:53:55,904 INFO L175 MemorySlicer]: Split 6 memory accesses to 3 slices as follows [2, 2, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-02-20 11:53:55,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:55" (1/1) ... [2024-02-20 11:53:55,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:55" (1/1) ... [2024-02-20 11:53:55,909 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:55" (1/1) ... [2024-02-20 11:53:55,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:55" (1/1) ... [2024-02-20 11:53:55,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:55" (1/1) ... [2024-02-20 11:53:55,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:55" (1/1) ... [2024-02-20 11:53:55,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-02-20 11:53:55,915 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-02-20 11:53:55,915 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-02-20 11:53:55,915 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-02-20 11:53:55,916 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:55" (1/1) ... [2024-02-20 11:53:55,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-02-20 11:53:55,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-02-20 11:53:55,951 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-02-20 11:53:55,970 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-02-20 11:53:56,008 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-02-20 11:53:56,008 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-02-20 11:53:56,008 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-02-20 11:53:56,009 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-02-20 11:53:56,009 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-02-20 11:53:56,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-02-20 11:53:56,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-02-20 11:53:56,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-02-20 11:53:56,009 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-02-20 11:53:56,009 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-02-20 11:53:56,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-02-20 11:53:56,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-02-20 11:53:56,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-02-20 11:53:56,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-02-20 11:53:56,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-02-20 11:53:56,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-02-20 11:53:56,010 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-02-20 11:53:56,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-02-20 11:53:56,012 WARN L214 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2024-02-20 11:53:56,086 INFO L244 CfgBuilder]: Building ICFG [2024-02-20 11:53:56,087 INFO L270 CfgBuilder]: Building CFG for each procedure with an implementation [2024-02-20 11:53:56,195 INFO L289 CfgBuilder]: Ommited future-live optimization because the input is a concurrent program. [2024-02-20 11:53:56,195 INFO L293 CfgBuilder]: Performing block encoding [2024-02-20 11:53:56,279 INFO L315 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-02-20 11:53:56,279 INFO L320 CfgBuilder]: Removed 0 assume(true) statements. [2024-02-20 11:53:56,280 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:53:56 BoogieIcfgContainer [2024-02-20 11:53:56,280 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-02-20 11:53:56,282 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-02-20 11:53:56,282 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-02-20 11:53:56,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-02-20 11:53:56,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:53:55" (1/3) ... [2024-02-20 11:53:56,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be56509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:53:56, skipping insertion in model container [2024-02-20 11:53:56,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:53:55" (2/3) ... [2024-02-20 11:53:56,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4be56509 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:53:56, skipping insertion in model container [2024-02-20 11:53:56,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:53:56" (3/3) ... [2024-02-20 11:53:56,286 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-sre-symm.wvr.c [2024-02-20 11:53:56,300 INFO L221 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-02-20 11:53:56,301 INFO L180 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-02-20 11:53:56,301 INFO L635 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-02-20 11:53:56,350 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-02-20 11:53:56,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 22 places, 15 transitions, 44 flow [2024-02-20 11:53:56,395 INFO L124 PetriNetUnfolderBase]: 0/13 cut-off events. [2024-02-20 11:53:56,395 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-20 11:53:56,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22 conditions, 13 events. 0/13 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 2. Compared 4 event pairs, 0 based on Foata normal form. 0/12 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-02-20 11:53:56,397 INFO L82 GeneralOperation]: Start removeDead. Operand has 22 places, 15 transitions, 44 flow [2024-02-20 11:53:56,400 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 19 places, 12 transitions, 36 flow [2024-02-20 11:53:56,414 INFO L368 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-02-20 11:53:56,419 INFO L369 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@530eaf91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-02-20 11:53:56,420 INFO L370 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-02-20 11:53:56,428 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-02-20 11:53:56,428 INFO L124 PetriNetUnfolderBase]: 0/11 cut-off events. [2024-02-20 11:53:56,428 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-02-20 11:53:56,428 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:56,429 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:53:56,429 INFO L432 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:53:56,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:56,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1214757554, now seen corresponding path program 1 times [2024-02-20 11:53:56,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:56,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046292498] [2024-02-20 11:53:56,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:56,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:56,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:57,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:53:57,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:57,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046292498] [2024-02-20 11:53:57,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046292498] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:57,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:53:57,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:53:57,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498467804] [2024-02-20 11:53:57,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:57,288 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:53:57,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:57,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:53:57,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:53:57,316 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 15 [2024-02-20 11:53:57,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 19 places, 12 transitions, 36 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:53:57,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:57,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 15 [2024-02-20 11:53:57,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:57,419 INFO L124 PetriNetUnfolderBase]: 8/33 cut-off events. [2024-02-20 11:53:57,420 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-02-20 11:53:57,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80 conditions, 33 events. 8/33 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 51 event pairs, 0 based on Foata normal form. 1/34 useless extension candidates. Maximal degree in co-relation 45. Up to 16 conditions per place. [2024-02-20 11:53:57,422 INFO L140 encePairwiseOnDemand]: 11/15 looper letters, 10 selfloop transitions, 3 changer transitions 8/22 dead transitions. [2024-02-20 11:53:57,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 23 places, 22 transitions, 107 flow [2024-02-20 11:53:57,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:53:57,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:53:57,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2024-02-20 11:53:57,433 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.49333333333333335 [2024-02-20 11:53:57,436 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 4 predicate places. [2024-02-20 11:53:57,436 INFO L507 AbstractCegarLoop]: Abstraction has has 23 places, 22 transitions, 107 flow [2024-02-20 11:53:57,437 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:53:57,437 INFO L226 CegarLoopForPetriNet]: Found error trace [2024-02-20 11:53:57,437 INFO L234 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-02-20 11:53:57,437 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-02-20 11:53:57,438 INFO L432 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2024-02-20 11:53:57,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2024-02-20 11:53:57,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1947616154, now seen corresponding path program 2 times [2024-02-20 11:53:57,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-02-20 11:53:57,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738364645] [2024-02-20 11:53:57,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-02-20 11:53:57,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-02-20 11:53:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-02-20 11:53:57,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-02-20 11:53:57,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-02-20 11:53:57,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738364645] [2024-02-20 11:53:57,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738364645] provided 1 perfect and 0 imperfect interpolant sequences [2024-02-20 11:53:57,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-02-20 11:53:57,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-02-20 11:53:57,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [268977394] [2024-02-20 11:53:57,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-02-20 11:53:57,796 INFO L584 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-02-20 11:53:57,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-02-20 11:53:57,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-02-20 11:53:57,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-02-20 11:53:57,798 INFO L498 CegarLoopForPetriNet]: Number of universal loopers: 3 out of 15 [2024-02-20 11:53:57,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 22 transitions, 107 flow. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:53:57,799 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-02-20 11:53:57,799 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 3 of 15 [2024-02-20 11:53:57,799 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-02-20 11:53:57,884 INFO L124 PetriNetUnfolderBase]: 8/31 cut-off events. [2024-02-20 11:53:57,885 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2024-02-20 11:53:57,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 31 events. 8/31 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 58 event pairs, 0 based on Foata normal form. 1/32 useless extension candidates. Maximal degree in co-relation 66. Up to 15 conditions per place. [2024-02-20 11:53:57,885 INFO L140 encePairwiseOnDemand]: 11/15 looper letters, 0 selfloop transitions, 0 changer transitions 23/23 dead transitions. [2024-02-20 11:53:57,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 23 transitions, 162 flow [2024-02-20 11:53:57,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-02-20 11:53:57,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-02-20 11:53:57,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2024-02-20 11:53:57,887 INFO L543 CegarLoopForPetriNet]: DFA transition density 0.5066666666666667 [2024-02-20 11:53:57,888 INFO L308 CegarLoopForPetriNet]: 19 programPoint places, 6 predicate places. [2024-02-20 11:53:57,888 INFO L507 AbstractCegarLoop]: Abstraction has has 25 places, 23 transitions, 162 flow [2024-02-20 11:53:57,889 INFO L508 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-02-20 11:53:57,894 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2024-02-20 11:53:57,894 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2024-02-20 11:53:57,895 INFO L818 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2024-02-20 11:53:57,895 WARN L489 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-02-20 11:53:57,926 INFO L644 CegarLoopForPetriNet]: Computed Owicki-Gries annotation of size 2228 in 30977752ns [2024-02-20 11:53:57,928 INFO L457 BasicCegarLoop]: Path program histogram: [2] [2024-02-20 11:53:57,934 INFO L246 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-02-20 11:53:58,015 INFO L196 ceAbstractionStarter]: Computing trace abstraction results [2024-02-20 11:53:58,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:53:58 BasicIcfg [2024-02-20 11:53:58,019 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-02-20 11:53:58,020 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-02-20 11:53:58,020 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-02-20 11:53:58,020 INFO L274 PluginConnector]: Witness Printer initialized [2024-02-20 11:53:58,021 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:53:56" (3/4) ... [2024-02-20 11:53:58,022 INFO L137 WitnessPrinter]: Generating witness for correct program [2024-02-20 11:53:58,024 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-02-20 11:53:58,025 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-02-20 11:53:58,028 INFO L959 BoogieBacktranslator]: Reduced CFG by removing 52 nodes and edges [2024-02-20 11:53:58,028 INFO L959 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-02-20 11:53:58,028 INFO L959 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-02-20 11:53:58,028 INFO L959 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2024-02-20 11:53:58,116 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-02-20 11:53:58,117 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-02-20 11:53:58,117 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-02-20 11:53:58,117 INFO L158 Benchmark]: Toolchain (without parser) took 2463.37ms. Allocated memory was 176.2MB in the beginning and 241.2MB in the end (delta: 65.0MB). Free memory was 119.2MB in the beginning and 112.4MB in the end (delta: 6.7MB). Peak memory consumption was 72.8MB. Max. memory is 16.1GB. [2024-02-20 11:53:58,117 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-02-20 11:53:58,118 INFO L158 Benchmark]: CACSL2BoogieTranslator took 197.40ms. Allocated memory is still 176.2MB. Free memory was 118.6MB in the beginning and 107.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-02-20 11:53:58,118 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.02ms. Allocated memory is still 176.2MB. Free memory was 107.1MB in the beginning and 105.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-02-20 11:53:58,118 INFO L158 Benchmark]: Boogie Preprocessor took 33.13ms. Allocated memory is still 176.2MB. Free memory was 105.5MB in the beginning and 103.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-02-20 11:53:58,118 INFO L158 Benchmark]: RCFGBuilder took 365.10ms. Allocated memory is still 176.2MB. Free memory was 103.9MB in the beginning and 81.4MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-02-20 11:53:58,119 INFO L158 Benchmark]: TraceAbstraction took 1737.94ms. Allocated memory was 176.2MB in the beginning and 241.2MB in the end (delta: 65.0MB). Free memory was 80.9MB in the beginning and 118.7MB in the end (delta: -37.8MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. [2024-02-20 11:53:58,119 INFO L158 Benchmark]: Witness Printer took 96.92ms. Allocated memory is still 241.2MB. Free memory was 118.7MB in the beginning and 112.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-02-20 11:53:58,120 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 176.2MB. Free memory is still 139.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 197.40ms. Allocated memory is still 176.2MB. Free memory was 118.6MB in the beginning and 107.6MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.02ms. Allocated memory is still 176.2MB. Free memory was 107.1MB in the beginning and 105.5MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 33.13ms. Allocated memory is still 176.2MB. Free memory was 105.5MB in the beginning and 103.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 365.10ms. Allocated memory is still 176.2MB. Free memory was 103.9MB in the beginning and 81.4MB in the end (delta: 22.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 1737.94ms. Allocated memory was 176.2MB in the beginning and 241.2MB in the end (delta: 65.0MB). Free memory was 80.9MB in the beginning and 118.7MB in the end (delta: -37.8MB). Peak memory consumption was 28.8MB. Max. memory is 16.1GB. * Witness Printer took 96.92ms. Allocated memory is still 241.2MB. Free memory was 118.7MB in the beginning and 112.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && !(v_np12_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np8_1)) && !(v_np10_1)) && !(v_np0_1)) && v_np6_1) && v_np1_1) && !(v_np4_1)) && !(v_np14_1)) && v_np15_1) && v_np13_1) && v_np11_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && !(v_np7_1)) || (((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && !(v_np12_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np8_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np6_1) && v_np3_1) && !(v_np11_1)) && !(v_np4_1)) && !(v_np14_1)) && !(v_np15_1)) && v_np10_1) && v_np13_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np7_1))) || (((((((((((((((((((!(v_np5_1) && !(v_np9_1)) && !(v_np2_1)) && !(v_np12_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np8_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np6_1) && !(v_np11_1)) && !(v_np4_1)) && !(v_np14_1)) && !(v_np15_1)) && v_np16_1) && v_np10_1) && v_np13_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && !(v_np7_1))) || (((((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && !(v_np12_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np10_1)) && !(v_np0_1)) && v_np6_1) && v_np8_1) && v_np1_1) && !(v_np4_1)) && !(v_np14_1)) && !(v_np15_1)) && v_np13_1) && v_np11_1) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && ((result_3 + 1) == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || (((!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 1)) || ((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_3 == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && ((((result_3 == 0) && (result_2 == 0)) || ((1 <= result_3) && ((result_2 + 1) <= 0))) || ((1 <= result_2) && ((result_3 + 1) <= 0)))) && !(v_np7_1))) || (((((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && !(v_np12_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np10_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np6_1) && v_np8_1) && !(v_np4_1)) && !(v_np15_1)) && v_np14_1) && v_np13_1) && v_np11_1) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && ((result_3 + 1) == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || (((!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 1)) || ((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_3 == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && ((((result_3 == 0) && (result_2 == 0)) || ((1 <= result_3) && ((result_2 + 1) <= 0))) || ((1 <= result_2) && ((result_3 + 1) <= 0)))) && !(v_np7_1))) || (((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && !(v_np12_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np8_1)) && !(v_np10_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np6_1) && !(v_np4_1)) && v_np15_1) && v_np14_1) && v_np13_1) && v_np11_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && !(v_np7_1))) - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np8_1)) && !(v_np10_1)) && !(v_np6_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np4_1) && !(v_np13_1)) && !(v_np14_1)) && v_np15_1) && v_np12_1) && v_np11_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && !(v_np7_1)) || (((((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np10_1)) && !(v_np6_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np4_1) && v_np8_1) && !(v_np13_1)) && !(v_np14_1)) && !(v_np15_1)) && v_np12_1) && v_np11_1) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && ((result_3 + 1) == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || (((!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 1)) || ((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_3 == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && ((((result_3 == 0) && (result_2 == 0)) || ((1 <= result_3) && ((result_2 + 1) <= 0))) || ((1 <= result_2) && ((result_3 + 1) <= 0)))) && !(v_np7_1))) - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: (((((((((((((((((((!(v_np16_1) && !(v_np9_1)) && !(v_np2_1)) && !(v_np8_1)) && !(v_np6_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np5_1) && !(v_np13_1)) && !(v_np11_1)) && !(v_np4_1)) && !(v_np14_1)) && !(v_np15_1)) && v_np10_1) && v_np12_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && ((((result_3 == 0) && (result_2 == 0)) || ((1 <= result_3) && ((result_2 + 1) <= 0))) || ((1 <= result_2) && ((result_3 + 1) <= 0)))) && !(v_np7_1)) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np10_1)) && !(v_np6_1)) && !(v_np1_1)) && v_np8_1) && v_np0_1) && !(v_np13_1)) && !(v_np4_1)) && !(v_np14_1)) && !(v_np15_1)) && v_np12_1) && v_np11_1) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && ((result_3 + 1) == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || (((!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 1)) || ((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_3 == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && ((((result_3 == 0) && (result_2 == 0)) || ((1 <= result_3) && ((result_2 + 1) <= 0))) || ((1 <= result_2) && ((result_3 + 1) <= 0)))) && !(v_np7_1)) || (((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np8_1)) && !(v_np10_1)) && !(v_np6_1)) && !(v_np1_1)) && v_np0_1) && !(v_np13_1)) && !(v_np4_1)) && !(v_np14_1)) && v_np15_1) && v_np12_1) && v_np11_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && !(v_np7_1))) - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && !(v_np12_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np8_1)) && !(v_np10_1)) && !(v_np0_1)) && v_np6_1) && v_np1_1) && !(v_np4_1)) && !(v_np14_1)) && v_np15_1) && v_np13_1) && v_np11_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && !(v_np7_1)) || (((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np12_1)) && !(v_np10_1)) && !(v_np6_1)) && !(v_np0_1)) && v_np8_1) && v_np2_1) && v_np1_1) && !(v_np4_1)) && !(v_np14_1)) && !(v_np15_1)) && v_np13_1) && v_np11_1) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && ((result_3 + 1) == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || (((!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 1)) || ((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_3 == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && !(v_np7_1))) || (((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np12_1)) && !(v_np8_1)) && !(v_np10_1)) && !(v_np6_1)) && !(v_np0_1)) && v_np2_1) && v_np1_1) && !(v_np4_1)) && !(v_np14_1)) && v_np15_1) && v_np13_1) && v_np11_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && ((((result_3 == 0) && (result_2 == 0)) || ((1 <= result_3) && ((result_2 + 1) <= 0))) || ((1 <= result_2) && ((result_3 + 1) <= 0)))) && !(v_np7_1))) || (((((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && !(v_np12_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np10_1)) && !(v_np0_1)) && v_np6_1) && v_np8_1) && v_np1_1) && !(v_np4_1)) && !(v_np14_1)) && !(v_np15_1)) && v_np13_1) && v_np11_1) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && ((result_3 + 1) == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || (((!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 1)) || ((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_3 == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && ((((result_3 == 0) && (result_2 == 0)) || ((1 <= result_3) && ((result_2 + 1) <= 0))) || ((1 <= result_2) && ((result_3 + 1) <= 0)))) && !(v_np7_1))) - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np12_1)) && !(v_np8_1)) && !(v_np6_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np3_1) && v_np2_1) && !(v_np11_1)) && !(v_np4_1)) && !(v_np14_1)) && !(v_np15_1)) && v_np10_1) && v_np13_1) && !(v_np18_1)) && !(v_np17_1)) && ((((result_3 == 0) && (result_2 == 0)) || ((1 <= result_3) && ((result_2 + 1) <= 0))) || ((1 <= result_2) && ((result_3 + 1) <= 0)))) && !(v_np7_1)) || (((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np12_1)) && !(v_np8_1)) && !(v_np10_1)) && !(v_np6_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np2_1) && !(v_np4_1)) && v_np15_1) && v_np14_1) && v_np13_1) && v_np11_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && ((((result_3 == 0) && (result_2 == 0)) || ((1 <= result_3) && ((result_2 + 1) <= 0))) || ((1 <= result_2) && ((result_3 + 1) <= 0)))) && !(v_np7_1))) || (((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np12_1)) && !(v_np10_1)) && !(v_np6_1)) && !(v_np0_1)) && v_np8_1) && v_np2_1) && v_np1_1) && !(v_np4_1)) && !(v_np14_1)) && !(v_np15_1)) && v_np13_1) && v_np11_1) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && ((result_3 + 1) == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || (((!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 1)) || ((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_3 == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && !(v_np7_1))) || (((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np12_1)) && !(v_np8_1)) && !(v_np10_1)) && !(v_np6_1)) && !(v_np0_1)) && v_np2_1) && v_np1_1) && !(v_np4_1)) && !(v_np14_1)) && v_np15_1) && v_np13_1) && v_np11_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && ((((result_3 == 0) && (result_2 == 0)) || ((1 <= result_3) && ((result_2 + 1) <= 0))) || ((1 <= result_2) && ((result_3 + 1) <= 0)))) && !(v_np7_1))) || (((((((((((((((((((!(v_np5_1) && !(v_np9_1)) && !(v_np12_1)) && !(v_np8_1)) && !(v_np6_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np2_1) && !(v_np11_1)) && !(v_np4_1)) && !(v_np14_1)) && !(v_np15_1)) && v_np16_1) && v_np10_1) && v_np13_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && ((((result_3 == 0) && (result_2 == 0)) || ((1 <= result_3) && ((result_2 + 1) <= 0))) || ((1 <= result_2) && ((result_3 + 1) <= 0)))) && !(v_np7_1))) || (((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np12_1)) && !(v_np10_1)) && !(v_np6_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np8_1) && v_np2_1) && !(v_np4_1)) && !(v_np15_1)) && v_np14_1) && v_np13_1) && v_np11_1) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && ((result_3 + 1) == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || (((!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 1)) || ((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_3 == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && !(v_np7_1))) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np10_1)) && !(v_np6_1)) && !(v_np1_1)) && v_np8_1) && v_np0_1) && !(v_np13_1)) && !(v_np4_1)) && !(v_np14_1)) && !(v_np15_1)) && v_np12_1) && v_np11_1) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && ((result_3 + 1) == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || (((!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 1)) || ((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_3 == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && ((((result_3 == 0) && (result_2 == 0)) || ((1 <= result_3) && ((result_2 + 1) <= 0))) || ((1 <= result_2) && ((result_3 + 1) <= 0)))) && !(v_np7_1)) || (((((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np10_1)) && !(v_np6_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np4_1) && v_np8_1) && !(v_np13_1)) && !(v_np14_1)) && !(v_np15_1)) && v_np12_1) && v_np11_1) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && ((result_3 + 1) == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || (((!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 1)) || ((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_3 == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && ((((result_3 == 0) && (result_2 == 0)) || ((1 <= result_3) && ((result_2 + 1) <= 0))) || ((1 <= result_2) && ((result_3 + 1) <= 0)))) && !(v_np7_1))) || (((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np12_1)) && !(v_np10_1)) && !(v_np6_1)) && !(v_np0_1)) && v_np8_1) && v_np2_1) && v_np1_1) && !(v_np4_1)) && !(v_np14_1)) && !(v_np15_1)) && v_np13_1) && v_np11_1) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && ((result_3 + 1) == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || (((!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 1)) || ((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_3 == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && !(v_np7_1))) || (((((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && !(v_np12_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np10_1)) && !(v_np0_1)) && v_np6_1) && v_np8_1) && v_np1_1) && !(v_np4_1)) && !(v_np14_1)) && !(v_np15_1)) && v_np13_1) && v_np11_1) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && ((result_3 + 1) == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || (((!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 1)) || ((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_3 == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && ((((result_3 == 0) && (result_2 == 0)) || ((1 <= result_3) && ((result_2 + 1) <= 0))) || ((1 <= result_2) && ((result_3 + 1) <= 0)))) && !(v_np7_1))) || (((((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && !(v_np12_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np10_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np6_1) && v_np8_1) && !(v_np4_1)) && !(v_np15_1)) && v_np14_1) && v_np13_1) && v_np11_1) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && ((result_3 + 1) == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || (((!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 1)) || ((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_3 == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && ((((result_3 == 0) && (result_2 == 0)) || ((1 <= result_3) && ((result_2 + 1) <= 0))) || ((1 <= result_2) && ((result_3 + 1) <= 0)))) && !(v_np7_1))) || (((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np12_1)) && !(v_np10_1)) && !(v_np6_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np8_1) && v_np2_1) && !(v_np4_1)) && !(v_np15_1)) && v_np14_1) && v_np13_1) && v_np11_1) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && ((result_3 + 1) == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || (((!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 1)) || ((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_3 == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && !(v_np7_1))) - InvariantResult [Line: 63]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np12_1)) && !(v_np8_1)) && !(v_np10_1)) && !(v_np6_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np2_1) && !(v_np4_1)) && v_np15_1) && v_np14_1) && v_np13_1) && v_np11_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && ((((result_3 == 0) && (result_2 == 0)) || ((1 <= result_3) && ((result_2 + 1) <= 0))) || ((1 <= result_2) && ((result_3 + 1) <= 0)))) && !(v_np7_1)) || (((((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && !(v_np12_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np10_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np6_1) && v_np8_1) && !(v_np4_1)) && !(v_np15_1)) && v_np14_1) && v_np13_1) && v_np11_1) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && ((result_3 + 1) == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || (((!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 1)) || ((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_3 == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && ((((result_3 == 0) && (result_2 == 0)) || ((1 <= result_3) && ((result_2 + 1) <= 0))) || ((1 <= result_2) && ((result_3 + 1) <= 0)))) && !(v_np7_1))) || (((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np12_1)) && !(v_np10_1)) && !(v_np6_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np8_1) && v_np2_1) && !(v_np4_1)) && !(v_np15_1)) && v_np14_1) && v_np13_1) && v_np11_1) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && ((result_3 + 1) == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || (((!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 1)) || ((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_3 == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && !(v_np7_1))) || (((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && !(v_np12_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np8_1)) && !(v_np10_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np6_1) && !(v_np4_1)) && v_np15_1) && v_np14_1) && v_np13_1) && v_np11_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && !(v_np7_1))) - InvariantResult [Line: 61]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(v_np5_1) && !(v_np9_1)) && !(v_np2_1)) && !(v_np12_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np8_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np6_1) && !(v_np11_1)) && !(v_np4_1)) && !(v_np14_1)) && !(v_np15_1)) && v_np16_1) && v_np10_1) && v_np13_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && !(v_np7_1)) || (((((((((((((((((((!(v_np5_1) && !(v_np9_1)) && !(v_np12_1)) && !(v_np8_1)) && !(v_np6_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np2_1) && !(v_np11_1)) && !(v_np4_1)) && !(v_np14_1)) && !(v_np15_1)) && v_np16_1) && v_np10_1) && v_np13_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && ((((result_3 == 0) && (result_2 == 0)) || ((1 <= result_3) && ((result_2 + 1) <= 0))) || ((1 <= result_2) && ((result_3 + 1) <= 0)))) && !(v_np7_1))) - InvariantResult [Line: -1]: Loop Invariant Derived loop invariant: ((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && !(v_np8_1)) && !(v_np6_1)) && !(v_np1_1)) && !(v_np0_1)) && !(v_np13_1)) && !(v_np11_1)) && !(v_np4_1)) && !(v_np14_1)) && !(v_np15_1)) && v_np17_1) && v_np10_1) && v_np12_1) && !(v_np18_1)) && !(v_np3_1)) && !(v_np7_1)) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np8_1)) && !(v_np10_1)) && !(v_np6_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np4_1) && !(v_np13_1)) && !(v_np14_1)) && v_np15_1) && v_np12_1) && v_np11_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && !(v_np7_1)) || (((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np12_1)) && !(v_np8_1)) && !(v_np10_1)) && !(v_np6_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np2_1) && !(v_np4_1)) && v_np15_1) && v_np14_1) && v_np13_1) && v_np11_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && ((((result_3 == 0) && (result_2 == 0)) || ((1 <= result_3) && ((result_2 + 1) <= 0))) || ((1 <= result_2) && ((result_3 + 1) <= 0)))) && !(v_np7_1))) || (((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && !(v_np12_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np8_1)) && !(v_np10_1)) && !(v_np0_1)) && v_np6_1) && v_np1_1) && !(v_np4_1)) && !(v_np14_1)) && v_np15_1) && v_np13_1) && v_np11_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && !(v_np7_1))) || (((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np8_1)) && !(v_np10_1)) && !(v_np6_1)) && !(v_np1_1)) && v_np0_1) && !(v_np13_1)) && !(v_np4_1)) && !(v_np14_1)) && v_np15_1) && v_np12_1) && v_np11_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && !(v_np7_1))) || (((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np12_1)) && !(v_np8_1)) && !(v_np10_1)) && !(v_np6_1)) && !(v_np0_1)) && v_np2_1) && v_np1_1) && !(v_np4_1)) && !(v_np14_1)) && v_np15_1) && v_np13_1) && v_np11_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && ((((result_3 == 0) && (result_2 == 0)) || ((1 <= result_3) && ((result_2 + 1) <= 0))) || ((1 <= result_2) && ((result_3 + 1) <= 0)))) && !(v_np7_1))) || (((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && !(v_np12_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np8_1)) && !(v_np10_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np6_1) && !(v_np4_1)) && v_np15_1) && v_np14_1) && v_np13_1) && v_np11_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np3_1)) && !(v_np7_1))) - InvariantResult [Line: 69]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: ((((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np12_1)) && !(v_np8_1)) && !(v_np6_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np3_1) && v_np2_1) && !(v_np11_1)) && !(v_np4_1)) && !(v_np14_1)) && !(v_np15_1)) && v_np10_1) && v_np13_1) && !(v_np18_1)) && !(v_np17_1)) && ((((result_3 == 0) && (result_2 == 0)) || ((1 <= result_3) && ((result_2 + 1) <= 0))) || ((1 <= result_2) && ((result_3 + 1) <= 0)))) && !(v_np7_1)) || (((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && !(v_np12_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np8_1)) && !(v_np1_1)) && !(v_np0_1)) && v_np6_1) && v_np3_1) && !(v_np11_1)) && !(v_np4_1)) && !(v_np14_1)) && !(v_np15_1)) && v_np10_1) && v_np13_1) && !(v_np18_1)) && !(v_np17_1)) && !(v_np7_1))) - InvariantResult [Line: 64]: Loop Invariant Derived loop invariant: (((((((((((((((((((((!(v_np5_1) && !(v_np16_1)) && !(v_np9_1)) && !(v_np2_1)) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 1)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_2 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || ((((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_2 == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && ((result_2 + 1) == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np8_1)) && !(v_np6_1)) && !(v_np1_1)) && !(v_np0_1)) && !(v_np13_1)) && !(v_np11_1)) && !(v_np4_1)) && !(v_np14_1)) && !(v_np15_1)) && v_np18_1) && v_np10_1) && v_np12_1) && (((((sponsored_1 == (256 * (sponsored_1 / 256))) && ((result_3 + 1) == 0)) || (!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 0))) && !((((sponsored_0 / 256) * 256) == sponsored_0))) || (((!((sponsored_1 == (256 * (sponsored_1 / 256)))) && (result_3 == 1)) || ((sponsored_1 == (256 * (sponsored_1 / 256))) && (result_3 == 0))) && (((sponsored_0 / 256) * 256) == sponsored_0)))) && !(v_np17_1)) && !(v_np3_1)) && ((((result_3 == 0) && (result_2 == 0)) || ((1 <= result_3) && ((result_2 + 1) <= 0))) || ((1 <= result_2) && ((result_3 + 1) <= 0)))) && !(v_np7_1)) - PositiveResult [Line: 69]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 22 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 70 IncrementalHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 0 mSDtfsCounter, 70 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=162occurred in iteration=2, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 24 NumberOfCodeBlocks, 24 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 440 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-02-20 11:53:58,143 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE