./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.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.graphml --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 52e3c636591acb857dfd3007f1959b2ca21042f2edf8d723e0b08c805c98fd4a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:38:46,761 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:38:46,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:38:46,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:38:46,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:38:46,783 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:38:46,784 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:38:46,786 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:38:46,787 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:38:46,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:38:46,788 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:38:46,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:38:46,789 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:38:46,790 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:38:46,791 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:38:46,791 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:38:46,792 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:38:46,793 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:38:46,794 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:38:46,795 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:38:46,796 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:38:46,805 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:38:46,806 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:38:46,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:38:46,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:38:46,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:38:46,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:38:46,810 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:38:46,811 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:38:46,811 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:38:46,812 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:38:46,812 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:38:46,813 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:38:46,813 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:38:46,814 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:38:46,814 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:38:46,815 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:38:46,815 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:38:46,816 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:38:46,816 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:38:46,817 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:38:46,823 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 18:38:46,843 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:38:46,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:38:46,845 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:38:46,845 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:38:46,845 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:38:46,846 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:38:46,846 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:38:46,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:38:46,847 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:38:46,847 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:38:46,848 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:38:46,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:38:46,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:38:46,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:38:46,848 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:38:46,848 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:38:46,848 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:38:46,848 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:38:46,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:38:46,849 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:38:46,849 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:38:46,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:38:46,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:38:46,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:38:46,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:38:46,850 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:38:46,850 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:38:46,851 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:38:46,851 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:38:46,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:38:46,851 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:38:46,851 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:38:46,852 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:38:46,852 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.graphml 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 -> 52e3c636591acb857dfd3007f1959b2ca21042f2edf8d723e0b08c805c98fd4a [2022-02-20 18:38:47,036 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:38:47,059 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:38:47,062 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:38:47,063 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:38:47,063 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:38:47,064 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:38:47,119 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa9f1eb43/490c87f8ad1b4007a58fb3fa2bdb2beb/FLAG0d270fea7 [2022-02-20 18:38:47,470 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:38:47,471 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:38:47,485 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa9f1eb43/490c87f8ad1b4007a58fb3fa2bdb2beb/FLAG0d270fea7 [2022-02-20 18:38:47,865 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa9f1eb43/490c87f8ad1b4007a58fb3fa2bdb2beb [2022-02-20 18:38:47,867 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:38:47,868 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:38:47,869 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:38:47,869 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:38:47,877 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:38:47,878 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:38:47" (1/1) ... [2022-02-20 18:38:47,879 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78646d39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:47, skipping insertion in model container [2022-02-20 18:38:47,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:38:47" (1/1) ... [2022-02-20 18:38:47,884 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:38:47,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:38:48,207 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9821,9834] [2022-02-20 18:38:48,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:38:48,291 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:38:48,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded-reduced/pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c[9821,9834] [2022-02-20 18:38:48,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:38:48,397 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:38:48,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:48 WrapperNode [2022-02-20 18:38:48,397 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:38:48,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:38:48,398 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:38:48,399 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:38:48,404 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:48" (1/1) ... [2022-02-20 18:38:48,422 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:48" (1/1) ... [2022-02-20 18:38:48,482 INFO L137 Inliner]: procedures = 23, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 874 [2022-02-20 18:38:48,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:38:48,483 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:38:48,483 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:38:48,483 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:38:48,489 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:48" (1/1) ... [2022-02-20 18:38:48,489 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:48" (1/1) ... [2022-02-20 18:38:48,491 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:48" (1/1) ... [2022-02-20 18:38:48,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:48" (1/1) ... [2022-02-20 18:38:48,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:48" (1/1) ... [2022-02-20 18:38:48,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:48" (1/1) ... [2022-02-20 18:38:48,506 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:48" (1/1) ... [2022-02-20 18:38:48,509 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:38:48,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:38:48,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:38:48,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:38:48,510 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:48" (1/1) ... [2022-02-20 18:38:48,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:38:48,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:38:48,547 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 18:38:48,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 18:38:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:38:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:38:48,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:38:48,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:38:48,678 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:38:48,679 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:38:49,251 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:38:49,257 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:38:49,257 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 18:38:49,258 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:38:49 BoogieIcfgContainer [2022-02-20 18:38:49,258 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:38:49,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:38:49,259 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:38:49,261 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:38:49,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:38:47" (1/3) ... [2022-02-20 18:38:49,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1390af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:38:49, skipping insertion in model container [2022-02-20 18:38:49,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:38:48" (2/3) ... [2022-02-20 18:38:49,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d1390af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:38:49, skipping insertion in model container [2022-02-20 18:38:49,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:38:49" (3/3) ... [2022-02-20 18:38:49,263 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2022-02-20 18:38:49,266 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:38:49,267 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:38:49,303 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:38:49,307 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 18:38:49,307 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:38:49,323 INFO L276 IsEmpty]: Start isEmpty. Operand has 224 states, 222 states have (on average 1.7702702702702702) internal successors, (393), 223 states have internal predecessors, (393), 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) [2022-02-20 18:38:49,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-20 18:38:49,333 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:49,333 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:38:49,334 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:49,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:49,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1885524630, now seen corresponding path program 1 times [2022-02-20 18:38:49,346 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:49,346 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464412486] [2022-02-20 18:38:49,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:49,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:49,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:49,751 INFO L290 TraceCheckUtils]: 0: Hoare triple {227#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1142~0 := 0;~__return_1270~0 := 0;~__return_1389~0 := 0;~__return_1499~0 := 0; {227#true} is VALID [2022-02-20 18:38:49,752 INFO L290 TraceCheckUtils]: 1: Hoare triple {227#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {227#true} is VALID [2022-02-20 18:38:49,752 INFO L290 TraceCheckUtils]: 2: Hoare triple {227#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {227#true} is VALID [2022-02-20 18:38:49,753 INFO L290 TraceCheckUtils]: 3: Hoare triple {227#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {227#true} is VALID [2022-02-20 18:38:49,756 INFO L290 TraceCheckUtils]: 4: Hoare triple {227#true} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {227#true} is VALID [2022-02-20 18:38:49,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {227#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {227#true} is VALID [2022-02-20 18:38:49,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {227#true} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {227#true} is VALID [2022-02-20 18:38:49,757 INFO L290 TraceCheckUtils]: 7: Hoare triple {227#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {227#true} is VALID [2022-02-20 18:38:49,757 INFO L290 TraceCheckUtils]: 8: Hoare triple {227#true} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {227#true} is VALID [2022-02-20 18:38:49,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {227#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {227#true} is VALID [2022-02-20 18:38:49,758 INFO L290 TraceCheckUtils]: 10: Hoare triple {227#true} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {227#true} is VALID [2022-02-20 18:38:49,758 INFO L290 TraceCheckUtils]: 11: Hoare triple {227#true} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {227#true} is VALID [2022-02-20 18:38:49,758 INFO L290 TraceCheckUtils]: 12: Hoare triple {227#true} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {227#true} is VALID [2022-02-20 18:38:49,758 INFO L290 TraceCheckUtils]: 13: Hoare triple {227#true} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {227#true} is VALID [2022-02-20 18:38:49,759 INFO L290 TraceCheckUtils]: 14: Hoare triple {227#true} assume ~id1~0 != ~id2~0; {227#true} is VALID [2022-02-20 18:38:49,759 INFO L290 TraceCheckUtils]: 15: Hoare triple {227#true} assume ~id1~0 != ~id3~0; {227#true} is VALID [2022-02-20 18:38:49,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {227#true} assume ~id2~0 != ~id3~0; {227#true} is VALID [2022-02-20 18:38:49,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {227#true} assume ~id1~0 >= 0; {227#true} is VALID [2022-02-20 18:38:49,760 INFO L290 TraceCheckUtils]: 18: Hoare triple {227#true} assume ~id2~0 >= 0; {227#true} is VALID [2022-02-20 18:38:49,760 INFO L290 TraceCheckUtils]: 19: Hoare triple {227#true} assume ~id3~0 >= 0; {227#true} is VALID [2022-02-20 18:38:49,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {227#true} assume 0 == ~r1~0 % 256; {227#true} is VALID [2022-02-20 18:38:49,761 INFO L290 TraceCheckUtils]: 21: Hoare triple {227#true} assume 0 == ~r2~0 % 256; {227#true} is VALID [2022-02-20 18:38:49,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {227#true} assume 0 == ~r3~0 % 256; {227#true} is VALID [2022-02-20 18:38:49,761 INFO L290 TraceCheckUtils]: 23: Hoare triple {227#true} assume !(0 == main_~init__r122~0#1 % 256); {227#true} is VALID [2022-02-20 18:38:49,762 INFO L290 TraceCheckUtils]: 24: Hoare triple {227#true} assume !(0 == main_~init__r132~0#1 % 256); {227#true} is VALID [2022-02-20 18:38:49,762 INFO L290 TraceCheckUtils]: 25: Hoare triple {227#true} assume !(0 == main_~init__r212~0#1 % 256); {227#true} is VALID [2022-02-20 18:38:49,762 INFO L290 TraceCheckUtils]: 26: Hoare triple {227#true} assume !(0 == main_~init__r232~0#1 % 256); {227#true} is VALID [2022-02-20 18:38:49,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {227#true} assume !(0 == main_~init__r312~0#1 % 256); {227#true} is VALID [2022-02-20 18:38:49,763 INFO L290 TraceCheckUtils]: 28: Hoare triple {227#true} assume !(0 == main_~init__r322~0#1 % 256); {227#true} is VALID [2022-02-20 18:38:49,764 INFO L290 TraceCheckUtils]: 29: Hoare triple {227#true} assume ~max1~0 == ~id1~0; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~max2~0 == ~id2~0; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,766 INFO L290 TraceCheckUtils]: 31: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~max3~0 == ~id3~0; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~st1~0; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~st2~0; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,767 INFO L290 TraceCheckUtils]: 34: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~st3~0; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,768 INFO L290 TraceCheckUtils]: 35: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~nl1~0; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,768 INFO L290 TraceCheckUtils]: 36: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~nl2~0; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~nl3~0; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,769 INFO L290 TraceCheckUtils]: 38: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~mode1~0 % 256; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~mode2~0 % 256; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1142~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1142~0; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,771 INFO L290 TraceCheckUtils]: 41: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~mode1~0 % 256); {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,772 INFO L290 TraceCheckUtils]: 43: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~r1~0 % 256 < 2; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,772 INFO L290 TraceCheckUtils]: 44: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep12~0 % 256); {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,773 INFO L290 TraceCheckUtils]: 45: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep13~0 % 256); {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,774 INFO L290 TraceCheckUtils]: 46: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} ~mode1~0 := 1; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,775 INFO L290 TraceCheckUtils]: 47: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~mode2~0 % 256); {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,775 INFO L290 TraceCheckUtils]: 48: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~r2~0 % 256 < 2; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,776 INFO L290 TraceCheckUtils]: 49: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep21~0 % 256); {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,779 INFO L290 TraceCheckUtils]: 50: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep23~0 % 256); {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,780 INFO L290 TraceCheckUtils]: 51: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} ~mode2~0 := 1; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,780 INFO L290 TraceCheckUtils]: 52: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~mode3~0 % 256); {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,781 INFO L290 TraceCheckUtils]: 53: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~r3~0 % 256 < 2; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,781 INFO L290 TraceCheckUtils]: 54: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep31~0 % 256); {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,782 INFO L290 TraceCheckUtils]: 55: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep32~0 % 256); {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,782 INFO L290 TraceCheckUtils]: 56: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} ~mode3~0 := 1;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,783 INFO L290 TraceCheckUtils]: 57: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,786 INFO L290 TraceCheckUtils]: 58: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~st1~0 + ~nl1~0 <= 1; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,787 INFO L290 TraceCheckUtils]: 59: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~st2~0 + ~nl2~0 <= 1; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,788 INFO L290 TraceCheckUtils]: 60: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~st3~0 + ~nl3~0 <= 1; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,788 INFO L290 TraceCheckUtils]: 61: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !(~r1~0 % 256 >= 2); {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,789 INFO L290 TraceCheckUtils]: 62: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,790 INFO L290 TraceCheckUtils]: 63: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~r1~0 % 256 < 2; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,790 INFO L290 TraceCheckUtils]: 64: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !(~r1~0 % 256 >= 2); {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,791 INFO L290 TraceCheckUtils]: 65: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,792 INFO L290 TraceCheckUtils]: 66: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1270~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1270~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,792 INFO L290 TraceCheckUtils]: 67: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !(0 == main_~assert__arg~0#1 % 256); {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,793 INFO L290 TraceCheckUtils]: 68: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !(0 == ~mode1~0 % 256); {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,794 INFO L290 TraceCheckUtils]: 69: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,794 INFO L290 TraceCheckUtils]: 70: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep21~0 % 256); {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,795 INFO L290 TraceCheckUtils]: 71: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !!(0 == ~ep31~0 % 256); {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,795 INFO L290 TraceCheckUtils]: 72: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume 1 == ~r1~0 % 256; {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} is VALID [2022-02-20 18:38:49,796 INFO L290 TraceCheckUtils]: 73: Hoare triple {229#(= (+ (* (- 1) ~id1~0) ~max1~0) 0)} assume !(~max1~0 == ~id1~0);~nl1~0 := 1; {228#false} is VALID [2022-02-20 18:38:49,796 INFO L290 TraceCheckUtils]: 74: Hoare triple {228#false} ~mode1~0 := 0; {228#false} is VALID [2022-02-20 18:38:49,796 INFO L290 TraceCheckUtils]: 75: Hoare triple {228#false} assume !(0 == ~mode2~0 % 256); {228#false} is VALID [2022-02-20 18:38:49,796 INFO L290 TraceCheckUtils]: 76: Hoare triple {228#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {228#false} is VALID [2022-02-20 18:38:49,796 INFO L290 TraceCheckUtils]: 77: Hoare triple {228#false} assume !!(0 == ~ep12~0 % 256); {228#false} is VALID [2022-02-20 18:38:49,797 INFO L290 TraceCheckUtils]: 78: Hoare triple {228#false} assume !!(0 == ~ep32~0 % 256); {228#false} is VALID [2022-02-20 18:38:49,797 INFO L290 TraceCheckUtils]: 79: Hoare triple {228#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0; {228#false} is VALID [2022-02-20 18:38:49,799 INFO L290 TraceCheckUtils]: 80: Hoare triple {228#false} assume !(0 == ~mode3~0 % 256); {228#false} is VALID [2022-02-20 18:38:49,799 INFO L290 TraceCheckUtils]: 81: Hoare triple {228#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {228#false} is VALID [2022-02-20 18:38:49,799 INFO L290 TraceCheckUtils]: 82: Hoare triple {228#false} assume !!(0 == ~ep13~0 % 256); {228#false} is VALID [2022-02-20 18:38:49,800 INFO L290 TraceCheckUtils]: 83: Hoare triple {228#false} assume !!(0 == ~ep23~0 % 256); {228#false} is VALID [2022-02-20 18:38:49,800 INFO L290 TraceCheckUtils]: 84: Hoare triple {228#false} assume !(2 == ~r3~0 % 256);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {228#false} is VALID [2022-02-20 18:38:49,800 INFO L290 TraceCheckUtils]: 85: Hoare triple {228#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {228#false} is VALID [2022-02-20 18:38:49,800 INFO L290 TraceCheckUtils]: 86: Hoare triple {228#false} assume ~st1~0 + ~nl1~0 <= 1; {228#false} is VALID [2022-02-20 18:38:49,801 INFO L290 TraceCheckUtils]: 87: Hoare triple {228#false} assume ~st2~0 + ~nl2~0 <= 1; {228#false} is VALID [2022-02-20 18:38:49,801 INFO L290 TraceCheckUtils]: 88: Hoare triple {228#false} assume ~st3~0 + ~nl3~0 <= 1; {228#false} is VALID [2022-02-20 18:38:49,805 INFO L290 TraceCheckUtils]: 89: Hoare triple {228#false} assume !(~r1~0 % 256 >= 2); {228#false} is VALID [2022-02-20 18:38:49,805 INFO L290 TraceCheckUtils]: 90: Hoare triple {228#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {228#false} is VALID [2022-02-20 18:38:49,805 INFO L290 TraceCheckUtils]: 91: Hoare triple {228#false} ~__return_1389~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1389~0; {228#false} is VALID [2022-02-20 18:38:49,806 INFO L290 TraceCheckUtils]: 92: Hoare triple {228#false} havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {228#false} is VALID [2022-02-20 18:38:49,806 INFO L290 TraceCheckUtils]: 93: Hoare triple {228#false} assume 0 == main_~assert__arg~1#1 % 256; {228#false} is VALID [2022-02-20 18:38:49,806 INFO L290 TraceCheckUtils]: 94: Hoare triple {228#false} assume !false; {228#false} is VALID [2022-02-20 18:38:49,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:38:49,808 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:49,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464412486] [2022-02-20 18:38:49,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464412486] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:49,809 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:49,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:49,812 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495837810] [2022-02-20 18:38:49,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:49,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-02-20 18:38:49,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:49,819 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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) [2022-02-20 18:38:49,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:49,893 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:49,893 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:49,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:49,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:49,914 INFO L87 Difference]: Start difference. First operand has 224 states, 222 states have (on average 1.7702702702702702) internal successors, (393), 223 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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) [2022-02-20 18:38:50,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:50,408 INFO L93 Difference]: Finished difference Result 452 states and 785 transitions. [2022-02-20 18:38:50,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:50,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-02-20 18:38:50,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:50,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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) [2022-02-20 18:38:50,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 785 transitions. [2022-02-20 18:38:50,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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) [2022-02-20 18:38:50,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 785 transitions. [2022-02-20 18:38:50,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 785 transitions. [2022-02-20 18:38:50,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 785 edges. 785 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:50,889 INFO L225 Difference]: With dead ends: 452 [2022-02-20 18:38:50,890 INFO L226 Difference]: Without dead ends: 334 [2022-02-20 18:38:50,893 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:50,896 INFO L933 BasicCegarLoop]: 372 mSDtfsCounter, 267 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:50,897 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 621 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:50,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2022-02-20 18:38:50,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2022-02-20 18:38:50,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:50,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 334 states. Second operand has 332 states, 331 states have (on average 1.5317220543806647) internal successors, (507), 331 states have internal predecessors, (507), 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) [2022-02-20 18:38:50,937 INFO L74 IsIncluded]: Start isIncluded. First operand 334 states. Second operand has 332 states, 331 states have (on average 1.5317220543806647) internal successors, (507), 331 states have internal predecessors, (507), 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) [2022-02-20 18:38:50,938 INFO L87 Difference]: Start difference. First operand 334 states. Second operand has 332 states, 331 states have (on average 1.5317220543806647) internal successors, (507), 331 states have internal predecessors, (507), 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) [2022-02-20 18:38:50,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:50,953 INFO L93 Difference]: Finished difference Result 334 states and 508 transitions. [2022-02-20 18:38:50,953 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 508 transitions. [2022-02-20 18:38:50,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:50,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:50,955 INFO L74 IsIncluded]: Start isIncluded. First operand has 332 states, 331 states have (on average 1.5317220543806647) internal successors, (507), 331 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 334 states. [2022-02-20 18:38:50,956 INFO L87 Difference]: Start difference. First operand has 332 states, 331 states have (on average 1.5317220543806647) internal successors, (507), 331 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 334 states. [2022-02-20 18:38:50,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:50,963 INFO L93 Difference]: Finished difference Result 334 states and 508 transitions. [2022-02-20 18:38:50,963 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 508 transitions. [2022-02-20 18:38:50,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:50,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:50,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:50,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:50,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 331 states have (on average 1.5317220543806647) internal successors, (507), 331 states have internal predecessors, (507), 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) [2022-02-20 18:38:50,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 507 transitions. [2022-02-20 18:38:50,974 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 507 transitions. Word has length 95 [2022-02-20 18:38:50,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:50,974 INFO L470 AbstractCegarLoop]: Abstraction has 332 states and 507 transitions. [2022-02-20 18:38:50,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 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) [2022-02-20 18:38:50,975 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 507 transitions. [2022-02-20 18:38:50,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-02-20 18:38:50,976 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:50,976 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:38:50,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:38:50,977 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:50,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:50,977 INFO L85 PathProgramCache]: Analyzing trace with hash -614138391, now seen corresponding path program 1 times [2022-02-20 18:38:50,977 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:50,978 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595678229] [2022-02-20 18:38:50,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:50,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:51,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:51,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {1963#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1142~0 := 0;~__return_1270~0 := 0;~__return_1389~0 := 0;~__return_1499~0 := 0; {1963#true} is VALID [2022-02-20 18:38:51,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {1963#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {1965#(= (+ (* (- 1) ~ep12~0) |ULTIMATE.start_main_~init__r121~0#1|) 0)} is VALID [2022-02-20 18:38:51,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {1965#(= (+ (* (- 1) ~ep12~0) |ULTIMATE.start_main_~init__r121~0#1|) 0)} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,141 INFO L290 TraceCheckUtils]: 3: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,142 INFO L290 TraceCheckUtils]: 4: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,143 INFO L290 TraceCheckUtils]: 6: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,144 INFO L290 TraceCheckUtils]: 9: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,144 INFO L290 TraceCheckUtils]: 10: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,145 INFO L290 TraceCheckUtils]: 11: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,146 INFO L290 TraceCheckUtils]: 13: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id1~0 != ~id2~0; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id1~0 != ~id3~0; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id2~0 != ~id3~0; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id1~0 >= 0; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id2~0 >= 0; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,148 INFO L290 TraceCheckUtils]: 19: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~id3~0 >= 0; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,148 INFO L290 TraceCheckUtils]: 20: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~r1~0 % 256; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~r2~0 % 256; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,149 INFO L290 TraceCheckUtils]: 22: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~r3~0 % 256; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r122~0#1 % 256); {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r132~0#1 % 256); {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r212~0#1 % 256); {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,151 INFO L290 TraceCheckUtils]: 26: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r232~0#1 % 256); {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,151 INFO L290 TraceCheckUtils]: 27: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r312~0#1 % 256); {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !(0 == main_~init__r322~0#1 % 256); {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~max1~0 == ~id1~0; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~max2~0 == ~id2~0; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~max3~0 == ~id3~0; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~st1~0; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~st2~0; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,154 INFO L290 TraceCheckUtils]: 34: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~st3~0; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,154 INFO L290 TraceCheckUtils]: 35: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~nl1~0; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,155 INFO L290 TraceCheckUtils]: 36: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~nl2~0; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,155 INFO L290 TraceCheckUtils]: 37: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~nl3~0; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,156 INFO L290 TraceCheckUtils]: 38: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~mode1~0 % 256; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,156 INFO L290 TraceCheckUtils]: 39: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~mode2~0 % 256; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,156 INFO L290 TraceCheckUtils]: 40: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1142~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1142~0; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,157 INFO L290 TraceCheckUtils]: 41: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,157 INFO L290 TraceCheckUtils]: 42: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !!(0 == ~mode1~0 % 256); {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,158 INFO L290 TraceCheckUtils]: 43: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume ~r1~0 % 256 < 2; {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} is VALID [2022-02-20 18:38:51,158 INFO L290 TraceCheckUtils]: 44: Hoare triple {1966#(<= (+ (* (div ~ep12~0 256) 256) 1) ~ep12~0)} assume !!(0 == ~ep12~0 % 256); {1964#false} is VALID [2022-02-20 18:38:51,158 INFO L290 TraceCheckUtils]: 45: Hoare triple {1964#false} assume !!(0 == ~ep13~0 % 256); {1964#false} is VALID [2022-02-20 18:38:51,159 INFO L290 TraceCheckUtils]: 46: Hoare triple {1964#false} ~mode1~0 := 1; {1964#false} is VALID [2022-02-20 18:38:51,159 INFO L290 TraceCheckUtils]: 47: Hoare triple {1964#false} assume !!(0 == ~mode2~0 % 256); {1964#false} is VALID [2022-02-20 18:38:51,159 INFO L290 TraceCheckUtils]: 48: Hoare triple {1964#false} assume ~r2~0 % 256 < 2; {1964#false} is VALID [2022-02-20 18:38:51,159 INFO L290 TraceCheckUtils]: 49: Hoare triple {1964#false} assume !!(0 == ~ep21~0 % 256); {1964#false} is VALID [2022-02-20 18:38:51,159 INFO L290 TraceCheckUtils]: 50: Hoare triple {1964#false} assume !!(0 == ~ep23~0 % 256); {1964#false} is VALID [2022-02-20 18:38:51,159 INFO L290 TraceCheckUtils]: 51: Hoare triple {1964#false} ~mode2~0 := 1; {1964#false} is VALID [2022-02-20 18:38:51,160 INFO L290 TraceCheckUtils]: 52: Hoare triple {1964#false} assume !!(0 == ~mode3~0 % 256); {1964#false} is VALID [2022-02-20 18:38:51,160 INFO L290 TraceCheckUtils]: 53: Hoare triple {1964#false} assume ~r3~0 % 256 < 2; {1964#false} is VALID [2022-02-20 18:38:51,160 INFO L290 TraceCheckUtils]: 54: Hoare triple {1964#false} assume !!(0 == ~ep31~0 % 256); {1964#false} is VALID [2022-02-20 18:38:51,160 INFO L290 TraceCheckUtils]: 55: Hoare triple {1964#false} assume !!(0 == ~ep32~0 % 256); {1964#false} is VALID [2022-02-20 18:38:51,160 INFO L290 TraceCheckUtils]: 56: Hoare triple {1964#false} ~mode3~0 := 1;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {1964#false} is VALID [2022-02-20 18:38:51,160 INFO L290 TraceCheckUtils]: 57: Hoare triple {1964#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1964#false} is VALID [2022-02-20 18:38:51,161 INFO L290 TraceCheckUtils]: 58: Hoare triple {1964#false} assume ~st1~0 + ~nl1~0 <= 1; {1964#false} is VALID [2022-02-20 18:38:51,161 INFO L290 TraceCheckUtils]: 59: Hoare triple {1964#false} assume ~st2~0 + ~nl2~0 <= 1; {1964#false} is VALID [2022-02-20 18:38:51,161 INFO L290 TraceCheckUtils]: 60: Hoare triple {1964#false} assume ~st3~0 + ~nl3~0 <= 1; {1964#false} is VALID [2022-02-20 18:38:51,161 INFO L290 TraceCheckUtils]: 61: Hoare triple {1964#false} assume !(~r1~0 % 256 >= 2); {1964#false} is VALID [2022-02-20 18:38:51,161 INFO L290 TraceCheckUtils]: 62: Hoare triple {1964#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {1964#false} is VALID [2022-02-20 18:38:51,161 INFO L290 TraceCheckUtils]: 63: Hoare triple {1964#false} assume ~r1~0 % 256 < 2; {1964#false} is VALID [2022-02-20 18:38:51,162 INFO L290 TraceCheckUtils]: 64: Hoare triple {1964#false} assume !(~r1~0 % 256 >= 2); {1964#false} is VALID [2022-02-20 18:38:51,162 INFO L290 TraceCheckUtils]: 65: Hoare triple {1964#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {1964#false} is VALID [2022-02-20 18:38:51,162 INFO L290 TraceCheckUtils]: 66: Hoare triple {1964#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1270~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1270~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {1964#false} is VALID [2022-02-20 18:38:51,162 INFO L290 TraceCheckUtils]: 67: Hoare triple {1964#false} assume !(0 == main_~assert__arg~0#1 % 256); {1964#false} is VALID [2022-02-20 18:38:51,162 INFO L290 TraceCheckUtils]: 68: Hoare triple {1964#false} assume !(0 == ~mode1~0 % 256); {1964#false} is VALID [2022-02-20 18:38:51,162 INFO L290 TraceCheckUtils]: 69: Hoare triple {1964#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {1964#false} is VALID [2022-02-20 18:38:51,162 INFO L290 TraceCheckUtils]: 70: Hoare triple {1964#false} assume !!(0 == ~ep21~0 % 256); {1964#false} is VALID [2022-02-20 18:38:51,163 INFO L290 TraceCheckUtils]: 71: Hoare triple {1964#false} assume !!(0 == ~ep31~0 % 256); {1964#false} is VALID [2022-02-20 18:38:51,163 INFO L290 TraceCheckUtils]: 72: Hoare triple {1964#false} assume 1 == ~r1~0 % 256; {1964#false} is VALID [2022-02-20 18:38:51,163 INFO L290 TraceCheckUtils]: 73: Hoare triple {1964#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {1964#false} is VALID [2022-02-20 18:38:51,163 INFO L290 TraceCheckUtils]: 74: Hoare triple {1964#false} ~mode1~0 := 0; {1964#false} is VALID [2022-02-20 18:38:51,163 INFO L290 TraceCheckUtils]: 75: Hoare triple {1964#false} assume !(0 == ~mode2~0 % 256); {1964#false} is VALID [2022-02-20 18:38:51,163 INFO L290 TraceCheckUtils]: 76: Hoare triple {1964#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {1964#false} is VALID [2022-02-20 18:38:51,163 INFO L290 TraceCheckUtils]: 77: Hoare triple {1964#false} assume !!(0 == ~ep12~0 % 256); {1964#false} is VALID [2022-02-20 18:38:51,164 INFO L290 TraceCheckUtils]: 78: Hoare triple {1964#false} assume !!(0 == ~ep32~0 % 256); {1964#false} is VALID [2022-02-20 18:38:51,164 INFO L290 TraceCheckUtils]: 79: Hoare triple {1964#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0; {1964#false} is VALID [2022-02-20 18:38:51,164 INFO L290 TraceCheckUtils]: 80: Hoare triple {1964#false} assume !(0 == ~mode3~0 % 256); {1964#false} is VALID [2022-02-20 18:38:51,164 INFO L290 TraceCheckUtils]: 81: Hoare triple {1964#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {1964#false} is VALID [2022-02-20 18:38:51,164 INFO L290 TraceCheckUtils]: 82: Hoare triple {1964#false} assume !!(0 == ~ep13~0 % 256); {1964#false} is VALID [2022-02-20 18:38:51,164 INFO L290 TraceCheckUtils]: 83: Hoare triple {1964#false} assume !!(0 == ~ep23~0 % 256); {1964#false} is VALID [2022-02-20 18:38:51,165 INFO L290 TraceCheckUtils]: 84: Hoare triple {1964#false} assume !(2 == ~r3~0 % 256);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {1964#false} is VALID [2022-02-20 18:38:51,165 INFO L290 TraceCheckUtils]: 85: Hoare triple {1964#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1964#false} is VALID [2022-02-20 18:38:51,165 INFO L290 TraceCheckUtils]: 86: Hoare triple {1964#false} assume ~st1~0 + ~nl1~0 <= 1; {1964#false} is VALID [2022-02-20 18:38:51,165 INFO L290 TraceCheckUtils]: 87: Hoare triple {1964#false} assume ~st2~0 + ~nl2~0 <= 1; {1964#false} is VALID [2022-02-20 18:38:51,165 INFO L290 TraceCheckUtils]: 88: Hoare triple {1964#false} assume ~st3~0 + ~nl3~0 <= 1; {1964#false} is VALID [2022-02-20 18:38:51,165 INFO L290 TraceCheckUtils]: 89: Hoare triple {1964#false} assume !(~r1~0 % 256 >= 2); {1964#false} is VALID [2022-02-20 18:38:51,165 INFO L290 TraceCheckUtils]: 90: Hoare triple {1964#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {1964#false} is VALID [2022-02-20 18:38:51,166 INFO L290 TraceCheckUtils]: 91: Hoare triple {1964#false} ~__return_1389~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1389~0; {1964#false} is VALID [2022-02-20 18:38:51,166 INFO L290 TraceCheckUtils]: 92: Hoare triple {1964#false} havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {1964#false} is VALID [2022-02-20 18:38:51,166 INFO L290 TraceCheckUtils]: 93: Hoare triple {1964#false} assume 0 == main_~assert__arg~1#1 % 256; {1964#false} is VALID [2022-02-20 18:38:51,166 INFO L290 TraceCheckUtils]: 94: Hoare triple {1964#false} assume !false; {1964#false} is VALID [2022-02-20 18:38:51,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:38:51,167 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:51,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595678229] [2022-02-20 18:38:51,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595678229] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:51,167 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:51,167 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:38:51,168 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792800668] [2022-02-20 18:38:51,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:51,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-02-20 18:38:51,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:51,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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) [2022-02-20 18:38:51,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:51,224 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:38:51,224 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:51,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:38:51,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:38:51,224 INFO L87 Difference]: Start difference. First operand 332 states and 507 transitions. Second operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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) [2022-02-20 18:38:51,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:51,973 INFO L93 Difference]: Finished difference Result 965 states and 1470 transitions. [2022-02-20 18:38:51,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:38:51,973 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2022-02-20 18:38:51,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:51,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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) [2022-02-20 18:38:51,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 943 transitions. [2022-02-20 18:38:51,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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) [2022-02-20 18:38:51,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 943 transitions. [2022-02-20 18:38:51,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 943 transitions. [2022-02-20 18:38:52,661 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 943 edges. 943 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:52,696 INFO L225 Difference]: With dead ends: 965 [2022-02-20 18:38:52,696 INFO L226 Difference]: Without dead ends: 642 [2022-02-20 18:38:52,703 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:38:52,705 INFO L933 BasicCegarLoop]: 544 mSDtfsCounter, 659 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 659 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:52,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [659 Valid, 838 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:52,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2022-02-20 18:38:52,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 640. [2022-02-20 18:38:52,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:52,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 642 states. Second operand has 640 states, 639 states have (on average 1.5148669796557122) internal successors, (968), 639 states have internal predecessors, (968), 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) [2022-02-20 18:38:52,815 INFO L74 IsIncluded]: Start isIncluded. First operand 642 states. Second operand has 640 states, 639 states have (on average 1.5148669796557122) internal successors, (968), 639 states have internal predecessors, (968), 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) [2022-02-20 18:38:52,816 INFO L87 Difference]: Start difference. First operand 642 states. Second operand has 640 states, 639 states have (on average 1.5148669796557122) internal successors, (968), 639 states have internal predecessors, (968), 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) [2022-02-20 18:38:52,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:52,836 INFO L93 Difference]: Finished difference Result 642 states and 969 transitions. [2022-02-20 18:38:52,836 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 969 transitions. [2022-02-20 18:38:52,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:52,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:52,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 640 states, 639 states have (on average 1.5148669796557122) internal successors, (968), 639 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 642 states. [2022-02-20 18:38:52,839 INFO L87 Difference]: Start difference. First operand has 640 states, 639 states have (on average 1.5148669796557122) internal successors, (968), 639 states have internal predecessors, (968), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 642 states. [2022-02-20 18:38:52,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:52,853 INFO L93 Difference]: Finished difference Result 642 states and 969 transitions. [2022-02-20 18:38:52,853 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 969 transitions. [2022-02-20 18:38:52,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:52,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:52,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:52,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:52,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 640 states, 639 states have (on average 1.5148669796557122) internal successors, (968), 639 states have internal predecessors, (968), 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) [2022-02-20 18:38:52,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 640 states and 968 transitions. [2022-02-20 18:38:52,871 INFO L78 Accepts]: Start accepts. Automaton has 640 states and 968 transitions. Word has length 95 [2022-02-20 18:38:52,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:52,872 INFO L470 AbstractCegarLoop]: Abstraction has 640 states and 968 transitions. [2022-02-20 18:38:52,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.75) internal successors, (95), 4 states have internal predecessors, (95), 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) [2022-02-20 18:38:52,872 INFO L276 IsEmpty]: Start isEmpty. Operand 640 states and 968 transitions. [2022-02-20 18:38:52,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-02-20 18:38:52,873 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:52,873 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:38:52,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:38:52,874 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:52,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:52,874 INFO L85 PathProgramCache]: Analyzing trace with hash -779319531, now seen corresponding path program 1 times [2022-02-20 18:38:52,874 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:52,874 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935112868] [2022-02-20 18:38:52,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:52,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:52,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:52,914 INFO L290 TraceCheckUtils]: 0: Hoare triple {5427#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1142~0 := 0;~__return_1270~0 := 0;~__return_1389~0 := 0;~__return_1499~0 := 0; {5427#true} is VALID [2022-02-20 18:38:52,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {5427#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {5427#true} is VALID [2022-02-20 18:38:52,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {5427#true} assume !!(0 == main_~init__r121~0#1 % 256); {5427#true} is VALID [2022-02-20 18:38:52,915 INFO L290 TraceCheckUtils]: 3: Hoare triple {5427#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {5429#(= (+ (* (- 256) (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:38:52,916 INFO L290 TraceCheckUtils]: 4: Hoare triple {5429#(= (+ (* (- 256) (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) 0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {5429#(= (+ (* (- 256) (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:38:52,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {5429#(= (+ (* (- 256) (div |ULTIMATE.start_main_~init__r131~0#1| 256)) |ULTIMATE.start_main_~init__r131~0#1|) 0)} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {5428#false} is VALID [2022-02-20 18:38:52,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {5428#false} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {5428#false} is VALID [2022-02-20 18:38:52,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {5428#false} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {5428#false} is VALID [2022-02-20 18:38:52,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {5428#false} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {5428#false} is VALID [2022-02-20 18:38:52,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {5428#false} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {5428#false} is VALID [2022-02-20 18:38:52,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {5428#false} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {5428#false} is VALID [2022-02-20 18:38:52,917 INFO L290 TraceCheckUtils]: 11: Hoare triple {5428#false} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {5428#false} is VALID [2022-02-20 18:38:52,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {5428#false} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {5428#false} is VALID [2022-02-20 18:38:52,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {5428#false} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {5428#false} is VALID [2022-02-20 18:38:52,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {5428#false} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {5428#false} is VALID [2022-02-20 18:38:52,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {5428#false} assume ~id1~0 != ~id2~0; {5428#false} is VALID [2022-02-20 18:38:52,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {5428#false} assume ~id1~0 != ~id3~0; {5428#false} is VALID [2022-02-20 18:38:52,918 INFO L290 TraceCheckUtils]: 17: Hoare triple {5428#false} assume ~id2~0 != ~id3~0; {5428#false} is VALID [2022-02-20 18:38:52,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {5428#false} assume ~id1~0 >= 0; {5428#false} is VALID [2022-02-20 18:38:52,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {5428#false} assume ~id2~0 >= 0; {5428#false} is VALID [2022-02-20 18:38:52,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {5428#false} assume ~id3~0 >= 0; {5428#false} is VALID [2022-02-20 18:38:52,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {5428#false} assume 0 == ~r1~0 % 256; {5428#false} is VALID [2022-02-20 18:38:52,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {5428#false} assume 0 == ~r2~0 % 256; {5428#false} is VALID [2022-02-20 18:38:52,919 INFO L290 TraceCheckUtils]: 23: Hoare triple {5428#false} assume 0 == ~r3~0 % 256; {5428#false} is VALID [2022-02-20 18:38:52,919 INFO L290 TraceCheckUtils]: 24: Hoare triple {5428#false} assume !(0 == main_~init__r122~0#1 % 256); {5428#false} is VALID [2022-02-20 18:38:52,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {5428#false} assume !(0 == main_~init__r132~0#1 % 256); {5428#false} is VALID [2022-02-20 18:38:52,919 INFO L290 TraceCheckUtils]: 26: Hoare triple {5428#false} assume !(0 == main_~init__r212~0#1 % 256); {5428#false} is VALID [2022-02-20 18:38:52,919 INFO L290 TraceCheckUtils]: 27: Hoare triple {5428#false} assume !(0 == main_~init__r232~0#1 % 256); {5428#false} is VALID [2022-02-20 18:38:52,919 INFO L290 TraceCheckUtils]: 28: Hoare triple {5428#false} assume !(0 == main_~init__r312~0#1 % 256); {5428#false} is VALID [2022-02-20 18:38:52,920 INFO L290 TraceCheckUtils]: 29: Hoare triple {5428#false} assume !(0 == main_~init__r322~0#1 % 256); {5428#false} is VALID [2022-02-20 18:38:52,920 INFO L290 TraceCheckUtils]: 30: Hoare triple {5428#false} assume ~max1~0 == ~id1~0; {5428#false} is VALID [2022-02-20 18:38:52,920 INFO L290 TraceCheckUtils]: 31: Hoare triple {5428#false} assume ~max2~0 == ~id2~0; {5428#false} is VALID [2022-02-20 18:38:52,920 INFO L290 TraceCheckUtils]: 32: Hoare triple {5428#false} assume ~max3~0 == ~id3~0; {5428#false} is VALID [2022-02-20 18:38:52,920 INFO L290 TraceCheckUtils]: 33: Hoare triple {5428#false} assume 0 == ~st1~0; {5428#false} is VALID [2022-02-20 18:38:52,920 INFO L290 TraceCheckUtils]: 34: Hoare triple {5428#false} assume 0 == ~st2~0; {5428#false} is VALID [2022-02-20 18:38:52,921 INFO L290 TraceCheckUtils]: 35: Hoare triple {5428#false} assume 0 == ~st3~0; {5428#false} is VALID [2022-02-20 18:38:52,921 INFO L290 TraceCheckUtils]: 36: Hoare triple {5428#false} assume 0 == ~nl1~0; {5428#false} is VALID [2022-02-20 18:38:52,921 INFO L290 TraceCheckUtils]: 37: Hoare triple {5428#false} assume 0 == ~nl2~0; {5428#false} is VALID [2022-02-20 18:38:52,921 INFO L290 TraceCheckUtils]: 38: Hoare triple {5428#false} assume 0 == ~nl3~0; {5428#false} is VALID [2022-02-20 18:38:52,921 INFO L290 TraceCheckUtils]: 39: Hoare triple {5428#false} assume 0 == ~mode1~0 % 256; {5428#false} is VALID [2022-02-20 18:38:52,921 INFO L290 TraceCheckUtils]: 40: Hoare triple {5428#false} assume 0 == ~mode2~0 % 256; {5428#false} is VALID [2022-02-20 18:38:52,921 INFO L290 TraceCheckUtils]: 41: Hoare triple {5428#false} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1142~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1142~0; {5428#false} is VALID [2022-02-20 18:38:52,922 INFO L290 TraceCheckUtils]: 42: Hoare triple {5428#false} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {5428#false} is VALID [2022-02-20 18:38:52,922 INFO L290 TraceCheckUtils]: 43: Hoare triple {5428#false} assume !!(0 == ~mode1~0 % 256); {5428#false} is VALID [2022-02-20 18:38:52,922 INFO L290 TraceCheckUtils]: 44: Hoare triple {5428#false} assume ~r1~0 % 256 < 2; {5428#false} is VALID [2022-02-20 18:38:52,922 INFO L290 TraceCheckUtils]: 45: Hoare triple {5428#false} assume !!(0 == ~ep12~0 % 256); {5428#false} is VALID [2022-02-20 18:38:52,922 INFO L290 TraceCheckUtils]: 46: Hoare triple {5428#false} assume !!(0 == ~ep13~0 % 256); {5428#false} is VALID [2022-02-20 18:38:52,922 INFO L290 TraceCheckUtils]: 47: Hoare triple {5428#false} ~mode1~0 := 1; {5428#false} is VALID [2022-02-20 18:38:52,923 INFO L290 TraceCheckUtils]: 48: Hoare triple {5428#false} assume !!(0 == ~mode2~0 % 256); {5428#false} is VALID [2022-02-20 18:38:52,923 INFO L290 TraceCheckUtils]: 49: Hoare triple {5428#false} assume ~r2~0 % 256 < 2; {5428#false} is VALID [2022-02-20 18:38:52,923 INFO L290 TraceCheckUtils]: 50: Hoare triple {5428#false} assume !!(0 == ~ep21~0 % 256); {5428#false} is VALID [2022-02-20 18:38:52,923 INFO L290 TraceCheckUtils]: 51: Hoare triple {5428#false} assume !!(0 == ~ep23~0 % 256); {5428#false} is VALID [2022-02-20 18:38:52,923 INFO L290 TraceCheckUtils]: 52: Hoare triple {5428#false} ~mode2~0 := 1; {5428#false} is VALID [2022-02-20 18:38:52,923 INFO L290 TraceCheckUtils]: 53: Hoare triple {5428#false} assume !!(0 == ~mode3~0 % 256); {5428#false} is VALID [2022-02-20 18:38:52,923 INFO L290 TraceCheckUtils]: 54: Hoare triple {5428#false} assume ~r3~0 % 256 < 2; {5428#false} is VALID [2022-02-20 18:38:52,924 INFO L290 TraceCheckUtils]: 55: Hoare triple {5428#false} assume !!(0 == ~ep31~0 % 256); {5428#false} is VALID [2022-02-20 18:38:52,924 INFO L290 TraceCheckUtils]: 56: Hoare triple {5428#false} assume !!(0 == ~ep32~0 % 256); {5428#false} is VALID [2022-02-20 18:38:52,924 INFO L290 TraceCheckUtils]: 57: Hoare triple {5428#false} ~mode3~0 := 1;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {5428#false} is VALID [2022-02-20 18:38:52,924 INFO L290 TraceCheckUtils]: 58: Hoare triple {5428#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {5428#false} is VALID [2022-02-20 18:38:52,924 INFO L290 TraceCheckUtils]: 59: Hoare triple {5428#false} assume ~st1~0 + ~nl1~0 <= 1; {5428#false} is VALID [2022-02-20 18:38:52,924 INFO L290 TraceCheckUtils]: 60: Hoare triple {5428#false} assume ~st2~0 + ~nl2~0 <= 1; {5428#false} is VALID [2022-02-20 18:38:52,924 INFO L290 TraceCheckUtils]: 61: Hoare triple {5428#false} assume ~st3~0 + ~nl3~0 <= 1; {5428#false} is VALID [2022-02-20 18:38:52,925 INFO L290 TraceCheckUtils]: 62: Hoare triple {5428#false} assume !(~r1~0 % 256 >= 2); {5428#false} is VALID [2022-02-20 18:38:52,925 INFO L290 TraceCheckUtils]: 63: Hoare triple {5428#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {5428#false} is VALID [2022-02-20 18:38:52,925 INFO L290 TraceCheckUtils]: 64: Hoare triple {5428#false} assume ~r1~0 % 256 < 2; {5428#false} is VALID [2022-02-20 18:38:52,925 INFO L290 TraceCheckUtils]: 65: Hoare triple {5428#false} assume !(~r1~0 % 256 >= 2); {5428#false} is VALID [2022-02-20 18:38:52,925 INFO L290 TraceCheckUtils]: 66: Hoare triple {5428#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {5428#false} is VALID [2022-02-20 18:38:52,925 INFO L290 TraceCheckUtils]: 67: Hoare triple {5428#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1270~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1270~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {5428#false} is VALID [2022-02-20 18:38:52,926 INFO L290 TraceCheckUtils]: 68: Hoare triple {5428#false} assume !(0 == main_~assert__arg~0#1 % 256); {5428#false} is VALID [2022-02-20 18:38:52,926 INFO L290 TraceCheckUtils]: 69: Hoare triple {5428#false} assume !(0 == ~mode1~0 % 256); {5428#false} is VALID [2022-02-20 18:38:52,926 INFO L290 TraceCheckUtils]: 70: Hoare triple {5428#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {5428#false} is VALID [2022-02-20 18:38:52,926 INFO L290 TraceCheckUtils]: 71: Hoare triple {5428#false} assume !!(0 == ~ep21~0 % 256); {5428#false} is VALID [2022-02-20 18:38:52,926 INFO L290 TraceCheckUtils]: 72: Hoare triple {5428#false} assume !!(0 == ~ep31~0 % 256); {5428#false} is VALID [2022-02-20 18:38:52,926 INFO L290 TraceCheckUtils]: 73: Hoare triple {5428#false} assume 1 == ~r1~0 % 256; {5428#false} is VALID [2022-02-20 18:38:52,926 INFO L290 TraceCheckUtils]: 74: Hoare triple {5428#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {5428#false} is VALID [2022-02-20 18:38:52,927 INFO L290 TraceCheckUtils]: 75: Hoare triple {5428#false} ~mode1~0 := 0; {5428#false} is VALID [2022-02-20 18:38:52,927 INFO L290 TraceCheckUtils]: 76: Hoare triple {5428#false} assume !(0 == ~mode2~0 % 256); {5428#false} is VALID [2022-02-20 18:38:52,927 INFO L290 TraceCheckUtils]: 77: Hoare triple {5428#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {5428#false} is VALID [2022-02-20 18:38:52,927 INFO L290 TraceCheckUtils]: 78: Hoare triple {5428#false} assume !!(0 == ~ep12~0 % 256); {5428#false} is VALID [2022-02-20 18:38:52,927 INFO L290 TraceCheckUtils]: 79: Hoare triple {5428#false} assume !!(0 == ~ep32~0 % 256); {5428#false} is VALID [2022-02-20 18:38:52,927 INFO L290 TraceCheckUtils]: 80: Hoare triple {5428#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0; {5428#false} is VALID [2022-02-20 18:38:52,928 INFO L290 TraceCheckUtils]: 81: Hoare triple {5428#false} assume !(0 == ~mode3~0 % 256); {5428#false} is VALID [2022-02-20 18:38:52,928 INFO L290 TraceCheckUtils]: 82: Hoare triple {5428#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {5428#false} is VALID [2022-02-20 18:38:52,928 INFO L290 TraceCheckUtils]: 83: Hoare triple {5428#false} assume !!(0 == ~ep13~0 % 256); {5428#false} is VALID [2022-02-20 18:38:52,928 INFO L290 TraceCheckUtils]: 84: Hoare triple {5428#false} assume !!(0 == ~ep23~0 % 256); {5428#false} is VALID [2022-02-20 18:38:52,928 INFO L290 TraceCheckUtils]: 85: Hoare triple {5428#false} assume !(2 == ~r3~0 % 256);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {5428#false} is VALID [2022-02-20 18:38:52,928 INFO L290 TraceCheckUtils]: 86: Hoare triple {5428#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {5428#false} is VALID [2022-02-20 18:38:52,928 INFO L290 TraceCheckUtils]: 87: Hoare triple {5428#false} assume ~st1~0 + ~nl1~0 <= 1; {5428#false} is VALID [2022-02-20 18:38:52,929 INFO L290 TraceCheckUtils]: 88: Hoare triple {5428#false} assume ~st2~0 + ~nl2~0 <= 1; {5428#false} is VALID [2022-02-20 18:38:52,929 INFO L290 TraceCheckUtils]: 89: Hoare triple {5428#false} assume ~st3~0 + ~nl3~0 <= 1; {5428#false} is VALID [2022-02-20 18:38:52,929 INFO L290 TraceCheckUtils]: 90: Hoare triple {5428#false} assume !(~r1~0 % 256 >= 2); {5428#false} is VALID [2022-02-20 18:38:52,929 INFO L290 TraceCheckUtils]: 91: Hoare triple {5428#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {5428#false} is VALID [2022-02-20 18:38:52,929 INFO L290 TraceCheckUtils]: 92: Hoare triple {5428#false} ~__return_1389~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1389~0; {5428#false} is VALID [2022-02-20 18:38:52,929 INFO L290 TraceCheckUtils]: 93: Hoare triple {5428#false} havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {5428#false} is VALID [2022-02-20 18:38:52,930 INFO L290 TraceCheckUtils]: 94: Hoare triple {5428#false} assume 0 == main_~assert__arg~1#1 % 256; {5428#false} is VALID [2022-02-20 18:38:52,930 INFO L290 TraceCheckUtils]: 95: Hoare triple {5428#false} assume !false; {5428#false} is VALID [2022-02-20 18:38:52,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:38:52,930 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:52,930 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935112868] [2022-02-20 18:38:52,931 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935112868] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:52,931 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:52,931 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:52,931 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578197412] [2022-02-20 18:38:52,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:52,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2022-02-20 18:38:52,932 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:52,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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) [2022-02-20 18:38:52,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:52,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:52,989 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:52,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:52,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:52,990 INFO L87 Difference]: Start difference. First operand 640 states and 968 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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) [2022-02-20 18:38:53,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:53,634 INFO L93 Difference]: Finished difference Result 1882 states and 2842 transitions. [2022-02-20 18:38:53,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:53,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 96 [2022-02-20 18:38:53,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:53,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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) [2022-02-20 18:38:53,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2022-02-20 18:38:53,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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) [2022-02-20 18:38:53,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 957 transitions. [2022-02-20 18:38:53,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 957 transitions. [2022-02-20 18:38:54,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 957 edges. 957 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:54,270 INFO L225 Difference]: With dead ends: 1882 [2022-02-20 18:38:54,270 INFO L226 Difference]: Without dead ends: 1270 [2022-02-20 18:38:54,271 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:54,292 INFO L933 BasicCegarLoop]: 394 mSDtfsCounter, 317 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 713 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:54,293 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [317 Valid, 713 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:54,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1270 states. [2022-02-20 18:38:54,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1270 to 642. [2022-02-20 18:38:54,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:54,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1270 states. Second operand has 642 states, 641 states have (on average 1.5132605304212168) internal successors, (970), 641 states have internal predecessors, (970), 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) [2022-02-20 18:38:54,430 INFO L74 IsIncluded]: Start isIncluded. First operand 1270 states. Second operand has 642 states, 641 states have (on average 1.5132605304212168) internal successors, (970), 641 states have internal predecessors, (970), 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) [2022-02-20 18:38:54,431 INFO L87 Difference]: Start difference. First operand 1270 states. Second operand has 642 states, 641 states have (on average 1.5132605304212168) internal successors, (970), 641 states have internal predecessors, (970), 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) [2022-02-20 18:38:54,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:54,514 INFO L93 Difference]: Finished difference Result 1270 states and 1919 transitions. [2022-02-20 18:38:54,514 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1919 transitions. [2022-02-20 18:38:54,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:54,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:54,532 INFO L74 IsIncluded]: Start isIncluded. First operand has 642 states, 641 states have (on average 1.5132605304212168) internal successors, (970), 641 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1270 states. [2022-02-20 18:38:54,533 INFO L87 Difference]: Start difference. First operand has 642 states, 641 states have (on average 1.5132605304212168) internal successors, (970), 641 states have internal predecessors, (970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1270 states. [2022-02-20 18:38:54,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:54,603 INFO L93 Difference]: Finished difference Result 1270 states and 1919 transitions. [2022-02-20 18:38:54,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1919 transitions. [2022-02-20 18:38:54,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:54,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:54,609 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:54,609 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:54,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 642 states, 641 states have (on average 1.5132605304212168) internal successors, (970), 641 states have internal predecessors, (970), 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) [2022-02-20 18:38:54,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 642 states and 970 transitions. [2022-02-20 18:38:54,667 INFO L78 Accepts]: Start accepts. Automaton has 642 states and 970 transitions. Word has length 96 [2022-02-20 18:38:54,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:54,667 INFO L470 AbstractCegarLoop]: Abstraction has 642 states and 970 transitions. [2022-02-20 18:38:54,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 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) [2022-02-20 18:38:54,668 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 970 transitions. [2022-02-20 18:38:54,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-02-20 18:38:54,669 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:54,669 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:38:54,669 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:38:54,670 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:54,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:54,670 INFO L85 PathProgramCache]: Analyzing trace with hash -611891448, now seen corresponding path program 1 times [2022-02-20 18:38:54,670 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:54,670 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72953138] [2022-02-20 18:38:54,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:54,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:54,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:54,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {11394#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1142~0 := 0;~__return_1270~0 := 0;~__return_1389~0 := 0;~__return_1499~0 := 0; {11394#true} is VALID [2022-02-20 18:38:54,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {11394#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {11396#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:54,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {11396#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {11396#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:54,828 INFO L290 TraceCheckUtils]: 3: Hoare triple {11396#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {11396#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:54,829 INFO L290 TraceCheckUtils]: 4: Hoare triple {11396#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {11396#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:54,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {11396#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256); {11396#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:54,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {11396#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {11396#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:54,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {11396#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {11396#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} is VALID [2022-02-20 18:38:54,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {11396#(= (+ |ULTIMATE.start_main_~init__r211~0#1| (* (- 1) ~ep21~0)) 0)} assume !(0 == main_~init__r211~0#1 % 256);main_~init__tmp___1~0#1 := 1; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id1~0 != ~id2~0; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id1~0 != ~id3~0; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,835 INFO L290 TraceCheckUtils]: 18: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id2~0 != ~id3~0; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id1~0 >= 0; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id2~0 >= 0; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~id3~0 >= 0; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,837 INFO L290 TraceCheckUtils]: 22: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~r1~0 % 256; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,838 INFO L290 TraceCheckUtils]: 23: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~r2~0 % 256; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~r3~0 % 256; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r122~0#1 % 256); {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r132~0#1 % 256); {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r212~0#1 % 256); {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r232~0#1 % 256); {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r312~0#1 % 256); {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,840 INFO L290 TraceCheckUtils]: 30: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !(0 == main_~init__r322~0#1 % 256); {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,841 INFO L290 TraceCheckUtils]: 31: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~max1~0 == ~id1~0; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,841 INFO L290 TraceCheckUtils]: 32: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~max2~0 == ~id2~0; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,842 INFO L290 TraceCheckUtils]: 33: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~max3~0 == ~id3~0; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,842 INFO L290 TraceCheckUtils]: 34: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~st1~0; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,843 INFO L290 TraceCheckUtils]: 35: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~st2~0; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,843 INFO L290 TraceCheckUtils]: 36: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~st3~0; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,843 INFO L290 TraceCheckUtils]: 37: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~nl1~0; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,844 INFO L290 TraceCheckUtils]: 38: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~nl2~0; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,844 INFO L290 TraceCheckUtils]: 39: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~nl3~0; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,844 INFO L290 TraceCheckUtils]: 40: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~mode1~0 % 256; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,845 INFO L290 TraceCheckUtils]: 41: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~mode2~0 % 256; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,845 INFO L290 TraceCheckUtils]: 42: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1142~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1142~0; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,846 INFO L290 TraceCheckUtils]: 43: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,846 INFO L290 TraceCheckUtils]: 44: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~mode1~0 % 256); {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,846 INFO L290 TraceCheckUtils]: 45: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~r1~0 % 256 < 2; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,847 INFO L290 TraceCheckUtils]: 46: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~ep12~0 % 256); {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,847 INFO L290 TraceCheckUtils]: 47: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~ep13~0 % 256); {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,848 INFO L290 TraceCheckUtils]: 48: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} ~mode1~0 := 1; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,848 INFO L290 TraceCheckUtils]: 49: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~mode2~0 % 256); {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,848 INFO L290 TraceCheckUtils]: 50: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume ~r2~0 % 256 < 2; {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} is VALID [2022-02-20 18:38:54,849 INFO L290 TraceCheckUtils]: 51: Hoare triple {11397#(<= (+ (* 256 (div ~ep21~0 256)) 1) ~ep21~0)} assume !!(0 == ~ep21~0 % 256); {11395#false} is VALID [2022-02-20 18:38:54,849 INFO L290 TraceCheckUtils]: 52: Hoare triple {11395#false} assume !!(0 == ~ep23~0 % 256); {11395#false} is VALID [2022-02-20 18:38:54,849 INFO L290 TraceCheckUtils]: 53: Hoare triple {11395#false} ~mode2~0 := 1; {11395#false} is VALID [2022-02-20 18:38:54,849 INFO L290 TraceCheckUtils]: 54: Hoare triple {11395#false} assume !!(0 == ~mode3~0 % 256); {11395#false} is VALID [2022-02-20 18:38:54,849 INFO L290 TraceCheckUtils]: 55: Hoare triple {11395#false} assume ~r3~0 % 256 < 2; {11395#false} is VALID [2022-02-20 18:38:54,849 INFO L290 TraceCheckUtils]: 56: Hoare triple {11395#false} assume !!(0 == ~ep31~0 % 256); {11395#false} is VALID [2022-02-20 18:38:54,850 INFO L290 TraceCheckUtils]: 57: Hoare triple {11395#false} assume !!(0 == ~ep32~0 % 256); {11395#false} is VALID [2022-02-20 18:38:54,854 INFO L290 TraceCheckUtils]: 58: Hoare triple {11395#false} ~mode3~0 := 1;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {11395#false} is VALID [2022-02-20 18:38:54,854 INFO L290 TraceCheckUtils]: 59: Hoare triple {11395#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {11395#false} is VALID [2022-02-20 18:38:54,854 INFO L290 TraceCheckUtils]: 60: Hoare triple {11395#false} assume ~st1~0 + ~nl1~0 <= 1; {11395#false} is VALID [2022-02-20 18:38:54,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {11395#false} assume ~st2~0 + ~nl2~0 <= 1; {11395#false} is VALID [2022-02-20 18:38:54,854 INFO L290 TraceCheckUtils]: 62: Hoare triple {11395#false} assume ~st3~0 + ~nl3~0 <= 1; {11395#false} is VALID [2022-02-20 18:38:54,855 INFO L290 TraceCheckUtils]: 63: Hoare triple {11395#false} assume !(~r1~0 % 256 >= 2); {11395#false} is VALID [2022-02-20 18:38:54,855 INFO L290 TraceCheckUtils]: 64: Hoare triple {11395#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {11395#false} is VALID [2022-02-20 18:38:54,855 INFO L290 TraceCheckUtils]: 65: Hoare triple {11395#false} assume ~r1~0 % 256 < 2; {11395#false} is VALID [2022-02-20 18:38:54,855 INFO L290 TraceCheckUtils]: 66: Hoare triple {11395#false} assume !(~r1~0 % 256 >= 2); {11395#false} is VALID [2022-02-20 18:38:54,855 INFO L290 TraceCheckUtils]: 67: Hoare triple {11395#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {11395#false} is VALID [2022-02-20 18:38:54,855 INFO L290 TraceCheckUtils]: 68: Hoare triple {11395#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1270~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1270~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {11395#false} is VALID [2022-02-20 18:38:54,855 INFO L290 TraceCheckUtils]: 69: Hoare triple {11395#false} assume !(0 == main_~assert__arg~0#1 % 256); {11395#false} is VALID [2022-02-20 18:38:54,856 INFO L290 TraceCheckUtils]: 70: Hoare triple {11395#false} assume !(0 == ~mode1~0 % 256); {11395#false} is VALID [2022-02-20 18:38:54,856 INFO L290 TraceCheckUtils]: 71: Hoare triple {11395#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {11395#false} is VALID [2022-02-20 18:38:54,856 INFO L290 TraceCheckUtils]: 72: Hoare triple {11395#false} assume !!(0 == ~ep21~0 % 256); {11395#false} is VALID [2022-02-20 18:38:54,856 INFO L290 TraceCheckUtils]: 73: Hoare triple {11395#false} assume !!(0 == ~ep31~0 % 256); {11395#false} is VALID [2022-02-20 18:38:54,856 INFO L290 TraceCheckUtils]: 74: Hoare triple {11395#false} assume 1 == ~r1~0 % 256; {11395#false} is VALID [2022-02-20 18:38:54,856 INFO L290 TraceCheckUtils]: 75: Hoare triple {11395#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {11395#false} is VALID [2022-02-20 18:38:54,856 INFO L290 TraceCheckUtils]: 76: Hoare triple {11395#false} ~mode1~0 := 0; {11395#false} is VALID [2022-02-20 18:38:54,857 INFO L290 TraceCheckUtils]: 77: Hoare triple {11395#false} assume !(0 == ~mode2~0 % 256); {11395#false} is VALID [2022-02-20 18:38:54,857 INFO L290 TraceCheckUtils]: 78: Hoare triple {11395#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {11395#false} is VALID [2022-02-20 18:38:54,857 INFO L290 TraceCheckUtils]: 79: Hoare triple {11395#false} assume !!(0 == ~ep12~0 % 256); {11395#false} is VALID [2022-02-20 18:38:54,857 INFO L290 TraceCheckUtils]: 80: Hoare triple {11395#false} assume !!(0 == ~ep32~0 % 256); {11395#false} is VALID [2022-02-20 18:38:54,857 INFO L290 TraceCheckUtils]: 81: Hoare triple {11395#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0; {11395#false} is VALID [2022-02-20 18:38:54,857 INFO L290 TraceCheckUtils]: 82: Hoare triple {11395#false} assume !(0 == ~mode3~0 % 256); {11395#false} is VALID [2022-02-20 18:38:54,857 INFO L290 TraceCheckUtils]: 83: Hoare triple {11395#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {11395#false} is VALID [2022-02-20 18:38:54,857 INFO L290 TraceCheckUtils]: 84: Hoare triple {11395#false} assume !!(0 == ~ep13~0 % 256); {11395#false} is VALID [2022-02-20 18:38:54,858 INFO L290 TraceCheckUtils]: 85: Hoare triple {11395#false} assume !!(0 == ~ep23~0 % 256); {11395#false} is VALID [2022-02-20 18:38:54,858 INFO L290 TraceCheckUtils]: 86: Hoare triple {11395#false} assume !(2 == ~r3~0 % 256);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {11395#false} is VALID [2022-02-20 18:38:54,858 INFO L290 TraceCheckUtils]: 87: Hoare triple {11395#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {11395#false} is VALID [2022-02-20 18:38:54,858 INFO L290 TraceCheckUtils]: 88: Hoare triple {11395#false} assume ~st1~0 + ~nl1~0 <= 1; {11395#false} is VALID [2022-02-20 18:38:54,858 INFO L290 TraceCheckUtils]: 89: Hoare triple {11395#false} assume ~st2~0 + ~nl2~0 <= 1; {11395#false} is VALID [2022-02-20 18:38:54,859 INFO L290 TraceCheckUtils]: 90: Hoare triple {11395#false} assume ~st3~0 + ~nl3~0 <= 1; {11395#false} is VALID [2022-02-20 18:38:54,861 INFO L290 TraceCheckUtils]: 91: Hoare triple {11395#false} assume !(~r1~0 % 256 >= 2); {11395#false} is VALID [2022-02-20 18:38:54,861 INFO L290 TraceCheckUtils]: 92: Hoare triple {11395#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {11395#false} is VALID [2022-02-20 18:38:54,866 INFO L290 TraceCheckUtils]: 93: Hoare triple {11395#false} ~__return_1389~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1389~0; {11395#false} is VALID [2022-02-20 18:38:54,867 INFO L290 TraceCheckUtils]: 94: Hoare triple {11395#false} havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {11395#false} is VALID [2022-02-20 18:38:54,867 INFO L290 TraceCheckUtils]: 95: Hoare triple {11395#false} assume 0 == main_~assert__arg~1#1 % 256; {11395#false} is VALID [2022-02-20 18:38:54,869 INFO L290 TraceCheckUtils]: 96: Hoare triple {11395#false} assume !false; {11395#false} is VALID [2022-02-20 18:38:54,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:38:54,870 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:54,870 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72953138] [2022-02-20 18:38:54,870 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72953138] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:54,871 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:54,871 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:38:54,871 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033194515] [2022-02-20 18:38:54,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:54,871 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-02-20 18:38:54,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:54,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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) [2022-02-20 18:38:54,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:54,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:38:54,940 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:54,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:38:54,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:38:54,941 INFO L87 Difference]: Start difference. First operand 642 states and 970 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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) [2022-02-20 18:38:56,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:56,083 INFO L93 Difference]: Finished difference Result 1838 states and 2766 transitions. [2022-02-20 18:38:56,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:38:56,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-02-20 18:38:56,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:56,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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) [2022-02-20 18:38:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 915 transitions. [2022-02-20 18:38:56,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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) [2022-02-20 18:38:56,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 915 transitions. [2022-02-20 18:38:56,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 915 transitions. [2022-02-20 18:38:56,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 915 edges. 915 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:56,842 INFO L225 Difference]: With dead ends: 1838 [2022-02-20 18:38:56,843 INFO L226 Difference]: Without dead ends: 1226 [2022-02-20 18:38:56,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:38:56,848 INFO L933 BasicCegarLoop]: 525 mSDtfsCounter, 643 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:56,850 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [643 Valid, 819 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:56,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2022-02-20 18:38:57,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1224. [2022-02-20 18:38:57,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:38:57,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1226 states. Second operand has 1224 states, 1223 states have (on average 1.4946852003270645) internal successors, (1828), 1223 states have internal predecessors, (1828), 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) [2022-02-20 18:38:57,115 INFO L74 IsIncluded]: Start isIncluded. First operand 1226 states. Second operand has 1224 states, 1223 states have (on average 1.4946852003270645) internal successors, (1828), 1223 states have internal predecessors, (1828), 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) [2022-02-20 18:38:57,117 INFO L87 Difference]: Start difference. First operand 1226 states. Second operand has 1224 states, 1223 states have (on average 1.4946852003270645) internal successors, (1828), 1223 states have internal predecessors, (1828), 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) [2022-02-20 18:38:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:57,158 INFO L93 Difference]: Finished difference Result 1226 states and 1829 transitions. [2022-02-20 18:38:57,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1829 transitions. [2022-02-20 18:38:57,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:57,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:57,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 1224 states, 1223 states have (on average 1.4946852003270645) internal successors, (1828), 1223 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1226 states. [2022-02-20 18:38:57,163 INFO L87 Difference]: Start difference. First operand has 1224 states, 1223 states have (on average 1.4946852003270645) internal successors, (1828), 1223 states have internal predecessors, (1828), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1226 states. [2022-02-20 18:38:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:57,212 INFO L93 Difference]: Finished difference Result 1226 states and 1829 transitions. [2022-02-20 18:38:57,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1829 transitions. [2022-02-20 18:38:57,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:38:57,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:38:57,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:38:57,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:38:57,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 1223 states have (on average 1.4946852003270645) internal successors, (1828), 1223 states have internal predecessors, (1828), 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) [2022-02-20 18:38:57,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1828 transitions. [2022-02-20 18:38:57,299 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1828 transitions. Word has length 97 [2022-02-20 18:38:57,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:38:57,300 INFO L470 AbstractCegarLoop]: Abstraction has 1224 states and 1828 transitions. [2022-02-20 18:38:57,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 4 states have internal predecessors, (97), 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) [2022-02-20 18:38:57,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1828 transitions. [2022-02-20 18:38:57,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-20 18:38:57,301 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:38:57,301 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:38:57,302 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:38:57,302 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:38:57,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:38:57,304 INFO L85 PathProgramCache]: Analyzing trace with hash 288388308, now seen corresponding path program 1 times [2022-02-20 18:38:57,304 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:38:57,304 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197410366] [2022-02-20 18:38:57,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:38:57,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:38:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:38:57,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {18006#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1142~0 := 0;~__return_1270~0 := 0;~__return_1389~0 := 0;~__return_1499~0 := 0; {18006#true} is VALID [2022-02-20 18:38:57,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {18006#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {18006#true} is VALID [2022-02-20 18:38:57,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {18006#true} assume !!(0 == main_~init__r121~0#1 % 256); {18006#true} is VALID [2022-02-20 18:38:57,369 INFO L290 TraceCheckUtils]: 3: Hoare triple {18006#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {18006#true} is VALID [2022-02-20 18:38:57,369 INFO L290 TraceCheckUtils]: 4: Hoare triple {18006#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {18006#true} is VALID [2022-02-20 18:38:57,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {18006#true} assume !!(0 == main_~init__r131~0#1 % 256); {18006#true} is VALID [2022-02-20 18:38:57,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {18006#true} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {18006#true} is VALID [2022-02-20 18:38:57,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {18006#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {18006#true} is VALID [2022-02-20 18:38:57,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {18006#true} assume !!(0 == main_~init__r211~0#1 % 256); {18006#true} is VALID [2022-02-20 18:38:57,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {18006#true} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {18008#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 256) (div |ULTIMATE.start_main_~init__r231~0#1| 256))) 0)} is VALID [2022-02-20 18:38:57,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {18008#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 256) (div |ULTIMATE.start_main_~init__r231~0#1| 256))) 0)} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {18008#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 256) (div |ULTIMATE.start_main_~init__r231~0#1| 256))) 0)} is VALID [2022-02-20 18:38:57,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {18008#(= (+ |ULTIMATE.start_main_~init__r231~0#1| (* (- 256) (div |ULTIMATE.start_main_~init__r231~0#1| 256))) 0)} assume !(0 == main_~init__r231~0#1 % 256);main_~init__tmp___2~0#1 := 1; {18007#false} is VALID [2022-02-20 18:38:57,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {18007#false} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {18007#false} is VALID [2022-02-20 18:38:57,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {18007#false} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {18007#false} is VALID [2022-02-20 18:38:57,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {18007#false} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {18007#false} is VALID [2022-02-20 18:38:57,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {18007#false} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {18007#false} is VALID [2022-02-20 18:38:57,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {18007#false} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {18007#false} is VALID [2022-02-20 18:38:57,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {18007#false} assume ~id1~0 != ~id2~0; {18007#false} is VALID [2022-02-20 18:38:57,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {18007#false} assume ~id1~0 != ~id3~0; {18007#false} is VALID [2022-02-20 18:38:57,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {18007#false} assume ~id2~0 != ~id3~0; {18007#false} is VALID [2022-02-20 18:38:57,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {18007#false} assume ~id1~0 >= 0; {18007#false} is VALID [2022-02-20 18:38:57,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {18007#false} assume ~id2~0 >= 0; {18007#false} is VALID [2022-02-20 18:38:57,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {18007#false} assume ~id3~0 >= 0; {18007#false} is VALID [2022-02-20 18:38:57,373 INFO L290 TraceCheckUtils]: 23: Hoare triple {18007#false} assume 0 == ~r1~0 % 256; {18007#false} is VALID [2022-02-20 18:38:57,373 INFO L290 TraceCheckUtils]: 24: Hoare triple {18007#false} assume 0 == ~r2~0 % 256; {18007#false} is VALID [2022-02-20 18:38:57,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {18007#false} assume 0 == ~r3~0 % 256; {18007#false} is VALID [2022-02-20 18:38:57,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {18007#false} assume !(0 == main_~init__r122~0#1 % 256); {18007#false} is VALID [2022-02-20 18:38:57,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {18007#false} assume !(0 == main_~init__r132~0#1 % 256); {18007#false} is VALID [2022-02-20 18:38:57,375 INFO L290 TraceCheckUtils]: 28: Hoare triple {18007#false} assume !(0 == main_~init__r212~0#1 % 256); {18007#false} is VALID [2022-02-20 18:38:57,375 INFO L290 TraceCheckUtils]: 29: Hoare triple {18007#false} assume !(0 == main_~init__r232~0#1 % 256); {18007#false} is VALID [2022-02-20 18:38:57,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {18007#false} assume !(0 == main_~init__r312~0#1 % 256); {18007#false} is VALID [2022-02-20 18:38:57,376 INFO L290 TraceCheckUtils]: 31: Hoare triple {18007#false} assume !(0 == main_~init__r322~0#1 % 256); {18007#false} is VALID [2022-02-20 18:38:57,376 INFO L290 TraceCheckUtils]: 32: Hoare triple {18007#false} assume ~max1~0 == ~id1~0; {18007#false} is VALID [2022-02-20 18:38:57,376 INFO L290 TraceCheckUtils]: 33: Hoare triple {18007#false} assume ~max2~0 == ~id2~0; {18007#false} is VALID [2022-02-20 18:38:57,376 INFO L290 TraceCheckUtils]: 34: Hoare triple {18007#false} assume ~max3~0 == ~id3~0; {18007#false} is VALID [2022-02-20 18:38:57,376 INFO L290 TraceCheckUtils]: 35: Hoare triple {18007#false} assume 0 == ~st1~0; {18007#false} is VALID [2022-02-20 18:38:57,377 INFO L290 TraceCheckUtils]: 36: Hoare triple {18007#false} assume 0 == ~st2~0; {18007#false} is VALID [2022-02-20 18:38:57,377 INFO L290 TraceCheckUtils]: 37: Hoare triple {18007#false} assume 0 == ~st3~0; {18007#false} is VALID [2022-02-20 18:38:57,377 INFO L290 TraceCheckUtils]: 38: Hoare triple {18007#false} assume 0 == ~nl1~0; {18007#false} is VALID [2022-02-20 18:38:57,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {18007#false} assume 0 == ~nl2~0; {18007#false} is VALID [2022-02-20 18:38:57,377 INFO L290 TraceCheckUtils]: 40: Hoare triple {18007#false} assume 0 == ~nl3~0; {18007#false} is VALID [2022-02-20 18:38:57,377 INFO L290 TraceCheckUtils]: 41: Hoare triple {18007#false} assume 0 == ~mode1~0 % 256; {18007#false} is VALID [2022-02-20 18:38:57,378 INFO L290 TraceCheckUtils]: 42: Hoare triple {18007#false} assume 0 == ~mode2~0 % 256; {18007#false} is VALID [2022-02-20 18:38:57,378 INFO L290 TraceCheckUtils]: 43: Hoare triple {18007#false} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1142~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1142~0; {18007#false} is VALID [2022-02-20 18:38:57,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {18007#false} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {18007#false} is VALID [2022-02-20 18:38:57,378 INFO L290 TraceCheckUtils]: 45: Hoare triple {18007#false} assume !!(0 == ~mode1~0 % 256); {18007#false} is VALID [2022-02-20 18:38:57,378 INFO L290 TraceCheckUtils]: 46: Hoare triple {18007#false} assume ~r1~0 % 256 < 2; {18007#false} is VALID [2022-02-20 18:38:57,378 INFO L290 TraceCheckUtils]: 47: Hoare triple {18007#false} assume !!(0 == ~ep12~0 % 256); {18007#false} is VALID [2022-02-20 18:38:57,378 INFO L290 TraceCheckUtils]: 48: Hoare triple {18007#false} assume !!(0 == ~ep13~0 % 256); {18007#false} is VALID [2022-02-20 18:38:57,379 INFO L290 TraceCheckUtils]: 49: Hoare triple {18007#false} ~mode1~0 := 1; {18007#false} is VALID [2022-02-20 18:38:57,379 INFO L290 TraceCheckUtils]: 50: Hoare triple {18007#false} assume !!(0 == ~mode2~0 % 256); {18007#false} is VALID [2022-02-20 18:38:57,379 INFO L290 TraceCheckUtils]: 51: Hoare triple {18007#false} assume ~r2~0 % 256 < 2; {18007#false} is VALID [2022-02-20 18:38:57,379 INFO L290 TraceCheckUtils]: 52: Hoare triple {18007#false} assume !!(0 == ~ep21~0 % 256); {18007#false} is VALID [2022-02-20 18:38:57,379 INFO L290 TraceCheckUtils]: 53: Hoare triple {18007#false} assume !!(0 == ~ep23~0 % 256); {18007#false} is VALID [2022-02-20 18:38:57,380 INFO L290 TraceCheckUtils]: 54: Hoare triple {18007#false} ~mode2~0 := 1; {18007#false} is VALID [2022-02-20 18:38:57,380 INFO L290 TraceCheckUtils]: 55: Hoare triple {18007#false} assume !!(0 == ~mode3~0 % 256); {18007#false} is VALID [2022-02-20 18:38:57,380 INFO L290 TraceCheckUtils]: 56: Hoare triple {18007#false} assume ~r3~0 % 256 < 2; {18007#false} is VALID [2022-02-20 18:38:57,380 INFO L290 TraceCheckUtils]: 57: Hoare triple {18007#false} assume !!(0 == ~ep31~0 % 256); {18007#false} is VALID [2022-02-20 18:38:57,380 INFO L290 TraceCheckUtils]: 58: Hoare triple {18007#false} assume !!(0 == ~ep32~0 % 256); {18007#false} is VALID [2022-02-20 18:38:57,380 INFO L290 TraceCheckUtils]: 59: Hoare triple {18007#false} ~mode3~0 := 1;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {18007#false} is VALID [2022-02-20 18:38:57,381 INFO L290 TraceCheckUtils]: 60: Hoare triple {18007#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {18007#false} is VALID [2022-02-20 18:38:57,381 INFO L290 TraceCheckUtils]: 61: Hoare triple {18007#false} assume ~st1~0 + ~nl1~0 <= 1; {18007#false} is VALID [2022-02-20 18:38:57,381 INFO L290 TraceCheckUtils]: 62: Hoare triple {18007#false} assume ~st2~0 + ~nl2~0 <= 1; {18007#false} is VALID [2022-02-20 18:38:57,381 INFO L290 TraceCheckUtils]: 63: Hoare triple {18007#false} assume ~st3~0 + ~nl3~0 <= 1; {18007#false} is VALID [2022-02-20 18:38:57,381 INFO L290 TraceCheckUtils]: 64: Hoare triple {18007#false} assume !(~r1~0 % 256 >= 2); {18007#false} is VALID [2022-02-20 18:38:57,382 INFO L290 TraceCheckUtils]: 65: Hoare triple {18007#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {18007#false} is VALID [2022-02-20 18:38:57,382 INFO L290 TraceCheckUtils]: 66: Hoare triple {18007#false} assume ~r1~0 % 256 < 2; {18007#false} is VALID [2022-02-20 18:38:57,382 INFO L290 TraceCheckUtils]: 67: Hoare triple {18007#false} assume !(~r1~0 % 256 >= 2); {18007#false} is VALID [2022-02-20 18:38:57,382 INFO L290 TraceCheckUtils]: 68: Hoare triple {18007#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {18007#false} is VALID [2022-02-20 18:38:57,382 INFO L290 TraceCheckUtils]: 69: Hoare triple {18007#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1270~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1270~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {18007#false} is VALID [2022-02-20 18:38:57,382 INFO L290 TraceCheckUtils]: 70: Hoare triple {18007#false} assume !(0 == main_~assert__arg~0#1 % 256); {18007#false} is VALID [2022-02-20 18:38:57,383 INFO L290 TraceCheckUtils]: 71: Hoare triple {18007#false} assume !(0 == ~mode1~0 % 256); {18007#false} is VALID [2022-02-20 18:38:57,383 INFO L290 TraceCheckUtils]: 72: Hoare triple {18007#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {18007#false} is VALID [2022-02-20 18:38:57,383 INFO L290 TraceCheckUtils]: 73: Hoare triple {18007#false} assume !!(0 == ~ep21~0 % 256); {18007#false} is VALID [2022-02-20 18:38:57,383 INFO L290 TraceCheckUtils]: 74: Hoare triple {18007#false} assume !!(0 == ~ep31~0 % 256); {18007#false} is VALID [2022-02-20 18:38:57,383 INFO L290 TraceCheckUtils]: 75: Hoare triple {18007#false} assume 1 == ~r1~0 % 256; {18007#false} is VALID [2022-02-20 18:38:57,383 INFO L290 TraceCheckUtils]: 76: Hoare triple {18007#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {18007#false} is VALID [2022-02-20 18:38:57,383 INFO L290 TraceCheckUtils]: 77: Hoare triple {18007#false} ~mode1~0 := 0; {18007#false} is VALID [2022-02-20 18:38:57,384 INFO L290 TraceCheckUtils]: 78: Hoare triple {18007#false} assume !(0 == ~mode2~0 % 256); {18007#false} is VALID [2022-02-20 18:38:57,384 INFO L290 TraceCheckUtils]: 79: Hoare triple {18007#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {18007#false} is VALID [2022-02-20 18:38:57,384 INFO L290 TraceCheckUtils]: 80: Hoare triple {18007#false} assume !!(0 == ~ep12~0 % 256); {18007#false} is VALID [2022-02-20 18:38:57,384 INFO L290 TraceCheckUtils]: 81: Hoare triple {18007#false} assume !!(0 == ~ep32~0 % 256); {18007#false} is VALID [2022-02-20 18:38:57,384 INFO L290 TraceCheckUtils]: 82: Hoare triple {18007#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0; {18007#false} is VALID [2022-02-20 18:38:57,385 INFO L290 TraceCheckUtils]: 83: Hoare triple {18007#false} assume !(0 == ~mode3~0 % 256); {18007#false} is VALID [2022-02-20 18:38:57,385 INFO L290 TraceCheckUtils]: 84: Hoare triple {18007#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {18007#false} is VALID [2022-02-20 18:38:57,385 INFO L290 TraceCheckUtils]: 85: Hoare triple {18007#false} assume !!(0 == ~ep13~0 % 256); {18007#false} is VALID [2022-02-20 18:38:57,385 INFO L290 TraceCheckUtils]: 86: Hoare triple {18007#false} assume !!(0 == ~ep23~0 % 256); {18007#false} is VALID [2022-02-20 18:38:57,385 INFO L290 TraceCheckUtils]: 87: Hoare triple {18007#false} assume !(2 == ~r3~0 % 256);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {18007#false} is VALID [2022-02-20 18:38:57,385 INFO L290 TraceCheckUtils]: 88: Hoare triple {18007#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {18007#false} is VALID [2022-02-20 18:38:57,386 INFO L290 TraceCheckUtils]: 89: Hoare triple {18007#false} assume ~st1~0 + ~nl1~0 <= 1; {18007#false} is VALID [2022-02-20 18:38:57,386 INFO L290 TraceCheckUtils]: 90: Hoare triple {18007#false} assume ~st2~0 + ~nl2~0 <= 1; {18007#false} is VALID [2022-02-20 18:38:57,386 INFO L290 TraceCheckUtils]: 91: Hoare triple {18007#false} assume ~st3~0 + ~nl3~0 <= 1; {18007#false} is VALID [2022-02-20 18:38:57,386 INFO L290 TraceCheckUtils]: 92: Hoare triple {18007#false} assume !(~r1~0 % 256 >= 2); {18007#false} is VALID [2022-02-20 18:38:57,386 INFO L290 TraceCheckUtils]: 93: Hoare triple {18007#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {18007#false} is VALID [2022-02-20 18:38:57,386 INFO L290 TraceCheckUtils]: 94: Hoare triple {18007#false} ~__return_1389~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1389~0; {18007#false} is VALID [2022-02-20 18:38:57,386 INFO L290 TraceCheckUtils]: 95: Hoare triple {18007#false} havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {18007#false} is VALID [2022-02-20 18:38:57,387 INFO L290 TraceCheckUtils]: 96: Hoare triple {18007#false} assume 0 == main_~assert__arg~1#1 % 256; {18007#false} is VALID [2022-02-20 18:38:57,387 INFO L290 TraceCheckUtils]: 97: Hoare triple {18007#false} assume !false; {18007#false} is VALID [2022-02-20 18:38:57,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:38:57,388 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:38:57,388 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197410366] [2022-02-20 18:38:57,388 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197410366] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:38:57,388 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:38:57,389 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:38:57,389 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042550276] [2022-02-20 18:38:57,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:38:57,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-02-20 18:38:57,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:38:57,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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) [2022-02-20 18:38:57,460 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:57,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:38:57,461 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:38:57,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:38:57,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:57,462 INFO L87 Difference]: Start difference. First operand 1224 states and 1828 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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) [2022-02-20 18:38:58,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:38:58,981 INFO L93 Difference]: Finished difference Result 3596 states and 5364 transitions. [2022-02-20 18:38:58,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:38:58,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-02-20 18:38:58,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:38:58,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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) [2022-02-20 18:38:58,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 929 transitions. [2022-02-20 18:38:58,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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) [2022-02-20 18:38:58,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 929 transitions. [2022-02-20 18:38:58,988 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 929 transitions. [2022-02-20 18:38:59,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 929 edges. 929 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:38:59,780 INFO L225 Difference]: With dead ends: 3596 [2022-02-20 18:38:59,780 INFO L226 Difference]: Without dead ends: 2416 [2022-02-20 18:38:59,782 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:38:59,782 INFO L933 BasicCegarLoop]: 399 mSDtfsCounter, 303 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:38:59,783 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 718 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:38:59,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2022-02-20 18:39:00,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 1228. [2022-02-20 18:39:00,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:00,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2416 states. Second operand has 1228 states, 1227 states have (on average 1.4930725346373268) internal successors, (1832), 1227 states have internal predecessors, (1832), 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) [2022-02-20 18:39:00,134 INFO L74 IsIncluded]: Start isIncluded. First operand 2416 states. Second operand has 1228 states, 1227 states have (on average 1.4930725346373268) internal successors, (1832), 1227 states have internal predecessors, (1832), 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) [2022-02-20 18:39:00,136 INFO L87 Difference]: Start difference. First operand 2416 states. Second operand has 1228 states, 1227 states have (on average 1.4930725346373268) internal successors, (1832), 1227 states have internal predecessors, (1832), 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) [2022-02-20 18:39:00,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:00,281 INFO L93 Difference]: Finished difference Result 2416 states and 3603 transitions. [2022-02-20 18:39:00,281 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3603 transitions. [2022-02-20 18:39:00,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:00,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:00,286 INFO L74 IsIncluded]: Start isIncluded. First operand has 1228 states, 1227 states have (on average 1.4930725346373268) internal successors, (1832), 1227 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2416 states. [2022-02-20 18:39:00,287 INFO L87 Difference]: Start difference. First operand has 1228 states, 1227 states have (on average 1.4930725346373268) internal successors, (1832), 1227 states have internal predecessors, (1832), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2416 states. [2022-02-20 18:39:00,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:00,437 INFO L93 Difference]: Finished difference Result 2416 states and 3603 transitions. [2022-02-20 18:39:00,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 3603 transitions. [2022-02-20 18:39:00,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:00,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:00,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:00,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:00,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1228 states, 1227 states have (on average 1.4930725346373268) internal successors, (1832), 1227 states have internal predecessors, (1832), 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) [2022-02-20 18:39:00,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1228 states to 1228 states and 1832 transitions. [2022-02-20 18:39:00,491 INFO L78 Accepts]: Start accepts. Automaton has 1228 states and 1832 transitions. Word has length 98 [2022-02-20 18:39:00,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:00,491 INFO L470 AbstractCegarLoop]: Abstraction has 1228 states and 1832 transitions. [2022-02-20 18:39:00,491 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 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) [2022-02-20 18:39:00,491 INFO L276 IsEmpty]: Start isEmpty. Operand 1228 states and 1832 transitions. [2022-02-20 18:39:00,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-02-20 18:39:00,492 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:00,492 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:39:00,492 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:39:00,493 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:00,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:00,493 INFO L85 PathProgramCache]: Analyzing trace with hash 892316583, now seen corresponding path program 1 times [2022-02-20 18:39:00,493 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:00,493 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612753252] [2022-02-20 18:39:00,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:00,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:00,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:00,588 INFO L290 TraceCheckUtils]: 0: Hoare triple {29391#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1142~0 := 0;~__return_1270~0 := 0;~__return_1389~0 := 0;~__return_1499~0 := 0; {29391#true} is VALID [2022-02-20 18:39:00,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {29391#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:00,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:00,589 INFO L290 TraceCheckUtils]: 3: Hoare triple {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:00,590 INFO L290 TraceCheckUtils]: 4: Hoare triple {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:00,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256); {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:00,590 INFO L290 TraceCheckUtils]: 6: Hoare triple {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:00,590 INFO L290 TraceCheckUtils]: 7: Hoare triple {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:00,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r211~0#1 % 256); {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:00,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:00,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:00,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r231~0#1 % 256); {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:00,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !!(0 == main_~init__r211~0#1 % 256);main_~init__tmp___2~0#1 := 0; {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:00,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} is VALID [2022-02-20 18:39:00,593 INFO L290 TraceCheckUtils]: 14: Hoare triple {29393#(= (+ |ULTIMATE.start_main_~init__r311~0#1| (* (- 1) ~ep31~0)) 0)} assume !(0 == main_~init__r311~0#1 % 256);main_~init__tmp___3~0#1 := 1; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id1~0 != ~id2~0; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,594 INFO L290 TraceCheckUtils]: 19: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id1~0 != ~id3~0; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,595 INFO L290 TraceCheckUtils]: 20: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id2~0 != ~id3~0; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,595 INFO L290 TraceCheckUtils]: 21: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id1~0 >= 0; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,595 INFO L290 TraceCheckUtils]: 22: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id2~0 >= 0; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~id3~0 >= 0; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~r1~0 % 256; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,599 INFO L290 TraceCheckUtils]: 25: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~r2~0 % 256; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,600 INFO L290 TraceCheckUtils]: 26: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~r3~0 % 256; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,600 INFO L290 TraceCheckUtils]: 27: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r122~0#1 % 256); {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,600 INFO L290 TraceCheckUtils]: 28: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r132~0#1 % 256); {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,601 INFO L290 TraceCheckUtils]: 29: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r212~0#1 % 256); {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,601 INFO L290 TraceCheckUtils]: 30: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r232~0#1 % 256); {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,601 INFO L290 TraceCheckUtils]: 31: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r312~0#1 % 256); {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,602 INFO L290 TraceCheckUtils]: 32: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !(0 == main_~init__r322~0#1 % 256); {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,602 INFO L290 TraceCheckUtils]: 33: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~max1~0 == ~id1~0; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,602 INFO L290 TraceCheckUtils]: 34: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~max2~0 == ~id2~0; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,603 INFO L290 TraceCheckUtils]: 35: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~max3~0 == ~id3~0; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,603 INFO L290 TraceCheckUtils]: 36: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~st1~0; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,603 INFO L290 TraceCheckUtils]: 37: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~st2~0; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,604 INFO L290 TraceCheckUtils]: 38: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~st3~0; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,604 INFO L290 TraceCheckUtils]: 39: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~nl1~0; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,604 INFO L290 TraceCheckUtils]: 40: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~nl2~0; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,604 INFO L290 TraceCheckUtils]: 41: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~nl3~0; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,605 INFO L290 TraceCheckUtils]: 42: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~mode1~0 % 256; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,605 INFO L290 TraceCheckUtils]: 43: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~mode2~0 % 256; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,605 INFO L290 TraceCheckUtils]: 44: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1142~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1142~0; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,606 INFO L290 TraceCheckUtils]: 45: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,606 INFO L290 TraceCheckUtils]: 46: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~mode1~0 % 256); {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,606 INFO L290 TraceCheckUtils]: 47: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~r1~0 % 256 < 2; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,606 INFO L290 TraceCheckUtils]: 48: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep12~0 % 256); {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,607 INFO L290 TraceCheckUtils]: 49: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep13~0 % 256); {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,607 INFO L290 TraceCheckUtils]: 50: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} ~mode1~0 := 1; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,607 INFO L290 TraceCheckUtils]: 51: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~mode2~0 % 256); {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,608 INFO L290 TraceCheckUtils]: 52: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~r2~0 % 256 < 2; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,608 INFO L290 TraceCheckUtils]: 53: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep21~0 % 256); {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,608 INFO L290 TraceCheckUtils]: 54: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep23~0 % 256); {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,608 INFO L290 TraceCheckUtils]: 55: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} ~mode2~0 := 1; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,609 INFO L290 TraceCheckUtils]: 56: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~mode3~0 % 256); {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,609 INFO L290 TraceCheckUtils]: 57: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume ~r3~0 % 256 < 2; {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} is VALID [2022-02-20 18:39:00,609 INFO L290 TraceCheckUtils]: 58: Hoare triple {29394#(<= (+ (* 256 (div ~ep31~0 256)) 1) ~ep31~0)} assume !!(0 == ~ep31~0 % 256); {29392#false} is VALID [2022-02-20 18:39:00,610 INFO L290 TraceCheckUtils]: 59: Hoare triple {29392#false} assume !!(0 == ~ep32~0 % 256); {29392#false} is VALID [2022-02-20 18:39:00,610 INFO L290 TraceCheckUtils]: 60: Hoare triple {29392#false} ~mode3~0 := 1;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {29392#false} is VALID [2022-02-20 18:39:00,610 INFO L290 TraceCheckUtils]: 61: Hoare triple {29392#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {29392#false} is VALID [2022-02-20 18:39:00,610 INFO L290 TraceCheckUtils]: 62: Hoare triple {29392#false} assume ~st1~0 + ~nl1~0 <= 1; {29392#false} is VALID [2022-02-20 18:39:00,610 INFO L290 TraceCheckUtils]: 63: Hoare triple {29392#false} assume ~st2~0 + ~nl2~0 <= 1; {29392#false} is VALID [2022-02-20 18:39:00,610 INFO L290 TraceCheckUtils]: 64: Hoare triple {29392#false} assume ~st3~0 + ~nl3~0 <= 1; {29392#false} is VALID [2022-02-20 18:39:00,610 INFO L290 TraceCheckUtils]: 65: Hoare triple {29392#false} assume !(~r1~0 % 256 >= 2); {29392#false} is VALID [2022-02-20 18:39:00,610 INFO L290 TraceCheckUtils]: 66: Hoare triple {29392#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {29392#false} is VALID [2022-02-20 18:39:00,611 INFO L290 TraceCheckUtils]: 67: Hoare triple {29392#false} assume ~r1~0 % 256 < 2; {29392#false} is VALID [2022-02-20 18:39:00,611 INFO L290 TraceCheckUtils]: 68: Hoare triple {29392#false} assume !(~r1~0 % 256 >= 2); {29392#false} is VALID [2022-02-20 18:39:00,611 INFO L290 TraceCheckUtils]: 69: Hoare triple {29392#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {29392#false} is VALID [2022-02-20 18:39:00,611 INFO L290 TraceCheckUtils]: 70: Hoare triple {29392#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1270~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1270~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {29392#false} is VALID [2022-02-20 18:39:00,611 INFO L290 TraceCheckUtils]: 71: Hoare triple {29392#false} assume !(0 == main_~assert__arg~0#1 % 256); {29392#false} is VALID [2022-02-20 18:39:00,611 INFO L290 TraceCheckUtils]: 72: Hoare triple {29392#false} assume !(0 == ~mode1~0 % 256); {29392#false} is VALID [2022-02-20 18:39:00,611 INFO L290 TraceCheckUtils]: 73: Hoare triple {29392#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {29392#false} is VALID [2022-02-20 18:39:00,611 INFO L290 TraceCheckUtils]: 74: Hoare triple {29392#false} assume !!(0 == ~ep21~0 % 256); {29392#false} is VALID [2022-02-20 18:39:00,611 INFO L290 TraceCheckUtils]: 75: Hoare triple {29392#false} assume !!(0 == ~ep31~0 % 256); {29392#false} is VALID [2022-02-20 18:39:00,612 INFO L290 TraceCheckUtils]: 76: Hoare triple {29392#false} assume 1 == ~r1~0 % 256; {29392#false} is VALID [2022-02-20 18:39:00,612 INFO L290 TraceCheckUtils]: 77: Hoare triple {29392#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {29392#false} is VALID [2022-02-20 18:39:00,612 INFO L290 TraceCheckUtils]: 78: Hoare triple {29392#false} ~mode1~0 := 0; {29392#false} is VALID [2022-02-20 18:39:00,612 INFO L290 TraceCheckUtils]: 79: Hoare triple {29392#false} assume !(0 == ~mode2~0 % 256); {29392#false} is VALID [2022-02-20 18:39:00,612 INFO L290 TraceCheckUtils]: 80: Hoare triple {29392#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {29392#false} is VALID [2022-02-20 18:39:00,612 INFO L290 TraceCheckUtils]: 81: Hoare triple {29392#false} assume !!(0 == ~ep12~0 % 256); {29392#false} is VALID [2022-02-20 18:39:00,612 INFO L290 TraceCheckUtils]: 82: Hoare triple {29392#false} assume !!(0 == ~ep32~0 % 256); {29392#false} is VALID [2022-02-20 18:39:00,612 INFO L290 TraceCheckUtils]: 83: Hoare triple {29392#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0; {29392#false} is VALID [2022-02-20 18:39:00,612 INFO L290 TraceCheckUtils]: 84: Hoare triple {29392#false} assume !(0 == ~mode3~0 % 256); {29392#false} is VALID [2022-02-20 18:39:00,613 INFO L290 TraceCheckUtils]: 85: Hoare triple {29392#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {29392#false} is VALID [2022-02-20 18:39:00,613 INFO L290 TraceCheckUtils]: 86: Hoare triple {29392#false} assume !!(0 == ~ep13~0 % 256); {29392#false} is VALID [2022-02-20 18:39:00,613 INFO L290 TraceCheckUtils]: 87: Hoare triple {29392#false} assume !!(0 == ~ep23~0 % 256); {29392#false} is VALID [2022-02-20 18:39:00,613 INFO L290 TraceCheckUtils]: 88: Hoare triple {29392#false} assume !(2 == ~r3~0 % 256);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {29392#false} is VALID [2022-02-20 18:39:00,613 INFO L290 TraceCheckUtils]: 89: Hoare triple {29392#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {29392#false} is VALID [2022-02-20 18:39:00,613 INFO L290 TraceCheckUtils]: 90: Hoare triple {29392#false} assume ~st1~0 + ~nl1~0 <= 1; {29392#false} is VALID [2022-02-20 18:39:00,613 INFO L290 TraceCheckUtils]: 91: Hoare triple {29392#false} assume ~st2~0 + ~nl2~0 <= 1; {29392#false} is VALID [2022-02-20 18:39:00,613 INFO L290 TraceCheckUtils]: 92: Hoare triple {29392#false} assume ~st3~0 + ~nl3~0 <= 1; {29392#false} is VALID [2022-02-20 18:39:00,614 INFO L290 TraceCheckUtils]: 93: Hoare triple {29392#false} assume !(~r1~0 % 256 >= 2); {29392#false} is VALID [2022-02-20 18:39:00,614 INFO L290 TraceCheckUtils]: 94: Hoare triple {29392#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {29392#false} is VALID [2022-02-20 18:39:00,614 INFO L290 TraceCheckUtils]: 95: Hoare triple {29392#false} ~__return_1389~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1389~0; {29392#false} is VALID [2022-02-20 18:39:00,614 INFO L290 TraceCheckUtils]: 96: Hoare triple {29392#false} havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {29392#false} is VALID [2022-02-20 18:39:00,614 INFO L290 TraceCheckUtils]: 97: Hoare triple {29392#false} assume 0 == main_~assert__arg~1#1 % 256; {29392#false} is VALID [2022-02-20 18:39:00,614 INFO L290 TraceCheckUtils]: 98: Hoare triple {29392#false} assume !false; {29392#false} is VALID [2022-02-20 18:39:00,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:39:00,615 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:00,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612753252] [2022-02-20 18:39:00,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612753252] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:00,615 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:00,615 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:39:00,615 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67683562] [2022-02-20 18:39:00,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:00,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-02-20 18:39:00,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:00,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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) [2022-02-20 18:39:00,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:00,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:39:00,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:00,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:39:00,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:39:00,689 INFO L87 Difference]: Start difference. First operand 1228 states and 1832 transitions. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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) [2022-02-20 18:39:02,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:02,210 INFO L93 Difference]: Finished difference Result 3338 states and 4947 transitions. [2022-02-20 18:39:02,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:39:02,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 99 [2022-02-20 18:39:02,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:02,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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) [2022-02-20 18:39:02,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 908 transitions. [2022-02-20 18:39:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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) [2022-02-20 18:39:02,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 908 transitions. [2022-02-20 18:39:02,217 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 908 transitions. [2022-02-20 18:39:02,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 908 edges. 908 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:02,952 INFO L225 Difference]: With dead ends: 3338 [2022-02-20 18:39:02,952 INFO L226 Difference]: Without dead ends: 2158 [2022-02-20 18:39:02,954 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:39:02,955 INFO L933 BasicCegarLoop]: 512 mSDtfsCounter, 639 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:02,955 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [639 Valid, 806 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:02,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2022-02-20 18:39:03,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2156. [2022-02-20 18:39:03,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:03,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2158 states. Second operand has 2156 states, 2155 states have (on average 1.463109048723898) internal successors, (3153), 2155 states have internal predecessors, (3153), 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) [2022-02-20 18:39:03,612 INFO L74 IsIncluded]: Start isIncluded. First operand 2158 states. Second operand has 2156 states, 2155 states have (on average 1.463109048723898) internal successors, (3153), 2155 states have internal predecessors, (3153), 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) [2022-02-20 18:39:03,614 INFO L87 Difference]: Start difference. First operand 2158 states. Second operand has 2156 states, 2155 states have (on average 1.463109048723898) internal successors, (3153), 2155 states have internal predecessors, (3153), 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) [2022-02-20 18:39:03,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:03,725 INFO L93 Difference]: Finished difference Result 2158 states and 3154 transitions. [2022-02-20 18:39:03,725 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 3154 transitions. [2022-02-20 18:39:03,727 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:03,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:03,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 2156 states, 2155 states have (on average 1.463109048723898) internal successors, (3153), 2155 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2158 states. [2022-02-20 18:39:03,731 INFO L87 Difference]: Start difference. First operand has 2156 states, 2155 states have (on average 1.463109048723898) internal successors, (3153), 2155 states have internal predecessors, (3153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 2158 states. [2022-02-20 18:39:03,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:03,850 INFO L93 Difference]: Finished difference Result 2158 states and 3154 transitions. [2022-02-20 18:39:03,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2158 states and 3154 transitions. [2022-02-20 18:39:03,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:03,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:03,851 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:03,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:03,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2156 states, 2155 states have (on average 1.463109048723898) internal successors, (3153), 2155 states have internal predecessors, (3153), 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) [2022-02-20 18:39:04,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2156 states to 2156 states and 3153 transitions. [2022-02-20 18:39:04,024 INFO L78 Accepts]: Start accepts. Automaton has 2156 states and 3153 transitions. Word has length 99 [2022-02-20 18:39:04,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:04,024 INFO L470 AbstractCegarLoop]: Abstraction has 2156 states and 3153 transitions. [2022-02-20 18:39:04,024 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 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) [2022-02-20 18:39:04,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2156 states and 3153 transitions. [2022-02-20 18:39:04,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-02-20 18:39:04,025 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:04,026 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:39:04,026 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:39:04,026 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:04,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:04,026 INFO L85 PathProgramCache]: Analyzing trace with hash -701979117, now seen corresponding path program 1 times [2022-02-20 18:39:04,026 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:04,027 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720082617] [2022-02-20 18:39:04,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:04,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:04,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {41153#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1142~0 := 0;~__return_1270~0 := 0;~__return_1389~0 := 0;~__return_1499~0 := 0; {41153#true} is VALID [2022-02-20 18:39:04,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {41153#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {41153#true} is VALID [2022-02-20 18:39:04,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {41153#true} assume !!(0 == main_~init__r121~0#1 % 256); {41153#true} is VALID [2022-02-20 18:39:04,099 INFO L290 TraceCheckUtils]: 3: Hoare triple {41153#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {41153#true} is VALID [2022-02-20 18:39:04,099 INFO L290 TraceCheckUtils]: 4: Hoare triple {41153#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {41153#true} is VALID [2022-02-20 18:39:04,099 INFO L290 TraceCheckUtils]: 5: Hoare triple {41153#true} assume !!(0 == main_~init__r131~0#1 % 256); {41153#true} is VALID [2022-02-20 18:39:04,099 INFO L290 TraceCheckUtils]: 6: Hoare triple {41153#true} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {41153#true} is VALID [2022-02-20 18:39:04,100 INFO L290 TraceCheckUtils]: 7: Hoare triple {41153#true} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {41153#true} is VALID [2022-02-20 18:39:04,100 INFO L290 TraceCheckUtils]: 8: Hoare triple {41153#true} assume !!(0 == main_~init__r211~0#1 % 256); {41153#true} is VALID [2022-02-20 18:39:04,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {41153#true} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {41153#true} is VALID [2022-02-20 18:39:04,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {41153#true} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {41153#true} is VALID [2022-02-20 18:39:04,100 INFO L290 TraceCheckUtils]: 11: Hoare triple {41153#true} assume !!(0 == main_~init__r231~0#1 % 256); {41153#true} is VALID [2022-02-20 18:39:04,100 INFO L290 TraceCheckUtils]: 12: Hoare triple {41153#true} assume !!(0 == main_~init__r211~0#1 % 256);main_~init__tmp___2~0#1 := 0; {41153#true} is VALID [2022-02-20 18:39:04,100 INFO L290 TraceCheckUtils]: 13: Hoare triple {41153#true} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {41153#true} is VALID [2022-02-20 18:39:04,100 INFO L290 TraceCheckUtils]: 14: Hoare triple {41153#true} assume !!(0 == main_~init__r311~0#1 % 256); {41153#true} is VALID [2022-02-20 18:39:04,101 INFO L290 TraceCheckUtils]: 15: Hoare triple {41153#true} assume !!(0 == main_~init__r321~0#1 % 256);main_~init__tmp___3~0#1 := 0; {41155#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) (- 256))) 0)} is VALID [2022-02-20 18:39:04,101 INFO L290 TraceCheckUtils]: 16: Hoare triple {41155#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) (- 256))) 0)} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {41155#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) (- 256))) 0)} is VALID [2022-02-20 18:39:04,102 INFO L290 TraceCheckUtils]: 17: Hoare triple {41155#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) (- 256))) 0)} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {41154#false} is VALID [2022-02-20 18:39:04,102 INFO L290 TraceCheckUtils]: 18: Hoare triple {41154#false} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {41154#false} is VALID [2022-02-20 18:39:04,102 INFO L290 TraceCheckUtils]: 19: Hoare triple {41154#false} assume ~id1~0 != ~id2~0; {41154#false} is VALID [2022-02-20 18:39:04,102 INFO L290 TraceCheckUtils]: 20: Hoare triple {41154#false} assume ~id1~0 != ~id3~0; {41154#false} is VALID [2022-02-20 18:39:04,102 INFO L290 TraceCheckUtils]: 21: Hoare triple {41154#false} assume ~id2~0 != ~id3~0; {41154#false} is VALID [2022-02-20 18:39:04,102 INFO L290 TraceCheckUtils]: 22: Hoare triple {41154#false} assume ~id1~0 >= 0; {41154#false} is VALID [2022-02-20 18:39:04,103 INFO L290 TraceCheckUtils]: 23: Hoare triple {41154#false} assume ~id2~0 >= 0; {41154#false} is VALID [2022-02-20 18:39:04,103 INFO L290 TraceCheckUtils]: 24: Hoare triple {41154#false} assume ~id3~0 >= 0; {41154#false} is VALID [2022-02-20 18:39:04,103 INFO L290 TraceCheckUtils]: 25: Hoare triple {41154#false} assume 0 == ~r1~0 % 256; {41154#false} is VALID [2022-02-20 18:39:04,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {41154#false} assume 0 == ~r2~0 % 256; {41154#false} is VALID [2022-02-20 18:39:04,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {41154#false} assume 0 == ~r3~0 % 256; {41154#false} is VALID [2022-02-20 18:39:04,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {41154#false} assume !(0 == main_~init__r122~0#1 % 256); {41154#false} is VALID [2022-02-20 18:39:04,103 INFO L290 TraceCheckUtils]: 29: Hoare triple {41154#false} assume !(0 == main_~init__r132~0#1 % 256); {41154#false} is VALID [2022-02-20 18:39:04,103 INFO L290 TraceCheckUtils]: 30: Hoare triple {41154#false} assume !(0 == main_~init__r212~0#1 % 256); {41154#false} is VALID [2022-02-20 18:39:04,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {41154#false} assume !(0 == main_~init__r232~0#1 % 256); {41154#false} is VALID [2022-02-20 18:39:04,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {41154#false} assume !(0 == main_~init__r312~0#1 % 256); {41154#false} is VALID [2022-02-20 18:39:04,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {41154#false} assume !(0 == main_~init__r322~0#1 % 256); {41154#false} is VALID [2022-02-20 18:39:04,104 INFO L290 TraceCheckUtils]: 34: Hoare triple {41154#false} assume ~max1~0 == ~id1~0; {41154#false} is VALID [2022-02-20 18:39:04,104 INFO L290 TraceCheckUtils]: 35: Hoare triple {41154#false} assume ~max2~0 == ~id2~0; {41154#false} is VALID [2022-02-20 18:39:04,104 INFO L290 TraceCheckUtils]: 36: Hoare triple {41154#false} assume ~max3~0 == ~id3~0; {41154#false} is VALID [2022-02-20 18:39:04,104 INFO L290 TraceCheckUtils]: 37: Hoare triple {41154#false} assume 0 == ~st1~0; {41154#false} is VALID [2022-02-20 18:39:04,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {41154#false} assume 0 == ~st2~0; {41154#false} is VALID [2022-02-20 18:39:04,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {41154#false} assume 0 == ~st3~0; {41154#false} is VALID [2022-02-20 18:39:04,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {41154#false} assume 0 == ~nl1~0; {41154#false} is VALID [2022-02-20 18:39:04,105 INFO L290 TraceCheckUtils]: 41: Hoare triple {41154#false} assume 0 == ~nl2~0; {41154#false} is VALID [2022-02-20 18:39:04,105 INFO L290 TraceCheckUtils]: 42: Hoare triple {41154#false} assume 0 == ~nl3~0; {41154#false} is VALID [2022-02-20 18:39:04,105 INFO L290 TraceCheckUtils]: 43: Hoare triple {41154#false} assume 0 == ~mode1~0 % 256; {41154#false} is VALID [2022-02-20 18:39:04,105 INFO L290 TraceCheckUtils]: 44: Hoare triple {41154#false} assume 0 == ~mode2~0 % 256; {41154#false} is VALID [2022-02-20 18:39:04,105 INFO L290 TraceCheckUtils]: 45: Hoare triple {41154#false} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1142~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1142~0; {41154#false} is VALID [2022-02-20 18:39:04,105 INFO L290 TraceCheckUtils]: 46: Hoare triple {41154#false} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {41154#false} is VALID [2022-02-20 18:39:04,105 INFO L290 TraceCheckUtils]: 47: Hoare triple {41154#false} assume !!(0 == ~mode1~0 % 256); {41154#false} is VALID [2022-02-20 18:39:04,106 INFO L290 TraceCheckUtils]: 48: Hoare triple {41154#false} assume ~r1~0 % 256 < 2; {41154#false} is VALID [2022-02-20 18:39:04,106 INFO L290 TraceCheckUtils]: 49: Hoare triple {41154#false} assume !!(0 == ~ep12~0 % 256); {41154#false} is VALID [2022-02-20 18:39:04,106 INFO L290 TraceCheckUtils]: 50: Hoare triple {41154#false} assume !!(0 == ~ep13~0 % 256); {41154#false} is VALID [2022-02-20 18:39:04,106 INFO L290 TraceCheckUtils]: 51: Hoare triple {41154#false} ~mode1~0 := 1; {41154#false} is VALID [2022-02-20 18:39:04,106 INFO L290 TraceCheckUtils]: 52: Hoare triple {41154#false} assume !!(0 == ~mode2~0 % 256); {41154#false} is VALID [2022-02-20 18:39:04,106 INFO L290 TraceCheckUtils]: 53: Hoare triple {41154#false} assume ~r2~0 % 256 < 2; {41154#false} is VALID [2022-02-20 18:39:04,106 INFO L290 TraceCheckUtils]: 54: Hoare triple {41154#false} assume !!(0 == ~ep21~0 % 256); {41154#false} is VALID [2022-02-20 18:39:04,106 INFO L290 TraceCheckUtils]: 55: Hoare triple {41154#false} assume !!(0 == ~ep23~0 % 256); {41154#false} is VALID [2022-02-20 18:39:04,106 INFO L290 TraceCheckUtils]: 56: Hoare triple {41154#false} ~mode2~0 := 1; {41154#false} is VALID [2022-02-20 18:39:04,107 INFO L290 TraceCheckUtils]: 57: Hoare triple {41154#false} assume !!(0 == ~mode3~0 % 256); {41154#false} is VALID [2022-02-20 18:39:04,107 INFO L290 TraceCheckUtils]: 58: Hoare triple {41154#false} assume ~r3~0 % 256 < 2; {41154#false} is VALID [2022-02-20 18:39:04,107 INFO L290 TraceCheckUtils]: 59: Hoare triple {41154#false} assume !!(0 == ~ep31~0 % 256); {41154#false} is VALID [2022-02-20 18:39:04,107 INFO L290 TraceCheckUtils]: 60: Hoare triple {41154#false} assume !!(0 == ~ep32~0 % 256); {41154#false} is VALID [2022-02-20 18:39:04,107 INFO L290 TraceCheckUtils]: 61: Hoare triple {41154#false} ~mode3~0 := 1;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {41154#false} is VALID [2022-02-20 18:39:04,107 INFO L290 TraceCheckUtils]: 62: Hoare triple {41154#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {41154#false} is VALID [2022-02-20 18:39:04,107 INFO L290 TraceCheckUtils]: 63: Hoare triple {41154#false} assume ~st1~0 + ~nl1~0 <= 1; {41154#false} is VALID [2022-02-20 18:39:04,107 INFO L290 TraceCheckUtils]: 64: Hoare triple {41154#false} assume ~st2~0 + ~nl2~0 <= 1; {41154#false} is VALID [2022-02-20 18:39:04,108 INFO L290 TraceCheckUtils]: 65: Hoare triple {41154#false} assume ~st3~0 + ~nl3~0 <= 1; {41154#false} is VALID [2022-02-20 18:39:04,108 INFO L290 TraceCheckUtils]: 66: Hoare triple {41154#false} assume !(~r1~0 % 256 >= 2); {41154#false} is VALID [2022-02-20 18:39:04,108 INFO L290 TraceCheckUtils]: 67: Hoare triple {41154#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {41154#false} is VALID [2022-02-20 18:39:04,108 INFO L290 TraceCheckUtils]: 68: Hoare triple {41154#false} assume ~r1~0 % 256 < 2; {41154#false} is VALID [2022-02-20 18:39:04,108 INFO L290 TraceCheckUtils]: 69: Hoare triple {41154#false} assume !(~r1~0 % 256 >= 2); {41154#false} is VALID [2022-02-20 18:39:04,108 INFO L290 TraceCheckUtils]: 70: Hoare triple {41154#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {41154#false} is VALID [2022-02-20 18:39:04,108 INFO L290 TraceCheckUtils]: 71: Hoare triple {41154#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1270~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1270~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {41154#false} is VALID [2022-02-20 18:39:04,108 INFO L290 TraceCheckUtils]: 72: Hoare triple {41154#false} assume !(0 == main_~assert__arg~0#1 % 256); {41154#false} is VALID [2022-02-20 18:39:04,108 INFO L290 TraceCheckUtils]: 73: Hoare triple {41154#false} assume !(0 == ~mode1~0 % 256); {41154#false} is VALID [2022-02-20 18:39:04,109 INFO L290 TraceCheckUtils]: 74: Hoare triple {41154#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {41154#false} is VALID [2022-02-20 18:39:04,109 INFO L290 TraceCheckUtils]: 75: Hoare triple {41154#false} assume !!(0 == ~ep21~0 % 256); {41154#false} is VALID [2022-02-20 18:39:04,109 INFO L290 TraceCheckUtils]: 76: Hoare triple {41154#false} assume !!(0 == ~ep31~0 % 256); {41154#false} is VALID [2022-02-20 18:39:04,109 INFO L290 TraceCheckUtils]: 77: Hoare triple {41154#false} assume 1 == ~r1~0 % 256; {41154#false} is VALID [2022-02-20 18:39:04,109 INFO L290 TraceCheckUtils]: 78: Hoare triple {41154#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {41154#false} is VALID [2022-02-20 18:39:04,109 INFO L290 TraceCheckUtils]: 79: Hoare triple {41154#false} ~mode1~0 := 0; {41154#false} is VALID [2022-02-20 18:39:04,109 INFO L290 TraceCheckUtils]: 80: Hoare triple {41154#false} assume !(0 == ~mode2~0 % 256); {41154#false} is VALID [2022-02-20 18:39:04,109 INFO L290 TraceCheckUtils]: 81: Hoare triple {41154#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {41154#false} is VALID [2022-02-20 18:39:04,109 INFO L290 TraceCheckUtils]: 82: Hoare triple {41154#false} assume !!(0 == ~ep12~0 % 256); {41154#false} is VALID [2022-02-20 18:39:04,110 INFO L290 TraceCheckUtils]: 83: Hoare triple {41154#false} assume !!(0 == ~ep32~0 % 256); {41154#false} is VALID [2022-02-20 18:39:04,110 INFO L290 TraceCheckUtils]: 84: Hoare triple {41154#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0; {41154#false} is VALID [2022-02-20 18:39:04,110 INFO L290 TraceCheckUtils]: 85: Hoare triple {41154#false} assume !(0 == ~mode3~0 % 256); {41154#false} is VALID [2022-02-20 18:39:04,110 INFO L290 TraceCheckUtils]: 86: Hoare triple {41154#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {41154#false} is VALID [2022-02-20 18:39:04,110 INFO L290 TraceCheckUtils]: 87: Hoare triple {41154#false} assume !!(0 == ~ep13~0 % 256); {41154#false} is VALID [2022-02-20 18:39:04,110 INFO L290 TraceCheckUtils]: 88: Hoare triple {41154#false} assume !!(0 == ~ep23~0 % 256); {41154#false} is VALID [2022-02-20 18:39:04,110 INFO L290 TraceCheckUtils]: 89: Hoare triple {41154#false} assume !(2 == ~r3~0 % 256);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {41154#false} is VALID [2022-02-20 18:39:04,110 INFO L290 TraceCheckUtils]: 90: Hoare triple {41154#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {41154#false} is VALID [2022-02-20 18:39:04,111 INFO L290 TraceCheckUtils]: 91: Hoare triple {41154#false} assume ~st1~0 + ~nl1~0 <= 1; {41154#false} is VALID [2022-02-20 18:39:04,111 INFO L290 TraceCheckUtils]: 92: Hoare triple {41154#false} assume ~st2~0 + ~nl2~0 <= 1; {41154#false} is VALID [2022-02-20 18:39:04,111 INFO L290 TraceCheckUtils]: 93: Hoare triple {41154#false} assume ~st3~0 + ~nl3~0 <= 1; {41154#false} is VALID [2022-02-20 18:39:04,111 INFO L290 TraceCheckUtils]: 94: Hoare triple {41154#false} assume !(~r1~0 % 256 >= 2); {41154#false} is VALID [2022-02-20 18:39:04,111 INFO L290 TraceCheckUtils]: 95: Hoare triple {41154#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {41154#false} is VALID [2022-02-20 18:39:04,111 INFO L290 TraceCheckUtils]: 96: Hoare triple {41154#false} ~__return_1389~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1389~0; {41154#false} is VALID [2022-02-20 18:39:04,111 INFO L290 TraceCheckUtils]: 97: Hoare triple {41154#false} havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {41154#false} is VALID [2022-02-20 18:39:04,111 INFO L290 TraceCheckUtils]: 98: Hoare triple {41154#false} assume 0 == main_~assert__arg~1#1 % 256; {41154#false} is VALID [2022-02-20 18:39:04,111 INFO L290 TraceCheckUtils]: 99: Hoare triple {41154#false} assume !false; {41154#false} is VALID [2022-02-20 18:39:04,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:39:04,112 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:04,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720082617] [2022-02-20 18:39:04,112 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720082617] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:04,112 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:04,112 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:39:04,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110825925] [2022-02-20 18:39:04,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:04,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-02-20 18:39:04,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:04,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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) [2022-02-20 18:39:04,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:04,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:39:04,165 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:04,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:39:04,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:39:04,166 INFO L87 Difference]: Start difference. First operand 2156 states and 3153 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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) [2022-02-20 18:39:07,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:07,057 INFO L93 Difference]: Finished difference Result 6060 states and 8917 transitions. [2022-02-20 18:39:07,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:39:07,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 100 [2022-02-20 18:39:07,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:07,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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) [2022-02-20 18:39:07,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 901 transitions. [2022-02-20 18:39:07,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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) [2022-02-20 18:39:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 901 transitions. [2022-02-20 18:39:07,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 901 transitions. [2022-02-20 18:39:07,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 901 edges. 901 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:08,261 INFO L225 Difference]: With dead ends: 6060 [2022-02-20 18:39:08,262 INFO L226 Difference]: Without dead ends: 4220 [2022-02-20 18:39:08,263 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:39:08,264 INFO L933 BasicCegarLoop]: 614 mSDtfsCounter, 289 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 933 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:08,264 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 933 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:08,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4220 states. [2022-02-20 18:39:09,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4220 to 2164. [2022-02-20 18:39:09,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:09,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4220 states. Second operand has 2164 states, 2163 states have (on average 1.4613962089690244) internal successors, (3161), 2163 states have internal predecessors, (3161), 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) [2022-02-20 18:39:09,027 INFO L74 IsIncluded]: Start isIncluded. First operand 4220 states. Second operand has 2164 states, 2163 states have (on average 1.4613962089690244) internal successors, (3161), 2163 states have internal predecessors, (3161), 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) [2022-02-20 18:39:09,028 INFO L87 Difference]: Start difference. First operand 4220 states. Second operand has 2164 states, 2163 states have (on average 1.4613962089690244) internal successors, (3161), 2163 states have internal predecessors, (3161), 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) [2022-02-20 18:39:09,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:09,714 INFO L93 Difference]: Finished difference Result 4220 states and 6163 transitions. [2022-02-20 18:39:09,714 INFO L276 IsEmpty]: Start isEmpty. Operand 4220 states and 6163 transitions. [2022-02-20 18:39:09,718 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:09,718 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:09,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 2164 states, 2163 states have (on average 1.4613962089690244) internal successors, (3161), 2163 states have internal predecessors, (3161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 4220 states. [2022-02-20 18:39:09,722 INFO L87 Difference]: Start difference. First operand has 2164 states, 2163 states have (on average 1.4613962089690244) internal successors, (3161), 2163 states have internal predecessors, (3161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 4220 states. [2022-02-20 18:39:10,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:10,168 INFO L93 Difference]: Finished difference Result 4220 states and 6163 transitions. [2022-02-20 18:39:10,168 INFO L276 IsEmpty]: Start isEmpty. Operand 4220 states and 6163 transitions. [2022-02-20 18:39:10,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:10,172 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:10,172 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:10,172 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:10,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2164 states, 2163 states have (on average 1.4613962089690244) internal successors, (3161), 2163 states have internal predecessors, (3161), 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) [2022-02-20 18:39:10,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2164 states to 2164 states and 3161 transitions. [2022-02-20 18:39:10,331 INFO L78 Accepts]: Start accepts. Automaton has 2164 states and 3161 transitions. Word has length 100 [2022-02-20 18:39:10,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:10,331 INFO L470 AbstractCegarLoop]: Abstraction has 2164 states and 3161 transitions. [2022-02-20 18:39:10,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 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) [2022-02-20 18:39:10,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2164 states and 3161 transitions. [2022-02-20 18:39:10,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-20 18:39:10,333 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:10,333 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:39:10,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:39:10,334 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:10,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:10,334 INFO L85 PathProgramCache]: Analyzing trace with hash -362041594, now seen corresponding path program 1 times [2022-02-20 18:39:10,334 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:10,334 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809351048] [2022-02-20 18:39:10,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:10,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:10,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:10,425 INFO L290 TraceCheckUtils]: 0: Hoare triple {60772#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1142~0 := 0;~__return_1270~0 := 0;~__return_1389~0 := 0;~__return_1499~0 := 0; {60772#true} is VALID [2022-02-20 18:39:10,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {60772#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:10,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256); {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:10,426 INFO L290 TraceCheckUtils]: 3: Hoare triple {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:10,427 INFO L290 TraceCheckUtils]: 4: Hoare triple {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:10,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r131~0#1 % 256); {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:10,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:10,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:10,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r211~0#1 % 256); {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:10,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:10,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:10,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r231~0#1 % 256); {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:10,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r211~0#1 % 256);main_~init__tmp___2~0#1 := 0; {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:10,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:10,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !!(0 == main_~init__r311~0#1 % 256); {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} is VALID [2022-02-20 18:39:10,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {60774#(= (+ |ULTIMATE.start_main_~init__r321~0#1| (* (- 1) ~ep32~0)) 0)} assume !(0 == main_~init__r321~0#1 % 256); {60775#(and (< (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) 256) |ULTIMATE.start_main_~init__r321~0#1|) (= ~ep32~0 |ULTIMATE.start_main_~init__r321~0#1|))} is VALID [2022-02-20 18:39:10,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {60775#(and (< (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) 256) |ULTIMATE.start_main_~init__r321~0#1|) (= ~ep32~0 |ULTIMATE.start_main_~init__r321~0#1|))} assume !!(0 == ~ep21~0 % 256);main_~init__tmp___3~0#1 := 0; {60775#(and (< (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) 256) |ULTIMATE.start_main_~init__r321~0#1|) (= ~ep32~0 |ULTIMATE.start_main_~init__r321~0#1|))} is VALID [2022-02-20 18:39:10,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {60775#(and (< (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) 256) |ULTIMATE.start_main_~init__r321~0#1|) (= ~ep32~0 |ULTIMATE.start_main_~init__r321~0#1|))} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {60775#(and (< (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) 256) |ULTIMATE.start_main_~init__r321~0#1|) (= ~ep32~0 |ULTIMATE.start_main_~init__r321~0#1|))} is VALID [2022-02-20 18:39:10,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {60775#(and (< (* (div |ULTIMATE.start_main_~init__r321~0#1| 256) 256) |ULTIMATE.start_main_~init__r321~0#1|) (= ~ep32~0 |ULTIMATE.start_main_~init__r321~0#1|))} assume !(0 == main_~init__r321~0#1 % 256);main_~init__tmp___4~0#1 := 1; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id1~0 != ~id2~0; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id1~0 != ~id3~0; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id2~0 != ~id3~0; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id1~0 >= 0; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,434 INFO L290 TraceCheckUtils]: 24: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id2~0 >= 0; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~id3~0 >= 0; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~r1~0 % 256; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~r2~0 % 256; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,435 INFO L290 TraceCheckUtils]: 28: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~r3~0 % 256; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r122~0#1 % 256); {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r132~0#1 % 256); {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,436 INFO L290 TraceCheckUtils]: 31: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r212~0#1 % 256); {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,436 INFO L290 TraceCheckUtils]: 32: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r232~0#1 % 256); {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,436 INFO L290 TraceCheckUtils]: 33: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r312~0#1 % 256); {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,437 INFO L290 TraceCheckUtils]: 34: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !(0 == main_~init__r322~0#1 % 256); {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,437 INFO L290 TraceCheckUtils]: 35: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~max1~0 == ~id1~0; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~max2~0 == ~id2~0; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~max3~0 == ~id3~0; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,438 INFO L290 TraceCheckUtils]: 38: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~st1~0; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,438 INFO L290 TraceCheckUtils]: 39: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~st2~0; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,438 INFO L290 TraceCheckUtils]: 40: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~st3~0; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,439 INFO L290 TraceCheckUtils]: 41: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~nl1~0; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,439 INFO L290 TraceCheckUtils]: 42: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~nl2~0; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,439 INFO L290 TraceCheckUtils]: 43: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~nl3~0; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,439 INFO L290 TraceCheckUtils]: 44: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~mode1~0 % 256; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,440 INFO L290 TraceCheckUtils]: 45: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~mode2~0 % 256; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,440 INFO L290 TraceCheckUtils]: 46: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1142~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1142~0; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,440 INFO L290 TraceCheckUtils]: 47: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,441 INFO L290 TraceCheckUtils]: 48: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~mode1~0 % 256); {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,441 INFO L290 TraceCheckUtils]: 49: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~r1~0 % 256 < 2; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,441 INFO L290 TraceCheckUtils]: 50: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep12~0 % 256); {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,441 INFO L290 TraceCheckUtils]: 51: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep13~0 % 256); {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,442 INFO L290 TraceCheckUtils]: 52: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} ~mode1~0 := 1; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,442 INFO L290 TraceCheckUtils]: 53: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~mode2~0 % 256); {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,442 INFO L290 TraceCheckUtils]: 54: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~r2~0 % 256 < 2; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,453 INFO L290 TraceCheckUtils]: 55: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep21~0 % 256); {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,454 INFO L290 TraceCheckUtils]: 56: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep23~0 % 256); {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,454 INFO L290 TraceCheckUtils]: 57: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} ~mode2~0 := 1; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,454 INFO L290 TraceCheckUtils]: 58: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~mode3~0 % 256); {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,455 INFO L290 TraceCheckUtils]: 59: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume ~r3~0 % 256 < 2; {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,455 INFO L290 TraceCheckUtils]: 60: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep31~0 % 256); {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} is VALID [2022-02-20 18:39:10,455 INFO L290 TraceCheckUtils]: 61: Hoare triple {60776#(<= (+ (* 256 (div ~ep32~0 256)) 1) ~ep32~0)} assume !!(0 == ~ep32~0 % 256); {60773#false} is VALID [2022-02-20 18:39:10,455 INFO L290 TraceCheckUtils]: 62: Hoare triple {60773#false} ~mode3~0 := 1;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {60773#false} is VALID [2022-02-20 18:39:10,455 INFO L290 TraceCheckUtils]: 63: Hoare triple {60773#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {60773#false} is VALID [2022-02-20 18:39:10,456 INFO L290 TraceCheckUtils]: 64: Hoare triple {60773#false} assume ~st1~0 + ~nl1~0 <= 1; {60773#false} is VALID [2022-02-20 18:39:10,456 INFO L290 TraceCheckUtils]: 65: Hoare triple {60773#false} assume ~st2~0 + ~nl2~0 <= 1; {60773#false} is VALID [2022-02-20 18:39:10,456 INFO L290 TraceCheckUtils]: 66: Hoare triple {60773#false} assume ~st3~0 + ~nl3~0 <= 1; {60773#false} is VALID [2022-02-20 18:39:10,456 INFO L290 TraceCheckUtils]: 67: Hoare triple {60773#false} assume !(~r1~0 % 256 >= 2); {60773#false} is VALID [2022-02-20 18:39:10,456 INFO L290 TraceCheckUtils]: 68: Hoare triple {60773#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {60773#false} is VALID [2022-02-20 18:39:10,456 INFO L290 TraceCheckUtils]: 69: Hoare triple {60773#false} assume ~r1~0 % 256 < 2; {60773#false} is VALID [2022-02-20 18:39:10,456 INFO L290 TraceCheckUtils]: 70: Hoare triple {60773#false} assume !(~r1~0 % 256 >= 2); {60773#false} is VALID [2022-02-20 18:39:10,456 INFO L290 TraceCheckUtils]: 71: Hoare triple {60773#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {60773#false} is VALID [2022-02-20 18:39:10,457 INFO L290 TraceCheckUtils]: 72: Hoare triple {60773#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1270~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1270~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {60773#false} is VALID [2022-02-20 18:39:10,457 INFO L290 TraceCheckUtils]: 73: Hoare triple {60773#false} assume !(0 == main_~assert__arg~0#1 % 256); {60773#false} is VALID [2022-02-20 18:39:10,457 INFO L290 TraceCheckUtils]: 74: Hoare triple {60773#false} assume !(0 == ~mode1~0 % 256); {60773#false} is VALID [2022-02-20 18:39:10,457 INFO L290 TraceCheckUtils]: 75: Hoare triple {60773#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {60773#false} is VALID [2022-02-20 18:39:10,457 INFO L290 TraceCheckUtils]: 76: Hoare triple {60773#false} assume !!(0 == ~ep21~0 % 256); {60773#false} is VALID [2022-02-20 18:39:10,457 INFO L290 TraceCheckUtils]: 77: Hoare triple {60773#false} assume !!(0 == ~ep31~0 % 256); {60773#false} is VALID [2022-02-20 18:39:10,457 INFO L290 TraceCheckUtils]: 78: Hoare triple {60773#false} assume 1 == ~r1~0 % 256; {60773#false} is VALID [2022-02-20 18:39:10,457 INFO L290 TraceCheckUtils]: 79: Hoare triple {60773#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {60773#false} is VALID [2022-02-20 18:39:10,457 INFO L290 TraceCheckUtils]: 80: Hoare triple {60773#false} ~mode1~0 := 0; {60773#false} is VALID [2022-02-20 18:39:10,458 INFO L290 TraceCheckUtils]: 81: Hoare triple {60773#false} assume !(0 == ~mode2~0 % 256); {60773#false} is VALID [2022-02-20 18:39:10,458 INFO L290 TraceCheckUtils]: 82: Hoare triple {60773#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {60773#false} is VALID [2022-02-20 18:39:10,458 INFO L290 TraceCheckUtils]: 83: Hoare triple {60773#false} assume !!(0 == ~ep12~0 % 256); {60773#false} is VALID [2022-02-20 18:39:10,458 INFO L290 TraceCheckUtils]: 84: Hoare triple {60773#false} assume !!(0 == ~ep32~0 % 256); {60773#false} is VALID [2022-02-20 18:39:10,458 INFO L290 TraceCheckUtils]: 85: Hoare triple {60773#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0; {60773#false} is VALID [2022-02-20 18:39:10,458 INFO L290 TraceCheckUtils]: 86: Hoare triple {60773#false} assume !(0 == ~mode3~0 % 256); {60773#false} is VALID [2022-02-20 18:39:10,458 INFO L290 TraceCheckUtils]: 87: Hoare triple {60773#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {60773#false} is VALID [2022-02-20 18:39:10,458 INFO L290 TraceCheckUtils]: 88: Hoare triple {60773#false} assume !!(0 == ~ep13~0 % 256); {60773#false} is VALID [2022-02-20 18:39:10,458 INFO L290 TraceCheckUtils]: 89: Hoare triple {60773#false} assume !!(0 == ~ep23~0 % 256); {60773#false} is VALID [2022-02-20 18:39:10,459 INFO L290 TraceCheckUtils]: 90: Hoare triple {60773#false} assume !(2 == ~r3~0 % 256);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {60773#false} is VALID [2022-02-20 18:39:10,459 INFO L290 TraceCheckUtils]: 91: Hoare triple {60773#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {60773#false} is VALID [2022-02-20 18:39:10,459 INFO L290 TraceCheckUtils]: 92: Hoare triple {60773#false} assume ~st1~0 + ~nl1~0 <= 1; {60773#false} is VALID [2022-02-20 18:39:10,459 INFO L290 TraceCheckUtils]: 93: Hoare triple {60773#false} assume ~st2~0 + ~nl2~0 <= 1; {60773#false} is VALID [2022-02-20 18:39:10,459 INFO L290 TraceCheckUtils]: 94: Hoare triple {60773#false} assume ~st3~0 + ~nl3~0 <= 1; {60773#false} is VALID [2022-02-20 18:39:10,459 INFO L290 TraceCheckUtils]: 95: Hoare triple {60773#false} assume !(~r1~0 % 256 >= 2); {60773#false} is VALID [2022-02-20 18:39:10,459 INFO L290 TraceCheckUtils]: 96: Hoare triple {60773#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {60773#false} is VALID [2022-02-20 18:39:10,459 INFO L290 TraceCheckUtils]: 97: Hoare triple {60773#false} ~__return_1389~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1389~0; {60773#false} is VALID [2022-02-20 18:39:10,460 INFO L290 TraceCheckUtils]: 98: Hoare triple {60773#false} havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {60773#false} is VALID [2022-02-20 18:39:10,460 INFO L290 TraceCheckUtils]: 99: Hoare triple {60773#false} assume 0 == main_~assert__arg~1#1 % 256; {60773#false} is VALID [2022-02-20 18:39:10,460 INFO L290 TraceCheckUtils]: 100: Hoare triple {60773#false} assume !false; {60773#false} is VALID [2022-02-20 18:39:10,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:39:10,460 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:10,460 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809351048] [2022-02-20 18:39:10,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809351048] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:10,472 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:10,472 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:39:10,472 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333898216] [2022-02-20 18:39:10,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:10,473 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-02-20 18:39:10,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:10,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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) [2022-02-20 18:39:10,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:10,542 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:39:10,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:10,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:39:10,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:39:10,543 INFO L87 Difference]: Start difference. First operand 2164 states and 3161 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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) [2022-02-20 18:39:14,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:14,521 INFO L93 Difference]: Finished difference Result 6246 states and 9104 transitions. [2022-02-20 18:39:14,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:39:14,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-02-20 18:39:14,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:14,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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) [2022-02-20 18:39:14,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 917 transitions. [2022-02-20 18:39:14,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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) [2022-02-20 18:39:14,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 917 transitions. [2022-02-20 18:39:14,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 917 transitions. [2022-02-20 18:39:15,082 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 917 edges. 917 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:15,799 INFO L225 Difference]: With dead ends: 6246 [2022-02-20 18:39:15,799 INFO L226 Difference]: Without dead ends: 4170 [2022-02-20 18:39:15,816 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:39:15,820 INFO L933 BasicCegarLoop]: 523 mSDtfsCounter, 957 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:15,821 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [957 Valid, 817 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:15,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4170 states. [2022-02-20 18:39:17,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4170 to 4168. [2022-02-20 18:39:17,645 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:17,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4170 states. Second operand has 4168 states, 4167 states have (on average 1.4430045596352292) internal successors, (6013), 4167 states have internal predecessors, (6013), 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) [2022-02-20 18:39:17,669 INFO L74 IsIncluded]: Start isIncluded. First operand 4170 states. Second operand has 4168 states, 4167 states have (on average 1.4430045596352292) internal successors, (6013), 4167 states have internal predecessors, (6013), 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) [2022-02-20 18:39:17,673 INFO L87 Difference]: Start difference. First operand 4170 states. Second operand has 4168 states, 4167 states have (on average 1.4430045596352292) internal successors, (6013), 4167 states have internal predecessors, (6013), 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) [2022-02-20 18:39:18,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:18,121 INFO L93 Difference]: Finished difference Result 4170 states and 6014 transitions. [2022-02-20 18:39:18,121 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 6014 transitions. [2022-02-20 18:39:18,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:18,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:18,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 4168 states, 4167 states have (on average 1.4430045596352292) internal successors, (6013), 4167 states have internal predecessors, (6013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 4170 states. [2022-02-20 18:39:18,159 INFO L87 Difference]: Start difference. First operand has 4168 states, 4167 states have (on average 1.4430045596352292) internal successors, (6013), 4167 states have internal predecessors, (6013), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 4170 states. [2022-02-20 18:39:18,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:18,601 INFO L93 Difference]: Finished difference Result 4170 states and 6014 transitions. [2022-02-20 18:39:18,601 INFO L276 IsEmpty]: Start isEmpty. Operand 4170 states and 6014 transitions. [2022-02-20 18:39:18,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:18,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:18,604 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:18,604 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:18,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4168 states, 4167 states have (on average 1.4430045596352292) internal successors, (6013), 4167 states have internal predecessors, (6013), 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) [2022-02-20 18:39:19,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4168 states to 4168 states and 6013 transitions. [2022-02-20 18:39:19,271 INFO L78 Accepts]: Start accepts. Automaton has 4168 states and 6013 transitions. Word has length 101 [2022-02-20 18:39:19,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:19,271 INFO L470 AbstractCegarLoop]: Abstraction has 4168 states and 6013 transitions. [2022-02-20 18:39:19,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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) [2022-02-20 18:39:19,272 INFO L276 IsEmpty]: Start isEmpty. Operand 4168 states and 6013 transitions. [2022-02-20 18:39:19,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-02-20 18:39:19,274 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:19,274 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:39:19,274 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:39:19,274 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:19,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:19,275 INFO L85 PathProgramCache]: Analyzing trace with hash 847440838, now seen corresponding path program 1 times [2022-02-20 18:39:19,275 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:19,275 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225985932] [2022-02-20 18:39:19,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:19,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:19,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {83221#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1142~0 := 0;~__return_1270~0 := 0;~__return_1389~0 := 0;~__return_1499~0 := 0; {83221#true} is VALID [2022-02-20 18:39:19,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {83221#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {83221#true} is VALID [2022-02-20 18:39:19,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {83221#true} assume !!(0 == main_~init__r121~0#1 % 256); {83221#true} is VALID [2022-02-20 18:39:19,375 INFO L290 TraceCheckUtils]: 3: Hoare triple {83221#true} assume !!(0 == main_~init__r131~0#1 % 256);main_~init__tmp~0#1 := 0; {83223#(= |ULTIMATE.start_main_~init__tmp~0#1| 0)} is VALID [2022-02-20 18:39:19,375 INFO L290 TraceCheckUtils]: 4: Hoare triple {83223#(= |ULTIMATE.start_main_~init__tmp~0#1| 0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} assume !!(0 == main_~init__r131~0#1 % 256); {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} assume !!(0 == main_~init__r121~0#1 % 256);main_~init__tmp___0~0#1 := 0; {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,376 INFO L290 TraceCheckUtils]: 7: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} assume !!(0 == main_~init__r211~0#1 % 256); {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} assume !!(0 == main_~init__r231~0#1 % 256); {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} assume !!(0 == main_~init__r211~0#1 % 256);main_~init__tmp___2~0#1 := 0; {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} assume !!(0 == main_~init__r311~0#1 % 256); {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} assume !!(0 == main_~init__r321~0#1 % 256);main_~init__tmp___3~0#1 := 0; {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} assume !!(0 == main_~init__r321~0#1 % 256); {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} assume !!(0 == main_~init__r311~0#1 % 256);main_~init__tmp___4~0#1 := 0; {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,382 INFO L290 TraceCheckUtils]: 19: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} assume ~id1~0 != ~id2~0; {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} assume ~id1~0 != ~id3~0; {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,383 INFO L290 TraceCheckUtils]: 22: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} assume ~id2~0 != ~id3~0; {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,383 INFO L290 TraceCheckUtils]: 23: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} assume ~id1~0 >= 0; {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,384 INFO L290 TraceCheckUtils]: 24: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} assume ~id2~0 >= 0; {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,384 INFO L290 TraceCheckUtils]: 25: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} assume ~id3~0 >= 0; {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,384 INFO L290 TraceCheckUtils]: 26: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} assume 0 == ~r1~0 % 256; {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} assume 0 == ~r2~0 % 256; {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} assume 0 == ~r3~0 % 256; {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} is VALID [2022-02-20 18:39:19,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {83224#(and (not (<= (+ (div |ULTIMATE.start_main_~init__r122~0#1| 256) 1) 0)) (<= |ULTIMATE.start_main_~init__r122~0#1| (* 256 (div |ULTIMATE.start_main_~init__r122~0#1| 256))))} assume !(0 == main_~init__r122~0#1 % 256); {83222#false} is VALID [2022-02-20 18:39:19,386 INFO L290 TraceCheckUtils]: 30: Hoare triple {83222#false} assume !(0 == main_~init__r132~0#1 % 256); {83222#false} is VALID [2022-02-20 18:39:19,386 INFO L290 TraceCheckUtils]: 31: Hoare triple {83222#false} assume !(0 == main_~init__r212~0#1 % 256); {83222#false} is VALID [2022-02-20 18:39:19,386 INFO L290 TraceCheckUtils]: 32: Hoare triple {83222#false} assume !(0 == main_~init__r232~0#1 % 256); {83222#false} is VALID [2022-02-20 18:39:19,386 INFO L290 TraceCheckUtils]: 33: Hoare triple {83222#false} assume !(0 == main_~init__r312~0#1 % 256); {83222#false} is VALID [2022-02-20 18:39:19,386 INFO L290 TraceCheckUtils]: 34: Hoare triple {83222#false} assume !(0 == main_~init__r322~0#1 % 256); {83222#false} is VALID [2022-02-20 18:39:19,386 INFO L290 TraceCheckUtils]: 35: Hoare triple {83222#false} assume ~max1~0 == ~id1~0; {83222#false} is VALID [2022-02-20 18:39:19,386 INFO L290 TraceCheckUtils]: 36: Hoare triple {83222#false} assume ~max2~0 == ~id2~0; {83222#false} is VALID [2022-02-20 18:39:19,386 INFO L290 TraceCheckUtils]: 37: Hoare triple {83222#false} assume ~max3~0 == ~id3~0; {83222#false} is VALID [2022-02-20 18:39:19,386 INFO L290 TraceCheckUtils]: 38: Hoare triple {83222#false} assume 0 == ~st1~0; {83222#false} is VALID [2022-02-20 18:39:19,387 INFO L290 TraceCheckUtils]: 39: Hoare triple {83222#false} assume 0 == ~st2~0; {83222#false} is VALID [2022-02-20 18:39:19,387 INFO L290 TraceCheckUtils]: 40: Hoare triple {83222#false} assume 0 == ~st3~0; {83222#false} is VALID [2022-02-20 18:39:19,387 INFO L290 TraceCheckUtils]: 41: Hoare triple {83222#false} assume 0 == ~nl1~0; {83222#false} is VALID [2022-02-20 18:39:19,387 INFO L290 TraceCheckUtils]: 42: Hoare triple {83222#false} assume 0 == ~nl2~0; {83222#false} is VALID [2022-02-20 18:39:19,387 INFO L290 TraceCheckUtils]: 43: Hoare triple {83222#false} assume 0 == ~nl3~0; {83222#false} is VALID [2022-02-20 18:39:19,387 INFO L290 TraceCheckUtils]: 44: Hoare triple {83222#false} assume 0 == ~mode1~0 % 256; {83222#false} is VALID [2022-02-20 18:39:19,387 INFO L290 TraceCheckUtils]: 45: Hoare triple {83222#false} assume 0 == ~mode2~0 % 256; {83222#false} is VALID [2022-02-20 18:39:19,387 INFO L290 TraceCheckUtils]: 46: Hoare triple {83222#false} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1142~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1142~0; {83222#false} is VALID [2022-02-20 18:39:19,388 INFO L290 TraceCheckUtils]: 47: Hoare triple {83222#false} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {83222#false} is VALID [2022-02-20 18:39:19,388 INFO L290 TraceCheckUtils]: 48: Hoare triple {83222#false} assume !!(0 == ~mode1~0 % 256); {83222#false} is VALID [2022-02-20 18:39:19,388 INFO L290 TraceCheckUtils]: 49: Hoare triple {83222#false} assume ~r1~0 % 256 < 2; {83222#false} is VALID [2022-02-20 18:39:19,388 INFO L290 TraceCheckUtils]: 50: Hoare triple {83222#false} assume !!(0 == ~ep12~0 % 256); {83222#false} is VALID [2022-02-20 18:39:19,388 INFO L290 TraceCheckUtils]: 51: Hoare triple {83222#false} assume !!(0 == ~ep13~0 % 256); {83222#false} is VALID [2022-02-20 18:39:19,388 INFO L290 TraceCheckUtils]: 52: Hoare triple {83222#false} ~mode1~0 := 1; {83222#false} is VALID [2022-02-20 18:39:19,388 INFO L290 TraceCheckUtils]: 53: Hoare triple {83222#false} assume !!(0 == ~mode2~0 % 256); {83222#false} is VALID [2022-02-20 18:39:19,388 INFO L290 TraceCheckUtils]: 54: Hoare triple {83222#false} assume ~r2~0 % 256 < 2; {83222#false} is VALID [2022-02-20 18:39:19,388 INFO L290 TraceCheckUtils]: 55: Hoare triple {83222#false} assume !!(0 == ~ep21~0 % 256); {83222#false} is VALID [2022-02-20 18:39:19,389 INFO L290 TraceCheckUtils]: 56: Hoare triple {83222#false} assume !!(0 == ~ep23~0 % 256); {83222#false} is VALID [2022-02-20 18:39:19,389 INFO L290 TraceCheckUtils]: 57: Hoare triple {83222#false} ~mode2~0 := 1; {83222#false} is VALID [2022-02-20 18:39:19,389 INFO L290 TraceCheckUtils]: 58: Hoare triple {83222#false} assume !!(0 == ~mode3~0 % 256); {83222#false} is VALID [2022-02-20 18:39:19,389 INFO L290 TraceCheckUtils]: 59: Hoare triple {83222#false} assume ~r3~0 % 256 < 2; {83222#false} is VALID [2022-02-20 18:39:19,389 INFO L290 TraceCheckUtils]: 60: Hoare triple {83222#false} assume !!(0 == ~ep31~0 % 256); {83222#false} is VALID [2022-02-20 18:39:19,389 INFO L290 TraceCheckUtils]: 61: Hoare triple {83222#false} assume !!(0 == ~ep32~0 % 256); {83222#false} is VALID [2022-02-20 18:39:19,389 INFO L290 TraceCheckUtils]: 62: Hoare triple {83222#false} ~mode3~0 := 1;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {83222#false} is VALID [2022-02-20 18:39:19,389 INFO L290 TraceCheckUtils]: 63: Hoare triple {83222#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {83222#false} is VALID [2022-02-20 18:39:19,389 INFO L290 TraceCheckUtils]: 64: Hoare triple {83222#false} assume ~st1~0 + ~nl1~0 <= 1; {83222#false} is VALID [2022-02-20 18:39:19,390 INFO L290 TraceCheckUtils]: 65: Hoare triple {83222#false} assume ~st2~0 + ~nl2~0 <= 1; {83222#false} is VALID [2022-02-20 18:39:19,390 INFO L290 TraceCheckUtils]: 66: Hoare triple {83222#false} assume ~st3~0 + ~nl3~0 <= 1; {83222#false} is VALID [2022-02-20 18:39:19,390 INFO L290 TraceCheckUtils]: 67: Hoare triple {83222#false} assume !(~r1~0 % 256 >= 2); {83222#false} is VALID [2022-02-20 18:39:19,390 INFO L290 TraceCheckUtils]: 68: Hoare triple {83222#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {83222#false} is VALID [2022-02-20 18:39:19,390 INFO L290 TraceCheckUtils]: 69: Hoare triple {83222#false} assume ~r1~0 % 256 < 2; {83222#false} is VALID [2022-02-20 18:39:19,390 INFO L290 TraceCheckUtils]: 70: Hoare triple {83222#false} assume !(~r1~0 % 256 >= 2); {83222#false} is VALID [2022-02-20 18:39:19,390 INFO L290 TraceCheckUtils]: 71: Hoare triple {83222#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {83222#false} is VALID [2022-02-20 18:39:19,390 INFO L290 TraceCheckUtils]: 72: Hoare triple {83222#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1270~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1270~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {83222#false} is VALID [2022-02-20 18:39:19,391 INFO L290 TraceCheckUtils]: 73: Hoare triple {83222#false} assume !(0 == main_~assert__arg~0#1 % 256); {83222#false} is VALID [2022-02-20 18:39:19,391 INFO L290 TraceCheckUtils]: 74: Hoare triple {83222#false} assume !(0 == ~mode1~0 % 256); {83222#false} is VALID [2022-02-20 18:39:19,391 INFO L290 TraceCheckUtils]: 75: Hoare triple {83222#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {83222#false} is VALID [2022-02-20 18:39:19,391 INFO L290 TraceCheckUtils]: 76: Hoare triple {83222#false} assume !!(0 == ~ep21~0 % 256); {83222#false} is VALID [2022-02-20 18:39:19,391 INFO L290 TraceCheckUtils]: 77: Hoare triple {83222#false} assume !!(0 == ~ep31~0 % 256); {83222#false} is VALID [2022-02-20 18:39:19,391 INFO L290 TraceCheckUtils]: 78: Hoare triple {83222#false} assume 1 == ~r1~0 % 256; {83222#false} is VALID [2022-02-20 18:39:19,391 INFO L290 TraceCheckUtils]: 79: Hoare triple {83222#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {83222#false} is VALID [2022-02-20 18:39:19,391 INFO L290 TraceCheckUtils]: 80: Hoare triple {83222#false} ~mode1~0 := 0; {83222#false} is VALID [2022-02-20 18:39:19,391 INFO L290 TraceCheckUtils]: 81: Hoare triple {83222#false} assume !(0 == ~mode2~0 % 256); {83222#false} is VALID [2022-02-20 18:39:19,392 INFO L290 TraceCheckUtils]: 82: Hoare triple {83222#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {83222#false} is VALID [2022-02-20 18:39:19,392 INFO L290 TraceCheckUtils]: 83: Hoare triple {83222#false} assume !!(0 == ~ep12~0 % 256); {83222#false} is VALID [2022-02-20 18:39:19,392 INFO L290 TraceCheckUtils]: 84: Hoare triple {83222#false} assume !!(0 == ~ep32~0 % 256); {83222#false} is VALID [2022-02-20 18:39:19,392 INFO L290 TraceCheckUtils]: 85: Hoare triple {83222#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0; {83222#false} is VALID [2022-02-20 18:39:19,392 INFO L290 TraceCheckUtils]: 86: Hoare triple {83222#false} assume !(0 == ~mode3~0 % 256); {83222#false} is VALID [2022-02-20 18:39:19,392 INFO L290 TraceCheckUtils]: 87: Hoare triple {83222#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {83222#false} is VALID [2022-02-20 18:39:19,392 INFO L290 TraceCheckUtils]: 88: Hoare triple {83222#false} assume !!(0 == ~ep13~0 % 256); {83222#false} is VALID [2022-02-20 18:39:19,392 INFO L290 TraceCheckUtils]: 89: Hoare triple {83222#false} assume !!(0 == ~ep23~0 % 256); {83222#false} is VALID [2022-02-20 18:39:19,392 INFO L290 TraceCheckUtils]: 90: Hoare triple {83222#false} assume !(2 == ~r3~0 % 256);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {83222#false} is VALID [2022-02-20 18:39:19,393 INFO L290 TraceCheckUtils]: 91: Hoare triple {83222#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {83222#false} is VALID [2022-02-20 18:39:19,393 INFO L290 TraceCheckUtils]: 92: Hoare triple {83222#false} assume ~st1~0 + ~nl1~0 <= 1; {83222#false} is VALID [2022-02-20 18:39:19,393 INFO L290 TraceCheckUtils]: 93: Hoare triple {83222#false} assume ~st2~0 + ~nl2~0 <= 1; {83222#false} is VALID [2022-02-20 18:39:19,393 INFO L290 TraceCheckUtils]: 94: Hoare triple {83222#false} assume ~st3~0 + ~nl3~0 <= 1; {83222#false} is VALID [2022-02-20 18:39:19,393 INFO L290 TraceCheckUtils]: 95: Hoare triple {83222#false} assume !(~r1~0 % 256 >= 2); {83222#false} is VALID [2022-02-20 18:39:19,393 INFO L290 TraceCheckUtils]: 96: Hoare triple {83222#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {83222#false} is VALID [2022-02-20 18:39:19,393 INFO L290 TraceCheckUtils]: 97: Hoare triple {83222#false} ~__return_1389~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1389~0; {83222#false} is VALID [2022-02-20 18:39:19,393 INFO L290 TraceCheckUtils]: 98: Hoare triple {83222#false} havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {83222#false} is VALID [2022-02-20 18:39:19,393 INFO L290 TraceCheckUtils]: 99: Hoare triple {83222#false} assume 0 == main_~assert__arg~1#1 % 256; {83222#false} is VALID [2022-02-20 18:39:19,394 INFO L290 TraceCheckUtils]: 100: Hoare triple {83222#false} assume !false; {83222#false} is VALID [2022-02-20 18:39:19,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:39:19,394 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:19,394 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225985932] [2022-02-20 18:39:19,394 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225985932] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:19,394 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:19,395 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:39:19,395 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199826774] [2022-02-20 18:39:19,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:19,395 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-02-20 18:39:19,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:19,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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) [2022-02-20 18:39:19,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:19,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:39:19,461 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:19,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:39:19,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:39:19,462 INFO L87 Difference]: Start difference. First operand 4168 states and 6013 transitions. Second operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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) [2022-02-20 18:39:23,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:23,647 INFO L93 Difference]: Finished difference Result 7276 states and 10481 transitions. [2022-02-20 18:39:23,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:39:23,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 101 [2022-02-20 18:39:23,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:23,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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) [2022-02-20 18:39:23,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 647 transitions. [2022-02-20 18:39:23,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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) [2022-02-20 18:39:23,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 647 transitions. [2022-02-20 18:39:23,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 647 transitions. [2022-02-20 18:39:24,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 647 edges. 647 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:24,456 INFO L225 Difference]: With dead ends: 7276 [2022-02-20 18:39:24,456 INFO L226 Difference]: Without dead ends: 3182 [2022-02-20 18:39:24,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:39:24,459 INFO L933 BasicCegarLoop]: 370 mSDtfsCounter, 65 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1015 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:24,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 1015 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:24,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3182 states. [2022-02-20 18:39:25,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3182 to 3182. [2022-02-20 18:39:25,754 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:25,758 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3182 states. Second operand has 3182 states, 3181 states have (on average 1.4369695064445143) internal successors, (4571), 3181 states have internal predecessors, (4571), 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) [2022-02-20 18:39:25,760 INFO L74 IsIncluded]: Start isIncluded. First operand 3182 states. Second operand has 3182 states, 3181 states have (on average 1.4369695064445143) internal successors, (4571), 3181 states have internal predecessors, (4571), 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) [2022-02-20 18:39:25,763 INFO L87 Difference]: Start difference. First operand 3182 states. Second operand has 3182 states, 3181 states have (on average 1.4369695064445143) internal successors, (4571), 3181 states have internal predecessors, (4571), 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) [2022-02-20 18:39:26,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:26,026 INFO L93 Difference]: Finished difference Result 3182 states and 4571 transitions. [2022-02-20 18:39:26,026 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 4571 transitions. [2022-02-20 18:39:26,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:26,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:26,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 3182 states, 3181 states have (on average 1.4369695064445143) internal successors, (4571), 3181 states have internal predecessors, (4571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 3182 states. [2022-02-20 18:39:26,036 INFO L87 Difference]: Start difference. First operand has 3182 states, 3181 states have (on average 1.4369695064445143) internal successors, (4571), 3181 states have internal predecessors, (4571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 3182 states. [2022-02-20 18:39:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:26,305 INFO L93 Difference]: Finished difference Result 3182 states and 4571 transitions. [2022-02-20 18:39:26,305 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 4571 transitions. [2022-02-20 18:39:26,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:26,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:26,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:26,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:26,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3182 states, 3181 states have (on average 1.4369695064445143) internal successors, (4571), 3181 states have internal predecessors, (4571), 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) [2022-02-20 18:39:26,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3182 states to 3182 states and 4571 transitions. [2022-02-20 18:39:26,714 INFO L78 Accepts]: Start accepts. Automaton has 3182 states and 4571 transitions. Word has length 101 [2022-02-20 18:39:26,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:26,715 INFO L470 AbstractCegarLoop]: Abstraction has 3182 states and 4571 transitions. [2022-02-20 18:39:26,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.25) internal successors, (101), 4 states have internal predecessors, (101), 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) [2022-02-20 18:39:26,715 INFO L276 IsEmpty]: Start isEmpty. Operand 3182 states and 4571 transitions. [2022-02-20 18:39:26,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-02-20 18:39:26,717 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:26,717 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:39:26,717 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:39:26,718 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:26,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:26,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1568538744, now seen corresponding path program 1 times [2022-02-20 18:39:26,718 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:26,718 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779198935] [2022-02-20 18:39:26,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:26,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:26,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:26,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {103759#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1142~0 := 0;~__return_1270~0 := 0;~__return_1389~0 := 0;~__return_1499~0 := 0; {103759#true} is VALID [2022-02-20 18:39:26,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {103759#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {103761#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:39:26,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {103761#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {103761#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:39:26,815 INFO L290 TraceCheckUtils]: 3: Hoare triple {103761#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {103761#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} is VALID [2022-02-20 18:39:26,816 INFO L290 TraceCheckUtils]: 4: Hoare triple {103761#(= (+ (* (- 1) ~ep13~0) |ULTIMATE.start_main_~init__r131~0#1|) 0)} assume !(0 == main_~init__r131~0#1 % 256);main_~init__tmp___0~0#1 := 1; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == main_~init__r211~0#1 % 256); {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == main_~init__r231~0#1 % 256); {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == main_~init__r211~0#1 % 256);main_~init__tmp___2~0#1 := 0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == main_~init__r311~0#1 % 256); {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == main_~init__r321~0#1 % 256);main_~init__tmp___3~0#1 := 0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == main_~init__r321~0#1 % 256); {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == main_~init__r311~0#1 % 256);main_~init__tmp___4~0#1 := 0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id1~0 != ~id2~0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id1~0 != ~id3~0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id2~0 != ~id3~0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id1~0 >= 0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id2~0 >= 0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~id3~0 >= 0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,821 INFO L290 TraceCheckUtils]: 24: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~r1~0 % 256; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,821 INFO L290 TraceCheckUtils]: 25: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~r2~0 % 256; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~r3~0 % 256; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r122~0#1 % 256); {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,822 INFO L290 TraceCheckUtils]: 28: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r132~0#1 % 256); {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,823 INFO L290 TraceCheckUtils]: 29: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r212~0#1 % 256); {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,823 INFO L290 TraceCheckUtils]: 30: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r232~0#1 % 256); {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,823 INFO L290 TraceCheckUtils]: 31: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r312~0#1 % 256); {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,823 INFO L290 TraceCheckUtils]: 32: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == main_~init__r322~0#1 % 256); {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,824 INFO L290 TraceCheckUtils]: 33: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~max1~0 == ~id1~0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,824 INFO L290 TraceCheckUtils]: 34: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~max2~0 == ~id2~0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,824 INFO L290 TraceCheckUtils]: 35: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~max3~0 == ~id3~0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,824 INFO L290 TraceCheckUtils]: 36: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~st1~0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,825 INFO L290 TraceCheckUtils]: 37: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~st2~0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,825 INFO L290 TraceCheckUtils]: 38: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~st3~0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,825 INFO L290 TraceCheckUtils]: 39: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~nl1~0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,826 INFO L290 TraceCheckUtils]: 40: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~nl2~0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,826 INFO L290 TraceCheckUtils]: 41: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~nl3~0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,826 INFO L290 TraceCheckUtils]: 42: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~mode1~0 % 256; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,826 INFO L290 TraceCheckUtils]: 43: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~mode2~0 % 256; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,827 INFO L290 TraceCheckUtils]: 44: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1142~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1142~0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,827 INFO L290 TraceCheckUtils]: 45: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,827 INFO L290 TraceCheckUtils]: 46: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == ~mode1~0 % 256); {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,827 INFO L290 TraceCheckUtils]: 47: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~r1~0 % 256 < 2; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,828 INFO L290 TraceCheckUtils]: 48: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !(0 == ~ep12~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,828 INFO L290 TraceCheckUtils]: 49: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~max1~0 != ~nomsg~0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,828 INFO L290 TraceCheckUtils]: 50: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume ~p12_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~max1~0; {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,829 INFO L290 TraceCheckUtils]: 51: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} ~p12_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256); {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} is VALID [2022-02-20 18:39:26,829 INFO L290 TraceCheckUtils]: 52: Hoare triple {103762#(<= (+ (* 256 (div ~ep13~0 256)) 1) ~ep13~0)} assume !!(0 == ~ep13~0 % 256); {103760#false} is VALID [2022-02-20 18:39:26,829 INFO L290 TraceCheckUtils]: 53: Hoare triple {103760#false} ~mode1~0 := 1; {103760#false} is VALID [2022-02-20 18:39:26,829 INFO L290 TraceCheckUtils]: 54: Hoare triple {103760#false} assume !!(0 == ~mode2~0 % 256); {103760#false} is VALID [2022-02-20 18:39:26,829 INFO L290 TraceCheckUtils]: 55: Hoare triple {103760#false} assume ~r2~0 % 256 < 2; {103760#false} is VALID [2022-02-20 18:39:26,829 INFO L290 TraceCheckUtils]: 56: Hoare triple {103760#false} assume !!(0 == ~ep21~0 % 256); {103760#false} is VALID [2022-02-20 18:39:26,830 INFO L290 TraceCheckUtils]: 57: Hoare triple {103760#false} assume !!(0 == ~ep23~0 % 256); {103760#false} is VALID [2022-02-20 18:39:26,830 INFO L290 TraceCheckUtils]: 58: Hoare triple {103760#false} ~mode2~0 := 1; {103760#false} is VALID [2022-02-20 18:39:26,830 INFO L290 TraceCheckUtils]: 59: Hoare triple {103760#false} assume !!(0 == ~mode3~0 % 256); {103760#false} is VALID [2022-02-20 18:39:26,830 INFO L290 TraceCheckUtils]: 60: Hoare triple {103760#false} assume ~r3~0 % 256 < 2; {103760#false} is VALID [2022-02-20 18:39:26,830 INFO L290 TraceCheckUtils]: 61: Hoare triple {103760#false} assume !!(0 == ~ep31~0 % 256); {103760#false} is VALID [2022-02-20 18:39:26,830 INFO L290 TraceCheckUtils]: 62: Hoare triple {103760#false} assume !!(0 == ~ep32~0 % 256); {103760#false} is VALID [2022-02-20 18:39:26,830 INFO L290 TraceCheckUtils]: 63: Hoare triple {103760#false} ~mode3~0 := 1;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {103760#false} is VALID [2022-02-20 18:39:26,830 INFO L290 TraceCheckUtils]: 64: Hoare triple {103760#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {103760#false} is VALID [2022-02-20 18:39:26,831 INFO L290 TraceCheckUtils]: 65: Hoare triple {103760#false} assume ~st1~0 + ~nl1~0 <= 1; {103760#false} is VALID [2022-02-20 18:39:26,831 INFO L290 TraceCheckUtils]: 66: Hoare triple {103760#false} assume ~st2~0 + ~nl2~0 <= 1; {103760#false} is VALID [2022-02-20 18:39:26,831 INFO L290 TraceCheckUtils]: 67: Hoare triple {103760#false} assume ~st3~0 + ~nl3~0 <= 1; {103760#false} is VALID [2022-02-20 18:39:26,831 INFO L290 TraceCheckUtils]: 68: Hoare triple {103760#false} assume !(~r1~0 % 256 >= 2); {103760#false} is VALID [2022-02-20 18:39:26,831 INFO L290 TraceCheckUtils]: 69: Hoare triple {103760#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {103760#false} is VALID [2022-02-20 18:39:26,831 INFO L290 TraceCheckUtils]: 70: Hoare triple {103760#false} assume ~r1~0 % 256 < 2; {103760#false} is VALID [2022-02-20 18:39:26,831 INFO L290 TraceCheckUtils]: 71: Hoare triple {103760#false} assume !(~r1~0 % 256 >= 2); {103760#false} is VALID [2022-02-20 18:39:26,831 INFO L290 TraceCheckUtils]: 72: Hoare triple {103760#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {103760#false} is VALID [2022-02-20 18:39:26,831 INFO L290 TraceCheckUtils]: 73: Hoare triple {103760#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1270~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1270~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {103760#false} is VALID [2022-02-20 18:39:26,832 INFO L290 TraceCheckUtils]: 74: Hoare triple {103760#false} assume !(0 == main_~assert__arg~0#1 % 256); {103760#false} is VALID [2022-02-20 18:39:26,832 INFO L290 TraceCheckUtils]: 75: Hoare triple {103760#false} assume !(0 == ~mode1~0 % 256); {103760#false} is VALID [2022-02-20 18:39:26,832 INFO L290 TraceCheckUtils]: 76: Hoare triple {103760#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {103760#false} is VALID [2022-02-20 18:39:26,832 INFO L290 TraceCheckUtils]: 77: Hoare triple {103760#false} assume !!(0 == ~ep21~0 % 256); {103760#false} is VALID [2022-02-20 18:39:26,832 INFO L290 TraceCheckUtils]: 78: Hoare triple {103760#false} assume !!(0 == ~ep31~0 % 256); {103760#false} is VALID [2022-02-20 18:39:26,832 INFO L290 TraceCheckUtils]: 79: Hoare triple {103760#false} assume 1 == ~r1~0 % 256; {103760#false} is VALID [2022-02-20 18:39:26,832 INFO L290 TraceCheckUtils]: 80: Hoare triple {103760#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {103760#false} is VALID [2022-02-20 18:39:26,832 INFO L290 TraceCheckUtils]: 81: Hoare triple {103760#false} ~mode1~0 := 0; {103760#false} is VALID [2022-02-20 18:39:26,832 INFO L290 TraceCheckUtils]: 82: Hoare triple {103760#false} assume !(0 == ~mode2~0 % 256); {103760#false} is VALID [2022-02-20 18:39:26,833 INFO L290 TraceCheckUtils]: 83: Hoare triple {103760#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {103760#false} is VALID [2022-02-20 18:39:26,833 INFO L290 TraceCheckUtils]: 84: Hoare triple {103760#false} assume !(0 == ~ep12~0 % 256);~m2~0 := ~p12_old~0;~p12_old~0 := ~nomsg~0; {103760#false} is VALID [2022-02-20 18:39:26,833 INFO L290 TraceCheckUtils]: 85: Hoare triple {103760#false} assume !(~m2~0 > ~max2~0); {103760#false} is VALID [2022-02-20 18:39:26,833 INFO L290 TraceCheckUtils]: 86: Hoare triple {103760#false} assume !!(0 == ~ep32~0 % 256); {103760#false} is VALID [2022-02-20 18:39:26,833 INFO L290 TraceCheckUtils]: 87: Hoare triple {103760#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0; {103760#false} is VALID [2022-02-20 18:39:26,833 INFO L290 TraceCheckUtils]: 88: Hoare triple {103760#false} assume !(0 == ~mode3~0 % 256); {103760#false} is VALID [2022-02-20 18:39:26,833 INFO L290 TraceCheckUtils]: 89: Hoare triple {103760#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {103760#false} is VALID [2022-02-20 18:39:26,833 INFO L290 TraceCheckUtils]: 90: Hoare triple {103760#false} assume !!(0 == ~ep13~0 % 256); {103760#false} is VALID [2022-02-20 18:39:26,833 INFO L290 TraceCheckUtils]: 91: Hoare triple {103760#false} assume !!(0 == ~ep23~0 % 256); {103760#false} is VALID [2022-02-20 18:39:26,834 INFO L290 TraceCheckUtils]: 92: Hoare triple {103760#false} assume !(2 == ~r3~0 % 256);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {103760#false} is VALID [2022-02-20 18:39:26,834 INFO L290 TraceCheckUtils]: 93: Hoare triple {103760#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {103760#false} is VALID [2022-02-20 18:39:26,834 INFO L290 TraceCheckUtils]: 94: Hoare triple {103760#false} assume ~st1~0 + ~nl1~0 <= 1; {103760#false} is VALID [2022-02-20 18:39:26,834 INFO L290 TraceCheckUtils]: 95: Hoare triple {103760#false} assume ~st2~0 + ~nl2~0 <= 1; {103760#false} is VALID [2022-02-20 18:39:26,834 INFO L290 TraceCheckUtils]: 96: Hoare triple {103760#false} assume ~st3~0 + ~nl3~0 <= 1; {103760#false} is VALID [2022-02-20 18:39:26,834 INFO L290 TraceCheckUtils]: 97: Hoare triple {103760#false} assume !(~r1~0 % 256 >= 2); {103760#false} is VALID [2022-02-20 18:39:26,834 INFO L290 TraceCheckUtils]: 98: Hoare triple {103760#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {103760#false} is VALID [2022-02-20 18:39:26,834 INFO L290 TraceCheckUtils]: 99: Hoare triple {103760#false} ~__return_1389~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1389~0; {103760#false} is VALID [2022-02-20 18:39:26,835 INFO L290 TraceCheckUtils]: 100: Hoare triple {103760#false} havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {103760#false} is VALID [2022-02-20 18:39:26,835 INFO L290 TraceCheckUtils]: 101: Hoare triple {103760#false} assume 0 == main_~assert__arg~1#1 % 256; {103760#false} is VALID [2022-02-20 18:39:26,835 INFO L290 TraceCheckUtils]: 102: Hoare triple {103760#false} assume !false; {103760#false} is VALID [2022-02-20 18:39:26,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:39:26,835 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:26,835 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779198935] [2022-02-20 18:39:26,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779198935] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:26,836 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:26,836 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:39:26,836 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306674292] [2022-02-20 18:39:26,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:26,836 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-02-20 18:39:26,837 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:26,837 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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) [2022-02-20 18:39:26,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:26,907 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:39:26,907 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:26,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:39:26,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:39:26,908 INFO L87 Difference]: Start difference. First operand 3182 states and 4571 transitions. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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) [2022-02-20 18:39:32,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:32,237 INFO L93 Difference]: Finished difference Result 8196 states and 11775 transitions. [2022-02-20 18:39:32,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:39:32,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 103 [2022-02-20 18:39:32,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:32,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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) [2022-02-20 18:39:32,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 935 transitions. [2022-02-20 18:39:32,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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) [2022-02-20 18:39:32,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 935 transitions. [2022-02-20 18:39:32,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 935 transitions. [2022-02-20 18:39:32,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 935 edges. 935 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:33,945 INFO L225 Difference]: With dead ends: 8196 [2022-02-20 18:39:33,945 INFO L226 Difference]: Without dead ends: 5136 [2022-02-20 18:39:33,948 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:39:33,948 INFO L933 BasicCegarLoop]: 531 mSDtfsCounter, 644 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 819 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:33,949 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [644 Valid, 819 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:33,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5136 states. [2022-02-20 18:39:36,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5136 to 5134. [2022-02-20 18:39:36,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:36,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5136 states. Second operand has 5134 states, 5133 states have (on average 1.41691018897331) internal successors, (7273), 5133 states have internal predecessors, (7273), 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) [2022-02-20 18:39:36,745 INFO L74 IsIncluded]: Start isIncluded. First operand 5136 states. Second operand has 5134 states, 5133 states have (on average 1.41691018897331) internal successors, (7273), 5133 states have internal predecessors, (7273), 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) [2022-02-20 18:39:36,748 INFO L87 Difference]: Start difference. First operand 5136 states. Second operand has 5134 states, 5133 states have (on average 1.41691018897331) internal successors, (7273), 5133 states have internal predecessors, (7273), 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) [2022-02-20 18:39:37,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:37,464 INFO L93 Difference]: Finished difference Result 5136 states and 7274 transitions. [2022-02-20 18:39:37,464 INFO L276 IsEmpty]: Start isEmpty. Operand 5136 states and 7274 transitions. [2022-02-20 18:39:37,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:37,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:37,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 5134 states, 5133 states have (on average 1.41691018897331) internal successors, (7273), 5133 states have internal predecessors, (7273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 5136 states. [2022-02-20 18:39:37,476 INFO L87 Difference]: Start difference. First operand has 5134 states, 5133 states have (on average 1.41691018897331) internal successors, (7273), 5133 states have internal predecessors, (7273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 5136 states. [2022-02-20 18:39:38,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:38,162 INFO L93 Difference]: Finished difference Result 5136 states and 7274 transitions. [2022-02-20 18:39:38,162 INFO L276 IsEmpty]: Start isEmpty. Operand 5136 states and 7274 transitions. [2022-02-20 18:39:38,168 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:38,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:38,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:38,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:38,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5134 states, 5133 states have (on average 1.41691018897331) internal successors, (7273), 5133 states have internal predecessors, (7273), 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) [2022-02-20 18:39:39,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5134 states to 5134 states and 7273 transitions. [2022-02-20 18:39:39,169 INFO L78 Accepts]: Start accepts. Automaton has 5134 states and 7273 transitions. Word has length 103 [2022-02-20 18:39:39,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:39,170 INFO L470 AbstractCegarLoop]: Abstraction has 5134 states and 7273 transitions. [2022-02-20 18:39:39,170 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 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) [2022-02-20 18:39:39,170 INFO L276 IsEmpty]: Start isEmpty. Operand 5134 states and 7273 transitions. [2022-02-20 18:39:39,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:39:39,173 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:39,173 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:39:39,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:39:39,173 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:39,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:39,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1396779373, now seen corresponding path program 1 times [2022-02-20 18:39:39,174 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:39,174 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2025244285] [2022-02-20 18:39:39,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:39,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:39,246 INFO L290 TraceCheckUtils]: 0: Hoare triple {132114#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1142~0 := 0;~__return_1270~0 := 0;~__return_1389~0 := 0;~__return_1499~0 := 0; {132114#true} is VALID [2022-02-20 18:39:39,246 INFO L290 TraceCheckUtils]: 1: Hoare triple {132114#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {132114#true} is VALID [2022-02-20 18:39:39,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {132114#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {132114#true} is VALID [2022-02-20 18:39:39,246 INFO L290 TraceCheckUtils]: 3: Hoare triple {132114#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {132114#true} is VALID [2022-02-20 18:39:39,246 INFO L290 TraceCheckUtils]: 4: Hoare triple {132114#true} assume !!(0 == main_~init__r131~0#1 % 256); {132114#true} is VALID [2022-02-20 18:39:39,246 INFO L290 TraceCheckUtils]: 5: Hoare triple {132114#true} assume !(0 == main_~init__r121~0#1 % 256); {132114#true} is VALID [2022-02-20 18:39:39,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {132114#true} assume !!(0 == ~ep23~0 % 256);main_~init__tmp___0~0#1 := 0; {132116#(= |ULTIMATE.start_main_~init__tmp___0~0#1| 0)} is VALID [2022-02-20 18:39:39,247 INFO L290 TraceCheckUtils]: 7: Hoare triple {132116#(= |ULTIMATE.start_main_~init__tmp___0~0#1| 0)} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} assume !!(0 == main_~init__r211~0#1 % 256); {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,249 INFO L290 TraceCheckUtils]: 11: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} assume !!(0 == main_~init__r231~0#1 % 256); {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,249 INFO L290 TraceCheckUtils]: 12: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} assume !!(0 == main_~init__r211~0#1 % 256);main_~init__tmp___2~0#1 := 0; {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,249 INFO L290 TraceCheckUtils]: 13: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} assume !!(0 == main_~init__r311~0#1 % 256); {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} assume !!(0 == main_~init__r321~0#1 % 256);main_~init__tmp___3~0#1 := 0; {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,251 INFO L290 TraceCheckUtils]: 17: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} assume !!(0 == main_~init__r321~0#1 % 256); {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} assume !!(0 == main_~init__r311~0#1 % 256);main_~init__tmp___4~0#1 := 0; {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,252 INFO L290 TraceCheckUtils]: 19: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} assume ~id1~0 != ~id2~0; {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} assume ~id1~0 != ~id3~0; {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,253 INFO L290 TraceCheckUtils]: 22: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} assume ~id2~0 != ~id3~0; {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,253 INFO L290 TraceCheckUtils]: 23: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} assume ~id1~0 >= 0; {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,253 INFO L290 TraceCheckUtils]: 24: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} assume ~id2~0 >= 0; {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,254 INFO L290 TraceCheckUtils]: 25: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} assume ~id3~0 >= 0; {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,254 INFO L290 TraceCheckUtils]: 26: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} assume 0 == ~r1~0 % 256; {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,255 INFO L290 TraceCheckUtils]: 27: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} assume 0 == ~r2~0 % 256; {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} assume 0 == ~r3~0 % 256; {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} assume !(0 == main_~init__r122~0#1 % 256); {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} is VALID [2022-02-20 18:39:39,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {132117#(and (<= |ULTIMATE.start_main_~init__r132~0#1| (* 256 (div |ULTIMATE.start_main_~init__r132~0#1| 256))) (not (<= (+ (div |ULTIMATE.start_main_~init__r132~0#1| 256) 1) 0)))} assume !(0 == main_~init__r132~0#1 % 256); {132115#false} is VALID [2022-02-20 18:39:39,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {132115#false} assume !(0 == main_~init__r212~0#1 % 256); {132115#false} is VALID [2022-02-20 18:39:39,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {132115#false} assume !(0 == main_~init__r232~0#1 % 256); {132115#false} is VALID [2022-02-20 18:39:39,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {132115#false} assume !(0 == main_~init__r312~0#1 % 256); {132115#false} is VALID [2022-02-20 18:39:39,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {132115#false} assume !(0 == main_~init__r322~0#1 % 256); {132115#false} is VALID [2022-02-20 18:39:39,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {132115#false} assume ~max1~0 == ~id1~0; {132115#false} is VALID [2022-02-20 18:39:39,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {132115#false} assume ~max2~0 == ~id2~0; {132115#false} is VALID [2022-02-20 18:39:39,269 INFO L290 TraceCheckUtils]: 37: Hoare triple {132115#false} assume ~max3~0 == ~id3~0; {132115#false} is VALID [2022-02-20 18:39:39,269 INFO L290 TraceCheckUtils]: 38: Hoare triple {132115#false} assume 0 == ~st1~0; {132115#false} is VALID [2022-02-20 18:39:39,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {132115#false} assume 0 == ~st2~0; {132115#false} is VALID [2022-02-20 18:39:39,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {132115#false} assume 0 == ~st3~0; {132115#false} is VALID [2022-02-20 18:39:39,269 INFO L290 TraceCheckUtils]: 41: Hoare triple {132115#false} assume 0 == ~nl1~0; {132115#false} is VALID [2022-02-20 18:39:39,269 INFO L290 TraceCheckUtils]: 42: Hoare triple {132115#false} assume 0 == ~nl2~0; {132115#false} is VALID [2022-02-20 18:39:39,269 INFO L290 TraceCheckUtils]: 43: Hoare triple {132115#false} assume 0 == ~nl3~0; {132115#false} is VALID [2022-02-20 18:39:39,269 INFO L290 TraceCheckUtils]: 44: Hoare triple {132115#false} assume 0 == ~mode1~0 % 256; {132115#false} is VALID [2022-02-20 18:39:39,270 INFO L290 TraceCheckUtils]: 45: Hoare triple {132115#false} assume 0 == ~mode2~0 % 256; {132115#false} is VALID [2022-02-20 18:39:39,270 INFO L290 TraceCheckUtils]: 46: Hoare triple {132115#false} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1142~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1142~0; {132115#false} is VALID [2022-02-20 18:39:39,270 INFO L290 TraceCheckUtils]: 47: Hoare triple {132115#false} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {132115#false} is VALID [2022-02-20 18:39:39,270 INFO L290 TraceCheckUtils]: 48: Hoare triple {132115#false} assume !!(0 == ~mode1~0 % 256); {132115#false} is VALID [2022-02-20 18:39:39,270 INFO L290 TraceCheckUtils]: 49: Hoare triple {132115#false} assume ~r1~0 % 256 < 2; {132115#false} is VALID [2022-02-20 18:39:39,270 INFO L290 TraceCheckUtils]: 50: Hoare triple {132115#false} assume !(0 == ~ep12~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {132115#false} is VALID [2022-02-20 18:39:39,270 INFO L290 TraceCheckUtils]: 51: Hoare triple {132115#false} assume ~max1~0 != ~nomsg~0; {132115#false} is VALID [2022-02-20 18:39:39,270 INFO L290 TraceCheckUtils]: 52: Hoare triple {132115#false} assume ~p12_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~max1~0; {132115#false} is VALID [2022-02-20 18:39:39,271 INFO L290 TraceCheckUtils]: 53: Hoare triple {132115#false} ~p12_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256); {132115#false} is VALID [2022-02-20 18:39:39,271 INFO L290 TraceCheckUtils]: 54: Hoare triple {132115#false} assume !!(0 == ~ep13~0 % 256); {132115#false} is VALID [2022-02-20 18:39:39,271 INFO L290 TraceCheckUtils]: 55: Hoare triple {132115#false} ~mode1~0 := 1; {132115#false} is VALID [2022-02-20 18:39:39,271 INFO L290 TraceCheckUtils]: 56: Hoare triple {132115#false} assume !!(0 == ~mode2~0 % 256); {132115#false} is VALID [2022-02-20 18:39:39,271 INFO L290 TraceCheckUtils]: 57: Hoare triple {132115#false} assume ~r2~0 % 256 < 2; {132115#false} is VALID [2022-02-20 18:39:39,271 INFO L290 TraceCheckUtils]: 58: Hoare triple {132115#false} assume !!(0 == ~ep21~0 % 256); {132115#false} is VALID [2022-02-20 18:39:39,271 INFO L290 TraceCheckUtils]: 59: Hoare triple {132115#false} assume !!(0 == ~ep23~0 % 256); {132115#false} is VALID [2022-02-20 18:39:39,271 INFO L290 TraceCheckUtils]: 60: Hoare triple {132115#false} ~mode2~0 := 1; {132115#false} is VALID [2022-02-20 18:39:39,271 INFO L290 TraceCheckUtils]: 61: Hoare triple {132115#false} assume !!(0 == ~mode3~0 % 256); {132115#false} is VALID [2022-02-20 18:39:39,272 INFO L290 TraceCheckUtils]: 62: Hoare triple {132115#false} assume ~r3~0 % 256 < 2; {132115#false} is VALID [2022-02-20 18:39:39,272 INFO L290 TraceCheckUtils]: 63: Hoare triple {132115#false} assume !!(0 == ~ep31~0 % 256); {132115#false} is VALID [2022-02-20 18:39:39,272 INFO L290 TraceCheckUtils]: 64: Hoare triple {132115#false} assume !!(0 == ~ep32~0 % 256); {132115#false} is VALID [2022-02-20 18:39:39,272 INFO L290 TraceCheckUtils]: 65: Hoare triple {132115#false} ~mode3~0 := 1;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {132115#false} is VALID [2022-02-20 18:39:39,272 INFO L290 TraceCheckUtils]: 66: Hoare triple {132115#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {132115#false} is VALID [2022-02-20 18:39:39,272 INFO L290 TraceCheckUtils]: 67: Hoare triple {132115#false} assume ~st1~0 + ~nl1~0 <= 1; {132115#false} is VALID [2022-02-20 18:39:39,272 INFO L290 TraceCheckUtils]: 68: Hoare triple {132115#false} assume ~st2~0 + ~nl2~0 <= 1; {132115#false} is VALID [2022-02-20 18:39:39,272 INFO L290 TraceCheckUtils]: 69: Hoare triple {132115#false} assume ~st3~0 + ~nl3~0 <= 1; {132115#false} is VALID [2022-02-20 18:39:39,272 INFO L290 TraceCheckUtils]: 70: Hoare triple {132115#false} assume !(~r1~0 % 256 >= 2); {132115#false} is VALID [2022-02-20 18:39:39,273 INFO L290 TraceCheckUtils]: 71: Hoare triple {132115#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {132115#false} is VALID [2022-02-20 18:39:39,273 INFO L290 TraceCheckUtils]: 72: Hoare triple {132115#false} assume ~r1~0 % 256 < 2; {132115#false} is VALID [2022-02-20 18:39:39,273 INFO L290 TraceCheckUtils]: 73: Hoare triple {132115#false} assume !(~r1~0 % 256 >= 2); {132115#false} is VALID [2022-02-20 18:39:39,273 INFO L290 TraceCheckUtils]: 74: Hoare triple {132115#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {132115#false} is VALID [2022-02-20 18:39:39,273 INFO L290 TraceCheckUtils]: 75: Hoare triple {132115#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1270~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1270~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {132115#false} is VALID [2022-02-20 18:39:39,273 INFO L290 TraceCheckUtils]: 76: Hoare triple {132115#false} assume !(0 == main_~assert__arg~0#1 % 256); {132115#false} is VALID [2022-02-20 18:39:39,273 INFO L290 TraceCheckUtils]: 77: Hoare triple {132115#false} assume !(0 == ~mode1~0 % 256); {132115#false} is VALID [2022-02-20 18:39:39,273 INFO L290 TraceCheckUtils]: 78: Hoare triple {132115#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {132115#false} is VALID [2022-02-20 18:39:39,273 INFO L290 TraceCheckUtils]: 79: Hoare triple {132115#false} assume !!(0 == ~ep21~0 % 256); {132115#false} is VALID [2022-02-20 18:39:39,274 INFO L290 TraceCheckUtils]: 80: Hoare triple {132115#false} assume !!(0 == ~ep31~0 % 256); {132115#false} is VALID [2022-02-20 18:39:39,274 INFO L290 TraceCheckUtils]: 81: Hoare triple {132115#false} assume 1 == ~r1~0 % 256; {132115#false} is VALID [2022-02-20 18:39:39,274 INFO L290 TraceCheckUtils]: 82: Hoare triple {132115#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {132115#false} is VALID [2022-02-20 18:39:39,274 INFO L290 TraceCheckUtils]: 83: Hoare triple {132115#false} ~mode1~0 := 0; {132115#false} is VALID [2022-02-20 18:39:39,274 INFO L290 TraceCheckUtils]: 84: Hoare triple {132115#false} assume !(0 == ~mode2~0 % 256); {132115#false} is VALID [2022-02-20 18:39:39,274 INFO L290 TraceCheckUtils]: 85: Hoare triple {132115#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {132115#false} is VALID [2022-02-20 18:39:39,274 INFO L290 TraceCheckUtils]: 86: Hoare triple {132115#false} assume !(0 == ~ep12~0 % 256);~m2~0 := ~p12_old~0;~p12_old~0 := ~nomsg~0; {132115#false} is VALID [2022-02-20 18:39:39,274 INFO L290 TraceCheckUtils]: 87: Hoare triple {132115#false} assume !(~m2~0 > ~max2~0); {132115#false} is VALID [2022-02-20 18:39:39,275 INFO L290 TraceCheckUtils]: 88: Hoare triple {132115#false} assume !!(0 == ~ep32~0 % 256); {132115#false} is VALID [2022-02-20 18:39:39,275 INFO L290 TraceCheckUtils]: 89: Hoare triple {132115#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0; {132115#false} is VALID [2022-02-20 18:39:39,275 INFO L290 TraceCheckUtils]: 90: Hoare triple {132115#false} assume !(0 == ~mode3~0 % 256); {132115#false} is VALID [2022-02-20 18:39:39,275 INFO L290 TraceCheckUtils]: 91: Hoare triple {132115#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {132115#false} is VALID [2022-02-20 18:39:39,275 INFO L290 TraceCheckUtils]: 92: Hoare triple {132115#false} assume !!(0 == ~ep13~0 % 256); {132115#false} is VALID [2022-02-20 18:39:39,275 INFO L290 TraceCheckUtils]: 93: Hoare triple {132115#false} assume !!(0 == ~ep23~0 % 256); {132115#false} is VALID [2022-02-20 18:39:39,275 INFO L290 TraceCheckUtils]: 94: Hoare triple {132115#false} assume !(2 == ~r3~0 % 256);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {132115#false} is VALID [2022-02-20 18:39:39,275 INFO L290 TraceCheckUtils]: 95: Hoare triple {132115#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {132115#false} is VALID [2022-02-20 18:39:39,275 INFO L290 TraceCheckUtils]: 96: Hoare triple {132115#false} assume ~st1~0 + ~nl1~0 <= 1; {132115#false} is VALID [2022-02-20 18:39:39,276 INFO L290 TraceCheckUtils]: 97: Hoare triple {132115#false} assume ~st2~0 + ~nl2~0 <= 1; {132115#false} is VALID [2022-02-20 18:39:39,276 INFO L290 TraceCheckUtils]: 98: Hoare triple {132115#false} assume ~st3~0 + ~nl3~0 <= 1; {132115#false} is VALID [2022-02-20 18:39:39,276 INFO L290 TraceCheckUtils]: 99: Hoare triple {132115#false} assume !(~r1~0 % 256 >= 2); {132115#false} is VALID [2022-02-20 18:39:39,276 INFO L290 TraceCheckUtils]: 100: Hoare triple {132115#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {132115#false} is VALID [2022-02-20 18:39:39,276 INFO L290 TraceCheckUtils]: 101: Hoare triple {132115#false} ~__return_1389~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1389~0; {132115#false} is VALID [2022-02-20 18:39:39,276 INFO L290 TraceCheckUtils]: 102: Hoare triple {132115#false} havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {132115#false} is VALID [2022-02-20 18:39:39,276 INFO L290 TraceCheckUtils]: 103: Hoare triple {132115#false} assume 0 == main_~assert__arg~1#1 % 256; {132115#false} is VALID [2022-02-20 18:39:39,276 INFO L290 TraceCheckUtils]: 104: Hoare triple {132115#false} assume !false; {132115#false} is VALID [2022-02-20 18:39:39,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:39:39,277 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:39,277 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2025244285] [2022-02-20 18:39:39,277 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2025244285] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:39,277 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:39,277 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 18:39:39,277 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675213880] [2022-02-20 18:39:39,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:39,278 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-02-20 18:39:39,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:39,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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) [2022-02-20 18:39:39,369 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:39,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 18:39:39,369 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:39,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 18:39:39,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 18:39:39,370 INFO L87 Difference]: Start difference. First operand 5134 states and 7273 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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) [2022-02-20 18:39:46,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:46,072 INFO L93 Difference]: Finished difference Result 9042 states and 12867 transitions. [2022-02-20 18:39:46,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 18:39:46,073 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-02-20 18:39:46,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:39:46,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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) [2022-02-20 18:39:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 632 transitions. [2022-02-20 18:39:46,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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) [2022-02-20 18:39:46,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 632 transitions. [2022-02-20 18:39:46,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 632 transitions. [2022-02-20 18:39:46,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 632 edges. 632 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:47,322 INFO L225 Difference]: With dead ends: 9042 [2022-02-20 18:39:47,323 INFO L226 Difference]: Without dead ends: 5134 [2022-02-20 18:39:47,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:39:47,326 INFO L933 BasicCegarLoop]: 360 mSDtfsCounter, 53 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:39:47,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 1000 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:39:47,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5134 states. [2022-02-20 18:39:50,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5134 to 5134. [2022-02-20 18:39:50,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:39:50,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5134 states. Second operand has 5134 states, 5133 states have (on average 1.4167153711279954) internal successors, (7272), 5133 states have internal predecessors, (7272), 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) [2022-02-20 18:39:50,102 INFO L74 IsIncluded]: Start isIncluded. First operand 5134 states. Second operand has 5134 states, 5133 states have (on average 1.4167153711279954) internal successors, (7272), 5133 states have internal predecessors, (7272), 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) [2022-02-20 18:39:50,105 INFO L87 Difference]: Start difference. First operand 5134 states. Second operand has 5134 states, 5133 states have (on average 1.4167153711279954) internal successors, (7272), 5133 states have internal predecessors, (7272), 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) [2022-02-20 18:39:50,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:50,748 INFO L93 Difference]: Finished difference Result 5134 states and 7272 transitions. [2022-02-20 18:39:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 5134 states and 7272 transitions. [2022-02-20 18:39:50,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:50,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:50,760 INFO L74 IsIncluded]: Start isIncluded. First operand has 5134 states, 5133 states have (on average 1.4167153711279954) internal successors, (7272), 5133 states have internal predecessors, (7272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 5134 states. [2022-02-20 18:39:50,763 INFO L87 Difference]: Start difference. First operand has 5134 states, 5133 states have (on average 1.4167153711279954) internal successors, (7272), 5133 states have internal predecessors, (7272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 5134 states. [2022-02-20 18:39:51,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:39:51,429 INFO L93 Difference]: Finished difference Result 5134 states and 7272 transitions. [2022-02-20 18:39:51,430 INFO L276 IsEmpty]: Start isEmpty. Operand 5134 states and 7272 transitions. [2022-02-20 18:39:51,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:39:51,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:39:51,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:39:51,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:39:51,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5134 states, 5133 states have (on average 1.4167153711279954) internal successors, (7272), 5133 states have internal predecessors, (7272), 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) [2022-02-20 18:39:52,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5134 states to 5134 states and 7272 transitions. [2022-02-20 18:39:52,410 INFO L78 Accepts]: Start accepts. Automaton has 5134 states and 7272 transitions. Word has length 105 [2022-02-20 18:39:52,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:39:52,410 INFO L470 AbstractCegarLoop]: Abstraction has 5134 states and 7272 transitions. [2022-02-20 18:39:52,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 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) [2022-02-20 18:39:52,411 INFO L276 IsEmpty]: Start isEmpty. Operand 5134 states and 7272 transitions. [2022-02-20 18:39:52,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-02-20 18:39:52,413 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:39:52,413 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 18:39:52,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:39:52,413 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:39:52,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:39:52,414 INFO L85 PathProgramCache]: Analyzing trace with hash -149781974, now seen corresponding path program 1 times [2022-02-20 18:39:52,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:39:52,414 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054368444] [2022-02-20 18:39:52,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:39:52,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:39:52,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:39:52,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {161630#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(55, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~__return_1142~0 := 0;~__return_1270~0 := 0;~__return_1389~0 := 0;~__return_1499~0 := 0; {161630#true} is VALID [2022-02-20 18:39:52,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {161630#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_~check__tmp~2#1, main_~node3____CPAchecker_TMP_1~1#1, main_~node3____CPAchecker_TMP_0~1#1, main_~node2____CPAchecker_TMP_1~1#1, main_~node2____CPAchecker_TMP_0~1#1, main_~node1____CPAchecker_TMP_1~1#1, main_~node1____CPAchecker_TMP_0~1#1, main_~__tmp_2~0#1, main_~assert__arg~1#1, main_~check__tmp~1#1, main_~__tmp_1~0#1, main_~assert__arg~0#1, main_~check__tmp~0#1, main_~node3____CPAchecker_TMP_1~0#1, main_~node3____CPAchecker_TMP_0~0#1, main_~node2____CPAchecker_TMP_1~0#1, main_~node2____CPAchecker_TMP_0~0#1, main_~node1____CPAchecker_TMP_1~0#1, main_~node1____CPAchecker_TMP_0~0#1, main_~init__r121~0#1, main_~init__r131~0#1, main_~init__r211~0#1, main_~init__r231~0#1, main_~init__r311~0#1, main_~init__r321~0#1, main_~init__r122~0#1, main_~init__tmp~0#1, main_~init__r132~0#1, main_~init__tmp___0~0#1, main_~init__r212~0#1, main_~init__tmp___1~0#1, main_~init__r232~0#1, main_~init__tmp___2~0#1, main_~init__r312~0#1, main_~init__tmp___3~0#1, main_~init__r322~0#1, main_~init__tmp___4~0#1, main_~init__tmp___5~0#1, main_~main__c1~0#1, main_~main__i2~0#1;havoc main_~main__c1~0#1;havoc main_~main__i2~0#1;main_~main__c1~0#1 := 0;~ep12~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;~ep13~0 := main_#t~nondet5#1;havoc main_#t~nondet5#1;~ep21~0 := main_#t~nondet6#1;havoc main_#t~nondet6#1;~ep23~0 := main_#t~nondet7#1;havoc main_#t~nondet7#1;~ep31~0 := main_#t~nondet8#1;havoc main_#t~nondet8#1;~ep32~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~r1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;assume -128 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 127;~st1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;assume -128 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 127;~nl1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;assume -128 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 127;~m1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~max1~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~mode1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~id2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~r2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~st2~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~nl2~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~m2~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;assume -128 <= main_#t~nondet22#1 && main_#t~nondet22#1 <= 127;~max2~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~mode2~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~id3~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r3~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;assume -128 <= main_#t~nondet26#1 && main_#t~nondet26#1 <= 127;~st3~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~nl3~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~m3~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~max3~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode3~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;havoc main_~init__r121~0#1;havoc main_~init__r131~0#1;havoc main_~init__r211~0#1;havoc main_~init__r231~0#1;havoc main_~init__r311~0#1;havoc main_~init__r321~0#1;havoc main_~init__r122~0#1;havoc main_~init__tmp~0#1;havoc main_~init__r132~0#1;havoc main_~init__tmp___0~0#1;havoc main_~init__r212~0#1;havoc main_~init__tmp___1~0#1;havoc main_~init__r232~0#1;havoc main_~init__tmp___2~0#1;havoc main_~init__r312~0#1;havoc main_~init__tmp___3~0#1;havoc main_~init__r322~0#1;havoc main_~init__tmp___4~0#1;havoc main_~init__tmp___5~0#1;main_~init__r121~0#1 := ~ep12~0;main_~init__r131~0#1 := ~ep13~0;main_~init__r211~0#1 := ~ep21~0;main_~init__r231~0#1 := ~ep23~0;main_~init__r311~0#1 := ~ep31~0;main_~init__r321~0#1 := ~ep32~0; {161630#true} is VALID [2022-02-20 18:39:52,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {161630#true} assume !(0 == main_~init__r121~0#1 % 256);main_~init__tmp~0#1 := 1; {161630#true} is VALID [2022-02-20 18:39:52,463 INFO L290 TraceCheckUtils]: 3: Hoare triple {161630#true} main_~init__r122~0#1 := (if 0 == main_~init__tmp~0#1 then 0 else 1); {161630#true} is VALID [2022-02-20 18:39:52,464 INFO L290 TraceCheckUtils]: 4: Hoare triple {161630#true} assume !!(0 == main_~init__r131~0#1 % 256); {161630#true} is VALID [2022-02-20 18:39:52,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {161630#true} assume !(0 == main_~init__r121~0#1 % 256); {161630#true} is VALID [2022-02-20 18:39:52,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {161630#true} assume !(0 == ~ep23~0 % 256);main_~init__tmp___0~0#1 := 1; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} main_~init__r132~0#1 := (if 0 == main_~init__tmp___0~0#1 then 0 else 1); {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,465 INFO L290 TraceCheckUtils]: 8: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume !!(0 == main_~init__r211~0#1 % 256); {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,465 INFO L290 TraceCheckUtils]: 9: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume !!(0 == main_~init__r231~0#1 % 256);main_~init__tmp___1~0#1 := 0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} main_~init__r212~0#1 := (if 0 == main_~init__tmp___1~0#1 then 0 else 1); {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,466 INFO L290 TraceCheckUtils]: 11: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume !!(0 == main_~init__r231~0#1 % 256); {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,466 INFO L290 TraceCheckUtils]: 12: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume !!(0 == main_~init__r211~0#1 % 256);main_~init__tmp___2~0#1 := 0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} main_~init__r232~0#1 := (if 0 == main_~init__tmp___2~0#1 then 0 else 1); {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,467 INFO L290 TraceCheckUtils]: 14: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume !!(0 == main_~init__r311~0#1 % 256); {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume !!(0 == main_~init__r321~0#1 % 256);main_~init__tmp___3~0#1 := 0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} main_~init__r312~0#1 := (if 0 == main_~init__tmp___3~0#1 then 0 else 1); {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume !!(0 == main_~init__r321~0#1 % 256); {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume !!(0 == main_~init__r311~0#1 % 256);main_~init__tmp___4~0#1 := 0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,469 INFO L290 TraceCheckUtils]: 19: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} main_~init__r322~0#1 := (if 0 == main_~init__tmp___4~0#1 then 0 else 1); {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume ~id1~0 != ~id2~0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume ~id1~0 != ~id3~0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume ~id2~0 != ~id3~0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume ~id1~0 >= 0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,483 INFO L290 TraceCheckUtils]: 24: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume ~id2~0 >= 0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,483 INFO L290 TraceCheckUtils]: 25: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume ~id3~0 >= 0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume 0 == ~r1~0 % 256; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,484 INFO L290 TraceCheckUtils]: 27: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume 0 == ~r2~0 % 256; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,484 INFO L290 TraceCheckUtils]: 28: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume 0 == ~r3~0 % 256; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,484 INFO L290 TraceCheckUtils]: 29: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume !(0 == main_~init__r122~0#1 % 256); {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,485 INFO L290 TraceCheckUtils]: 30: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume !(0 == main_~init__r132~0#1 % 256); {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,485 INFO L290 TraceCheckUtils]: 31: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume !(0 == main_~init__r212~0#1 % 256); {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,485 INFO L290 TraceCheckUtils]: 32: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume !(0 == main_~init__r232~0#1 % 256); {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume !(0 == main_~init__r312~0#1 % 256); {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,486 INFO L290 TraceCheckUtils]: 34: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume !(0 == main_~init__r322~0#1 % 256); {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,486 INFO L290 TraceCheckUtils]: 35: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume ~max1~0 == ~id1~0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,487 INFO L290 TraceCheckUtils]: 36: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume ~max2~0 == ~id2~0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,487 INFO L290 TraceCheckUtils]: 37: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume ~max3~0 == ~id3~0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,487 INFO L290 TraceCheckUtils]: 38: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume 0 == ~st1~0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,488 INFO L290 TraceCheckUtils]: 39: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume 0 == ~st2~0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,488 INFO L290 TraceCheckUtils]: 40: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume 0 == ~st3~0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,489 INFO L290 TraceCheckUtils]: 41: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume 0 == ~nl1~0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,489 INFO L290 TraceCheckUtils]: 42: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume 0 == ~nl2~0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,489 INFO L290 TraceCheckUtils]: 43: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume 0 == ~nl3~0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,490 INFO L290 TraceCheckUtils]: 44: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume 0 == ~mode1~0 % 256; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,490 INFO L290 TraceCheckUtils]: 45: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume 0 == ~mode2~0 % 256; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,490 INFO L290 TraceCheckUtils]: 46: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume 0 == ~mode3~0 % 256;main_~init__tmp___5~0#1 := 1;~__return_1142~0 := main_~init__tmp___5~0#1;main_~main__i2~0#1 := ~__return_1142~0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,491 INFO L290 TraceCheckUtils]: 47: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume 0 != main_~main__i2~0#1;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~main__i2~0#1 := 0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,491 INFO L290 TraceCheckUtils]: 48: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume !!(0 == ~mode1~0 % 256); {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,491 INFO L290 TraceCheckUtils]: 49: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume ~r1~0 % 256 < 2; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,492 INFO L290 TraceCheckUtils]: 50: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume !(0 == ~ep12~0 % 256);havoc main_~node1____CPAchecker_TMP_0~0#1; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,492 INFO L290 TraceCheckUtils]: 51: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume ~max1~0 != ~nomsg~0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,492 INFO L290 TraceCheckUtils]: 52: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume ~p12_new~0 == ~nomsg~0;main_~node1____CPAchecker_TMP_0~0#1 := ~max1~0; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,493 INFO L290 TraceCheckUtils]: 53: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} ~p12_new~0 := (if main_~node1____CPAchecker_TMP_0~0#1 % 256 <= 127 then main_~node1____CPAchecker_TMP_0~0#1 % 256 else main_~node1____CPAchecker_TMP_0~0#1 % 256 - 256); {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,493 INFO L290 TraceCheckUtils]: 54: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume !!(0 == ~ep13~0 % 256); {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,493 INFO L290 TraceCheckUtils]: 55: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} ~mode1~0 := 1; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,494 INFO L290 TraceCheckUtils]: 56: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume !!(0 == ~mode2~0 % 256); {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,494 INFO L290 TraceCheckUtils]: 57: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume ~r2~0 % 256 < 2; {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,494 INFO L290 TraceCheckUtils]: 58: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume !!(0 == ~ep21~0 % 256); {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} is VALID [2022-02-20 18:39:52,495 INFO L290 TraceCheckUtils]: 59: Hoare triple {161632#(not (= (+ ~ep23~0 (* (- 256) (div ~ep23~0 256))) 0))} assume !!(0 == ~ep23~0 % 256); {161631#false} is VALID [2022-02-20 18:39:52,495 INFO L290 TraceCheckUtils]: 60: Hoare triple {161631#false} ~mode2~0 := 1; {161631#false} is VALID [2022-02-20 18:39:52,495 INFO L290 TraceCheckUtils]: 61: Hoare triple {161631#false} assume !!(0 == ~mode3~0 % 256); {161631#false} is VALID [2022-02-20 18:39:52,495 INFO L290 TraceCheckUtils]: 62: Hoare triple {161631#false} assume ~r3~0 % 256 < 2; {161631#false} is VALID [2022-02-20 18:39:52,495 INFO L290 TraceCheckUtils]: 63: Hoare triple {161631#false} assume !!(0 == ~ep31~0 % 256); {161631#false} is VALID [2022-02-20 18:39:52,495 INFO L290 TraceCheckUtils]: 64: Hoare triple {161631#false} assume !!(0 == ~ep32~0 % 256); {161631#false} is VALID [2022-02-20 18:39:52,495 INFO L290 TraceCheckUtils]: 65: Hoare triple {161631#false} ~mode3~0 := 1;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~0#1; {161631#false} is VALID [2022-02-20 18:39:52,496 INFO L290 TraceCheckUtils]: 66: Hoare triple {161631#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {161631#false} is VALID [2022-02-20 18:39:52,496 INFO L290 TraceCheckUtils]: 67: Hoare triple {161631#false} assume ~st1~0 + ~nl1~0 <= 1; {161631#false} is VALID [2022-02-20 18:39:52,496 INFO L290 TraceCheckUtils]: 68: Hoare triple {161631#false} assume ~st2~0 + ~nl2~0 <= 1; {161631#false} is VALID [2022-02-20 18:39:52,496 INFO L290 TraceCheckUtils]: 69: Hoare triple {161631#false} assume ~st3~0 + ~nl3~0 <= 1; {161631#false} is VALID [2022-02-20 18:39:52,496 INFO L290 TraceCheckUtils]: 70: Hoare triple {161631#false} assume !(~r1~0 % 256 >= 2); {161631#false} is VALID [2022-02-20 18:39:52,496 INFO L290 TraceCheckUtils]: 71: Hoare triple {161631#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {161631#false} is VALID [2022-02-20 18:39:52,496 INFO L290 TraceCheckUtils]: 72: Hoare triple {161631#false} assume ~r1~0 % 256 < 2; {161631#false} is VALID [2022-02-20 18:39:52,496 INFO L290 TraceCheckUtils]: 73: Hoare triple {161631#false} assume !(~r1~0 % 256 >= 2); {161631#false} is VALID [2022-02-20 18:39:52,497 INFO L290 TraceCheckUtils]: 74: Hoare triple {161631#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {161631#false} is VALID [2022-02-20 18:39:52,497 INFO L290 TraceCheckUtils]: 75: Hoare triple {161631#false} assume ~r1~0 % 256 < 2;main_~check__tmp~0#1 := 1;~__return_1270~0 := main_~check__tmp~0#1;main_~main__c1~0#1 := ~__return_1270~0;havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~0#1;main_~assert__arg~0#1 := main_~__tmp_1~0#1; {161631#false} is VALID [2022-02-20 18:39:52,497 INFO L290 TraceCheckUtils]: 76: Hoare triple {161631#false} assume !(0 == main_~assert__arg~0#1 % 256); {161631#false} is VALID [2022-02-20 18:39:52,497 INFO L290 TraceCheckUtils]: 77: Hoare triple {161631#false} assume !(0 == ~mode1~0 % 256); {161631#false} is VALID [2022-02-20 18:39:52,497 INFO L290 TraceCheckUtils]: 78: Hoare triple {161631#false} assume !(255 == ~r1~0 % 256);~r1~0 := 1 + ~r1~0 % 256; {161631#false} is VALID [2022-02-20 18:39:52,497 INFO L290 TraceCheckUtils]: 79: Hoare triple {161631#false} assume !!(0 == ~ep21~0 % 256); {161631#false} is VALID [2022-02-20 18:39:52,497 INFO L290 TraceCheckUtils]: 80: Hoare triple {161631#false} assume !!(0 == ~ep31~0 % 256); {161631#false} is VALID [2022-02-20 18:39:52,497 INFO L290 TraceCheckUtils]: 81: Hoare triple {161631#false} assume 1 == ~r1~0 % 256; {161631#false} is VALID [2022-02-20 18:39:52,497 INFO L290 TraceCheckUtils]: 82: Hoare triple {161631#false} assume ~max1~0 == ~id1~0;~st1~0 := 1; {161631#false} is VALID [2022-02-20 18:39:52,498 INFO L290 TraceCheckUtils]: 83: Hoare triple {161631#false} ~mode1~0 := 0; {161631#false} is VALID [2022-02-20 18:39:52,498 INFO L290 TraceCheckUtils]: 84: Hoare triple {161631#false} assume !(0 == ~mode2~0 % 256); {161631#false} is VALID [2022-02-20 18:39:52,498 INFO L290 TraceCheckUtils]: 85: Hoare triple {161631#false} assume !(255 == ~r2~0 % 256);~r2~0 := 1 + ~r2~0 % 256; {161631#false} is VALID [2022-02-20 18:39:52,498 INFO L290 TraceCheckUtils]: 86: Hoare triple {161631#false} assume !(0 == ~ep12~0 % 256);~m2~0 := ~p12_old~0;~p12_old~0 := ~nomsg~0; {161631#false} is VALID [2022-02-20 18:39:52,498 INFO L290 TraceCheckUtils]: 87: Hoare triple {161631#false} assume !(~m2~0 > ~max2~0); {161631#false} is VALID [2022-02-20 18:39:52,498 INFO L290 TraceCheckUtils]: 88: Hoare triple {161631#false} assume !!(0 == ~ep32~0 % 256); {161631#false} is VALID [2022-02-20 18:39:52,498 INFO L290 TraceCheckUtils]: 89: Hoare triple {161631#false} assume !(2 == ~r2~0 % 256);~mode2~0 := 0; {161631#false} is VALID [2022-02-20 18:39:52,498 INFO L290 TraceCheckUtils]: 90: Hoare triple {161631#false} assume !(0 == ~mode3~0 % 256); {161631#false} is VALID [2022-02-20 18:39:52,498 INFO L290 TraceCheckUtils]: 91: Hoare triple {161631#false} assume !(255 == ~r3~0 % 256);~r3~0 := 1 + ~r3~0 % 256; {161631#false} is VALID [2022-02-20 18:39:52,499 INFO L290 TraceCheckUtils]: 92: Hoare triple {161631#false} assume !!(0 == ~ep13~0 % 256); {161631#false} is VALID [2022-02-20 18:39:52,499 INFO L290 TraceCheckUtils]: 93: Hoare triple {161631#false} assume !!(0 == ~ep23~0 % 256); {161631#false} is VALID [2022-02-20 18:39:52,499 INFO L290 TraceCheckUtils]: 94: Hoare triple {161631#false} assume !(2 == ~r3~0 % 256);~mode3~0 := 0;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;havoc main_~check__tmp~1#1; {161631#false} is VALID [2022-02-20 18:39:52,499 INFO L290 TraceCheckUtils]: 95: Hoare triple {161631#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {161631#false} is VALID [2022-02-20 18:39:52,499 INFO L290 TraceCheckUtils]: 96: Hoare triple {161631#false} assume ~st1~0 + ~nl1~0 <= 1; {161631#false} is VALID [2022-02-20 18:39:52,499 INFO L290 TraceCheckUtils]: 97: Hoare triple {161631#false} assume ~st2~0 + ~nl2~0 <= 1; {161631#false} is VALID [2022-02-20 18:39:52,499 INFO L290 TraceCheckUtils]: 98: Hoare triple {161631#false} assume ~st3~0 + ~nl3~0 <= 1; {161631#false} is VALID [2022-02-20 18:39:52,499 INFO L290 TraceCheckUtils]: 99: Hoare triple {161631#false} assume !(~r1~0 % 256 >= 2); {161631#false} is VALID [2022-02-20 18:39:52,500 INFO L290 TraceCheckUtils]: 100: Hoare triple {161631#false} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);main_~check__tmp~1#1 := 0; {161631#false} is VALID [2022-02-20 18:39:52,500 INFO L290 TraceCheckUtils]: 101: Hoare triple {161631#false} ~__return_1389~0 := main_~check__tmp~1#1;main_~main__c1~0#1 := ~__return_1389~0; {161631#false} is VALID [2022-02-20 18:39:52,500 INFO L290 TraceCheckUtils]: 102: Hoare triple {161631#false} havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := (if 0 == main_~main__c1~0#1 then 0 else 1);havoc main_~assert__arg~1#1;main_~assert__arg~1#1 := main_~__tmp_2~0#1; {161631#false} is VALID [2022-02-20 18:39:52,500 INFO L290 TraceCheckUtils]: 103: Hoare triple {161631#false} assume 0 == main_~assert__arg~1#1 % 256; {161631#false} is VALID [2022-02-20 18:39:52,500 INFO L290 TraceCheckUtils]: 104: Hoare triple {161631#false} assume !false; {161631#false} is VALID [2022-02-20 18:39:52,500 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 18:39:52,501 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:39:52,501 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054368444] [2022-02-20 18:39:52,501 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054368444] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:39:52,501 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:39:52,501 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:39:52,501 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276543874] [2022-02-20 18:39:52,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:39:52,502 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-02-20 18:39:52,502 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:39:52,502 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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) [2022-02-20 18:39:52,598 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:39:52,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:39:52,598 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:39:52,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:39:52,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:39:52,599 INFO L87 Difference]: Start difference. First operand 5134 states and 7272 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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)