./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.1.ufo.BOUNDED-12.pals.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/pals_lcr.6.1.ufo.BOUNDED-12.pals.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 b4e7977192ae56aeb09dc050b873d7b40c1e47d710f31b358c00a46d3bffe743 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 18:30:02,096 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 18:30:02,098 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 18:30:02,131 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 18:30:02,134 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 18:30:02,137 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 18:30:02,139 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 18:30:02,141 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 18:30:02,142 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 18:30:02,145 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 18:30:02,146 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 18:30:02,147 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 18:30:02,147 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 18:30:02,149 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 18:30:02,150 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 18:30:02,152 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 18:30:02,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 18:30:02,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 18:30:02,156 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 18:30:02,158 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 18:30:02,159 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 18:30:02,160 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 18:30:02,161 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 18:30:02,161 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 18:30:02,163 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 18:30:02,163 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 18:30:02,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 18:30:02,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 18:30:02,164 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 18:30:02,165 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 18:30:02,165 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 18:30:02,166 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 18:30:02,166 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 18:30:02,167 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 18:30:02,168 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 18:30:02,168 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 18:30:02,169 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 18:30:02,169 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 18:30:02,169 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 18:30:02,170 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 18:30:02,170 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 18:30:02,175 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:30:02,199 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 18:30:02,200 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 18:30:02,200 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 18:30:02,200 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 18:30:02,201 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 18:30:02,201 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 18:30:02,202 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 18:30:02,202 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 18:30:02,202 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 18:30:02,202 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 18:30:02,203 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 18:30:02,203 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 18:30:02,203 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 18:30:02,203 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 18:30:02,203 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 18:30:02,204 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 18:30:02,204 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 18:30:02,204 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 18:30:02,204 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 18:30:02,204 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 18:30:02,204 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 18:30:02,204 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 18:30:02,205 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 18:30:02,205 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 18:30:02,205 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:30:02,205 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 18:30:02,205 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 18:30:02,205 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 18:30:02,206 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 18:30:02,206 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 18:30:02,206 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 18:30:02,206 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 18:30:02,206 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 18:30:02,206 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 -> b4e7977192ae56aeb09dc050b873d7b40c1e47d710f31b358c00a46d3bffe743 [2022-02-20 18:30:02,413 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 18:30:02,443 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 18:30:02,445 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 18:30:02,446 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 18:30:02,446 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 18:30:02,447 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.6.1.ufo.BOUNDED-12.pals.c [2022-02-20 18:30:02,502 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e603df009/9b3c1a314fd541a182dbddbfb3338d25/FLAG30bf7ab76 [2022-02-20 18:30:02,874 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 18:30:02,874 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.6.1.ufo.BOUNDED-12.pals.c [2022-02-20 18:30:02,886 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e603df009/9b3c1a314fd541a182dbddbfb3338d25/FLAG30bf7ab76 [2022-02-20 18:30:02,898 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e603df009/9b3c1a314fd541a182dbddbfb3338d25 [2022-02-20 18:30:02,901 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 18:30:02,904 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 18:30:02,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 18:30:02,907 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 18:30:02,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 18:30:02,915 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:30:02" (1/1) ... [2022-02-20 18:30:02,916 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6034906f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:02, skipping insertion in model container [2022-02-20 18:30:02,917 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 06:30:02" (1/1) ... [2022-02-20 18:30:02,922 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 18:30:02,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 18:30:03,139 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/pals_lcr.6.1.ufo.BOUNDED-12.pals.c[15112,15125] [2022-02-20 18:30:03,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:30:03,147 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 18:30:03,181 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/pals_lcr.6.1.ufo.BOUNDED-12.pals.c[15112,15125] [2022-02-20 18:30:03,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 18:30:03,192 INFO L208 MainTranslator]: Completed translation [2022-02-20 18:30:03,193 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:03 WrapperNode [2022-02-20 18:30:03,193 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 18:30:03,194 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 18:30:03,194 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 18:30:03,194 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 18:30:03,198 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:30:03" (1/1) ... [2022-02-20 18:30:03,205 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:30:03" (1/1) ... [2022-02-20 18:30:03,239 INFO L137 Inliner]: procedures = 25, calls = 17, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 393 [2022-02-20 18:30:03,239 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 18:30:03,240 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 18:30:03,240 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 18:30:03,240 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 18:30:03,254 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:03" (1/1) ... [2022-02-20 18:30:03,254 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:03" (1/1) ... [2022-02-20 18:30:03,265 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:03" (1/1) ... [2022-02-20 18:30:03,265 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:03" (1/1) ... [2022-02-20 18:30:03,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:03" (1/1) ... [2022-02-20 18:30:03,281 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:03" (1/1) ... [2022-02-20 18:30:03,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:03" (1/1) ... [2022-02-20 18:30:03,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 18:30:03,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 18:30:03,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 18:30:03,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 18:30:03,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:03" (1/1) ... [2022-02-20 18:30:03,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 18:30:03,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 18:30:03,344 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:30:03,349 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:30:03,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 18:30:03,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 18:30:03,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 18:30:03,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 18:30:03,502 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 18:30:03,503 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 18:30:04,089 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 18:30:04,098 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 18:30:04,101 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 18:30:04,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:30:04 BoogieIcfgContainer [2022-02-20 18:30:04,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 18:30:04,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 18:30:04,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 18:30:04,107 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 18:30:04,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 06:30:02" (1/3) ... [2022-02-20 18:30:04,108 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414fe779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:30:04, skipping insertion in model container [2022-02-20 18:30:04,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 06:30:03" (2/3) ... [2022-02-20 18:30:04,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@414fe779 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 06:30:04, skipping insertion in model container [2022-02-20 18:30:04,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 06:30:04" (3/3) ... [2022-02-20 18:30:04,110 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.1.ufo.BOUNDED-12.pals.c [2022-02-20 18:30:04,115 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 18:30:04,116 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 18:30:04,152 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 18:30:04,156 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:30:04,156 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 18:30:04,169 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 108 states have (on average 1.7407407407407407) internal successors, (188), 109 states have internal predecessors, (188), 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:30:04,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:30:04,174 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:04,175 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] [2022-02-20 18:30:04,175 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:04,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:04,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1259035486, now seen corresponding path program 1 times [2022-02-20 18:30:04,186 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:04,186 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657403247] [2022-02-20 18:30:04,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:04,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:04,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:04,328 INFO L290 TraceCheckUtils]: 0: Hoare triple {113#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {113#true} is VALID [2022-02-20 18:30:04,328 INFO L290 TraceCheckUtils]: 1: Hoare triple {113#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~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;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {113#true} is VALID [2022-02-20 18:30:04,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {113#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {113#true} is VALID [2022-02-20 18:30:04,329 INFO L290 TraceCheckUtils]: 3: Hoare triple {113#true} init_#res#1 := init_~tmp~0#1; {113#true} is VALID [2022-02-20 18:30:04,329 INFO L290 TraceCheckUtils]: 4: Hoare triple {113#true} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {113#true} is VALID [2022-02-20 18:30:04,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {113#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {114#false} is VALID [2022-02-20 18:30:04,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {114#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {114#false} is VALID [2022-02-20 18:30:04,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {114#false} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:30:04,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {114#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:30:04,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {114#false} assume !(node1_~m1~0#1 != ~nomsg~0); {114#false} is VALID [2022-02-20 18:30:04,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {114#false} ~mode1~0 := 0; {114#false} is VALID [2022-02-20 18:30:04,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {114#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:30:04,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {114#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:30:04,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {114#false} assume !(node2_~m2~0#1 != ~nomsg~0); {114#false} is VALID [2022-02-20 18:30:04,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {114#false} ~mode2~0 := 0; {114#false} is VALID [2022-02-20 18:30:04,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {114#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:30:04,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {114#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:30:04,333 INFO L290 TraceCheckUtils]: 17: Hoare triple {114#false} assume !(node3_~m3~0#1 != ~nomsg~0); {114#false} is VALID [2022-02-20 18:30:04,333 INFO L290 TraceCheckUtils]: 18: Hoare triple {114#false} ~mode3~0 := 0; {114#false} is VALID [2022-02-20 18:30:04,333 INFO L290 TraceCheckUtils]: 19: Hoare triple {114#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:30:04,334 INFO L290 TraceCheckUtils]: 20: Hoare triple {114#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:30:04,334 INFO L290 TraceCheckUtils]: 21: Hoare triple {114#false} assume !(node4_~m4~0#1 != ~nomsg~0); {114#false} is VALID [2022-02-20 18:30:04,334 INFO L290 TraceCheckUtils]: 22: Hoare triple {114#false} ~mode4~0 := 0; {114#false} is VALID [2022-02-20 18:30:04,335 INFO L290 TraceCheckUtils]: 23: Hoare triple {114#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:30:04,335 INFO L290 TraceCheckUtils]: 24: Hoare triple {114#false} assume !(0 != ~mode5~0 % 256); {114#false} is VALID [2022-02-20 18:30:04,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {114#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {114#false} is VALID [2022-02-20 18:30:04,335 INFO L290 TraceCheckUtils]: 26: Hoare triple {114#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {114#false} is VALID [2022-02-20 18:30:04,336 INFO L290 TraceCheckUtils]: 27: Hoare triple {114#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {114#false} is VALID [2022-02-20 18:30:04,336 INFO L290 TraceCheckUtils]: 28: Hoare triple {114#false} assume !(0 != ~mode6~0 % 256); {114#false} is VALID [2022-02-20 18:30:04,336 INFO L290 TraceCheckUtils]: 29: Hoare triple {114#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {114#false} is VALID [2022-02-20 18:30:04,336 INFO L290 TraceCheckUtils]: 30: Hoare triple {114#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {114#false} is VALID [2022-02-20 18:30:04,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {114#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {114#false} is VALID [2022-02-20 18:30:04,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {114#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {114#false} is VALID [2022-02-20 18:30:04,337 INFO L290 TraceCheckUtils]: 33: Hoare triple {114#false} check_#res#1 := check_~tmp~1#1; {114#false} is VALID [2022-02-20 18:30:04,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {114#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {114#false} is VALID [2022-02-20 18:30:04,337 INFO L290 TraceCheckUtils]: 35: Hoare triple {114#false} assume 0 == assert_~arg#1 % 256; {114#false} is VALID [2022-02-20 18:30:04,338 INFO L290 TraceCheckUtils]: 36: Hoare triple {114#false} assume !false; {114#false} is VALID [2022-02-20 18:30:04,339 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:30:04,339 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:04,339 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657403247] [2022-02-20 18:30:04,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657403247] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:04,340 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:04,340 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 18:30:04,341 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622066386] [2022-02-20 18:30:04,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:04,345 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 37 [2022-02-20 18:30:04,346 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:04,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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:30:04,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:04,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 18:30:04,379 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:04,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 18:30:04,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:30:04,395 INFO L87 Difference]: Start difference. First operand has 110 states, 108 states have (on average 1.7407407407407407) internal successors, (188), 109 states have internal predecessors, (188), 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 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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:30:04,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:04,510 INFO L93 Difference]: Finished difference Result 175 states and 290 transitions. [2022-02-20 18:30:04,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 18:30:04,511 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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 37 [2022-02-20 18:30:04,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:04,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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:30:04,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 290 transitions. [2022-02-20 18:30:04,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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:30:04,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 290 transitions. [2022-02-20 18:30:04,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 290 transitions. [2022-02-20 18:30:04,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 290 edges. 290 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:04,755 INFO L225 Difference]: With dead ends: 175 [2022-02-20 18:30:04,756 INFO L226 Difference]: Without dead ends: 106 [2022-02-20 18:30:04,758 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 18:30:04,761 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:04,762 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:04,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-20 18:30:04,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-02-20 18:30:04,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:04,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 106 states, 105 states have (on average 1.723809523809524) internal successors, (181), 105 states have internal predecessors, (181), 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:30:04,795 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 106 states, 105 states have (on average 1.723809523809524) internal successors, (181), 105 states have internal predecessors, (181), 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:30:04,795 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 106 states, 105 states have (on average 1.723809523809524) internal successors, (181), 105 states have internal predecessors, (181), 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:30:04,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:04,799 INFO L93 Difference]: Finished difference Result 106 states and 181 transitions. [2022-02-20 18:30:04,799 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 181 transitions. [2022-02-20 18:30:04,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:04,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:04,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 105 states have (on average 1.723809523809524) internal successors, (181), 105 states have internal predecessors, (181), 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 106 states. [2022-02-20 18:30:04,801 INFO L87 Difference]: Start difference. First operand has 106 states, 105 states have (on average 1.723809523809524) internal successors, (181), 105 states have internal predecessors, (181), 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 106 states. [2022-02-20 18:30:04,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:04,804 INFO L93 Difference]: Finished difference Result 106 states and 181 transitions. [2022-02-20 18:30:04,805 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 181 transitions. [2022-02-20 18:30:04,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:04,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:04,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:04,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:04,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.723809523809524) internal successors, (181), 105 states have internal predecessors, (181), 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:30:04,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 181 transitions. [2022-02-20 18:30:04,809 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 181 transitions. Word has length 37 [2022-02-20 18:30:04,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:04,810 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 181 transitions. [2022-02-20 18:30:04,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 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:30:04,810 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 181 transitions. [2022-02-20 18:30:04,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 18:30:04,811 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:04,812 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] [2022-02-20 18:30:04,812 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 18:30:04,812 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:04,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:04,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1533795100, now seen corresponding path program 1 times [2022-02-20 18:30:04,813 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:04,814 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358721561] [2022-02-20 18:30:04,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:04,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:04,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {641#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {641#true} is VALID [2022-02-20 18:30:04,941 INFO L290 TraceCheckUtils]: 1: Hoare triple {641#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~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;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {641#true} is VALID [2022-02-20 18:30:04,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {641#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {643#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 18:30:04,942 INFO L290 TraceCheckUtils]: 3: Hoare triple {643#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {644#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 18:30:04,943 INFO L290 TraceCheckUtils]: 4: Hoare triple {644#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {645#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 18:30:04,943 INFO L290 TraceCheckUtils]: 5: Hoare triple {645#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {642#false} is VALID [2022-02-20 18:30:04,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {642#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {642#false} is VALID [2022-02-20 18:30:04,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {642#false} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {642#false} is VALID [2022-02-20 18:30:04,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {642#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {642#false} is VALID [2022-02-20 18:30:04,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {642#false} assume !(node1_~m1~0#1 != ~nomsg~0); {642#false} is VALID [2022-02-20 18:30:04,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {642#false} ~mode1~0 := 0; {642#false} is VALID [2022-02-20 18:30:04,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {642#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {642#false} is VALID [2022-02-20 18:30:04,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {642#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {642#false} is VALID [2022-02-20 18:30:04,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {642#false} assume !(node2_~m2~0#1 != ~nomsg~0); {642#false} is VALID [2022-02-20 18:30:04,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {642#false} ~mode2~0 := 0; {642#false} is VALID [2022-02-20 18:30:04,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {642#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {642#false} is VALID [2022-02-20 18:30:04,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {642#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {642#false} is VALID [2022-02-20 18:30:04,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {642#false} assume !(node3_~m3~0#1 != ~nomsg~0); {642#false} is VALID [2022-02-20 18:30:04,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {642#false} ~mode3~0 := 0; {642#false} is VALID [2022-02-20 18:30:04,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {642#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {642#false} is VALID [2022-02-20 18:30:04,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {642#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {642#false} is VALID [2022-02-20 18:30:04,951 INFO L290 TraceCheckUtils]: 21: Hoare triple {642#false} assume !(node4_~m4~0#1 != ~nomsg~0); {642#false} is VALID [2022-02-20 18:30:04,951 INFO L290 TraceCheckUtils]: 22: Hoare triple {642#false} ~mode4~0 := 0; {642#false} is VALID [2022-02-20 18:30:04,951 INFO L290 TraceCheckUtils]: 23: Hoare triple {642#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {642#false} is VALID [2022-02-20 18:30:04,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {642#false} assume !(0 != ~mode5~0 % 256); {642#false} is VALID [2022-02-20 18:30:04,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {642#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {642#false} is VALID [2022-02-20 18:30:04,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {642#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {642#false} is VALID [2022-02-20 18:30:04,952 INFO L290 TraceCheckUtils]: 27: Hoare triple {642#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {642#false} is VALID [2022-02-20 18:30:04,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {642#false} assume !(0 != ~mode6~0 % 256); {642#false} is VALID [2022-02-20 18:30:04,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {642#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {642#false} is VALID [2022-02-20 18:30:04,953 INFO L290 TraceCheckUtils]: 30: Hoare triple {642#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {642#false} is VALID [2022-02-20 18:30:04,953 INFO L290 TraceCheckUtils]: 31: Hoare triple {642#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {642#false} is VALID [2022-02-20 18:30:04,953 INFO L290 TraceCheckUtils]: 32: Hoare triple {642#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {642#false} is VALID [2022-02-20 18:30:04,953 INFO L290 TraceCheckUtils]: 33: Hoare triple {642#false} check_#res#1 := check_~tmp~1#1; {642#false} is VALID [2022-02-20 18:30:04,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {642#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {642#false} is VALID [2022-02-20 18:30:04,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {642#false} assume 0 == assert_~arg#1 % 256; {642#false} is VALID [2022-02-20 18:30:04,955 INFO L290 TraceCheckUtils]: 36: Hoare triple {642#false} assume !false; {642#false} is VALID [2022-02-20 18:30:04,955 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:30:04,955 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:04,955 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358721561] [2022-02-20 18:30:04,956 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358721561] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:04,956 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:04,956 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:30:04,957 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963915091] [2022-02-20 18:30:04,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:04,958 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2022-02-20 18:30:04,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:04,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:30:04,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:04,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 18:30:04,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:04,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 18:30:04,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 18:30:04,996 INFO L87 Difference]: Start difference. First operand 106 states and 181 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:30:05,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:05,316 INFO L93 Difference]: Finished difference Result 170 states and 280 transitions. [2022-02-20 18:30:05,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 18:30:05,317 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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 37 [2022-02-20 18:30:05,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:05,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:30:05,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 280 transitions. [2022-02-20 18:30:05,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:30:05,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 280 transitions. [2022-02-20 18:30:05,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 280 transitions. [2022-02-20 18:30:05,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:05,502 INFO L225 Difference]: With dead ends: 170 [2022-02-20 18:30:05,502 INFO L226 Difference]: Without dead ends: 106 [2022-02-20 18:30:05,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 18:30:05,507 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 3 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:05,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 673 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:05,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-02-20 18:30:05,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-02-20 18:30:05,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:05,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 106 states. Second operand has 106 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 105 states have internal predecessors, (141), 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:30:05,520 INFO L74 IsIncluded]: Start isIncluded. First operand 106 states. Second operand has 106 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 105 states have internal predecessors, (141), 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:30:05,521 INFO L87 Difference]: Start difference. First operand 106 states. Second operand has 106 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 105 states have internal predecessors, (141), 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:30:05,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:05,523 INFO L93 Difference]: Finished difference Result 106 states and 141 transitions. [2022-02-20 18:30:05,523 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 141 transitions. [2022-02-20 18:30:05,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:05,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:05,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 105 states have internal predecessors, (141), 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 106 states. [2022-02-20 18:30:05,524 INFO L87 Difference]: Start difference. First operand has 106 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 105 states have internal predecessors, (141), 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 106 states. [2022-02-20 18:30:05,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:05,527 INFO L93 Difference]: Finished difference Result 106 states and 141 transitions. [2022-02-20 18:30:05,527 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 141 transitions. [2022-02-20 18:30:05,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:05,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:05,528 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:05,528 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:05,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 105 states have (on average 1.3428571428571427) internal successors, (141), 105 states have internal predecessors, (141), 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:30:05,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 141 transitions. [2022-02-20 18:30:05,530 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 141 transitions. Word has length 37 [2022-02-20 18:30:05,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:05,531 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 141 transitions. [2022-02-20 18:30:05,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 5 states have internal predecessors, (37), 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:30:05,531 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 141 transitions. [2022-02-20 18:30:05,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:30:05,532 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:05,532 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] [2022-02-20 18:30:05,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 18:30:05,533 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:05,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:05,534 INFO L85 PathProgramCache]: Analyzing trace with hash 1950823117, now seen corresponding path program 1 times [2022-02-20 18:30:05,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:05,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163950185] [2022-02-20 18:30:05,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:05,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:05,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {1170#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {1170#true} is VALID [2022-02-20 18:30:05,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {1170#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~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;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1170#true} is VALID [2022-02-20 18:30:05,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {1170#true} assume 0 == ~r1~0; {1170#true} is VALID [2022-02-20 18:30:05,640 INFO L290 TraceCheckUtils]: 3: Hoare triple {1170#true} assume ~id1~0 >= 0; {1170#true} is VALID [2022-02-20 18:30:05,640 INFO L290 TraceCheckUtils]: 4: Hoare triple {1170#true} assume 0 == ~st1~0; {1170#true} is VALID [2022-02-20 18:30:05,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {1170#true} assume ~send1~0 == ~id1~0; {1170#true} is VALID [2022-02-20 18:30:05,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {1170#true} assume 0 == ~mode1~0 % 256; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,644 INFO L290 TraceCheckUtils]: 15: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,645 INFO L290 TraceCheckUtils]: 16: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,645 INFO L290 TraceCheckUtils]: 17: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,646 INFO L290 TraceCheckUtils]: 18: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,646 INFO L290 TraceCheckUtils]: 20: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,648 INFO L290 TraceCheckUtils]: 23: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id6~0 >= 0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st6~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send6~0 == ~id6~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,649 INFO L290 TraceCheckUtils]: 26: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode6~0 % 256; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,649 INFO L290 TraceCheckUtils]: 27: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,650 INFO L290 TraceCheckUtils]: 28: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,650 INFO L290 TraceCheckUtils]: 29: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,651 INFO L290 TraceCheckUtils]: 31: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id6~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,651 INFO L290 TraceCheckUtils]: 32: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id6~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,653 INFO L290 TraceCheckUtils]: 36: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,654 INFO L290 TraceCheckUtils]: 37: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id6~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,654 INFO L290 TraceCheckUtils]: 39: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,655 INFO L290 TraceCheckUtils]: 40: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id6~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,655 INFO L290 TraceCheckUtils]: 41: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,656 INFO L290 TraceCheckUtils]: 42: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,656 INFO L290 TraceCheckUtils]: 43: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,657 INFO L290 TraceCheckUtils]: 44: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,657 INFO L290 TraceCheckUtils]: 45: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,658 INFO L290 TraceCheckUtils]: 46: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 18:30:05,658 INFO L290 TraceCheckUtils]: 47: Hoare triple {1172#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {1171#false} is VALID [2022-02-20 18:30:05,658 INFO L290 TraceCheckUtils]: 48: Hoare triple {1171#false} assume !(node1_~m1~0#1 != ~nomsg~0); {1171#false} is VALID [2022-02-20 18:30:05,659 INFO L290 TraceCheckUtils]: 49: Hoare triple {1171#false} ~mode1~0 := 0; {1171#false} is VALID [2022-02-20 18:30:05,659 INFO L290 TraceCheckUtils]: 50: Hoare triple {1171#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1171#false} is VALID [2022-02-20 18:30:05,659 INFO L290 TraceCheckUtils]: 51: Hoare triple {1171#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1171#false} is VALID [2022-02-20 18:30:05,659 INFO L290 TraceCheckUtils]: 52: Hoare triple {1171#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1171#false} is VALID [2022-02-20 18:30:05,659 INFO L290 TraceCheckUtils]: 53: Hoare triple {1171#false} ~mode2~0 := 0; {1171#false} is VALID [2022-02-20 18:30:05,659 INFO L290 TraceCheckUtils]: 54: Hoare triple {1171#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1171#false} is VALID [2022-02-20 18:30:05,659 INFO L290 TraceCheckUtils]: 55: Hoare triple {1171#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1171#false} is VALID [2022-02-20 18:30:05,660 INFO L290 TraceCheckUtils]: 56: Hoare triple {1171#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1171#false} is VALID [2022-02-20 18:30:05,660 INFO L290 TraceCheckUtils]: 57: Hoare triple {1171#false} ~mode3~0 := 0; {1171#false} is VALID [2022-02-20 18:30:05,660 INFO L290 TraceCheckUtils]: 58: Hoare triple {1171#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1171#false} is VALID [2022-02-20 18:30:05,660 INFO L290 TraceCheckUtils]: 59: Hoare triple {1171#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1171#false} is VALID [2022-02-20 18:30:05,660 INFO L290 TraceCheckUtils]: 60: Hoare triple {1171#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1171#false} is VALID [2022-02-20 18:30:05,660 INFO L290 TraceCheckUtils]: 61: Hoare triple {1171#false} ~mode4~0 := 0; {1171#false} is VALID [2022-02-20 18:30:05,661 INFO L290 TraceCheckUtils]: 62: Hoare triple {1171#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1171#false} is VALID [2022-02-20 18:30:05,661 INFO L290 TraceCheckUtils]: 63: Hoare triple {1171#false} assume !(0 != ~mode5~0 % 256); {1171#false} is VALID [2022-02-20 18:30:05,661 INFO L290 TraceCheckUtils]: 64: Hoare triple {1171#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {1171#false} is VALID [2022-02-20 18:30:05,661 INFO L290 TraceCheckUtils]: 65: Hoare triple {1171#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {1171#false} is VALID [2022-02-20 18:30:05,661 INFO L290 TraceCheckUtils]: 66: Hoare triple {1171#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1171#false} is VALID [2022-02-20 18:30:05,661 INFO L290 TraceCheckUtils]: 67: Hoare triple {1171#false} assume !(0 != ~mode6~0 % 256); {1171#false} is VALID [2022-02-20 18:30:05,661 INFO L290 TraceCheckUtils]: 68: Hoare triple {1171#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {1171#false} is VALID [2022-02-20 18:30:05,662 INFO L290 TraceCheckUtils]: 69: Hoare triple {1171#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {1171#false} is VALID [2022-02-20 18:30:05,662 INFO L290 TraceCheckUtils]: 70: Hoare triple {1171#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1171#false} is VALID [2022-02-20 18:30:05,662 INFO L290 TraceCheckUtils]: 71: Hoare triple {1171#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {1171#false} is VALID [2022-02-20 18:30:05,662 INFO L290 TraceCheckUtils]: 72: Hoare triple {1171#false} check_#res#1 := check_~tmp~1#1; {1171#false} is VALID [2022-02-20 18:30:05,662 INFO L290 TraceCheckUtils]: 73: Hoare triple {1171#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1171#false} is VALID [2022-02-20 18:30:05,662 INFO L290 TraceCheckUtils]: 74: Hoare triple {1171#false} assume 0 == assert_~arg#1 % 256; {1171#false} is VALID [2022-02-20 18:30:05,662 INFO L290 TraceCheckUtils]: 75: Hoare triple {1171#false} assume !false; {1171#false} is VALID [2022-02-20 18:30:05,663 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:30:05,663 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:05,664 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163950185] [2022-02-20 18:30:05,664 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163950185] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:05,664 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:05,664 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:05,664 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754200719] [2022-02-20 18:30:05,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:05,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2022-02-20 18:30:05,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:05,665 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:30:05,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:05,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:05,712 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:05,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:05,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:05,712 INFO L87 Difference]: Start difference. First operand 106 states and 141 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:30:05,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:05,890 INFO L93 Difference]: Finished difference Result 220 states and 321 transitions. [2022-02-20 18:30:05,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:05,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2022-02-20 18:30:05,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:05,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:30:05,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:30:05,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:30:05,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:30:05,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 321 transitions. [2022-02-20 18:30:06,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:06,128 INFO L225 Difference]: With dead ends: 220 [2022-02-20 18:30:06,128 INFO L226 Difference]: Without dead ends: 160 [2022-02-20 18:30:06,129 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:30:06,129 INFO L933 BasicCegarLoop]: 222 mSDtfsCounter, 85 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:06,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 315 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:06,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-02-20 18:30:06,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2022-02-20 18:30:06,135 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:06,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 158 states, 157 states have (on average 1.4267515923566878) internal successors, (224), 157 states have internal predecessors, (224), 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:30:06,136 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 158 states, 157 states have (on average 1.4267515923566878) internal successors, (224), 157 states have internal predecessors, (224), 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:30:06,136 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 158 states, 157 states have (on average 1.4267515923566878) internal successors, (224), 157 states have internal predecessors, (224), 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:30:06,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:06,139 INFO L93 Difference]: Finished difference Result 160 states and 225 transitions. [2022-02-20 18:30:06,140 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 225 transitions. [2022-02-20 18:30:06,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:06,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:06,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 157 states have (on average 1.4267515923566878) internal successors, (224), 157 states have internal predecessors, (224), 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 160 states. [2022-02-20 18:30:06,141 INFO L87 Difference]: Start difference. First operand has 158 states, 157 states have (on average 1.4267515923566878) internal successors, (224), 157 states have internal predecessors, (224), 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 160 states. [2022-02-20 18:30:06,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:06,144 INFO L93 Difference]: Finished difference Result 160 states and 225 transitions. [2022-02-20 18:30:06,144 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 225 transitions. [2022-02-20 18:30:06,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:06,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:06,145 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:06,145 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:06,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.4267515923566878) internal successors, (224), 157 states have internal predecessors, (224), 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:30:06,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 224 transitions. [2022-02-20 18:30:06,148 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 224 transitions. Word has length 76 [2022-02-20 18:30:06,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:06,148 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 224 transitions. [2022-02-20 18:30:06,149 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:30:06,149 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 224 transitions. [2022-02-20 18:30:06,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:30:06,150 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:06,150 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] [2022-02-20 18:30:06,150 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 18:30:06,150 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:06,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:06,151 INFO L85 PathProgramCache]: Analyzing trace with hash 699917825, now seen corresponding path program 1 times [2022-02-20 18:30:06,151 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:06,151 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910875928] [2022-02-20 18:30:06,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:06,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:06,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {1920#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {1920#true} is VALID [2022-02-20 18:30:06,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {1920#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~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;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1920#true} is VALID [2022-02-20 18:30:06,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {1920#true} assume 0 == ~r1~0; {1920#true} is VALID [2022-02-20 18:30:06,228 INFO L290 TraceCheckUtils]: 3: Hoare triple {1920#true} assume ~id1~0 >= 0; {1920#true} is VALID [2022-02-20 18:30:06,228 INFO L290 TraceCheckUtils]: 4: Hoare triple {1920#true} assume 0 == ~st1~0; {1920#true} is VALID [2022-02-20 18:30:06,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {1920#true} assume ~send1~0 == ~id1~0; {1920#true} is VALID [2022-02-20 18:30:06,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {1920#true} assume 0 == ~mode1~0 % 256; {1920#true} is VALID [2022-02-20 18:30:06,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {1920#true} assume ~id2~0 >= 0; {1920#true} is VALID [2022-02-20 18:30:06,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {1920#true} assume 0 == ~st2~0; {1920#true} is VALID [2022-02-20 18:30:06,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {1920#true} assume ~send2~0 == ~id2~0; {1920#true} is VALID [2022-02-20 18:30:06,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {1920#true} assume 0 == ~mode2~0 % 256; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,231 INFO L290 TraceCheckUtils]: 12: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,236 INFO L290 TraceCheckUtils]: 23: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,238 INFO L290 TraceCheckUtils]: 28: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,239 INFO L290 TraceCheckUtils]: 29: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,239 INFO L290 TraceCheckUtils]: 30: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,240 INFO L290 TraceCheckUtils]: 31: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,240 INFO L290 TraceCheckUtils]: 32: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,241 INFO L290 TraceCheckUtils]: 33: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,241 INFO L290 TraceCheckUtils]: 34: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,242 INFO L290 TraceCheckUtils]: 35: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,242 INFO L290 TraceCheckUtils]: 36: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,243 INFO L290 TraceCheckUtils]: 37: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,243 INFO L290 TraceCheckUtils]: 38: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,244 INFO L290 TraceCheckUtils]: 39: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,244 INFO L290 TraceCheckUtils]: 40: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,245 INFO L290 TraceCheckUtils]: 41: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,246 INFO L290 TraceCheckUtils]: 43: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,247 INFO L290 TraceCheckUtils]: 44: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,247 INFO L290 TraceCheckUtils]: 45: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,248 INFO L290 TraceCheckUtils]: 46: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,248 INFO L290 TraceCheckUtils]: 47: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,249 INFO L290 TraceCheckUtils]: 48: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,249 INFO L290 TraceCheckUtils]: 49: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,250 INFO L290 TraceCheckUtils]: 50: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 18:30:06,250 INFO L290 TraceCheckUtils]: 51: Hoare triple {1922#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1921#false} is VALID [2022-02-20 18:30:06,251 INFO L290 TraceCheckUtils]: 52: Hoare triple {1921#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1921#false} is VALID [2022-02-20 18:30:06,251 INFO L290 TraceCheckUtils]: 53: Hoare triple {1921#false} ~mode2~0 := 0; {1921#false} is VALID [2022-02-20 18:30:06,251 INFO L290 TraceCheckUtils]: 54: Hoare triple {1921#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1921#false} is VALID [2022-02-20 18:30:06,251 INFO L290 TraceCheckUtils]: 55: Hoare triple {1921#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1921#false} is VALID [2022-02-20 18:30:06,251 INFO L290 TraceCheckUtils]: 56: Hoare triple {1921#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1921#false} is VALID [2022-02-20 18:30:06,252 INFO L290 TraceCheckUtils]: 57: Hoare triple {1921#false} ~mode3~0 := 0; {1921#false} is VALID [2022-02-20 18:30:06,252 INFO L290 TraceCheckUtils]: 58: Hoare triple {1921#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1921#false} is VALID [2022-02-20 18:30:06,252 INFO L290 TraceCheckUtils]: 59: Hoare triple {1921#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1921#false} is VALID [2022-02-20 18:30:06,252 INFO L290 TraceCheckUtils]: 60: Hoare triple {1921#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1921#false} is VALID [2022-02-20 18:30:06,252 INFO L290 TraceCheckUtils]: 61: Hoare triple {1921#false} ~mode4~0 := 0; {1921#false} is VALID [2022-02-20 18:30:06,252 INFO L290 TraceCheckUtils]: 62: Hoare triple {1921#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1921#false} is VALID [2022-02-20 18:30:06,253 INFO L290 TraceCheckUtils]: 63: Hoare triple {1921#false} assume !(0 != ~mode5~0 % 256); {1921#false} is VALID [2022-02-20 18:30:06,253 INFO L290 TraceCheckUtils]: 64: Hoare triple {1921#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {1921#false} is VALID [2022-02-20 18:30:06,253 INFO L290 TraceCheckUtils]: 65: Hoare triple {1921#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {1921#false} is VALID [2022-02-20 18:30:06,253 INFO L290 TraceCheckUtils]: 66: Hoare triple {1921#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {1921#false} is VALID [2022-02-20 18:30:06,253 INFO L290 TraceCheckUtils]: 67: Hoare triple {1921#false} assume !(0 != ~mode6~0 % 256); {1921#false} is VALID [2022-02-20 18:30:06,253 INFO L290 TraceCheckUtils]: 68: Hoare triple {1921#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {1921#false} is VALID [2022-02-20 18:30:06,254 INFO L290 TraceCheckUtils]: 69: Hoare triple {1921#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {1921#false} is VALID [2022-02-20 18:30:06,254 INFO L290 TraceCheckUtils]: 70: Hoare triple {1921#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1921#false} is VALID [2022-02-20 18:30:06,254 INFO L290 TraceCheckUtils]: 71: Hoare triple {1921#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {1921#false} is VALID [2022-02-20 18:30:06,254 INFO L290 TraceCheckUtils]: 72: Hoare triple {1921#false} check_#res#1 := check_~tmp~1#1; {1921#false} is VALID [2022-02-20 18:30:06,254 INFO L290 TraceCheckUtils]: 73: Hoare triple {1921#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1921#false} is VALID [2022-02-20 18:30:06,255 INFO L290 TraceCheckUtils]: 74: Hoare triple {1921#false} assume 0 == assert_~arg#1 % 256; {1921#false} is VALID [2022-02-20 18:30:06,255 INFO L290 TraceCheckUtils]: 75: Hoare triple {1921#false} assume !false; {1921#false} is VALID [2022-02-20 18:30:06,255 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:30:06,256 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:06,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910875928] [2022-02-20 18:30:06,256 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910875928] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:06,256 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:06,256 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:06,256 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451021323] [2022-02-20 18:30:06,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:06,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2022-02-20 18:30:06,257 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:06,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:30:06,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:06,312 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:06,313 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:06,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:06,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:06,313 INFO L87 Difference]: Start difference. First operand 158 states and 224 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:30:06,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:06,505 INFO L93 Difference]: Finished difference Result 370 states and 560 transitions. [2022-02-20 18:30:06,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:06,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2022-02-20 18:30:06,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:06,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:30:06,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:30:06,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:30:06,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:30:06,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 321 transitions. [2022-02-20 18:30:06,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:06,721 INFO L225 Difference]: With dead ends: 370 [2022-02-20 18:30:06,721 INFO L226 Difference]: Without dead ends: 258 [2022-02-20 18:30:06,721 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:30:06,722 INFO L933 BasicCegarLoop]: 217 mSDtfsCounter, 81 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:06,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 314 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:06,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-02-20 18:30:06,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2022-02-20 18:30:06,734 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:06,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 256 states, 255 states have (on average 1.4862745098039216) internal successors, (379), 255 states have internal predecessors, (379), 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:30:06,735 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 256 states, 255 states have (on average 1.4862745098039216) internal successors, (379), 255 states have internal predecessors, (379), 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:30:06,735 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 256 states, 255 states have (on average 1.4862745098039216) internal successors, (379), 255 states have internal predecessors, (379), 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:30:06,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:06,740 INFO L93 Difference]: Finished difference Result 258 states and 380 transitions. [2022-02-20 18:30:06,740 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 380 transitions. [2022-02-20 18:30:06,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:06,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:06,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 256 states, 255 states have (on average 1.4862745098039216) internal successors, (379), 255 states have internal predecessors, (379), 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 258 states. [2022-02-20 18:30:06,742 INFO L87 Difference]: Start difference. First operand has 256 states, 255 states have (on average 1.4862745098039216) internal successors, (379), 255 states have internal predecessors, (379), 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 258 states. [2022-02-20 18:30:06,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:06,747 INFO L93 Difference]: Finished difference Result 258 states and 380 transitions. [2022-02-20 18:30:06,747 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 380 transitions. [2022-02-20 18:30:06,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:06,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:06,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:06,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:06,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 255 states have (on average 1.4862745098039216) internal successors, (379), 255 states have internal predecessors, (379), 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:30:06,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 379 transitions. [2022-02-20 18:30:06,754 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 379 transitions. Word has length 76 [2022-02-20 18:30:06,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:06,754 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 379 transitions. [2022-02-20 18:30:06,755 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:30:06,755 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 379 transitions. [2022-02-20 18:30:06,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:30:06,756 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:06,756 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] [2022-02-20 18:30:06,756 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 18:30:06,757 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:06,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:06,757 INFO L85 PathProgramCache]: Analyzing trace with hash -45664905, now seen corresponding path program 1 times [2022-02-20 18:30:06,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:06,758 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795139480] [2022-02-20 18:30:06,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:06,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:06,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:06,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {3159#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {3159#true} is VALID [2022-02-20 18:30:06,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {3159#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~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;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {3159#true} is VALID [2022-02-20 18:30:06,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {3159#true} assume 0 == ~r1~0; {3159#true} is VALID [2022-02-20 18:30:06,816 INFO L290 TraceCheckUtils]: 3: Hoare triple {3159#true} assume ~id1~0 >= 0; {3159#true} is VALID [2022-02-20 18:30:06,817 INFO L290 TraceCheckUtils]: 4: Hoare triple {3159#true} assume 0 == ~st1~0; {3159#true} is VALID [2022-02-20 18:30:06,817 INFO L290 TraceCheckUtils]: 5: Hoare triple {3159#true} assume ~send1~0 == ~id1~0; {3159#true} is VALID [2022-02-20 18:30:06,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {3159#true} assume 0 == ~mode1~0 % 256; {3159#true} is VALID [2022-02-20 18:30:06,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {3159#true} assume ~id2~0 >= 0; {3159#true} is VALID [2022-02-20 18:30:06,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {3159#true} assume 0 == ~st2~0; {3159#true} is VALID [2022-02-20 18:30:06,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {3159#true} assume ~send2~0 == ~id2~0; {3159#true} is VALID [2022-02-20 18:30:06,817 INFO L290 TraceCheckUtils]: 10: Hoare triple {3159#true} assume 0 == ~mode2~0 % 256; {3159#true} is VALID [2022-02-20 18:30:06,817 INFO L290 TraceCheckUtils]: 11: Hoare triple {3159#true} assume ~id3~0 >= 0; {3159#true} is VALID [2022-02-20 18:30:06,817 INFO L290 TraceCheckUtils]: 12: Hoare triple {3159#true} assume 0 == ~st3~0; {3159#true} is VALID [2022-02-20 18:30:06,818 INFO L290 TraceCheckUtils]: 13: Hoare triple {3159#true} assume ~send3~0 == ~id3~0; {3159#true} is VALID [2022-02-20 18:30:06,818 INFO L290 TraceCheckUtils]: 14: Hoare triple {3159#true} assume 0 == ~mode3~0 % 256; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,818 INFO L290 TraceCheckUtils]: 15: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,820 INFO L290 TraceCheckUtils]: 19: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,821 INFO L290 TraceCheckUtils]: 23: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,822 INFO L290 TraceCheckUtils]: 25: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,823 INFO L290 TraceCheckUtils]: 27: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,823 INFO L290 TraceCheckUtils]: 28: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,823 INFO L290 TraceCheckUtils]: 29: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,824 INFO L290 TraceCheckUtils]: 30: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,824 INFO L290 TraceCheckUtils]: 31: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,824 INFO L290 TraceCheckUtils]: 32: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,825 INFO L290 TraceCheckUtils]: 33: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,825 INFO L290 TraceCheckUtils]: 34: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,826 INFO L290 TraceCheckUtils]: 35: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,826 INFO L290 TraceCheckUtils]: 36: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,826 INFO L290 TraceCheckUtils]: 37: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,827 INFO L290 TraceCheckUtils]: 38: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,827 INFO L290 TraceCheckUtils]: 39: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,827 INFO L290 TraceCheckUtils]: 40: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,828 INFO L290 TraceCheckUtils]: 41: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,828 INFO L290 TraceCheckUtils]: 42: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,828 INFO L290 TraceCheckUtils]: 43: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,829 INFO L290 TraceCheckUtils]: 44: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,829 INFO L290 TraceCheckUtils]: 45: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,830 INFO L290 TraceCheckUtils]: 46: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,830 INFO L290 TraceCheckUtils]: 47: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,830 INFO L290 TraceCheckUtils]: 48: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,831 INFO L290 TraceCheckUtils]: 49: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,831 INFO L290 TraceCheckUtils]: 50: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,831 INFO L290 TraceCheckUtils]: 51: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,832 INFO L290 TraceCheckUtils]: 52: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,832 INFO L290 TraceCheckUtils]: 53: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,833 INFO L290 TraceCheckUtils]: 54: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 18:30:06,833 INFO L290 TraceCheckUtils]: 55: Hoare triple {3161#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {3160#false} is VALID [2022-02-20 18:30:06,833 INFO L290 TraceCheckUtils]: 56: Hoare triple {3160#false} assume !(node3_~m3~0#1 != ~nomsg~0); {3160#false} is VALID [2022-02-20 18:30:06,834 INFO L290 TraceCheckUtils]: 57: Hoare triple {3160#false} ~mode3~0 := 0; {3160#false} is VALID [2022-02-20 18:30:06,834 INFO L290 TraceCheckUtils]: 58: Hoare triple {3160#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {3160#false} is VALID [2022-02-20 18:30:06,834 INFO L290 TraceCheckUtils]: 59: Hoare triple {3160#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {3160#false} is VALID [2022-02-20 18:30:06,834 INFO L290 TraceCheckUtils]: 60: Hoare triple {3160#false} assume !(node4_~m4~0#1 != ~nomsg~0); {3160#false} is VALID [2022-02-20 18:30:06,834 INFO L290 TraceCheckUtils]: 61: Hoare triple {3160#false} ~mode4~0 := 0; {3160#false} is VALID [2022-02-20 18:30:06,834 INFO L290 TraceCheckUtils]: 62: Hoare triple {3160#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {3160#false} is VALID [2022-02-20 18:30:06,834 INFO L290 TraceCheckUtils]: 63: Hoare triple {3160#false} assume !(0 != ~mode5~0 % 256); {3160#false} is VALID [2022-02-20 18:30:06,834 INFO L290 TraceCheckUtils]: 64: Hoare triple {3160#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {3160#false} is VALID [2022-02-20 18:30:06,835 INFO L290 TraceCheckUtils]: 65: Hoare triple {3160#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {3160#false} is VALID [2022-02-20 18:30:06,835 INFO L290 TraceCheckUtils]: 66: Hoare triple {3160#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {3160#false} is VALID [2022-02-20 18:30:06,835 INFO L290 TraceCheckUtils]: 67: Hoare triple {3160#false} assume !(0 != ~mode6~0 % 256); {3160#false} is VALID [2022-02-20 18:30:06,835 INFO L290 TraceCheckUtils]: 68: Hoare triple {3160#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {3160#false} is VALID [2022-02-20 18:30:06,835 INFO L290 TraceCheckUtils]: 69: Hoare triple {3160#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {3160#false} is VALID [2022-02-20 18:30:06,835 INFO L290 TraceCheckUtils]: 70: Hoare triple {3160#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3160#false} is VALID [2022-02-20 18:30:06,835 INFO L290 TraceCheckUtils]: 71: Hoare triple {3160#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {3160#false} is VALID [2022-02-20 18:30:06,835 INFO L290 TraceCheckUtils]: 72: Hoare triple {3160#false} check_#res#1 := check_~tmp~1#1; {3160#false} is VALID [2022-02-20 18:30:06,836 INFO L290 TraceCheckUtils]: 73: Hoare triple {3160#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {3160#false} is VALID [2022-02-20 18:30:06,836 INFO L290 TraceCheckUtils]: 74: Hoare triple {3160#false} assume 0 == assert_~arg#1 % 256; {3160#false} is VALID [2022-02-20 18:30:06,836 INFO L290 TraceCheckUtils]: 75: Hoare triple {3160#false} assume !false; {3160#false} is VALID [2022-02-20 18:30:06,836 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:30:06,836 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:06,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795139480] [2022-02-20 18:30:06,837 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795139480] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:06,837 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:06,837 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:06,837 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823953478] [2022-02-20 18:30:06,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:06,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2022-02-20 18:30:06,838 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:06,838 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:30:06,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:06,889 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:06,889 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:06,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:06,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:06,890 INFO L87 Difference]: Start difference. First operand 256 states and 379 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:30:07,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:07,078 INFO L93 Difference]: Finished difference Result 652 states and 1005 transitions. [2022-02-20 18:30:07,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:07,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2022-02-20 18:30:07,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:07,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:30:07,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:30:07,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:30:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:30:07,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 321 transitions. [2022-02-20 18:30:07,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:07,301 INFO L225 Difference]: With dead ends: 652 [2022-02-20 18:30:07,301 INFO L226 Difference]: Without dead ends: 442 [2022-02-20 18:30:07,301 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:30:07,302 INFO L933 BasicCegarLoop]: 212 mSDtfsCounter, 77 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:07,302 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 313 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:07,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-02-20 18:30:07,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 440. [2022-02-20 18:30:07,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:07,317 INFO L82 GeneralOperation]: Start isEquivalent. First operand 442 states. Second operand has 440 states, 439 states have (on average 1.5193621867881548) internal successors, (667), 439 states have internal predecessors, (667), 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:30:07,318 INFO L74 IsIncluded]: Start isIncluded. First operand 442 states. Second operand has 440 states, 439 states have (on average 1.5193621867881548) internal successors, (667), 439 states have internal predecessors, (667), 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:30:07,318 INFO L87 Difference]: Start difference. First operand 442 states. Second operand has 440 states, 439 states have (on average 1.5193621867881548) internal successors, (667), 439 states have internal predecessors, (667), 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:30:07,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:07,329 INFO L93 Difference]: Finished difference Result 442 states and 668 transitions. [2022-02-20 18:30:07,329 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 668 transitions. [2022-02-20 18:30:07,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:07,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:07,330 INFO L74 IsIncluded]: Start isIncluded. First operand has 440 states, 439 states have (on average 1.5193621867881548) internal successors, (667), 439 states have internal predecessors, (667), 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 442 states. [2022-02-20 18:30:07,331 INFO L87 Difference]: Start difference. First operand has 440 states, 439 states have (on average 1.5193621867881548) internal successors, (667), 439 states have internal predecessors, (667), 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 442 states. [2022-02-20 18:30:07,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:07,341 INFO L93 Difference]: Finished difference Result 442 states and 668 transitions. [2022-02-20 18:30:07,342 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 668 transitions. [2022-02-20 18:30:07,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:07,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:07,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:07,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:07,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 439 states have (on average 1.5193621867881548) internal successors, (667), 439 states have internal predecessors, (667), 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:30:07,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 667 transitions. [2022-02-20 18:30:07,353 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 667 transitions. Word has length 76 [2022-02-20 18:30:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:07,353 INFO L470 AbstractCegarLoop]: Abstraction has 440 states and 667 transitions. [2022-02-20 18:30:07,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:30:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 667 transitions. [2022-02-20 18:30:07,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:30:07,354 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:07,354 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] [2022-02-20 18:30:07,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 18:30:07,355 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:07,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:07,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1985695763, now seen corresponding path program 1 times [2022-02-20 18:30:07,355 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:07,355 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457210782] [2022-02-20 18:30:07,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:07,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:07,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:07,414 INFO L290 TraceCheckUtils]: 0: Hoare triple {5322#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {5322#true} is VALID [2022-02-20 18:30:07,415 INFO L290 TraceCheckUtils]: 1: Hoare triple {5322#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~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;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5322#true} is VALID [2022-02-20 18:30:07,415 INFO L290 TraceCheckUtils]: 2: Hoare triple {5322#true} assume 0 == ~r1~0; {5322#true} is VALID [2022-02-20 18:30:07,415 INFO L290 TraceCheckUtils]: 3: Hoare triple {5322#true} assume ~id1~0 >= 0; {5322#true} is VALID [2022-02-20 18:30:07,415 INFO L290 TraceCheckUtils]: 4: Hoare triple {5322#true} assume 0 == ~st1~0; {5322#true} is VALID [2022-02-20 18:30:07,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {5322#true} assume ~send1~0 == ~id1~0; {5322#true} is VALID [2022-02-20 18:30:07,415 INFO L290 TraceCheckUtils]: 6: Hoare triple {5322#true} assume 0 == ~mode1~0 % 256; {5322#true} is VALID [2022-02-20 18:30:07,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {5322#true} assume ~id2~0 >= 0; {5322#true} is VALID [2022-02-20 18:30:07,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {5322#true} assume 0 == ~st2~0; {5322#true} is VALID [2022-02-20 18:30:07,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {5322#true} assume ~send2~0 == ~id2~0; {5322#true} is VALID [2022-02-20 18:30:07,416 INFO L290 TraceCheckUtils]: 10: Hoare triple {5322#true} assume 0 == ~mode2~0 % 256; {5322#true} is VALID [2022-02-20 18:30:07,416 INFO L290 TraceCheckUtils]: 11: Hoare triple {5322#true} assume ~id3~0 >= 0; {5322#true} is VALID [2022-02-20 18:30:07,416 INFO L290 TraceCheckUtils]: 12: Hoare triple {5322#true} assume 0 == ~st3~0; {5322#true} is VALID [2022-02-20 18:30:07,416 INFO L290 TraceCheckUtils]: 13: Hoare triple {5322#true} assume ~send3~0 == ~id3~0; {5322#true} is VALID [2022-02-20 18:30:07,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {5322#true} assume 0 == ~mode3~0 % 256; {5322#true} is VALID [2022-02-20 18:30:07,417 INFO L290 TraceCheckUtils]: 15: Hoare triple {5322#true} assume ~id4~0 >= 0; {5322#true} is VALID [2022-02-20 18:30:07,417 INFO L290 TraceCheckUtils]: 16: Hoare triple {5322#true} assume 0 == ~st4~0; {5322#true} is VALID [2022-02-20 18:30:07,417 INFO L290 TraceCheckUtils]: 17: Hoare triple {5322#true} assume ~send4~0 == ~id4~0; {5322#true} is VALID [2022-02-20 18:30:07,417 INFO L290 TraceCheckUtils]: 18: Hoare triple {5322#true} assume 0 == ~mode4~0 % 256; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,418 INFO L290 TraceCheckUtils]: 21: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,419 INFO L290 TraceCheckUtils]: 22: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,419 INFO L290 TraceCheckUtils]: 23: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,419 INFO L290 TraceCheckUtils]: 24: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,420 INFO L290 TraceCheckUtils]: 25: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,420 INFO L290 TraceCheckUtils]: 26: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,420 INFO L290 TraceCheckUtils]: 27: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,421 INFO L290 TraceCheckUtils]: 28: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,421 INFO L290 TraceCheckUtils]: 29: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,422 INFO L290 TraceCheckUtils]: 30: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,422 INFO L290 TraceCheckUtils]: 31: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,422 INFO L290 TraceCheckUtils]: 32: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,423 INFO L290 TraceCheckUtils]: 33: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,423 INFO L290 TraceCheckUtils]: 34: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,423 INFO L290 TraceCheckUtils]: 35: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,424 INFO L290 TraceCheckUtils]: 36: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,424 INFO L290 TraceCheckUtils]: 37: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,424 INFO L290 TraceCheckUtils]: 38: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,425 INFO L290 TraceCheckUtils]: 39: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,425 INFO L290 TraceCheckUtils]: 40: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,425 INFO L290 TraceCheckUtils]: 41: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,426 INFO L290 TraceCheckUtils]: 42: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,426 INFO L290 TraceCheckUtils]: 43: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,427 INFO L290 TraceCheckUtils]: 44: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,427 INFO L290 TraceCheckUtils]: 45: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,427 INFO L290 TraceCheckUtils]: 46: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,428 INFO L290 TraceCheckUtils]: 47: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,428 INFO L290 TraceCheckUtils]: 48: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,429 INFO L290 TraceCheckUtils]: 49: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,429 INFO L290 TraceCheckUtils]: 50: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,429 INFO L290 TraceCheckUtils]: 51: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,430 INFO L290 TraceCheckUtils]: 52: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,431 INFO L290 TraceCheckUtils]: 53: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,431 INFO L290 TraceCheckUtils]: 54: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,431 INFO L290 TraceCheckUtils]: 55: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,432 INFO L290 TraceCheckUtils]: 56: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,432 INFO L290 TraceCheckUtils]: 57: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,433 INFO L290 TraceCheckUtils]: 58: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 18:30:07,433 INFO L290 TraceCheckUtils]: 59: Hoare triple {5324#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5323#false} is VALID [2022-02-20 18:30:07,433 INFO L290 TraceCheckUtils]: 60: Hoare triple {5323#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5323#false} is VALID [2022-02-20 18:30:07,433 INFO L290 TraceCheckUtils]: 61: Hoare triple {5323#false} ~mode4~0 := 0; {5323#false} is VALID [2022-02-20 18:30:07,434 INFO L290 TraceCheckUtils]: 62: Hoare triple {5323#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {5323#false} is VALID [2022-02-20 18:30:07,434 INFO L290 TraceCheckUtils]: 63: Hoare triple {5323#false} assume !(0 != ~mode5~0 % 256); {5323#false} is VALID [2022-02-20 18:30:07,434 INFO L290 TraceCheckUtils]: 64: Hoare triple {5323#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {5323#false} is VALID [2022-02-20 18:30:07,434 INFO L290 TraceCheckUtils]: 65: Hoare triple {5323#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {5323#false} is VALID [2022-02-20 18:30:07,434 INFO L290 TraceCheckUtils]: 66: Hoare triple {5323#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {5323#false} is VALID [2022-02-20 18:30:07,434 INFO L290 TraceCheckUtils]: 67: Hoare triple {5323#false} assume !(0 != ~mode6~0 % 256); {5323#false} is VALID [2022-02-20 18:30:07,434 INFO L290 TraceCheckUtils]: 68: Hoare triple {5323#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {5323#false} is VALID [2022-02-20 18:30:07,434 INFO L290 TraceCheckUtils]: 69: Hoare triple {5323#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {5323#false} is VALID [2022-02-20 18:30:07,435 INFO L290 TraceCheckUtils]: 70: Hoare triple {5323#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5323#false} is VALID [2022-02-20 18:30:07,435 INFO L290 TraceCheckUtils]: 71: Hoare triple {5323#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {5323#false} is VALID [2022-02-20 18:30:07,435 INFO L290 TraceCheckUtils]: 72: Hoare triple {5323#false} check_#res#1 := check_~tmp~1#1; {5323#false} is VALID [2022-02-20 18:30:07,435 INFO L290 TraceCheckUtils]: 73: Hoare triple {5323#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {5323#false} is VALID [2022-02-20 18:30:07,435 INFO L290 TraceCheckUtils]: 74: Hoare triple {5323#false} assume 0 == assert_~arg#1 % 256; {5323#false} is VALID [2022-02-20 18:30:07,435 INFO L290 TraceCheckUtils]: 75: Hoare triple {5323#false} assume !false; {5323#false} is VALID [2022-02-20 18:30:07,436 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:30:07,436 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:07,436 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457210782] [2022-02-20 18:30:07,436 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457210782] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:07,436 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:07,436 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:07,437 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271524224] [2022-02-20 18:30:07,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:07,437 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2022-02-20 18:30:07,437 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:07,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:30:07,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:07,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:07,492 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:07,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:07,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:07,492 INFO L87 Difference]: Start difference. First operand 440 states and 667 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:30:07,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:07,713 INFO L93 Difference]: Finished difference Result 1180 states and 1829 transitions. [2022-02-20 18:30:07,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:07,714 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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 76 [2022-02-20 18:30:07,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:30:07,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:30:07,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:30:07,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:30:07,719 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 321 transitions. [2022-02-20 18:30:07,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:07,944 INFO L225 Difference]: With dead ends: 1180 [2022-02-20 18:30:07,944 INFO L226 Difference]: Without dead ends: 786 [2022-02-20 18:30:07,945 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:30:07,945 INFO L933 BasicCegarLoop]: 207 mSDtfsCounter, 73 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:07,946 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 312 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:07,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2022-02-20 18:30:07,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 784. [2022-02-20 18:30:07,983 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:07,984 INFO L82 GeneralOperation]: Start isEquivalent. First operand 786 states. Second operand has 784 states, 783 states have (on average 1.5312899106002553) internal successors, (1199), 783 states have internal predecessors, (1199), 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:30:07,986 INFO L74 IsIncluded]: Start isIncluded. First operand 786 states. Second operand has 784 states, 783 states have (on average 1.5312899106002553) internal successors, (1199), 783 states have internal predecessors, (1199), 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:30:07,987 INFO L87 Difference]: Start difference. First operand 786 states. Second operand has 784 states, 783 states have (on average 1.5312899106002553) internal successors, (1199), 783 states have internal predecessors, (1199), 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:30:08,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:08,012 INFO L93 Difference]: Finished difference Result 786 states and 1200 transitions. [2022-02-20 18:30:08,012 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1200 transitions. [2022-02-20 18:30:08,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:08,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:08,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 784 states, 783 states have (on average 1.5312899106002553) internal successors, (1199), 783 states have internal predecessors, (1199), 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 786 states. [2022-02-20 18:30:08,016 INFO L87 Difference]: Start difference. First operand has 784 states, 783 states have (on average 1.5312899106002553) internal successors, (1199), 783 states have internal predecessors, (1199), 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 786 states. [2022-02-20 18:30:08,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:08,040 INFO L93 Difference]: Finished difference Result 786 states and 1200 transitions. [2022-02-20 18:30:08,040 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1200 transitions. [2022-02-20 18:30:08,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:08,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:08,041 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:08,041 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 784 states, 783 states have (on average 1.5312899106002553) internal successors, (1199), 783 states have internal predecessors, (1199), 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:30:08,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 784 states to 784 states and 1199 transitions. [2022-02-20 18:30:08,067 INFO L78 Accepts]: Start accepts. Automaton has 784 states and 1199 transitions. Word has length 76 [2022-02-20 18:30:08,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:08,068 INFO L470 AbstractCegarLoop]: Abstraction has 784 states and 1199 transitions. [2022-02-20 18:30:08,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 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:30:08,068 INFO L276 IsEmpty]: Start isEmpty. Operand 784 states and 1199 transitions. [2022-02-20 18:30:08,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2022-02-20 18:30:08,068 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:08,068 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] [2022-02-20 18:30:08,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 18:30:08,069 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:08,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:08,069 INFO L85 PathProgramCache]: Analyzing trace with hash 714986851, now seen corresponding path program 1 times [2022-02-20 18:30:08,069 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:08,069 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782079452] [2022-02-20 18:30:08,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:08,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:08,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:08,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {9225#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {9225#true} is VALID [2022-02-20 18:30:08,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {9225#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~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;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {9225#true} is VALID [2022-02-20 18:30:08,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {9225#true} assume 0 == ~r1~0; {9225#true} is VALID [2022-02-20 18:30:08,174 INFO L290 TraceCheckUtils]: 3: Hoare triple {9225#true} assume ~id1~0 >= 0; {9225#true} is VALID [2022-02-20 18:30:08,175 INFO L290 TraceCheckUtils]: 4: Hoare triple {9225#true} assume 0 == ~st1~0; {9227#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:08,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {9227#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {9227#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:08,178 INFO L290 TraceCheckUtils]: 6: Hoare triple {9227#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {9227#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:08,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {9227#(<= ~st1~0 0)} assume ~id2~0 >= 0; {9227#(<= ~st1~0 0)} is VALID [2022-02-20 18:30:08,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {9227#(<= ~st1~0 0)} assume 0 == ~st2~0; {9228#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:08,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {9228#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {9228#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:08,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {9228#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {9228#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:08,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {9228#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {9228#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:08,180 INFO L290 TraceCheckUtils]: 12: Hoare triple {9228#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {9229#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:08,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {9229#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {9229#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:08,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {9229#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {9229#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:08,181 INFO L290 TraceCheckUtils]: 15: Hoare triple {9229#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {9229#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:08,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {9229#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {9230#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:08,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {9230#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {9230#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:08,181 INFO L290 TraceCheckUtils]: 18: Hoare triple {9230#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {9230#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:08,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {9230#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {9230#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:08,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {9230#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {9231#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:08,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {9231#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {9231#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:08,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {9231#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {9231#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:08,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {9231#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {9231#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 18:30:08,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {9231#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,184 INFO L290 TraceCheckUtils]: 25: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,185 INFO L290 TraceCheckUtils]: 28: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,185 INFO L290 TraceCheckUtils]: 30: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,186 INFO L290 TraceCheckUtils]: 31: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,186 INFO L290 TraceCheckUtils]: 32: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,187 INFO L290 TraceCheckUtils]: 33: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,187 INFO L290 TraceCheckUtils]: 34: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,187 INFO L290 TraceCheckUtils]: 35: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,189 INFO L290 TraceCheckUtils]: 39: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,189 INFO L290 TraceCheckUtils]: 40: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,189 INFO L290 TraceCheckUtils]: 41: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,190 INFO L290 TraceCheckUtils]: 42: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,190 INFO L290 TraceCheckUtils]: 43: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,191 INFO L290 TraceCheckUtils]: 44: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,191 INFO L290 TraceCheckUtils]: 45: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,192 INFO L290 TraceCheckUtils]: 46: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,192 INFO L290 TraceCheckUtils]: 47: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,192 INFO L290 TraceCheckUtils]: 48: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,193 INFO L290 TraceCheckUtils]: 49: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,193 INFO L290 TraceCheckUtils]: 50: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,193 INFO L290 TraceCheckUtils]: 51: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,194 INFO L290 TraceCheckUtils]: 52: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,194 INFO L290 TraceCheckUtils]: 53: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,195 INFO L290 TraceCheckUtils]: 54: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,195 INFO L290 TraceCheckUtils]: 55: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,196 INFO L290 TraceCheckUtils]: 56: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,196 INFO L290 TraceCheckUtils]: 57: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,197 INFO L290 TraceCheckUtils]: 58: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,198 INFO L290 TraceCheckUtils]: 59: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,198 INFO L290 TraceCheckUtils]: 60: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,199 INFO L290 TraceCheckUtils]: 61: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,199 INFO L290 TraceCheckUtils]: 62: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,199 INFO L290 TraceCheckUtils]: 63: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,200 INFO L290 TraceCheckUtils]: 64: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,200 INFO L290 TraceCheckUtils]: 65: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,200 INFO L290 TraceCheckUtils]: 66: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,201 INFO L290 TraceCheckUtils]: 67: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,201 INFO L290 TraceCheckUtils]: 68: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,201 INFO L290 TraceCheckUtils]: 69: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,202 INFO L290 TraceCheckUtils]: 70: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 18:30:08,202 INFO L290 TraceCheckUtils]: 71: Hoare triple {9232#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {9226#false} is VALID [2022-02-20 18:30:08,202 INFO L290 TraceCheckUtils]: 72: Hoare triple {9226#false} check_#res#1 := check_~tmp~1#1; {9226#false} is VALID [2022-02-20 18:30:08,202 INFO L290 TraceCheckUtils]: 73: Hoare triple {9226#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {9226#false} is VALID [2022-02-20 18:30:08,203 INFO L290 TraceCheckUtils]: 74: Hoare triple {9226#false} assume 0 == assert_~arg#1 % 256; {9226#false} is VALID [2022-02-20 18:30:08,203 INFO L290 TraceCheckUtils]: 75: Hoare triple {9226#false} assume !false; {9226#false} is VALID [2022-02-20 18:30:08,203 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:30:08,203 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:08,203 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782079452] [2022-02-20 18:30:08,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782079452] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:08,203 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:08,204 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:30:08,204 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602695694] [2022-02-20 18:30:08,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:08,204 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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 76 [2022-02-20 18:30:08,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:08,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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:30:08,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:08,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:30:08,251 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:08,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:30:08,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:30:08,252 INFO L87 Difference]: Start difference. First operand 784 states and 1199 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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:30:15,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:15,329 INFO L93 Difference]: Finished difference Result 9640 states and 15035 transitions. [2022-02-20 18:30:15,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 18:30:15,329 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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 76 [2022-02-20 18:30:15,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:15,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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:30:15,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1281 transitions. [2022-02-20 18:30:15,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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:30:15,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1281 transitions. [2022-02-20 18:30:15,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 1281 transitions. [2022-02-20 18:30:16,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1281 edges. 1281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:18,859 INFO L225 Difference]: With dead ends: 9640 [2022-02-20 18:30:18,859 INFO L226 Difference]: Without dead ends: 8902 [2022-02-20 18:30:18,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2022-02-20 18:30:18,862 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 2232 mSDsluCounter, 1105 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2232 SdHoareTripleChecker+Valid, 1240 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:18,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2232 Valid, 1240 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:30:18,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8902 states. [2022-02-20 18:30:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8902 to 1520. [2022-02-20 18:30:19,686 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:19,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8902 states. Second operand has 1520 states, 1519 states have (on average 1.5266622778143515) internal successors, (2319), 1519 states have internal predecessors, (2319), 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:30:19,690 INFO L74 IsIncluded]: Start isIncluded. First operand 8902 states. Second operand has 1520 states, 1519 states have (on average 1.5266622778143515) internal successors, (2319), 1519 states have internal predecessors, (2319), 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:30:19,692 INFO L87 Difference]: Start difference. First operand 8902 states. Second operand has 1520 states, 1519 states have (on average 1.5266622778143515) internal successors, (2319), 1519 states have internal predecessors, (2319), 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:30:22,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:22,188 INFO L93 Difference]: Finished difference Result 8902 states and 13690 transitions. [2022-02-20 18:30:22,188 INFO L276 IsEmpty]: Start isEmpty. Operand 8902 states and 13690 transitions. [2022-02-20 18:30:22,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:22,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:22,201 INFO L74 IsIncluded]: Start isIncluded. First operand has 1520 states, 1519 states have (on average 1.5266622778143515) internal successors, (2319), 1519 states have internal predecessors, (2319), 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 8902 states. [2022-02-20 18:30:22,203 INFO L87 Difference]: Start difference. First operand has 1520 states, 1519 states have (on average 1.5266622778143515) internal successors, (2319), 1519 states have internal predecessors, (2319), 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 8902 states. [2022-02-20 18:30:24,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:24,628 INFO L93 Difference]: Finished difference Result 8902 states and 13690 transitions. [2022-02-20 18:30:24,628 INFO L276 IsEmpty]: Start isEmpty. Operand 8902 states and 13690 transitions. [2022-02-20 18:30:24,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:24,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:24,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:24,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1520 states, 1519 states have (on average 1.5266622778143515) internal successors, (2319), 1519 states have internal predecessors, (2319), 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:30:24,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1520 states to 1520 states and 2319 transitions. [2022-02-20 18:30:24,719 INFO L78 Accepts]: Start accepts. Automaton has 1520 states and 2319 transitions. Word has length 76 [2022-02-20 18:30:24,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:24,719 INFO L470 AbstractCegarLoop]: Abstraction has 1520 states and 2319 transitions. [2022-02-20 18:30:24,719 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 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:30:24,719 INFO L276 IsEmpty]: Start isEmpty. Operand 1520 states and 2319 transitions. [2022-02-20 18:30:24,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:30:24,721 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:24,722 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] [2022-02-20 18:30:24,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 18:30:24,722 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:24,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:24,723 INFO L85 PathProgramCache]: Analyzing trace with hash -1508096525, now seen corresponding path program 1 times [2022-02-20 18:30:24,723 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:24,723 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448533866] [2022-02-20 18:30:24,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:24,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:24,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:24,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {40380#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {40380#true} is VALID [2022-02-20 18:30:24,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {40380#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~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;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {40380#true} is VALID [2022-02-20 18:30:24,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {40380#true} assume 0 == ~r1~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,803 INFO L290 TraceCheckUtils]: 3: Hoare triple {40382#(<= ~r1~0 0)} assume ~id1~0 >= 0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,803 INFO L290 TraceCheckUtils]: 4: Hoare triple {40382#(<= ~r1~0 0)} assume 0 == ~st1~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {40382#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {40382#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {40382#(<= ~r1~0 0)} assume ~id2~0 >= 0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {40382#(<= ~r1~0 0)} assume 0 == ~st2~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {40382#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,805 INFO L290 TraceCheckUtils]: 10: Hoare triple {40382#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,805 INFO L290 TraceCheckUtils]: 11: Hoare triple {40382#(<= ~r1~0 0)} assume ~id3~0 >= 0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {40382#(<= ~r1~0 0)} assume 0 == ~st3~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,806 INFO L290 TraceCheckUtils]: 13: Hoare triple {40382#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {40382#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {40382#(<= ~r1~0 0)} assume ~id4~0 >= 0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {40382#(<= ~r1~0 0)} assume 0 == ~st4~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {40382#(<= ~r1~0 0)} assume ~send4~0 == ~id4~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {40382#(<= ~r1~0 0)} assume 0 == ~mode4~0 % 256; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,807 INFO L290 TraceCheckUtils]: 19: Hoare triple {40382#(<= ~r1~0 0)} assume ~id5~0 >= 0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {40382#(<= ~r1~0 0)} assume 0 == ~st5~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {40382#(<= ~r1~0 0)} assume ~send5~0 == ~id5~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,808 INFO L290 TraceCheckUtils]: 22: Hoare triple {40382#(<= ~r1~0 0)} assume 0 == ~mode5~0 % 256; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,808 INFO L290 TraceCheckUtils]: 23: Hoare triple {40382#(<= ~r1~0 0)} assume ~id6~0 >= 0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {40382#(<= ~r1~0 0)} assume 0 == ~st6~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {40382#(<= ~r1~0 0)} assume ~send6~0 == ~id6~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {40382#(<= ~r1~0 0)} assume 0 == ~mode6~0 % 256; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,809 INFO L290 TraceCheckUtils]: 27: Hoare triple {40382#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,810 INFO L290 TraceCheckUtils]: 28: Hoare triple {40382#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,810 INFO L290 TraceCheckUtils]: 29: Hoare triple {40382#(<= ~r1~0 0)} assume ~id1~0 != ~id4~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {40382#(<= ~r1~0 0)} assume ~id1~0 != ~id5~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {40382#(<= ~r1~0 0)} assume ~id1~0 != ~id6~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {40382#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {40382#(<= ~r1~0 0)} assume ~id2~0 != ~id4~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {40382#(<= ~r1~0 0)} assume ~id2~0 != ~id5~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,812 INFO L290 TraceCheckUtils]: 35: Hoare triple {40382#(<= ~r1~0 0)} assume ~id2~0 != ~id6~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {40382#(<= ~r1~0 0)} assume ~id3~0 != ~id4~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,812 INFO L290 TraceCheckUtils]: 37: Hoare triple {40382#(<= ~r1~0 0)} assume ~id3~0 != ~id5~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,813 INFO L290 TraceCheckUtils]: 38: Hoare triple {40382#(<= ~r1~0 0)} assume ~id3~0 != ~id6~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,813 INFO L290 TraceCheckUtils]: 39: Hoare triple {40382#(<= ~r1~0 0)} assume ~id4~0 != ~id5~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,813 INFO L290 TraceCheckUtils]: 40: Hoare triple {40382#(<= ~r1~0 0)} assume ~id4~0 != ~id6~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,813 INFO L290 TraceCheckUtils]: 41: Hoare triple {40382#(<= ~r1~0 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,814 INFO L290 TraceCheckUtils]: 42: Hoare triple {40382#(<= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,814 INFO L290 TraceCheckUtils]: 43: Hoare triple {40382#(<= ~r1~0 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,815 INFO L290 TraceCheckUtils]: 44: Hoare triple {40382#(<= ~r1~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,817 INFO L290 TraceCheckUtils]: 45: Hoare triple {40382#(<= ~r1~0 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,818 INFO L290 TraceCheckUtils]: 46: Hoare triple {40382#(<= ~r1~0 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,818 INFO L290 TraceCheckUtils]: 47: Hoare triple {40382#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,819 INFO L290 TraceCheckUtils]: 48: Hoare triple {40382#(<= ~r1~0 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,819 INFO L290 TraceCheckUtils]: 49: Hoare triple {40382#(<= ~r1~0 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,820 INFO L290 TraceCheckUtils]: 50: Hoare triple {40382#(<= ~r1~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,822 INFO L290 TraceCheckUtils]: 51: Hoare triple {40382#(<= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,822 INFO L290 TraceCheckUtils]: 52: Hoare triple {40382#(<= ~r1~0 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,822 INFO L290 TraceCheckUtils]: 53: Hoare triple {40382#(<= ~r1~0 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,823 INFO L290 TraceCheckUtils]: 54: Hoare triple {40382#(<= ~r1~0 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,823 INFO L290 TraceCheckUtils]: 55: Hoare triple {40382#(<= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,823 INFO L290 TraceCheckUtils]: 56: Hoare triple {40382#(<= ~r1~0 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,823 INFO L290 TraceCheckUtils]: 57: Hoare triple {40382#(<= ~r1~0 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,824 INFO L290 TraceCheckUtils]: 58: Hoare triple {40382#(<= ~r1~0 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,824 INFO L290 TraceCheckUtils]: 59: Hoare triple {40382#(<= ~r1~0 0)} assume !(0 != ~mode4~0 % 256); {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,824 INFO L290 TraceCheckUtils]: 60: Hoare triple {40382#(<= ~r1~0 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,825 INFO L290 TraceCheckUtils]: 61: Hoare triple {40382#(<= ~r1~0 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,825 INFO L290 TraceCheckUtils]: 62: Hoare triple {40382#(<= ~r1~0 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,825 INFO L290 TraceCheckUtils]: 63: Hoare triple {40382#(<= ~r1~0 0)} assume !(0 != ~mode5~0 % 256); {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,825 INFO L290 TraceCheckUtils]: 64: Hoare triple {40382#(<= ~r1~0 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,826 INFO L290 TraceCheckUtils]: 65: Hoare triple {40382#(<= ~r1~0 0)} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,826 INFO L290 TraceCheckUtils]: 66: Hoare triple {40382#(<= ~r1~0 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,826 INFO L290 TraceCheckUtils]: 67: Hoare triple {40382#(<= ~r1~0 0)} assume !(0 != ~mode6~0 % 256); {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,827 INFO L290 TraceCheckUtils]: 68: Hoare triple {40382#(<= ~r1~0 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,827 INFO L290 TraceCheckUtils]: 69: Hoare triple {40382#(<= ~r1~0 0)} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,827 INFO L290 TraceCheckUtils]: 70: Hoare triple {40382#(<= ~r1~0 0)} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,828 INFO L290 TraceCheckUtils]: 71: Hoare triple {40382#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {40382#(<= ~r1~0 0)} is VALID [2022-02-20 18:30:24,828 INFO L290 TraceCheckUtils]: 72: Hoare triple {40382#(<= ~r1~0 0)} assume ~r1~0 >= 6; {40381#false} is VALID [2022-02-20 18:30:24,828 INFO L290 TraceCheckUtils]: 73: Hoare triple {40381#false} assume ~r1~0 < 6;check_~tmp~1#1 := 1; {40381#false} is VALID [2022-02-20 18:30:24,828 INFO L290 TraceCheckUtils]: 74: Hoare triple {40381#false} check_#res#1 := check_~tmp~1#1; {40381#false} is VALID [2022-02-20 18:30:24,829 INFO L290 TraceCheckUtils]: 75: Hoare triple {40381#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {40381#false} is VALID [2022-02-20 18:30:24,829 INFO L290 TraceCheckUtils]: 76: Hoare triple {40381#false} assume 0 == assert_~arg#1 % 256; {40381#false} is VALID [2022-02-20 18:30:24,829 INFO L290 TraceCheckUtils]: 77: Hoare triple {40381#false} assume !false; {40381#false} is VALID [2022-02-20 18:30:24,829 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:30:24,829 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:24,830 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448533866] [2022-02-20 18:30:24,830 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448533866] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:24,830 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:24,830 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:24,830 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177509319] [2022-02-20 18:30:24,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:24,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2022-02-20 18:30:24,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:24,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:30:24,873 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:24,874 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:24,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:24,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:24,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:24,875 INFO L87 Difference]: Start difference. First operand 1520 states and 2319 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:30:26,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:26,525 INFO L93 Difference]: Finished difference Result 3694 states and 5667 transitions. [2022-02-20 18:30:26,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:26,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2022-02-20 18:30:26,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:26,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:30:26,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2022-02-20 18:30:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:30:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2022-02-20 18:30:26,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 322 transitions. [2022-02-20 18:30:26,719 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 322 edges. 322 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:26,869 INFO L225 Difference]: With dead ends: 3694 [2022-02-20 18:30:26,870 INFO L226 Difference]: Without dead ends: 2220 [2022-02-20 18:30:26,876 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:30:26,877 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 57 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:26,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 252 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:26,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2022-02-20 18:30:28,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 2218. [2022-02-20 18:30:28,207 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:28,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2220 states. Second operand has 2218 states, 2217 states have (on average 1.5196211096075778) internal successors, (3369), 2217 states have internal predecessors, (3369), 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:30:28,221 INFO L74 IsIncluded]: Start isIncluded. First operand 2220 states. Second operand has 2218 states, 2217 states have (on average 1.5196211096075778) internal successors, (3369), 2217 states have internal predecessors, (3369), 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:30:28,224 INFO L87 Difference]: Start difference. First operand 2220 states. Second operand has 2218 states, 2217 states have (on average 1.5196211096075778) internal successors, (3369), 2217 states have internal predecessors, (3369), 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:30:28,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:28,387 INFO L93 Difference]: Finished difference Result 2220 states and 3370 transitions. [2022-02-20 18:30:28,387 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 3370 transitions. [2022-02-20 18:30:28,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:28,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:28,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 2218 states, 2217 states have (on average 1.5196211096075778) internal successors, (3369), 2217 states have internal predecessors, (3369), 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 2220 states. [2022-02-20 18:30:28,395 INFO L87 Difference]: Start difference. First operand has 2218 states, 2217 states have (on average 1.5196211096075778) internal successors, (3369), 2217 states have internal predecessors, (3369), 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 2220 states. [2022-02-20 18:30:28,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:28,552 INFO L93 Difference]: Finished difference Result 2220 states and 3370 transitions. [2022-02-20 18:30:28,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 3370 transitions. [2022-02-20 18:30:28,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:28,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:28,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:28,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:28,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2218 states, 2217 states have (on average 1.5196211096075778) internal successors, (3369), 2217 states have internal predecessors, (3369), 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:30:28,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 3369 transitions. [2022-02-20 18:30:28,740 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 3369 transitions. Word has length 78 [2022-02-20 18:30:28,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:28,741 INFO L470 AbstractCegarLoop]: Abstraction has 2218 states and 3369 transitions. [2022-02-20 18:30:28,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:30:28,741 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 3369 transitions. [2022-02-20 18:30:28,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:30:28,742 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:28,742 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] [2022-02-20 18:30:28,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 18:30:28,742 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:28,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:28,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1441603013, now seen corresponding path program 1 times [2022-02-20 18:30:28,743 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:28,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517987108] [2022-02-20 18:30:28,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:28,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:28,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:28,966 INFO L290 TraceCheckUtils]: 0: Hoare triple {51877#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {51877#true} is VALID [2022-02-20 18:30:28,966 INFO L290 TraceCheckUtils]: 1: Hoare triple {51877#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~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;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {51877#true} is VALID [2022-02-20 18:30:28,966 INFO L290 TraceCheckUtils]: 2: Hoare triple {51877#true} assume 0 == ~r1~0; {51877#true} is VALID [2022-02-20 18:30:28,966 INFO L290 TraceCheckUtils]: 3: Hoare triple {51877#true} assume ~id1~0 >= 0; {51877#true} is VALID [2022-02-20 18:30:28,967 INFO L290 TraceCheckUtils]: 4: Hoare triple {51877#true} assume 0 == ~st1~0; {51879#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:28,967 INFO L290 TraceCheckUtils]: 5: Hoare triple {51879#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~send1~0 == ~id1~0; {51879#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:28,968 INFO L290 TraceCheckUtils]: 6: Hoare triple {51879#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~mode1~0 % 256; {51879#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:28,968 INFO L290 TraceCheckUtils]: 7: Hoare triple {51879#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~id2~0 >= 0; {51879#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:28,969 INFO L290 TraceCheckUtils]: 8: Hoare triple {51879#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~st2~0; {51880#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:28,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {51880#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~send2~0 == ~id2~0; {51880#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:28,970 INFO L290 TraceCheckUtils]: 10: Hoare triple {51880#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~mode2~0 % 256; {51880#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:28,970 INFO L290 TraceCheckUtils]: 11: Hoare triple {51880#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~id3~0 >= 0; {51880#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:28,971 INFO L290 TraceCheckUtils]: 12: Hoare triple {51880#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st2~0 ~st1~0))) (or (<= (+ ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~st3~0; {51881#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:30:28,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {51881#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} assume ~send3~0 == ~id3~0; {51881#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:30:28,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {51881#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} assume 0 == ~mode3~0 % 256; {51881#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:30:28,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {51881#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} assume ~id4~0 >= 0; {51881#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} is VALID [2022-02-20 18:30:28,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {51881#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)) (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st3~0 ~st2~0 ~st1~0))))} assume 0 == ~st4~0; {51882#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:28,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {51882#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~send4~0 == ~id4~0; {51882#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:28,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {51882#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~mode4~0 % 256; {51882#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:28,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {51882#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~id5~0 >= 0; {51882#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:28,975 INFO L290 TraceCheckUtils]: 20: Hoare triple {51882#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~st5~0; {51883#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:28,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {51883#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~send5~0 == ~id5~0; {51883#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:28,976 INFO L290 TraceCheckUtils]: 22: Hoare triple {51883#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~mode5~0 % 256; {51883#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:28,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {51883#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume ~id6~0 >= 0; {51883#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} is VALID [2022-02-20 18:30:28,977 INFO L290 TraceCheckUtils]: 24: Hoare triple {51883#(and (or (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0))) (or (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)))} assume 0 == ~st6~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send6~0 == ~id6~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,978 INFO L290 TraceCheckUtils]: 26: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume 0 == ~mode6~0 % 256; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,978 INFO L290 TraceCheckUtils]: 27: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id2~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,979 INFO L290 TraceCheckUtils]: 28: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id3~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,979 INFO L290 TraceCheckUtils]: 29: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id4~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id5~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id1~0 != ~id6~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,980 INFO L290 TraceCheckUtils]: 32: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id2~0 != ~id3~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,981 INFO L290 TraceCheckUtils]: 33: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id2~0 != ~id4~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,981 INFO L290 TraceCheckUtils]: 34: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id2~0 != ~id5~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id2~0 != ~id6~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,982 INFO L290 TraceCheckUtils]: 36: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id3~0 != ~id4~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id3~0 != ~id5~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id3~0 != ~id6~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,983 INFO L290 TraceCheckUtils]: 39: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id4~0 != ~id5~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id4~0 != ~id6~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,984 INFO L290 TraceCheckUtils]: 41: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} init_#res#1 := init_~tmp~0#1; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,985 INFO L290 TraceCheckUtils]: 43: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 == assume_abort_if_not_~cond#1); {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,986 INFO L290 TraceCheckUtils]: 45: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,986 INFO L290 TraceCheckUtils]: 46: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,987 INFO L290 TraceCheckUtils]: 47: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode1~0 % 256); {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,987 INFO L290 TraceCheckUtils]: 48: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,988 INFO L290 TraceCheckUtils]: 49: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,988 INFO L290 TraceCheckUtils]: 50: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,989 INFO L290 TraceCheckUtils]: 51: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode2~0 % 256); {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,989 INFO L290 TraceCheckUtils]: 52: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,990 INFO L290 TraceCheckUtils]: 53: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,990 INFO L290 TraceCheckUtils]: 54: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,990 INFO L290 TraceCheckUtils]: 55: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode3~0 % 256); {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,991 INFO L290 TraceCheckUtils]: 56: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,991 INFO L290 TraceCheckUtils]: 57: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,992 INFO L290 TraceCheckUtils]: 58: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,992 INFO L290 TraceCheckUtils]: 59: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode4~0 % 256); {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,993 INFO L290 TraceCheckUtils]: 60: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,993 INFO L290 TraceCheckUtils]: 61: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,994 INFO L290 TraceCheckUtils]: 62: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,994 INFO L290 TraceCheckUtils]: 63: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode5~0 % 256); {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,994 INFO L290 TraceCheckUtils]: 64: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,995 INFO L290 TraceCheckUtils]: 65: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,995 INFO L290 TraceCheckUtils]: 66: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,996 INFO L290 TraceCheckUtils]: 67: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 != ~mode6~0 % 256); {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,996 INFO L290 TraceCheckUtils]: 68: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,997 INFO L290 TraceCheckUtils]: 69: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,997 INFO L290 TraceCheckUtils]: 70: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,998 INFO L290 TraceCheckUtils]: 71: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,998 INFO L290 TraceCheckUtils]: 72: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(~r1~0 >= 6); {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} is VALID [2022-02-20 18:30:28,999 INFO L290 TraceCheckUtils]: 73: Hoare triple {51884#(and (< 0 (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0 1)) (<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0);check_~tmp~1#1 := 0; {51878#false} is VALID [2022-02-20 18:30:28,999 INFO L290 TraceCheckUtils]: 74: Hoare triple {51878#false} check_#res#1 := check_~tmp~1#1; {51878#false} is VALID [2022-02-20 18:30:28,999 INFO L290 TraceCheckUtils]: 75: Hoare triple {51878#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {51878#false} is VALID [2022-02-20 18:30:28,999 INFO L290 TraceCheckUtils]: 76: Hoare triple {51878#false} assume 0 == assert_~arg#1 % 256; {51878#false} is VALID [2022-02-20 18:30:28,999 INFO L290 TraceCheckUtils]: 77: Hoare triple {51878#false} assume !false; {51878#false} is VALID [2022-02-20 18:30:29,000 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:30:29,000 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:29,000 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517987108] [2022-02-20 18:30:29,000 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517987108] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:29,000 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:29,000 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 18:30:29,001 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500977088] [2022-02-20 18:30:29,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:29,001 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 78 [2022-02-20 18:30:29,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:29,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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:30:29,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:29,064 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 18:30:29,064 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:29,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 18:30:29,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 18:30:29,065 INFO L87 Difference]: Start difference. First operand 2218 states and 3369 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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:30:31,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:31,746 INFO L93 Difference]: Finished difference Result 4390 states and 6691 transitions. [2022-02-20 18:30:31,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 18:30:31,747 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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 78 [2022-02-20 18:30:31,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:31,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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:30:31,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 329 transitions. [2022-02-20 18:30:31,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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:30:31,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 329 transitions. [2022-02-20 18:30:31,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 329 transitions. [2022-02-20 18:30:31,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 329 edges. 329 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:32,120 INFO L225 Difference]: With dead ends: 4390 [2022-02-20 18:30:32,120 INFO L226 Difference]: Without dead ends: 2220 [2022-02-20 18:30:32,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-02-20 18:30:32,123 INFO L933 BasicCegarLoop]: 174 mSDtfsCounter, 639 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 639 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:32,123 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [639 Valid, 632 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 18:30:32,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2220 states. [2022-02-20 18:30:33,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2220 to 2218. [2022-02-20 18:30:33,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:33,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2220 states. Second operand has 2218 states, 2217 states have (on average 1.5087956698240865) internal successors, (3345), 2217 states have internal predecessors, (3345), 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:30:33,418 INFO L74 IsIncluded]: Start isIncluded. First operand 2220 states. Second operand has 2218 states, 2217 states have (on average 1.5087956698240865) internal successors, (3345), 2217 states have internal predecessors, (3345), 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:30:33,420 INFO L87 Difference]: Start difference. First operand 2220 states. Second operand has 2218 states, 2217 states have (on average 1.5087956698240865) internal successors, (3345), 2217 states have internal predecessors, (3345), 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:30:33,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:33,557 INFO L93 Difference]: Finished difference Result 2220 states and 3346 transitions. [2022-02-20 18:30:33,557 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 3346 transitions. [2022-02-20 18:30:33,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:33,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:33,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 2218 states, 2217 states have (on average 1.5087956698240865) internal successors, (3345), 2217 states have internal predecessors, (3345), 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 2220 states. [2022-02-20 18:30:33,562 INFO L87 Difference]: Start difference. First operand has 2218 states, 2217 states have (on average 1.5087956698240865) internal successors, (3345), 2217 states have internal predecessors, (3345), 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 2220 states. [2022-02-20 18:30:33,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:33,748 INFO L93 Difference]: Finished difference Result 2220 states and 3346 transitions. [2022-02-20 18:30:33,748 INFO L276 IsEmpty]: Start isEmpty. Operand 2220 states and 3346 transitions. [2022-02-20 18:30:33,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:33,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:33,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:33,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:33,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2218 states, 2217 states have (on average 1.5087956698240865) internal successors, (3345), 2217 states have internal predecessors, (3345), 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:30:33,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 3345 transitions. [2022-02-20 18:30:33,925 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 3345 transitions. Word has length 78 [2022-02-20 18:30:33,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:33,925 INFO L470 AbstractCegarLoop]: Abstraction has 2218 states and 3345 transitions. [2022-02-20 18:30:33,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 8 states have internal predecessors, (78), 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:30:33,925 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 3345 transitions. [2022-02-20 18:30:33,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:30:33,926 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:33,926 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] [2022-02-20 18:30:33,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 18:30:33,926 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:33,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:33,927 INFO L85 PathProgramCache]: Analyzing trace with hash 347311063, now seen corresponding path program 1 times [2022-02-20 18:30:33,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:33,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102807148] [2022-02-20 18:30:33,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:33,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:33,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {64219#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {64219#true} is VALID [2022-02-20 18:30:33,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {64219#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~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;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {64219#true} is VALID [2022-02-20 18:30:33,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {64219#true} assume 0 == ~r1~0; {64219#true} is VALID [2022-02-20 18:30:33,965 INFO L290 TraceCheckUtils]: 3: Hoare triple {64219#true} assume ~id1~0 >= 0; {64219#true} is VALID [2022-02-20 18:30:33,966 INFO L290 TraceCheckUtils]: 4: Hoare triple {64219#true} assume 0 == ~st1~0; {64219#true} is VALID [2022-02-20 18:30:33,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {64219#true} assume ~send1~0 == ~id1~0; {64219#true} is VALID [2022-02-20 18:30:33,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {64219#true} assume 0 == ~mode1~0 % 256; {64219#true} is VALID [2022-02-20 18:30:33,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {64219#true} assume ~id2~0 >= 0; {64219#true} is VALID [2022-02-20 18:30:33,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {64219#true} assume 0 == ~st2~0; {64219#true} is VALID [2022-02-20 18:30:33,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {64219#true} assume ~send2~0 == ~id2~0; {64219#true} is VALID [2022-02-20 18:30:33,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {64219#true} assume 0 == ~mode2~0 % 256; {64219#true} is VALID [2022-02-20 18:30:33,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {64219#true} assume ~id3~0 >= 0; {64219#true} is VALID [2022-02-20 18:30:33,966 INFO L290 TraceCheckUtils]: 12: Hoare triple {64219#true} assume 0 == ~st3~0; {64219#true} is VALID [2022-02-20 18:30:33,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {64219#true} assume ~send3~0 == ~id3~0; {64219#true} is VALID [2022-02-20 18:30:33,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {64219#true} assume 0 == ~mode3~0 % 256; {64219#true} is VALID [2022-02-20 18:30:33,967 INFO L290 TraceCheckUtils]: 15: Hoare triple {64219#true} assume ~id4~0 >= 0; {64219#true} is VALID [2022-02-20 18:30:33,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {64219#true} assume 0 == ~st4~0; {64219#true} is VALID [2022-02-20 18:30:33,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {64219#true} assume ~send4~0 == ~id4~0; {64219#true} is VALID [2022-02-20 18:30:33,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {64219#true} assume 0 == ~mode4~0 % 256; {64219#true} is VALID [2022-02-20 18:30:33,967 INFO L290 TraceCheckUtils]: 19: Hoare triple {64219#true} assume ~id5~0 >= 0; {64219#true} is VALID [2022-02-20 18:30:33,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {64219#true} assume 0 == ~st5~0; {64219#true} is VALID [2022-02-20 18:30:33,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {64219#true} assume ~send5~0 == ~id5~0; {64219#true} is VALID [2022-02-20 18:30:33,967 INFO L290 TraceCheckUtils]: 22: Hoare triple {64219#true} assume 0 == ~mode5~0 % 256; {64219#true} is VALID [2022-02-20 18:30:33,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {64219#true} assume ~id6~0 >= 0; {64219#true} is VALID [2022-02-20 18:30:33,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {64219#true} assume 0 == ~st6~0; {64219#true} is VALID [2022-02-20 18:30:33,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {64219#true} assume ~send6~0 == ~id6~0; {64219#true} is VALID [2022-02-20 18:30:33,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {64219#true} assume 0 == ~mode6~0 % 256; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,970 INFO L290 TraceCheckUtils]: 30: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,970 INFO L290 TraceCheckUtils]: 31: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,971 INFO L290 TraceCheckUtils]: 33: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,971 INFO L290 TraceCheckUtils]: 35: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,972 INFO L290 TraceCheckUtils]: 37: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,972 INFO L290 TraceCheckUtils]: 38: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,973 INFO L290 TraceCheckUtils]: 39: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,973 INFO L290 TraceCheckUtils]: 41: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,974 INFO L290 TraceCheckUtils]: 42: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,974 INFO L290 TraceCheckUtils]: 43: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,975 INFO L290 TraceCheckUtils]: 45: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,975 INFO L290 TraceCheckUtils]: 46: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,976 INFO L290 TraceCheckUtils]: 47: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,976 INFO L290 TraceCheckUtils]: 48: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,977 INFO L290 TraceCheckUtils]: 49: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,977 INFO L290 TraceCheckUtils]: 50: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,977 INFO L290 TraceCheckUtils]: 51: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,978 INFO L290 TraceCheckUtils]: 52: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,978 INFO L290 TraceCheckUtils]: 53: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,978 INFO L290 TraceCheckUtils]: 54: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,979 INFO L290 TraceCheckUtils]: 55: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,979 INFO L290 TraceCheckUtils]: 56: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,979 INFO L290 TraceCheckUtils]: 57: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,980 INFO L290 TraceCheckUtils]: 58: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,980 INFO L290 TraceCheckUtils]: 59: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,981 INFO L290 TraceCheckUtils]: 60: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,981 INFO L290 TraceCheckUtils]: 61: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,981 INFO L290 TraceCheckUtils]: 62: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,982 INFO L290 TraceCheckUtils]: 63: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,982 INFO L290 TraceCheckUtils]: 64: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,982 INFO L290 TraceCheckUtils]: 65: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,983 INFO L290 TraceCheckUtils]: 66: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 18:30:33,983 INFO L290 TraceCheckUtils]: 67: Hoare triple {64221#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {64220#false} is VALID [2022-02-20 18:30:33,983 INFO L290 TraceCheckUtils]: 68: Hoare triple {64220#false} assume node6_~m6~0#1 != ~nomsg~0; {64220#false} is VALID [2022-02-20 18:30:33,983 INFO L290 TraceCheckUtils]: 69: Hoare triple {64220#false} assume !(node6_~m6~0#1 > ~id6~0); {64220#false} is VALID [2022-02-20 18:30:33,983 INFO L290 TraceCheckUtils]: 70: Hoare triple {64220#false} assume node6_~m6~0#1 == ~id6~0;~st6~0 := 1; {64220#false} is VALID [2022-02-20 18:30:33,984 INFO L290 TraceCheckUtils]: 71: Hoare triple {64220#false} ~mode6~0 := 0; {64220#false} is VALID [2022-02-20 18:30:33,984 INFO L290 TraceCheckUtils]: 72: Hoare triple {64220#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {64220#false} is VALID [2022-02-20 18:30:33,984 INFO L290 TraceCheckUtils]: 73: Hoare triple {64220#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {64220#false} is VALID [2022-02-20 18:30:33,984 INFO L290 TraceCheckUtils]: 74: Hoare triple {64220#false} check_#res#1 := check_~tmp~1#1; {64220#false} is VALID [2022-02-20 18:30:33,984 INFO L290 TraceCheckUtils]: 75: Hoare triple {64220#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {64220#false} is VALID [2022-02-20 18:30:33,984 INFO L290 TraceCheckUtils]: 76: Hoare triple {64220#false} assume 0 == assert_~arg#1 % 256; {64220#false} is VALID [2022-02-20 18:30:33,984 INFO L290 TraceCheckUtils]: 77: Hoare triple {64220#false} assume !false; {64220#false} is VALID [2022-02-20 18:30:33,985 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:30:33,985 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:33,985 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102807148] [2022-02-20 18:30:33,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102807148] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:33,985 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:33,985 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:33,986 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163820758] [2022-02-20 18:30:33,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:33,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2022-02-20 18:30:33,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:33,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:30:34,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:34,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:34,064 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:34,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:34,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:34,064 INFO L87 Difference]: Start difference. First operand 2218 states and 3345 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:30:37,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:37,792 INFO L93 Difference]: Finished difference Result 6270 states and 9459 transitions. [2022-02-20 18:30:37,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:37,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2022-02-20 18:30:37,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:37,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:30:37,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:30:37,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:30:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:30:37,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 321 transitions. [2022-02-20 18:30:37,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:38,614 INFO L225 Difference]: With dead ends: 6270 [2022-02-20 18:30:38,615 INFO L226 Difference]: Without dead ends: 4100 [2022-02-20 18:30:38,617 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:30:38,617 INFO L933 BasicCegarLoop]: 189 mSDtfsCounter, 65 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:38,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 302 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:38,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4100 states. [2022-02-20 18:30:41,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4100 to 4098. [2022-02-20 18:30:41,454 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:30:41,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4100 states. Second operand has 4098 states, 4097 states have (on average 1.4920673663656334) internal successors, (6113), 4097 states have internal predecessors, (6113), 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:30:41,464 INFO L74 IsIncluded]: Start isIncluded. First operand 4100 states. Second operand has 4098 states, 4097 states have (on average 1.4920673663656334) internal successors, (6113), 4097 states have internal predecessors, (6113), 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:30:41,467 INFO L87 Difference]: Start difference. First operand 4100 states. Second operand has 4098 states, 4097 states have (on average 1.4920673663656334) internal successors, (6113), 4097 states have internal predecessors, (6113), 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:30:42,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:42,000 INFO L93 Difference]: Finished difference Result 4100 states and 6114 transitions. [2022-02-20 18:30:42,000 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 6114 transitions. [2022-02-20 18:30:42,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:42,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:42,008 INFO L74 IsIncluded]: Start isIncluded. First operand has 4098 states, 4097 states have (on average 1.4920673663656334) internal successors, (6113), 4097 states have internal predecessors, (6113), 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 4100 states. [2022-02-20 18:30:42,011 INFO L87 Difference]: Start difference. First operand has 4098 states, 4097 states have (on average 1.4920673663656334) internal successors, (6113), 4097 states have internal predecessors, (6113), 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 4100 states. [2022-02-20 18:30:42,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:42,540 INFO L93 Difference]: Finished difference Result 4100 states and 6114 transitions. [2022-02-20 18:30:42,540 INFO L276 IsEmpty]: Start isEmpty. Operand 4100 states and 6114 transitions. [2022-02-20 18:30:42,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:30:42,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:30:42,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:30:42,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:30:42,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4098 states, 4097 states have (on average 1.4920673663656334) internal successors, (6113), 4097 states have internal predecessors, (6113), 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:30:43,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4098 states to 4098 states and 6113 transitions. [2022-02-20 18:30:43,227 INFO L78 Accepts]: Start accepts. Automaton has 4098 states and 6113 transitions. Word has length 78 [2022-02-20 18:30:43,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:30:43,227 INFO L470 AbstractCegarLoop]: Abstraction has 4098 states and 6113 transitions. [2022-02-20 18:30:43,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:30:43,228 INFO L276 IsEmpty]: Start isEmpty. Operand 4098 states and 6113 transitions. [2022-02-20 18:30:43,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-02-20 18:30:43,228 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:30:43,228 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] [2022-02-20 18:30:43,228 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 18:30:43,229 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:30:43,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:30:43,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1594818679, now seen corresponding path program 1 times [2022-02-20 18:30:43,229 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:30:43,229 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66266577] [2022-02-20 18:30:43,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:30:43,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:30:43,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:30:43,269 INFO L290 TraceCheckUtils]: 0: Hoare triple {84916#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {84916#true} is VALID [2022-02-20 18:30:43,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {84916#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~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;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {84916#true} is VALID [2022-02-20 18:30:43,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {84916#true} assume 0 == ~r1~0; {84916#true} is VALID [2022-02-20 18:30:43,269 INFO L290 TraceCheckUtils]: 3: Hoare triple {84916#true} assume ~id1~0 >= 0; {84916#true} is VALID [2022-02-20 18:30:43,269 INFO L290 TraceCheckUtils]: 4: Hoare triple {84916#true} assume 0 == ~st1~0; {84916#true} is VALID [2022-02-20 18:30:43,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {84916#true} assume ~send1~0 == ~id1~0; {84916#true} is VALID [2022-02-20 18:30:43,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {84916#true} assume 0 == ~mode1~0 % 256; {84916#true} is VALID [2022-02-20 18:30:43,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {84916#true} assume ~id2~0 >= 0; {84916#true} is VALID [2022-02-20 18:30:43,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {84916#true} assume 0 == ~st2~0; {84916#true} is VALID [2022-02-20 18:30:43,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {84916#true} assume ~send2~0 == ~id2~0; {84916#true} is VALID [2022-02-20 18:30:43,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {84916#true} assume 0 == ~mode2~0 % 256; {84916#true} is VALID [2022-02-20 18:30:43,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {84916#true} assume ~id3~0 >= 0; {84916#true} is VALID [2022-02-20 18:30:43,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {84916#true} assume 0 == ~st3~0; {84916#true} is VALID [2022-02-20 18:30:43,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {84916#true} assume ~send3~0 == ~id3~0; {84916#true} is VALID [2022-02-20 18:30:43,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {84916#true} assume 0 == ~mode3~0 % 256; {84916#true} is VALID [2022-02-20 18:30:43,271 INFO L290 TraceCheckUtils]: 15: Hoare triple {84916#true} assume ~id4~0 >= 0; {84916#true} is VALID [2022-02-20 18:30:43,271 INFO L290 TraceCheckUtils]: 16: Hoare triple {84916#true} assume 0 == ~st4~0; {84916#true} is VALID [2022-02-20 18:30:43,271 INFO L290 TraceCheckUtils]: 17: Hoare triple {84916#true} assume ~send4~0 == ~id4~0; {84916#true} is VALID [2022-02-20 18:30:43,271 INFO L290 TraceCheckUtils]: 18: Hoare triple {84916#true} assume 0 == ~mode4~0 % 256; {84916#true} is VALID [2022-02-20 18:30:43,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {84916#true} assume ~id5~0 >= 0; {84916#true} is VALID [2022-02-20 18:30:43,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {84916#true} assume 0 == ~st5~0; {84916#true} is VALID [2022-02-20 18:30:43,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {84916#true} assume ~send5~0 == ~id5~0; {84916#true} is VALID [2022-02-20 18:30:43,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {84916#true} assume 0 == ~mode5~0 % 256; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,273 INFO L290 TraceCheckUtils]: 27: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,274 INFO L290 TraceCheckUtils]: 28: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,274 INFO L290 TraceCheckUtils]: 29: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,274 INFO L290 TraceCheckUtils]: 30: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,275 INFO L290 TraceCheckUtils]: 32: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,276 INFO L290 TraceCheckUtils]: 34: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,276 INFO L290 TraceCheckUtils]: 35: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,277 INFO L290 TraceCheckUtils]: 36: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,277 INFO L290 TraceCheckUtils]: 37: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,277 INFO L290 TraceCheckUtils]: 38: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,278 INFO L290 TraceCheckUtils]: 39: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,278 INFO L290 TraceCheckUtils]: 40: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,278 INFO L290 TraceCheckUtils]: 41: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,279 INFO L290 TraceCheckUtils]: 42: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,279 INFO L290 TraceCheckUtils]: 43: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,279 INFO L290 TraceCheckUtils]: 44: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,280 INFO L290 TraceCheckUtils]: 45: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,281 INFO L290 TraceCheckUtils]: 46: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,287 INFO L290 TraceCheckUtils]: 47: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,288 INFO L290 TraceCheckUtils]: 48: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,288 INFO L290 TraceCheckUtils]: 49: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,288 INFO L290 TraceCheckUtils]: 50: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,289 INFO L290 TraceCheckUtils]: 51: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,289 INFO L290 TraceCheckUtils]: 52: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,289 INFO L290 TraceCheckUtils]: 53: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,290 INFO L290 TraceCheckUtils]: 54: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,290 INFO L290 TraceCheckUtils]: 55: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,290 INFO L290 TraceCheckUtils]: 56: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,291 INFO L290 TraceCheckUtils]: 57: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,291 INFO L290 TraceCheckUtils]: 58: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,291 INFO L290 TraceCheckUtils]: 59: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,292 INFO L290 TraceCheckUtils]: 60: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,293 INFO L290 TraceCheckUtils]: 61: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,293 INFO L290 TraceCheckUtils]: 62: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 18:30:43,293 INFO L290 TraceCheckUtils]: 63: Hoare triple {84918#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {84917#false} is VALID [2022-02-20 18:30:43,293 INFO L290 TraceCheckUtils]: 64: Hoare triple {84917#false} assume node5_~m5~0#1 != ~nomsg~0; {84917#false} is VALID [2022-02-20 18:30:43,294 INFO L290 TraceCheckUtils]: 65: Hoare triple {84917#false} assume !(node5_~m5~0#1 > ~id5~0); {84917#false} is VALID [2022-02-20 18:30:43,294 INFO L290 TraceCheckUtils]: 66: Hoare triple {84917#false} assume node5_~m5~0#1 == ~id5~0;~st5~0 := 1; {84917#false} is VALID [2022-02-20 18:30:43,294 INFO L290 TraceCheckUtils]: 67: Hoare triple {84917#false} ~mode5~0 := 0; {84917#false} is VALID [2022-02-20 18:30:43,294 INFO L290 TraceCheckUtils]: 68: Hoare triple {84917#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {84917#false} is VALID [2022-02-20 18:30:43,294 INFO L290 TraceCheckUtils]: 69: Hoare triple {84917#false} assume !(0 != ~mode6~0 % 256); {84917#false} is VALID [2022-02-20 18:30:43,294 INFO L290 TraceCheckUtils]: 70: Hoare triple {84917#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {84917#false} is VALID [2022-02-20 18:30:43,294 INFO L290 TraceCheckUtils]: 71: Hoare triple {84917#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {84917#false} is VALID [2022-02-20 18:30:43,294 INFO L290 TraceCheckUtils]: 72: Hoare triple {84917#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {84917#false} is VALID [2022-02-20 18:30:43,294 INFO L290 TraceCheckUtils]: 73: Hoare triple {84917#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {84917#false} is VALID [2022-02-20 18:30:43,294 INFO L290 TraceCheckUtils]: 74: Hoare triple {84917#false} check_#res#1 := check_~tmp~1#1; {84917#false} is VALID [2022-02-20 18:30:43,294 INFO L290 TraceCheckUtils]: 75: Hoare triple {84917#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {84917#false} is VALID [2022-02-20 18:30:43,294 INFO L290 TraceCheckUtils]: 76: Hoare triple {84917#false} assume 0 == assert_~arg#1 % 256; {84917#false} is VALID [2022-02-20 18:30:43,294 INFO L290 TraceCheckUtils]: 77: Hoare triple {84917#false} assume !false; {84917#false} is VALID [2022-02-20 18:30:43,295 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:30:43,295 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:30:43,295 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66266577] [2022-02-20 18:30:43,295 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66266577] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:30:43,295 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:30:43,295 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 18:30:43,295 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290851058] [2022-02-20 18:30:43,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:30:43,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2022-02-20 18:30:43,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:30:43,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:30:43,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:43,384 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 18:30:43,384 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:30:43,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 18:30:43,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 18:30:43,385 INFO L87 Difference]: Start difference. First operand 4098 states and 6113 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:30:53,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:30:53,932 INFO L93 Difference]: Finished difference Result 11622 states and 17283 transitions. [2022-02-20 18:30:53,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 18:30:53,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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 78 [2022-02-20 18:30:53,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 18:30:53,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:30:53,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:30:53,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:30:53,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 321 transitions. [2022-02-20 18:30:53,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 321 transitions. [2022-02-20 18:30:54,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:30:56,209 INFO L225 Difference]: With dead ends: 11622 [2022-02-20 18:30:56,210 INFO L226 Difference]: Without dead ends: 7572 [2022-02-20 18:30:56,213 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:30:56,213 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 69 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 18:30:56,214 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 311 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 18:30:56,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7572 states. [2022-02-20 18:31:01,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7572 to 7570. [2022-02-20 18:31:01,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 18:31:01,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7572 states. Second operand has 7570 states, 7569 states have (on average 1.4692826000792707) internal successors, (11121), 7569 states have internal predecessors, (11121), 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:31:01,491 INFO L74 IsIncluded]: Start isIncluded. First operand 7572 states. Second operand has 7570 states, 7569 states have (on average 1.4692826000792707) internal successors, (11121), 7569 states have internal predecessors, (11121), 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:31:01,496 INFO L87 Difference]: Start difference. First operand 7572 states. Second operand has 7570 states, 7569 states have (on average 1.4692826000792707) internal successors, (11121), 7569 states have internal predecessors, (11121), 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:31:03,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:03,426 INFO L93 Difference]: Finished difference Result 7572 states and 11122 transitions. [2022-02-20 18:31:03,426 INFO L276 IsEmpty]: Start isEmpty. Operand 7572 states and 11122 transitions. [2022-02-20 18:31:03,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:03,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:03,440 INFO L74 IsIncluded]: Start isIncluded. First operand has 7570 states, 7569 states have (on average 1.4692826000792707) internal successors, (11121), 7569 states have internal predecessors, (11121), 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 7572 states. [2022-02-20 18:31:03,445 INFO L87 Difference]: Start difference. First operand has 7570 states, 7569 states have (on average 1.4692826000792707) internal successors, (11121), 7569 states have internal predecessors, (11121), 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 7572 states. [2022-02-20 18:31:05,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 18:31:05,393 INFO L93 Difference]: Finished difference Result 7572 states and 11122 transitions. [2022-02-20 18:31:05,393 INFO L276 IsEmpty]: Start isEmpty. Operand 7572 states and 11122 transitions. [2022-02-20 18:31:05,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 18:31:05,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 18:31:05,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 18:31:05,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 18:31:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7570 states, 7569 states have (on average 1.4692826000792707) internal successors, (11121), 7569 states have internal predecessors, (11121), 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:31:07,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7570 states to 7570 states and 11121 transitions. [2022-02-20 18:31:07,727 INFO L78 Accepts]: Start accepts. Automaton has 7570 states and 11121 transitions. Word has length 78 [2022-02-20 18:31:07,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 18:31:07,728 INFO L470 AbstractCegarLoop]: Abstraction has 7570 states and 11121 transitions. [2022-02-20 18:31:07,729 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 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:31:07,729 INFO L276 IsEmpty]: Start isEmpty. Operand 7570 states and 11121 transitions. [2022-02-20 18:31:07,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 18:31:07,729 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 18:31:07,729 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] [2022-02-20 18:31:07,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 18:31:07,730 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 18:31:07,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 18:31:07,730 INFO L85 PathProgramCache]: Analyzing trace with hash 2140223893, now seen corresponding path program 1 times [2022-02-20 18:31:07,730 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 18:31:07,730 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41861268] [2022-02-20 18:31:07,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 18:31:07,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 18:31:07,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 18:31:07,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {123501#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0;~p6~0 := 0;~p6_old~0 := 0;~p6_new~0 := 0;~id6~0 := 0;~st6~0 := 0;~send6~0 := 0;~mode6~0 := 0; {123503#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:31:07,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {123503#(<= (+ ~nomsg~0 1) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~ret35#1, main_#t~ret36#1, main_#t~post37#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;assume -128 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 127;~r1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;assume -128 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 127;~id1~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;~send1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~mode1~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;assume -128 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 127;~id2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;assume -128 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 127;~st2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;assume -128 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 127;~send2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~mode2~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;assume -128 <= main_#t~nondet19#1 && main_#t~nondet19#1 <= 127;~id3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;assume -128 <= main_#t~nondet20#1 && main_#t~nondet20#1 <= 127;~st3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;assume -128 <= main_#t~nondet21#1 && main_#t~nondet21#1 <= 127;~send3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode3~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;assume -128 <= main_#t~nondet23#1 && main_#t~nondet23#1 <= 127;~id4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;assume -128 <= main_#t~nondet24#1 && main_#t~nondet24#1 <= 127;~st4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;assume -128 <= main_#t~nondet25#1 && main_#t~nondet25#1 <= 127;~send4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~mode4~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;assume -128 <= main_#t~nondet27#1 && main_#t~nondet27#1 <= 127;~id5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;assume -128 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 127;~st5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;assume -128 <= main_#t~nondet29#1 && main_#t~nondet29#1 <= 127;~send5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode5~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;assume -128 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 127;~id6~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;assume -128 <= main_#t~nondet32#1 && main_#t~nondet32#1 <= 127;~st6~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;assume -128 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 127;~send6~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode6~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {123503#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:31:07,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {123503#(<= (+ ~nomsg~0 1) 0)} assume 0 == ~r1~0; {123503#(<= (+ ~nomsg~0 1) 0)} is VALID [2022-02-20 18:31:07,792 INFO L290 TraceCheckUtils]: 3: Hoare triple {123503#(<= (+ ~nomsg~0 1) 0)} assume ~id1~0 >= 0; {123504#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:31:07,793 INFO L290 TraceCheckUtils]: 4: Hoare triple {123504#(<= (+ ~nomsg~0 1) ~id1~0)} assume 0 == ~st1~0; {123504#(<= (+ ~nomsg~0 1) ~id1~0)} is VALID [2022-02-20 18:31:07,793 INFO L290 TraceCheckUtils]: 5: Hoare triple {123504#(<= (+ ~nomsg~0 1) ~id1~0)} assume ~send1~0 == ~id1~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode1~0 % 256; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,793 INFO L290 TraceCheckUtils]: 7: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 >= 0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st2~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send2~0 == ~id2~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode2~0 % 256; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,795 INFO L290 TraceCheckUtils]: 11: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 >= 0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st3~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send3~0 == ~id3~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode3~0 % 256; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 >= 0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st4~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send4~0 == ~id4~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode4~0 % 256; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,797 INFO L290 TraceCheckUtils]: 19: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id5~0 >= 0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st5~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send5~0 == ~id5~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode5~0 % 256; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,798 INFO L290 TraceCheckUtils]: 23: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id6~0 >= 0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~st6~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~send6~0 == ~id6~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume 0 == ~mode6~0 % 256; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id2~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id3~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,800 INFO L290 TraceCheckUtils]: 29: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id4~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,800 INFO L290 TraceCheckUtils]: 30: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id5~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,800 INFO L290 TraceCheckUtils]: 31: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id1~0 != ~id6~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,800 INFO L290 TraceCheckUtils]: 32: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id3~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,801 INFO L290 TraceCheckUtils]: 33: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id4~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,801 INFO L290 TraceCheckUtils]: 34: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id5~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,801 INFO L290 TraceCheckUtils]: 35: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id2~0 != ~id6~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,802 INFO L290 TraceCheckUtils]: 36: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id4~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,802 INFO L290 TraceCheckUtils]: 37: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id5~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,802 INFO L290 TraceCheckUtils]: 38: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id3~0 != ~id6~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,802 INFO L290 TraceCheckUtils]: 39: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 != ~id5~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,803 INFO L290 TraceCheckUtils]: 40: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id4~0 != ~id6~0; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,803 INFO L290 TraceCheckUtils]: 41: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,803 INFO L290 TraceCheckUtils]: 42: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} init_#res#1 := init_~tmp~0#1; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,803 INFO L290 TraceCheckUtils]: 43: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} main_#t~ret35#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main_#t~ret35#1 && main_#t~ret35#1 <= 2147483647;main_~i2~0#1 := main_#t~ret35#1;havoc main_#t~ret35#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,804 INFO L290 TraceCheckUtils]: 44: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume !(0 == assume_abort_if_not_~cond#1); {123505#(<= (+ ~nomsg~0 1) ~send1~0)} is VALID [2022-02-20 18:31:07,804 INFO L290 TraceCheckUtils]: 45: Hoare triple {123505#(<= (+ ~nomsg~0 1) ~send1~0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~nomsg~0;~p6_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {123506#(and (= (+ (* (- 1) ~p1_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send1~0))} is VALID [2022-02-20 18:31:07,805 INFO L290 TraceCheckUtils]: 46: Hoare triple {123506#(and (= (+ (* (- 1) ~p1_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send1~0))} assume !!(main_~i2~0#1 < 12);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {123506#(and (= (+ (* (- 1) ~p1_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send1~0))} is VALID [2022-02-20 18:31:07,805 INFO L290 TraceCheckUtils]: 47: Hoare triple {123506#(and (= (+ (* (- 1) ~p1_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send1~0))} assume !(0 != ~mode1~0 % 256); {123506#(and (= (+ (* (- 1) ~p1_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send1~0))} is VALID [2022-02-20 18:31:07,805 INFO L290 TraceCheckUtils]: 48: Hoare triple {123506#(and (= (+ (* (- 1) ~p1_new~0) ~nomsg~0) 0) (<= (+ ~nomsg~0 1) ~send1~0))} assume !(~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0);node1_#t~ite4#1 := ~p1_new~0; {123502#false} is VALID [2022-02-20 18:31:07,805 INFO L290 TraceCheckUtils]: 49: Hoare triple {123502#false} ~p1_new~0 := (if node1_#t~ite4#1 % 256 <= 127 then node1_#t~ite4#1 % 256 else node1_#t~ite4#1 % 256 - 256);havoc node1_#t~ite4#1;~mode1~0 := 1; {123502#false} is VALID [2022-02-20 18:31:07,806 INFO L290 TraceCheckUtils]: 50: Hoare triple {123502#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {123502#false} is VALID [2022-02-20 18:31:07,806 INFO L290 TraceCheckUtils]: 51: Hoare triple {123502#false} assume !(0 != ~mode2~0 % 256); {123502#false} is VALID [2022-02-20 18:31:07,806 INFO L290 TraceCheckUtils]: 52: Hoare triple {123502#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {123502#false} is VALID [2022-02-20 18:31:07,806 INFO L290 TraceCheckUtils]: 53: Hoare triple {123502#false} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {123502#false} is VALID [2022-02-20 18:31:07,806 INFO L290 TraceCheckUtils]: 54: Hoare triple {123502#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {123502#false} is VALID [2022-02-20 18:31:07,806 INFO L290 TraceCheckUtils]: 55: Hoare triple {123502#false} assume !(0 != ~mode3~0 % 256); {123502#false} is VALID [2022-02-20 18:31:07,806 INFO L290 TraceCheckUtils]: 56: Hoare triple {123502#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {123502#false} is VALID [2022-02-20 18:31:07,806 INFO L290 TraceCheckUtils]: 57: Hoare triple {123502#false} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {123502#false} is VALID [2022-02-20 18:31:07,806 INFO L290 TraceCheckUtils]: 58: Hoare triple {123502#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {123502#false} is VALID [2022-02-20 18:31:07,807 INFO L290 TraceCheckUtils]: 59: Hoare triple {123502#false} assume !(0 != ~mode4~0 % 256); {123502#false} is VALID [2022-02-20 18:31:07,807 INFO L290 TraceCheckUtils]: 60: Hoare triple {123502#false} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {123502#false} is VALID [2022-02-20 18:31:07,807 INFO L290 TraceCheckUtils]: 61: Hoare triple {123502#false} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {123502#false} is VALID [2022-02-20 18:31:07,807 INFO L290 TraceCheckUtils]: 62: Hoare triple {123502#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {123502#false} is VALID [2022-02-20 18:31:07,807 INFO L290 TraceCheckUtils]: 63: Hoare triple {123502#false} assume !(0 != ~mode5~0 % 256); {123502#false} is VALID [2022-02-20 18:31:07,807 INFO L290 TraceCheckUtils]: 64: Hoare triple {123502#false} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite8#1 := ~send5~0; {123502#false} is VALID [2022-02-20 18:31:07,807 INFO L290 TraceCheckUtils]: 65: Hoare triple {123502#false} ~p5_new~0 := (if node5_#t~ite8#1 % 256 <= 127 then node5_#t~ite8#1 % 256 else node5_#t~ite8#1 % 256 - 256);havoc node5_#t~ite8#1;~mode5~0 := 1; {123502#false} is VALID [2022-02-20 18:31:07,807 INFO L290 TraceCheckUtils]: 66: Hoare triple {123502#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite9#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {123502#false} is VALID [2022-02-20 18:31:07,807 INFO L290 TraceCheckUtils]: 67: Hoare triple {123502#false} assume !(0 != ~mode6~0 % 256); {123502#false} is VALID [2022-02-20 18:31:07,807 INFO L290 TraceCheckUtils]: 68: Hoare triple {123502#false} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite9#1 := ~send6~0; {123502#false} is VALID [2022-02-20 18:31:07,808 INFO L290 TraceCheckUtils]: 69: Hoare triple {123502#false} ~p6_new~0 := (if node6_#t~ite9#1 % 256 <= 127 then node6_#t~ite9#1 % 256 else node6_#t~ite9#1 % 256 - 256);havoc node6_#t~ite9#1;~mode6~0 := 1; {123502#false} is VALID [2022-02-20 18:31:07,808 INFO L290 TraceCheckUtils]: 70: Hoare triple {123502#false} assume { :end_inline_node6 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;~p6_old~0 := ~p6_new~0;~p6_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {123502#false} is VALID [2022-02-20 18:31:07,808 INFO L290 TraceCheckUtils]: 71: Hoare triple {123502#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1; {123502#false} is VALID [2022-02-20 18:31:07,808 INFO L290 TraceCheckUtils]: 72: Hoare triple {123502#false} assume !(~r1~0 >= 6); {123502#false} is VALID [2022-02-20 18:31:07,808 INFO L290 TraceCheckUtils]: 73: Hoare triple {123502#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0; {123502#false} is VALID [2022-02-20 18:31:07,808 INFO L290 TraceCheckUtils]: 74: Hoare triple {123502#false} assume ~r1~0 < 6;check_~tmp~1#1 := 1; {123502#false} is VALID [2022-02-20 18:31:07,808 INFO L290 TraceCheckUtils]: 75: Hoare triple {123502#false} check_#res#1 := check_~tmp~1#1; {123502#false} is VALID [2022-02-20 18:31:07,808 INFO L290 TraceCheckUtils]: 76: Hoare triple {123502#false} main_#t~ret36#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main_#t~ret36#1 && main_#t~ret36#1 <= 2147483647;main_~c1~0#1 := main_#t~ret36#1;havoc main_#t~ret36#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {123502#false} is VALID [2022-02-20 18:31:07,808 INFO L290 TraceCheckUtils]: 77: Hoare triple {123502#false} assume 0 == assert_~arg#1 % 256; {123502#false} is VALID [2022-02-20 18:31:07,809 INFO L290 TraceCheckUtils]: 78: Hoare triple {123502#false} assume !false; {123502#false} is VALID [2022-02-20 18:31:07,809 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:31:07,809 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 18:31:07,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41861268] [2022-02-20 18:31:07,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41861268] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 18:31:07,809 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 18:31:07,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 18:31:07,809 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421392380] [2022-02-20 18:31:07,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 18:31:07,810 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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 79 [2022-02-20 18:31:07,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 18:31:07,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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:31:07,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 18:31:07,861 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 18:31:07,861 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 18:31:07,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 18:31:07,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 18:31:07,862 INFO L87 Difference]: Start difference. First operand 7570 states and 11121 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 5 states have internal predecessors, (79), 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)