./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label09.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/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label09.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 faa92f3a348dfbe60d7663031fcd6f715676a2874c7581f2c55a3b15e2409056 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:48:07,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:48:07,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:48:07,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:48:07,341 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:48:07,342 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:48:07,345 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:48:07,347 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:48:07,348 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:48:07,352 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:48:07,352 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:48:07,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:48:07,353 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:48:07,359 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:48:07,360 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:48:07,361 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:48:07,362 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:48:07,363 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:48:07,365 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:48:07,369 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:48:07,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:48:07,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:48:07,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:48:07,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:48:07,377 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:48:07,377 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:48:07,378 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:48:07,379 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:48:07,379 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:48:07,380 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:48:07,380 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:48:07,381 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:48:07,382 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:48:07,383 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:48:07,384 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:48:07,384 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:48:07,384 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:48:07,385 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:48:07,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:48:07,385 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:48:07,386 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:48:07,386 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 19:48:07,415 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:48:07,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:48:07,416 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:48:07,416 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:48:07,417 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:48:07,417 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:48:07,418 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:48:07,418 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:48:07,418 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:48:07,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:48:07,419 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:48:07,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:48:07,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:48:07,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:48:07,419 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:48:07,419 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:48:07,420 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:48:07,420 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:48:07,420 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:48:07,420 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:48:07,420 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:48:07,420 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:48:07,421 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:48:07,421 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:48:07,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:48:07,421 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:48:07,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:48:07,421 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:48:07,421 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:48:07,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:48:07,422 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:48:07,422 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:48:07,422 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:48:07,422 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 -> faa92f3a348dfbe60d7663031fcd6f715676a2874c7581f2c55a3b15e2409056 [2022-02-20 19:48:07,585 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:48:07,606 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:48:07,608 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:48:07,609 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:48:07,609 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:48:07,610 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label09.c [2022-02-20 19:48:07,667 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4237906d4/335e5e263f4e49df978af110d3a8ee01/FLAGf0a82da64 [2022-02-20 19:48:08,194 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:48:08,194 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label09.c [2022-02-20 19:48:08,221 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4237906d4/335e5e263f4e49df978af110d3a8ee01/FLAGf0a82da64 [2022-02-20 19:48:08,683 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4237906d4/335e5e263f4e49df978af110d3a8ee01 [2022-02-20 19:48:08,685 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:48:08,687 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:48:08,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:48:08,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:48:08,691 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:48:08,692 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:48:08" (1/1) ... [2022-02-20 19:48:08,693 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@271de8e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:08, skipping insertion in model container [2022-02-20 19:48:08,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:48:08" (1/1) ... [2022-02-20 19:48:08,697 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:48:08,780 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:48:09,037 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/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label09.c[15510,15523] [2022-02-20 19:48:09,100 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/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label09.c[23258,23271] [2022-02-20 19:48:09,533 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:48:09,541 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:48:09,576 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/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label09.c[15510,15523] [2022-02-20 19:48:09,592 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/combinations/pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label09.c[23258,23271] [2022-02-20 19:48:09,892 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:48:09,911 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:48:09,911 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:09 WrapperNode [2022-02-20 19:48:09,911 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:48:09,913 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:48:09,913 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:48:09,913 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:48:09,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:09" (1/1) ... [2022-02-20 19:48:09,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:09" (1/1) ... [2022-02-20 19:48:10,326 INFO L137 Inliner]: procedures = 38, calls = 23, calls flagged for inlining = 18, calls inlined = 18, statements flattened = 5147 [2022-02-20 19:48:10,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:48:10,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:48:10,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:48:10,341 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:48:10,361 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:09" (1/1) ... [2022-02-20 19:48:10,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:09" (1/1) ... [2022-02-20 19:48:10,419 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:09" (1/1) ... [2022-02-20 19:48:10,419 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:09" (1/1) ... [2022-02-20 19:48:10,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:09" (1/1) ... [2022-02-20 19:48:10,573 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:09" (1/1) ... [2022-02-20 19:48:10,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:09" (1/1) ... [2022-02-20 19:48:10,661 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:48:10,663 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:48:10,663 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:48:10,663 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:48:10,664 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:09" (1/1) ... [2022-02-20 19:48:10,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:48:10,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:48:10,688 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 19:48:10,694 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 19:48:10,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:48:10,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:48:10,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:48:10,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:48:10,858 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:48:10,863 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:48:17,146 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:48:17,157 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:48:17,157 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:48:17,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:48:17 BoogieIcfgContainer [2022-02-20 19:48:17,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:48:17,161 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:48:17,161 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:48:17,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:48:17,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:48:08" (1/3) ... [2022-02-20 19:48:17,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a49beea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:48:17, skipping insertion in model container [2022-02-20 19:48:17,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:48:09" (2/3) ... [2022-02-20 19:48:17,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a49beea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:48:17, skipping insertion in model container [2022-02-20 19:48:17,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:48:17" (3/3) ... [2022-02-20 19:48:17,168 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.6.ufo.UNBOUNDED.pals+Problem12_label09.c [2022-02-20 19:48:17,171 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:48:17,171 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:48:17,202 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:48:17,207 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 19:48:17,207 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:48:17,236 INFO L276 IsEmpty]: Start isEmpty. Operand has 928 states, 925 states have (on average 1.8983783783783783) internal successors, (1756), 927 states have internal predecessors, (1756), 0 states have call successors, (0), 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 19:48:17,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 19:48:17,243 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:17,243 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] [2022-02-20 19:48:17,244 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:17,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:17,247 INFO L85 PathProgramCache]: Analyzing trace with hash -321533933, now seen corresponding path program 1 times [2022-02-20 19:48:17,253 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:17,254 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865947347] [2022-02-20 19:48:17,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:17,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:17,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {931#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {931#true} is VALID [2022-02-20 19:48:17,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {931#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {931#true} is VALID [2022-02-20 19:48:17,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {931#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {931#true} is VALID [2022-02-20 19:48:17,395 INFO L290 TraceCheckUtils]: 3: Hoare triple {931#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {931#true} is VALID [2022-02-20 19:48:17,396 INFO L290 TraceCheckUtils]: 4: Hoare triple {931#true} init_#res#1 := init_~tmp~0#1; {931#true} is VALID [2022-02-20 19:48:17,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {931#true} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {931#true} is VALID [2022-02-20 19:48:17,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {931#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {932#false} is VALID [2022-02-20 19:48:17,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {932#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;main1_~i2~0#1 := 0; {932#false} is VALID [2022-02-20 19:48:17,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {932#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {932#false} is VALID [2022-02-20 19:48:17,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {932#false} assume !(0 != ~mode1~0 % 256); {932#false} is VALID [2022-02-20 19:48:17,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {932#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {932#false} is VALID [2022-02-20 19:48:17,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {932#false} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {932#false} is VALID [2022-02-20 19:48:17,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {932#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {932#false} is VALID [2022-02-20 19:48:17,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {932#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {932#false} is VALID [2022-02-20 19:48:17,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {932#false} assume !(node2_~m2~0#1 != ~nomsg~0); {932#false} is VALID [2022-02-20 19:48:17,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {932#false} ~mode2~0 := 0; {932#false} is VALID [2022-02-20 19:48:17,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {932#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {932#false} is VALID [2022-02-20 19:48:17,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {932#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {932#false} is VALID [2022-02-20 19:48:17,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {932#false} assume !(node3_~m3~0#1 != ~nomsg~0); {932#false} is VALID [2022-02-20 19:48:17,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {932#false} ~mode3~0 := 0; {932#false} is VALID [2022-02-20 19:48:17,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {932#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {932#false} is VALID [2022-02-20 19:48:17,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {932#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {932#false} is VALID [2022-02-20 19:48:17,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {932#false} assume !(node4_~m4~0#1 != ~nomsg~0); {932#false} is VALID [2022-02-20 19:48:17,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {932#false} ~mode4~0 := 0; {932#false} is VALID [2022-02-20 19:48:17,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {932#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {932#false} is VALID [2022-02-20 19:48:17,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {932#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {932#false} is VALID [2022-02-20 19:48:17,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {932#false} assume !(node5_~m5~0#1 != ~nomsg~0); {932#false} is VALID [2022-02-20 19:48:17,404 INFO L290 TraceCheckUtils]: 27: Hoare triple {932#false} ~mode5~0 := 0; {932#false} is VALID [2022-02-20 19:48:17,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {932#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {932#false} is VALID [2022-02-20 19:48:17,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {932#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {932#false} is VALID [2022-02-20 19:48:17,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {932#false} assume !(node6_~m6~0#1 != ~nomsg~0); {932#false} is VALID [2022-02-20 19:48:17,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {932#false} ~mode6~0 := 0; {932#false} is VALID [2022-02-20 19:48:17,405 INFO L290 TraceCheckUtils]: 32: Hoare triple {932#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; {932#false} is VALID [2022-02-20 19:48:17,405 INFO L290 TraceCheckUtils]: 33: Hoare triple {932#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {932#false} is VALID [2022-02-20 19:48:17,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {932#false} check_#res#1 := check_~tmp~1#1; {932#false} is VALID [2022-02-20 19:48:17,405 INFO L290 TraceCheckUtils]: 35: Hoare triple {932#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {932#false} is VALID [2022-02-20 19:48:17,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {932#false} assume 0 == assert_~arg#1 % 256; {932#false} is VALID [2022-02-20 19:48:17,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {932#false} assume !false; {932#false} is VALID [2022-02-20 19:48:17,406 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 19:48:17,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:17,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865947347] [2022-02-20 19:48:17,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865947347] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:17,408 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:17,408 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:48:17,409 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581794401] [2022-02-20 19:48:17,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:17,413 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-02-20 19:48:17,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:17,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 19:48:17,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:17,446 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:48:17,446 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:17,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:48:17,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:48:17,463 INFO L87 Difference]: Start difference. First operand has 928 states, 925 states have (on average 1.8983783783783783) internal successors, (1756), 927 states have internal predecessors, (1756), 0 states have call successors, (0), 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 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 19:48:18,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:18,652 INFO L93 Difference]: Finished difference Result 1808 states and 3422 transitions. [2022-02-20 19:48:18,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:48:18,652 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-02-20 19:48:18,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:18,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 19:48:18,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3422 transitions. [2022-02-20 19:48:18,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 19:48:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3422 transitions. [2022-02-20 19:48:18,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3422 transitions. [2022-02-20 19:48:21,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3422 edges. 3422 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:21,165 INFO L225 Difference]: With dead ends: 1808 [2022-02-20 19:48:21,165 INFO L226 Difference]: Without dead ends: 862 [2022-02-20 19:48:21,169 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 19:48:21,173 INFO L933 BasicCegarLoop]: 1687 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, 1687 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 19:48:21,174 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1687 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:48:21,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2022-02-20 19:48:21,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 862. [2022-02-20 19:48:21,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:21,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 862 states. Second operand has 862 states, 860 states have (on average 1.8872093023255814) internal successors, (1623), 861 states have internal predecessors, (1623), 0 states have call successors, (0), 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 19:48:21,231 INFO L74 IsIncluded]: Start isIncluded. First operand 862 states. Second operand has 862 states, 860 states have (on average 1.8872093023255814) internal successors, (1623), 861 states have internal predecessors, (1623), 0 states have call successors, (0), 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 19:48:21,232 INFO L87 Difference]: Start difference. First operand 862 states. Second operand has 862 states, 860 states have (on average 1.8872093023255814) internal successors, (1623), 861 states have internal predecessors, (1623), 0 states have call successors, (0), 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 19:48:21,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:21,261 INFO L93 Difference]: Finished difference Result 862 states and 1623 transitions. [2022-02-20 19:48:21,261 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1623 transitions. [2022-02-20 19:48:21,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:21,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:21,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 862 states, 860 states have (on average 1.8872093023255814) internal successors, (1623), 861 states have internal predecessors, (1623), 0 states have call successors, (0), 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 862 states. [2022-02-20 19:48:21,270 INFO L87 Difference]: Start difference. First operand has 862 states, 860 states have (on average 1.8872093023255814) internal successors, (1623), 861 states have internal predecessors, (1623), 0 states have call successors, (0), 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 862 states. [2022-02-20 19:48:21,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:21,296 INFO L93 Difference]: Finished difference Result 862 states and 1623 transitions. [2022-02-20 19:48:21,297 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1623 transitions. [2022-02-20 19:48:21,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:21,302 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:21,302 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:21,303 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:21,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 860 states have (on average 1.8872093023255814) internal successors, (1623), 861 states have internal predecessors, (1623), 0 states have call successors, (0), 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 19:48:21,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1623 transitions. [2022-02-20 19:48:21,331 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1623 transitions. Word has length 38 [2022-02-20 19:48:21,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:21,332 INFO L470 AbstractCegarLoop]: Abstraction has 862 states and 1623 transitions. [2022-02-20 19:48:21,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 0 states have call successors, (0), 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 19:48:21,332 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1623 transitions. [2022-02-20 19:48:21,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 19:48:21,333 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:21,333 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:48:21,333 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:48:21,334 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:21,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:21,336 INFO L85 PathProgramCache]: Analyzing trace with hash -46774319, now seen corresponding path program 1 times [2022-02-20 19:48:21,336 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:21,336 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357540435] [2022-02-20 19:48:21,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:21,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:21,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:21,457 INFO L290 TraceCheckUtils]: 0: Hoare triple {5376#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {5376#true} is VALID [2022-02-20 19:48:21,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {5376#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {5376#true} is VALID [2022-02-20 19:48:21,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {5376#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5376#true} is VALID [2022-02-20 19:48:21,458 INFO L290 TraceCheckUtils]: 3: Hoare triple {5376#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5378#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:48:21,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {5378#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5379#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:48:21,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {5379#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5380#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:48:21,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {5380#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5377#false} is VALID [2022-02-20 19:48:21,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {5377#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;main1_~i2~0#1 := 0; {5377#false} is VALID [2022-02-20 19:48:21,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {5377#false} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {5377#false} is VALID [2022-02-20 19:48:21,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {5377#false} assume !(0 != ~mode1~0 % 256); {5377#false} is VALID [2022-02-20 19:48:21,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {5377#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {5377#false} is VALID [2022-02-20 19:48:21,463 INFO L290 TraceCheckUtils]: 11: Hoare triple {5377#false} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {5377#false} is VALID [2022-02-20 19:48:21,463 INFO L290 TraceCheckUtils]: 12: Hoare triple {5377#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {5377#false} is VALID [2022-02-20 19:48:21,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {5377#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5377#false} is VALID [2022-02-20 19:48:21,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {5377#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5377#false} is VALID [2022-02-20 19:48:21,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {5377#false} ~mode2~0 := 0; {5377#false} is VALID [2022-02-20 19:48:21,464 INFO L290 TraceCheckUtils]: 16: Hoare triple {5377#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {5377#false} is VALID [2022-02-20 19:48:21,464 INFO L290 TraceCheckUtils]: 17: Hoare triple {5377#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5377#false} is VALID [2022-02-20 19:48:21,465 INFO L290 TraceCheckUtils]: 18: Hoare triple {5377#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5377#false} is VALID [2022-02-20 19:48:21,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {5377#false} ~mode3~0 := 0; {5377#false} is VALID [2022-02-20 19:48:21,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {5377#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {5377#false} is VALID [2022-02-20 19:48:21,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {5377#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5377#false} is VALID [2022-02-20 19:48:21,465 INFO L290 TraceCheckUtils]: 22: Hoare triple {5377#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5377#false} is VALID [2022-02-20 19:48:21,465 INFO L290 TraceCheckUtils]: 23: Hoare triple {5377#false} ~mode4~0 := 0; {5377#false} is VALID [2022-02-20 19:48:21,465 INFO L290 TraceCheckUtils]: 24: Hoare triple {5377#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {5377#false} is VALID [2022-02-20 19:48:21,466 INFO L290 TraceCheckUtils]: 25: Hoare triple {5377#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5377#false} is VALID [2022-02-20 19:48:21,466 INFO L290 TraceCheckUtils]: 26: Hoare triple {5377#false} assume !(node5_~m5~0#1 != ~nomsg~0); {5377#false} is VALID [2022-02-20 19:48:21,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {5377#false} ~mode5~0 := 0; {5377#false} is VALID [2022-02-20 19:48:21,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {5377#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {5377#false} is VALID [2022-02-20 19:48:21,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {5377#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {5377#false} is VALID [2022-02-20 19:48:21,466 INFO L290 TraceCheckUtils]: 30: Hoare triple {5377#false} assume !(node6_~m6~0#1 != ~nomsg~0); {5377#false} is VALID [2022-02-20 19:48:21,467 INFO L290 TraceCheckUtils]: 31: Hoare triple {5377#false} ~mode6~0 := 0; {5377#false} is VALID [2022-02-20 19:48:21,467 INFO L290 TraceCheckUtils]: 32: Hoare triple {5377#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; {5377#false} is VALID [2022-02-20 19:48:21,467 INFO L290 TraceCheckUtils]: 33: Hoare triple {5377#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {5377#false} is VALID [2022-02-20 19:48:21,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {5377#false} check_#res#1 := check_~tmp~1#1; {5377#false} is VALID [2022-02-20 19:48:21,468 INFO L290 TraceCheckUtils]: 35: Hoare triple {5377#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {5377#false} is VALID [2022-02-20 19:48:21,468 INFO L290 TraceCheckUtils]: 36: Hoare triple {5377#false} assume 0 == assert_~arg#1 % 256; {5377#false} is VALID [2022-02-20 19:48:21,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {5377#false} assume !false; {5377#false} is VALID [2022-02-20 19:48:21,468 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 19:48:21,469 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:21,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357540435] [2022-02-20 19:48:21,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357540435] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:21,469 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:21,469 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:48:21,469 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1441214502] [2022-02-20 19:48:21,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:21,471 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-02-20 19:48:21,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:21,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 19:48:21,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:21,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:48:21,492 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:21,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:48:21,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:48:21,492 INFO L87 Difference]: Start difference. First operand 862 states and 1623 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 19:48:25,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:25,202 INFO L93 Difference]: Finished difference Result 928 states and 1725 transitions. [2022-02-20 19:48:25,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:48:25,203 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2022-02-20 19:48:25,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:25,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 19:48:25,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1725 transitions. [2022-02-20 19:48:25,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 19:48:25,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1725 transitions. [2022-02-20 19:48:25,216 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1725 transitions. [2022-02-20 19:48:26,441 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1725 edges. 1725 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:26,463 INFO L225 Difference]: With dead ends: 928 [2022-02-20 19:48:26,463 INFO L226 Difference]: Without dead ends: 862 [2022-02-20 19:48:26,464 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 19:48:26,464 INFO L933 BasicCegarLoop]: 1621 mSDtfsCounter, 3 mSDsluCounter, 4820 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6441 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 19:48:26,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6441 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:48:26,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2022-02-20 19:48:26,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 862. [2022-02-20 19:48:26,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:26,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 862 states. Second operand has 862 states, 860 states have (on average 1.8406976744186045) internal successors, (1583), 861 states have internal predecessors, (1583), 0 states have call successors, (0), 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 19:48:26,482 INFO L74 IsIncluded]: Start isIncluded. First operand 862 states. Second operand has 862 states, 860 states have (on average 1.8406976744186045) internal successors, (1583), 861 states have internal predecessors, (1583), 0 states have call successors, (0), 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 19:48:26,483 INFO L87 Difference]: Start difference. First operand 862 states. Second operand has 862 states, 860 states have (on average 1.8406976744186045) internal successors, (1583), 861 states have internal predecessors, (1583), 0 states have call successors, (0), 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 19:48:26,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:26,516 INFO L93 Difference]: Finished difference Result 862 states and 1583 transitions. [2022-02-20 19:48:26,516 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1583 transitions. [2022-02-20 19:48:26,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:26,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:26,519 INFO L74 IsIncluded]: Start isIncluded. First operand has 862 states, 860 states have (on average 1.8406976744186045) internal successors, (1583), 861 states have internal predecessors, (1583), 0 states have call successors, (0), 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 862 states. [2022-02-20 19:48:26,521 INFO L87 Difference]: Start difference. First operand has 862 states, 860 states have (on average 1.8406976744186045) internal successors, (1583), 861 states have internal predecessors, (1583), 0 states have call successors, (0), 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 862 states. [2022-02-20 19:48:26,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:26,547 INFO L93 Difference]: Finished difference Result 862 states and 1583 transitions. [2022-02-20 19:48:26,547 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1583 transitions. [2022-02-20 19:48:26,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:26,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:26,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:26,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:26,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 862 states, 860 states have (on average 1.8406976744186045) internal successors, (1583), 861 states have internal predecessors, (1583), 0 states have call successors, (0), 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 19:48:26,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 1583 transitions. [2022-02-20 19:48:26,588 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 1583 transitions. Word has length 38 [2022-02-20 19:48:26,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:26,592 INFO L470 AbstractCegarLoop]: Abstraction has 862 states and 1583 transitions. [2022-02-20 19:48:26,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 5 states have internal predecessors, (38), 0 states have call successors, (0), 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 19:48:26,593 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 1583 transitions. [2022-02-20 19:48:26,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 19:48:26,595 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:26,596 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] [2022-02-20 19:48:26,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:48:26,596 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:26,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:26,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1060707035, now seen corresponding path program 1 times [2022-02-20 19:48:26,598 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:26,598 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53125130] [2022-02-20 19:48:26,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:26,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:26,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:26,731 INFO L290 TraceCheckUtils]: 0: Hoare triple {8941#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,731 INFO L290 TraceCheckUtils]: 1: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !(0 != main_#t~nondet52#1);havoc main_#t~nondet52#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet50#1, main2_#t~ret51#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,732 INFO L290 TraceCheckUtils]: 3: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet50#1 && main2_#t~nondet50#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet50#1;havoc main2_#t~nondet50#1; {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,733 INFO L290 TraceCheckUtils]: 4: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !(((((1 != main2_~input~0#1 && 2 != main2_~input~0#1) && 3 != main2_~input~0#1) && 4 != main2_~input~0#1) && 5 != main2_~input~0#1) && 6 != main2_~input~0#1);assume { :begin_inline_calculate_output } true;calculate_output_#in~input#1 := main2_~input~0#1;havoc calculate_output_#res#1;havoc calculate_output_#t~ret47#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,734 INFO L290 TraceCheckUtils]: 6: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,735 INFO L290 TraceCheckUtils]: 9: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,736 INFO L290 TraceCheckUtils]: 10: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,736 INFO L290 TraceCheckUtils]: 11: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,737 INFO L290 TraceCheckUtils]: 12: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,739 INFO L290 TraceCheckUtils]: 16: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,741 INFO L290 TraceCheckUtils]: 20: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,742 INFO L290 TraceCheckUtils]: 22: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,742 INFO L290 TraceCheckUtils]: 23: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,743 INFO L290 TraceCheckUtils]: 24: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,743 INFO L290 TraceCheckUtils]: 25: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,744 INFO L290 TraceCheckUtils]: 26: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,744 INFO L290 TraceCheckUtils]: 27: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,744 INFO L290 TraceCheckUtils]: 28: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,745 INFO L290 TraceCheckUtils]: 29: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,745 INFO L290 TraceCheckUtils]: 30: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,746 INFO L290 TraceCheckUtils]: 31: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,746 INFO L290 TraceCheckUtils]: 32: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,747 INFO L290 TraceCheckUtils]: 33: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,747 INFO L290 TraceCheckUtils]: 34: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,748 INFO L290 TraceCheckUtils]: 35: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,748 INFO L290 TraceCheckUtils]: 36: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,749 INFO L290 TraceCheckUtils]: 37: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,749 INFO L290 TraceCheckUtils]: 38: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,750 INFO L290 TraceCheckUtils]: 39: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,750 INFO L290 TraceCheckUtils]: 40: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,751 INFO L290 TraceCheckUtils]: 41: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,751 INFO L290 TraceCheckUtils]: 42: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,752 INFO L290 TraceCheckUtils]: 43: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,752 INFO L290 TraceCheckUtils]: 44: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} is VALID [2022-02-20 19:48:26,753 INFO L290 TraceCheckUtils]: 45: Hoare triple {8943#(and (<= ~a2~0 170) (= (+ (- 13) ~a7~0) 0) (= (+ (- 15) ~a24~0) 0) (<= (+ ~a17~0 124) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {8944#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:48:26,753 INFO L290 TraceCheckUtils]: 46: Hoare triple {8944#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {8944#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:48:26,753 INFO L290 TraceCheckUtils]: 47: Hoare triple {8944#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8944#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:48:26,754 INFO L290 TraceCheckUtils]: 48: Hoare triple {8944#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8944#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:48:26,754 INFO L290 TraceCheckUtils]: 49: Hoare triple {8944#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8944#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:48:26,755 INFO L290 TraceCheckUtils]: 50: Hoare triple {8944#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8944#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:48:26,755 INFO L290 TraceCheckUtils]: 51: Hoare triple {8944#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8944#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:48:26,755 INFO L290 TraceCheckUtils]: 52: Hoare triple {8944#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8944#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:48:26,756 INFO L290 TraceCheckUtils]: 53: Hoare triple {8944#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8944#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:48:26,756 INFO L290 TraceCheckUtils]: 54: Hoare triple {8944#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8944#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:48:26,757 INFO L290 TraceCheckUtils]: 55: Hoare triple {8944#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {8944#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:48:26,757 INFO L290 TraceCheckUtils]: 56: Hoare triple {8944#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {8944#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:48:26,757 INFO L290 TraceCheckUtils]: 57: Hoare triple {8944#(not (= (+ (- 3) ~a5~0) 0))} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {8944#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:48:26,758 INFO L290 TraceCheckUtils]: 58: Hoare triple {8944#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8944#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:48:26,758 INFO L290 TraceCheckUtils]: 59: Hoare triple {8944#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8944#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:48:26,758 INFO L290 TraceCheckUtils]: 60: Hoare triple {8944#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {8944#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:48:26,759 INFO L290 TraceCheckUtils]: 61: Hoare triple {8944#(not (= (+ (- 3) ~a5~0) 0))} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {8944#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:48:26,759 INFO L290 TraceCheckUtils]: 62: Hoare triple {8944#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {8944#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:48:26,760 INFO L290 TraceCheckUtils]: 63: Hoare triple {8944#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8944#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:48:26,760 INFO L290 TraceCheckUtils]: 64: Hoare triple {8944#(not (= (+ (- 3) ~a5~0) 0))} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {8944#(not (= (+ (- 3) ~a5~0) 0))} is VALID [2022-02-20 19:48:26,760 INFO L290 TraceCheckUtils]: 65: Hoare triple {8944#(not (= (+ (- 3) ~a5~0) 0))} assume (((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {8942#false} is VALID [2022-02-20 19:48:26,761 INFO L290 TraceCheckUtils]: 66: Hoare triple {8942#false} assume !false; {8942#false} is VALID [2022-02-20 19:48:26,762 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 19:48:26,762 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:26,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53125130] [2022-02-20 19:48:26,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53125130] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:26,762 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:26,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:26,763 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448736999] [2022-02-20 19:48:26,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:26,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 19:48:26,763 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:26,763 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 19:48:26,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:26,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 19:48:26,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:26,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 19:48:26,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 19:48:26,824 INFO L87 Difference]: Start difference. First operand 862 states and 1583 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 19:48:38,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:38,581 INFO L93 Difference]: Finished difference Result 3117 states and 5892 transitions. [2022-02-20 19:48:38,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 19:48:38,582 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2022-02-20 19:48:38,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 19:48:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5892 transitions. [2022-02-20 19:48:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 19:48:38,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 5892 transitions. [2022-02-20 19:48:38,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 5892 transitions. [2022-02-20 19:48:42,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5892 edges. 5892 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:43,116 INFO L225 Difference]: With dead ends: 3117 [2022-02-20 19:48:43,116 INFO L226 Difference]: Without dead ends: 2364 [2022-02-20 19:48:43,117 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:48:43,118 INFO L933 BasicCegarLoop]: 819 mSDtfsCounter, 2459 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 1161 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2459 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 6515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1161 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:48:43,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2459 Valid, 837 Invalid, 6515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1161 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-02-20 19:48:43,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2364 states. [2022-02-20 19:48:43,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2364 to 2364. [2022-02-20 19:48:43,158 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:43,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2364 states. Second operand has 2364 states, 2362 states have (on average 1.5651989839119391) internal successors, (3697), 2363 states have internal predecessors, (3697), 0 states have call successors, (0), 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 19:48:43,167 INFO L74 IsIncluded]: Start isIncluded. First operand 2364 states. Second operand has 2364 states, 2362 states have (on average 1.5651989839119391) internal successors, (3697), 2363 states have internal predecessors, (3697), 0 states have call successors, (0), 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 19:48:43,172 INFO L87 Difference]: Start difference. First operand 2364 states. Second operand has 2364 states, 2362 states have (on average 1.5651989839119391) internal successors, (3697), 2363 states have internal predecessors, (3697), 0 states have call successors, (0), 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 19:48:43,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:43,319 INFO L93 Difference]: Finished difference Result 2364 states and 3697 transitions. [2022-02-20 19:48:43,319 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 3697 transitions. [2022-02-20 19:48:43,321 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:43,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:43,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 2364 states, 2362 states have (on average 1.5651989839119391) internal successors, (3697), 2363 states have internal predecessors, (3697), 0 states have call successors, (0), 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 2364 states. [2022-02-20 19:48:43,342 INFO L87 Difference]: Start difference. First operand has 2364 states, 2362 states have (on average 1.5651989839119391) internal successors, (3697), 2363 states have internal predecessors, (3697), 0 states have call successors, (0), 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 2364 states. [2022-02-20 19:48:43,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:43,484 INFO L93 Difference]: Finished difference Result 2364 states and 3697 transitions. [2022-02-20 19:48:43,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 3697 transitions. [2022-02-20 19:48:43,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:43,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:43,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:43,488 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:43,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2364 states, 2362 states have (on average 1.5651989839119391) internal successors, (3697), 2363 states have internal predecessors, (3697), 0 states have call successors, (0), 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 19:48:43,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2364 states to 2364 states and 3697 transitions. [2022-02-20 19:48:43,634 INFO L78 Accepts]: Start accepts. Automaton has 2364 states and 3697 transitions. Word has length 67 [2022-02-20 19:48:43,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:43,635 INFO L470 AbstractCegarLoop]: Abstraction has 2364 states and 3697 transitions. [2022-02-20 19:48:43,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 3 states have internal predecessors, (67), 0 states have call successors, (0), 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 19:48:43,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2364 states and 3697 transitions. [2022-02-20 19:48:43,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:43,636 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:43,636 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] [2022-02-20 19:48:43,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:48:43,636 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:43,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:43,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1531755293, now seen corresponding path program 1 times [2022-02-20 19:48:43,637 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:43,637 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114886435] [2022-02-20 19:48:43,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:43,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:43,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:43,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {19213#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {19213#true} is VALID [2022-02-20 19:48:43,717 INFO L290 TraceCheckUtils]: 1: Hoare triple {19213#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {19213#true} is VALID [2022-02-20 19:48:43,717 INFO L290 TraceCheckUtils]: 2: Hoare triple {19213#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {19213#true} is VALID [2022-02-20 19:48:43,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {19213#true} assume 0 == ~r1~0 % 256; {19213#true} is VALID [2022-02-20 19:48:43,717 INFO L290 TraceCheckUtils]: 4: Hoare triple {19213#true} assume ~id1~0 >= 0; {19213#true} is VALID [2022-02-20 19:48:43,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {19213#true} assume 0 == ~st1~0; {19213#true} is VALID [2022-02-20 19:48:43,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {19213#true} assume ~send1~0 == ~id1~0; {19213#true} is VALID [2022-02-20 19:48:43,718 INFO L290 TraceCheckUtils]: 7: Hoare triple {19213#true} assume 0 == ~mode1~0 % 256; {19213#true} is VALID [2022-02-20 19:48:43,718 INFO L290 TraceCheckUtils]: 8: Hoare triple {19213#true} assume ~id2~0 >= 0; {19213#true} is VALID [2022-02-20 19:48:43,718 INFO L290 TraceCheckUtils]: 9: Hoare triple {19213#true} assume 0 == ~st2~0; {19213#true} is VALID [2022-02-20 19:48:43,718 INFO L290 TraceCheckUtils]: 10: Hoare triple {19213#true} assume ~send2~0 == ~id2~0; {19213#true} is VALID [2022-02-20 19:48:43,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {19213#true} assume 0 == ~mode2~0 % 256; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,719 INFO L290 TraceCheckUtils]: 12: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,720 INFO L290 TraceCheckUtils]: 13: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,720 INFO L290 TraceCheckUtils]: 15: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,721 INFO L290 TraceCheckUtils]: 16: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,721 INFO L290 TraceCheckUtils]: 18: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,722 INFO L290 TraceCheckUtils]: 19: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,722 INFO L290 TraceCheckUtils]: 20: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,723 INFO L290 TraceCheckUtils]: 22: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,723 INFO L290 TraceCheckUtils]: 23: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,724 INFO L290 TraceCheckUtils]: 24: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,724 INFO L290 TraceCheckUtils]: 25: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,724 INFO L290 TraceCheckUtils]: 26: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,725 INFO L290 TraceCheckUtils]: 27: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,725 INFO L290 TraceCheckUtils]: 28: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,725 INFO L290 TraceCheckUtils]: 29: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,726 INFO L290 TraceCheckUtils]: 30: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,726 INFO L290 TraceCheckUtils]: 31: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,726 INFO L290 TraceCheckUtils]: 32: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,727 INFO L290 TraceCheckUtils]: 33: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,727 INFO L290 TraceCheckUtils]: 34: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,728 INFO L290 TraceCheckUtils]: 36: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,729 INFO L290 TraceCheckUtils]: 38: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,729 INFO L290 TraceCheckUtils]: 39: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,730 INFO L290 TraceCheckUtils]: 40: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,730 INFO L290 TraceCheckUtils]: 41: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,730 INFO L290 TraceCheckUtils]: 42: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,731 INFO L290 TraceCheckUtils]: 43: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,731 INFO L290 TraceCheckUtils]: 44: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,731 INFO L290 TraceCheckUtils]: 45: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {19215#(= (+ (* (- 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;main1_~i2~0#1 := 0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,732 INFO L290 TraceCheckUtils]: 47: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,732 INFO L290 TraceCheckUtils]: 48: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,733 INFO L290 TraceCheckUtils]: 49: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,733 INFO L290 TraceCheckUtils]: 50: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,734 INFO L290 TraceCheckUtils]: 51: Hoare triple {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {19215#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:48:43,734 INFO L290 TraceCheckUtils]: 52: Hoare triple {19215#(= (+ (* (- 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; {19214#false} is VALID [2022-02-20 19:48:43,734 INFO L290 TraceCheckUtils]: 53: Hoare triple {19214#false} assume !(node2_~m2~0#1 != ~nomsg~0); {19214#false} is VALID [2022-02-20 19:48:43,734 INFO L290 TraceCheckUtils]: 54: Hoare triple {19214#false} ~mode2~0 := 0; {19214#false} is VALID [2022-02-20 19:48:43,734 INFO L290 TraceCheckUtils]: 55: Hoare triple {19214#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {19214#false} is VALID [2022-02-20 19:48:43,734 INFO L290 TraceCheckUtils]: 56: Hoare triple {19214#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {19214#false} is VALID [2022-02-20 19:48:43,734 INFO L290 TraceCheckUtils]: 57: Hoare triple {19214#false} assume !(node3_~m3~0#1 != ~nomsg~0); {19214#false} is VALID [2022-02-20 19:48:43,735 INFO L290 TraceCheckUtils]: 58: Hoare triple {19214#false} ~mode3~0 := 0; {19214#false} is VALID [2022-02-20 19:48:43,735 INFO L290 TraceCheckUtils]: 59: Hoare triple {19214#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {19214#false} is VALID [2022-02-20 19:48:43,735 INFO L290 TraceCheckUtils]: 60: Hoare triple {19214#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {19214#false} is VALID [2022-02-20 19:48:43,735 INFO L290 TraceCheckUtils]: 61: Hoare triple {19214#false} assume !(node4_~m4~0#1 != ~nomsg~0); {19214#false} is VALID [2022-02-20 19:48:43,735 INFO L290 TraceCheckUtils]: 62: Hoare triple {19214#false} ~mode4~0 := 0; {19214#false} is VALID [2022-02-20 19:48:43,735 INFO L290 TraceCheckUtils]: 63: Hoare triple {19214#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {19214#false} is VALID [2022-02-20 19:48:43,735 INFO L290 TraceCheckUtils]: 64: Hoare triple {19214#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {19214#false} is VALID [2022-02-20 19:48:43,735 INFO L290 TraceCheckUtils]: 65: Hoare triple {19214#false} assume !(node5_~m5~0#1 != ~nomsg~0); {19214#false} is VALID [2022-02-20 19:48:43,736 INFO L290 TraceCheckUtils]: 66: Hoare triple {19214#false} ~mode5~0 := 0; {19214#false} is VALID [2022-02-20 19:48:43,736 INFO L290 TraceCheckUtils]: 67: Hoare triple {19214#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {19214#false} is VALID [2022-02-20 19:48:43,736 INFO L290 TraceCheckUtils]: 68: Hoare triple {19214#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {19214#false} is VALID [2022-02-20 19:48:43,736 INFO L290 TraceCheckUtils]: 69: Hoare triple {19214#false} assume !(node6_~m6~0#1 != ~nomsg~0); {19214#false} is VALID [2022-02-20 19:48:43,736 INFO L290 TraceCheckUtils]: 70: Hoare triple {19214#false} ~mode6~0 := 0; {19214#false} is VALID [2022-02-20 19:48:43,736 INFO L290 TraceCheckUtils]: 71: Hoare triple {19214#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; {19214#false} is VALID [2022-02-20 19:48:43,736 INFO L290 TraceCheckUtils]: 72: Hoare triple {19214#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {19214#false} is VALID [2022-02-20 19:48:43,736 INFO L290 TraceCheckUtils]: 73: Hoare triple {19214#false} check_#res#1 := check_~tmp~1#1; {19214#false} is VALID [2022-02-20 19:48:43,737 INFO L290 TraceCheckUtils]: 74: Hoare triple {19214#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {19214#false} is VALID [2022-02-20 19:48:43,737 INFO L290 TraceCheckUtils]: 75: Hoare triple {19214#false} assume 0 == assert_~arg#1 % 256; {19214#false} is VALID [2022-02-20 19:48:43,737 INFO L290 TraceCheckUtils]: 76: Hoare triple {19214#false} assume !false; {19214#false} is VALID [2022-02-20 19:48:43,737 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 19:48:43,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:43,738 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114886435] [2022-02-20 19:48:43,738 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114886435] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:43,738 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:43,738 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:43,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200939843] [2022-02-20 19:48:43,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:43,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:48:43,739 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:43,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:48:43,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:43,788 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:43,788 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:43,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:43,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:43,789 INFO L87 Difference]: Start difference. First operand 2364 states and 3697 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:48:45,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:45,553 INFO L93 Difference]: Finished difference Result 2482 states and 3883 transitions. [2022-02-20 19:48:45,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:45,553 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:48:45,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:45,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:48:45,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:45,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:48:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:45,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1769 transitions. [2022-02-20 19:48:46,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1769 edges. 1769 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:47,114 INFO L225 Difference]: With dead ends: 2482 [2022-02-20 19:48:47,114 INFO L226 Difference]: Without dead ends: 2420 [2022-02-20 19:48:47,114 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 19:48:47,115 INFO L933 BasicCegarLoop]: 1651 mSDtfsCounter, 1523 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1523 SdHoareTripleChecker+Valid, 1751 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 19:48:47,115 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1523 Valid, 1751 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:48:47,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2022-02-20 19:48:47,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 2418. [2022-02-20 19:48:47,172 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:47,175 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2420 states. Second operand has 2418 states, 2416 states have (on average 1.5658112582781456) internal successors, (3783), 2417 states have internal predecessors, (3783), 0 states have call successors, (0), 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 19:48:47,177 INFO L74 IsIncluded]: Start isIncluded. First operand 2420 states. Second operand has 2418 states, 2416 states have (on average 1.5658112582781456) internal successors, (3783), 2417 states have internal predecessors, (3783), 0 states have call successors, (0), 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 19:48:47,180 INFO L87 Difference]: Start difference. First operand 2420 states. Second operand has 2418 states, 2416 states have (on average 1.5658112582781456) internal successors, (3783), 2417 states have internal predecessors, (3783), 0 states have call successors, (0), 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 19:48:47,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:47,321 INFO L93 Difference]: Finished difference Result 2420 states and 3784 transitions. [2022-02-20 19:48:47,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3784 transitions. [2022-02-20 19:48:47,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:47,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:47,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 2418 states, 2416 states have (on average 1.5658112582781456) internal successors, (3783), 2417 states have internal predecessors, (3783), 0 states have call successors, (0), 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 2420 states. [2022-02-20 19:48:47,329 INFO L87 Difference]: Start difference. First operand has 2418 states, 2416 states have (on average 1.5658112582781456) internal successors, (3783), 2417 states have internal predecessors, (3783), 0 states have call successors, (0), 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 2420 states. [2022-02-20 19:48:47,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:47,470 INFO L93 Difference]: Finished difference Result 2420 states and 3784 transitions. [2022-02-20 19:48:47,470 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3784 transitions. [2022-02-20 19:48:47,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:47,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:47,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:47,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:47,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2418 states, 2416 states have (on average 1.5658112582781456) internal successors, (3783), 2417 states have internal predecessors, (3783), 0 states have call successors, (0), 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 19:48:47,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2418 states to 2418 states and 3783 transitions. [2022-02-20 19:48:47,624 INFO L78 Accepts]: Start accepts. Automaton has 2418 states and 3783 transitions. Word has length 77 [2022-02-20 19:48:47,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:47,624 INFO L470 AbstractCegarLoop]: Abstraction has 2418 states and 3783 transitions. [2022-02-20 19:48:47,624 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:48:47,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2418 states and 3783 transitions. [2022-02-20 19:48:47,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:47,625 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:47,625 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] [2022-02-20 19:48:47,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:48:47,625 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:47,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:47,626 INFO L85 PathProgramCache]: Analyzing trace with hash 786172563, now seen corresponding path program 1 times [2022-02-20 19:48:47,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:47,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230333215] [2022-02-20 19:48:47,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:47,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:47,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {29035#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {29035#true} is VALID [2022-02-20 19:48:47,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {29035#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {29035#true} is VALID [2022-02-20 19:48:47,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {29035#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {29035#true} is VALID [2022-02-20 19:48:47,686 INFO L290 TraceCheckUtils]: 3: Hoare triple {29035#true} assume 0 == ~r1~0 % 256; {29035#true} is VALID [2022-02-20 19:48:47,686 INFO L290 TraceCheckUtils]: 4: Hoare triple {29035#true} assume ~id1~0 >= 0; {29035#true} is VALID [2022-02-20 19:48:47,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {29035#true} assume 0 == ~st1~0; {29035#true} is VALID [2022-02-20 19:48:47,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {29035#true} assume ~send1~0 == ~id1~0; {29035#true} is VALID [2022-02-20 19:48:47,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {29035#true} assume 0 == ~mode1~0 % 256; {29035#true} is VALID [2022-02-20 19:48:47,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {29035#true} assume ~id2~0 >= 0; {29035#true} is VALID [2022-02-20 19:48:47,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {29035#true} assume 0 == ~st2~0; {29035#true} is VALID [2022-02-20 19:48:47,687 INFO L290 TraceCheckUtils]: 10: Hoare triple {29035#true} assume ~send2~0 == ~id2~0; {29035#true} is VALID [2022-02-20 19:48:47,687 INFO L290 TraceCheckUtils]: 11: Hoare triple {29035#true} assume 0 == ~mode2~0 % 256; {29035#true} is VALID [2022-02-20 19:48:47,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {29035#true} assume ~id3~0 >= 0; {29035#true} is VALID [2022-02-20 19:48:47,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {29035#true} assume 0 == ~st3~0; {29035#true} is VALID [2022-02-20 19:48:47,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {29035#true} assume ~send3~0 == ~id3~0; {29035#true} is VALID [2022-02-20 19:48:47,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {29035#true} assume 0 == ~mode3~0 % 256; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,689 INFO L290 TraceCheckUtils]: 16: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,692 INFO L290 TraceCheckUtils]: 26: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,692 INFO L290 TraceCheckUtils]: 28: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,694 INFO L290 TraceCheckUtils]: 32: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,694 INFO L290 TraceCheckUtils]: 33: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,695 INFO L290 TraceCheckUtils]: 36: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,695 INFO L290 TraceCheckUtils]: 37: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,696 INFO L290 TraceCheckUtils]: 38: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,696 INFO L290 TraceCheckUtils]: 39: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,697 INFO L290 TraceCheckUtils]: 41: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,697 INFO L290 TraceCheckUtils]: 42: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,697 INFO L290 TraceCheckUtils]: 43: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,698 INFO L290 TraceCheckUtils]: 46: Hoare triple {29037#(= (+ (* (- 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;main1_~i2~0#1 := 0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,699 INFO L290 TraceCheckUtils]: 47: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,699 INFO L290 TraceCheckUtils]: 48: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,699 INFO L290 TraceCheckUtils]: 49: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,700 INFO L290 TraceCheckUtils]: 50: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,700 INFO L290 TraceCheckUtils]: 51: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,700 INFO L290 TraceCheckUtils]: 52: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,701 INFO L290 TraceCheckUtils]: 53: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,701 INFO L290 TraceCheckUtils]: 54: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,701 INFO L290 TraceCheckUtils]: 55: Hoare triple {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {29037#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:48:47,702 INFO L290 TraceCheckUtils]: 56: Hoare triple {29037#(= (+ (* (- 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; {29036#false} is VALID [2022-02-20 19:48:47,702 INFO L290 TraceCheckUtils]: 57: Hoare triple {29036#false} assume !(node3_~m3~0#1 != ~nomsg~0); {29036#false} is VALID [2022-02-20 19:48:47,702 INFO L290 TraceCheckUtils]: 58: Hoare triple {29036#false} ~mode3~0 := 0; {29036#false} is VALID [2022-02-20 19:48:47,702 INFO L290 TraceCheckUtils]: 59: Hoare triple {29036#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {29036#false} is VALID [2022-02-20 19:48:47,702 INFO L290 TraceCheckUtils]: 60: Hoare triple {29036#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {29036#false} is VALID [2022-02-20 19:48:47,702 INFO L290 TraceCheckUtils]: 61: Hoare triple {29036#false} assume !(node4_~m4~0#1 != ~nomsg~0); {29036#false} is VALID [2022-02-20 19:48:47,703 INFO L290 TraceCheckUtils]: 62: Hoare triple {29036#false} ~mode4~0 := 0; {29036#false} is VALID [2022-02-20 19:48:47,703 INFO L290 TraceCheckUtils]: 63: Hoare triple {29036#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {29036#false} is VALID [2022-02-20 19:48:47,703 INFO L290 TraceCheckUtils]: 64: Hoare triple {29036#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {29036#false} is VALID [2022-02-20 19:48:47,703 INFO L290 TraceCheckUtils]: 65: Hoare triple {29036#false} assume !(node5_~m5~0#1 != ~nomsg~0); {29036#false} is VALID [2022-02-20 19:48:47,703 INFO L290 TraceCheckUtils]: 66: Hoare triple {29036#false} ~mode5~0 := 0; {29036#false} is VALID [2022-02-20 19:48:47,703 INFO L290 TraceCheckUtils]: 67: Hoare triple {29036#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {29036#false} is VALID [2022-02-20 19:48:47,703 INFO L290 TraceCheckUtils]: 68: Hoare triple {29036#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {29036#false} is VALID [2022-02-20 19:48:47,703 INFO L290 TraceCheckUtils]: 69: Hoare triple {29036#false} assume !(node6_~m6~0#1 != ~nomsg~0); {29036#false} is VALID [2022-02-20 19:48:47,704 INFO L290 TraceCheckUtils]: 70: Hoare triple {29036#false} ~mode6~0 := 0; {29036#false} is VALID [2022-02-20 19:48:47,704 INFO L290 TraceCheckUtils]: 71: Hoare triple {29036#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; {29036#false} is VALID [2022-02-20 19:48:47,704 INFO L290 TraceCheckUtils]: 72: Hoare triple {29036#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {29036#false} is VALID [2022-02-20 19:48:47,704 INFO L290 TraceCheckUtils]: 73: Hoare triple {29036#false} check_#res#1 := check_~tmp~1#1; {29036#false} is VALID [2022-02-20 19:48:47,704 INFO L290 TraceCheckUtils]: 74: Hoare triple {29036#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {29036#false} is VALID [2022-02-20 19:48:47,704 INFO L290 TraceCheckUtils]: 75: Hoare triple {29036#false} assume 0 == assert_~arg#1 % 256; {29036#false} is VALID [2022-02-20 19:48:47,704 INFO L290 TraceCheckUtils]: 76: Hoare triple {29036#false} assume !false; {29036#false} is VALID [2022-02-20 19:48:47,705 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 19:48:47,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:47,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230333215] [2022-02-20 19:48:47,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230333215] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:47,705 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:47,705 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:47,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543112612] [2022-02-20 19:48:47,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:47,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:48:47,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:47,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:48:47,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:47,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:47,749 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:47,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:47,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:47,749 INFO L87 Difference]: Start difference. First operand 2418 states and 3783 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:48:49,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:49,540 INFO L93 Difference]: Finished difference Result 2638 states and 4131 transitions. [2022-02-20 19:48:49,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:49,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:48:49,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:49,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:48:49,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:49,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:48:49,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:49,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1769 transitions. [2022-02-20 19:48:50,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1769 edges. 1769 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:51,048 INFO L225 Difference]: With dead ends: 2638 [2022-02-20 19:48:51,048 INFO L226 Difference]: Without dead ends: 2522 [2022-02-20 19:48:51,048 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 19:48:51,049 INFO L933 BasicCegarLoop]: 1646 mSDtfsCounter, 1519 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1519 SdHoareTripleChecker+Valid, 1750 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 19:48:51,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1519 Valid, 1750 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:48:51,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2522 states. [2022-02-20 19:48:51,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2522 to 2520. [2022-02-20 19:48:51,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:51,113 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2522 states. Second operand has 2520 states, 2518 states have (on average 1.5663224781572678) internal successors, (3944), 2519 states have internal predecessors, (3944), 0 states have call successors, (0), 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 19:48:51,115 INFO L74 IsIncluded]: Start isIncluded. First operand 2522 states. Second operand has 2520 states, 2518 states have (on average 1.5663224781572678) internal successors, (3944), 2519 states have internal predecessors, (3944), 0 states have call successors, (0), 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 19:48:51,117 INFO L87 Difference]: Start difference. First operand 2522 states. Second operand has 2520 states, 2518 states have (on average 1.5663224781572678) internal successors, (3944), 2519 states have internal predecessors, (3944), 0 states have call successors, (0), 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 19:48:51,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:51,265 INFO L93 Difference]: Finished difference Result 2522 states and 3945 transitions. [2022-02-20 19:48:51,265 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 3945 transitions. [2022-02-20 19:48:51,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:51,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:51,270 INFO L74 IsIncluded]: Start isIncluded. First operand has 2520 states, 2518 states have (on average 1.5663224781572678) internal successors, (3944), 2519 states have internal predecessors, (3944), 0 states have call successors, (0), 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 2522 states. [2022-02-20 19:48:51,272 INFO L87 Difference]: Start difference. First operand has 2520 states, 2518 states have (on average 1.5663224781572678) internal successors, (3944), 2519 states have internal predecessors, (3944), 0 states have call successors, (0), 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 2522 states. [2022-02-20 19:48:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:51,424 INFO L93 Difference]: Finished difference Result 2522 states and 3945 transitions. [2022-02-20 19:48:51,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 3945 transitions. [2022-02-20 19:48:51,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:51,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:51,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:51,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:51,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2520 states, 2518 states have (on average 1.5663224781572678) internal successors, (3944), 2519 states have internal predecessors, (3944), 0 states have call successors, (0), 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 19:48:51,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2520 states to 2520 states and 3944 transitions. [2022-02-20 19:48:51,591 INFO L78 Accepts]: Start accepts. Automaton has 2520 states and 3944 transitions. Word has length 77 [2022-02-20 19:48:51,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:51,592 INFO L470 AbstractCegarLoop]: Abstraction has 2520 states and 3944 transitions. [2022-02-20 19:48:51,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:48:51,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2520 states and 3944 transitions. [2022-02-20 19:48:51,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:51,592 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:51,593 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] [2022-02-20 19:48:51,593 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:48:51,593 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:51,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:51,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1153858295, now seen corresponding path program 1 times [2022-02-20 19:48:51,593 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:51,594 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064905773] [2022-02-20 19:48:51,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:51,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:51,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:51,651 INFO L290 TraceCheckUtils]: 0: Hoare triple {39364#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {39364#true} is VALID [2022-02-20 19:48:51,651 INFO L290 TraceCheckUtils]: 1: Hoare triple {39364#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {39364#true} is VALID [2022-02-20 19:48:51,651 INFO L290 TraceCheckUtils]: 2: Hoare triple {39364#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {39364#true} is VALID [2022-02-20 19:48:51,651 INFO L290 TraceCheckUtils]: 3: Hoare triple {39364#true} assume 0 == ~r1~0 % 256; {39364#true} is VALID [2022-02-20 19:48:51,652 INFO L290 TraceCheckUtils]: 4: Hoare triple {39364#true} assume ~id1~0 >= 0; {39364#true} is VALID [2022-02-20 19:48:51,652 INFO L290 TraceCheckUtils]: 5: Hoare triple {39364#true} assume 0 == ~st1~0; {39364#true} is VALID [2022-02-20 19:48:51,652 INFO L290 TraceCheckUtils]: 6: Hoare triple {39364#true} assume ~send1~0 == ~id1~0; {39364#true} is VALID [2022-02-20 19:48:51,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {39364#true} assume 0 == ~mode1~0 % 256; {39364#true} is VALID [2022-02-20 19:48:51,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {39364#true} assume ~id2~0 >= 0; {39364#true} is VALID [2022-02-20 19:48:51,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {39364#true} assume 0 == ~st2~0; {39364#true} is VALID [2022-02-20 19:48:51,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {39364#true} assume ~send2~0 == ~id2~0; {39364#true} is VALID [2022-02-20 19:48:51,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {39364#true} assume 0 == ~mode2~0 % 256; {39364#true} is VALID [2022-02-20 19:48:51,652 INFO L290 TraceCheckUtils]: 12: Hoare triple {39364#true} assume ~id3~0 >= 0; {39364#true} is VALID [2022-02-20 19:48:51,652 INFO L290 TraceCheckUtils]: 13: Hoare triple {39364#true} assume 0 == ~st3~0; {39364#true} is VALID [2022-02-20 19:48:51,652 INFO L290 TraceCheckUtils]: 14: Hoare triple {39364#true} assume ~send3~0 == ~id3~0; {39364#true} is VALID [2022-02-20 19:48:51,652 INFO L290 TraceCheckUtils]: 15: Hoare triple {39364#true} assume 0 == ~mode3~0 % 256; {39364#true} is VALID [2022-02-20 19:48:51,652 INFO L290 TraceCheckUtils]: 16: Hoare triple {39364#true} assume ~id4~0 >= 0; {39364#true} is VALID [2022-02-20 19:48:51,652 INFO L290 TraceCheckUtils]: 17: Hoare triple {39364#true} assume 0 == ~st4~0; {39364#true} is VALID [2022-02-20 19:48:51,652 INFO L290 TraceCheckUtils]: 18: Hoare triple {39364#true} assume ~send4~0 == ~id4~0; {39364#true} is VALID [2022-02-20 19:48:51,653 INFO L290 TraceCheckUtils]: 19: Hoare triple {39364#true} assume 0 == ~mode4~0 % 256; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,653 INFO L290 TraceCheckUtils]: 20: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,654 INFO L290 TraceCheckUtils]: 21: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,654 INFO L290 TraceCheckUtils]: 22: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,655 INFO L290 TraceCheckUtils]: 23: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,655 INFO L290 TraceCheckUtils]: 24: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,655 INFO L290 TraceCheckUtils]: 25: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,656 INFO L290 TraceCheckUtils]: 26: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,656 INFO L290 TraceCheckUtils]: 27: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,658 INFO L290 TraceCheckUtils]: 31: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,658 INFO L290 TraceCheckUtils]: 32: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,658 INFO L290 TraceCheckUtils]: 33: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,659 INFO L290 TraceCheckUtils]: 34: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,659 INFO L290 TraceCheckUtils]: 35: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,659 INFO L290 TraceCheckUtils]: 36: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,660 INFO L290 TraceCheckUtils]: 37: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,660 INFO L290 TraceCheckUtils]: 38: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,660 INFO L290 TraceCheckUtils]: 39: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,661 INFO L290 TraceCheckUtils]: 40: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,661 INFO L290 TraceCheckUtils]: 41: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,661 INFO L290 TraceCheckUtils]: 42: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,662 INFO L290 TraceCheckUtils]: 43: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,662 INFO L290 TraceCheckUtils]: 44: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,662 INFO L290 TraceCheckUtils]: 45: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,663 INFO L290 TraceCheckUtils]: 46: Hoare triple {39366#(= (+ (* (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;main1_~i2~0#1 := 0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,663 INFO L290 TraceCheckUtils]: 47: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,664 INFO L290 TraceCheckUtils]: 48: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,664 INFO L290 TraceCheckUtils]: 49: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,664 INFO L290 TraceCheckUtils]: 50: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,665 INFO L290 TraceCheckUtils]: 51: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,665 INFO L290 TraceCheckUtils]: 52: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,665 INFO L290 TraceCheckUtils]: 53: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,666 INFO L290 TraceCheckUtils]: 54: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,666 INFO L290 TraceCheckUtils]: 55: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,666 INFO L290 TraceCheckUtils]: 56: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,667 INFO L290 TraceCheckUtils]: 57: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,667 INFO L290 TraceCheckUtils]: 58: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,667 INFO L290 TraceCheckUtils]: 59: Hoare triple {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {39366#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:48:51,668 INFO L290 TraceCheckUtils]: 60: Hoare triple {39366#(= (+ (* (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; {39365#false} is VALID [2022-02-20 19:48:51,668 INFO L290 TraceCheckUtils]: 61: Hoare triple {39365#false} assume !(node4_~m4~0#1 != ~nomsg~0); {39365#false} is VALID [2022-02-20 19:48:51,668 INFO L290 TraceCheckUtils]: 62: Hoare triple {39365#false} ~mode4~0 := 0; {39365#false} is VALID [2022-02-20 19:48:51,668 INFO L290 TraceCheckUtils]: 63: Hoare triple {39365#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {39365#false} is VALID [2022-02-20 19:48:51,668 INFO L290 TraceCheckUtils]: 64: Hoare triple {39365#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {39365#false} is VALID [2022-02-20 19:48:51,668 INFO L290 TraceCheckUtils]: 65: Hoare triple {39365#false} assume !(node5_~m5~0#1 != ~nomsg~0); {39365#false} is VALID [2022-02-20 19:48:51,668 INFO L290 TraceCheckUtils]: 66: Hoare triple {39365#false} ~mode5~0 := 0; {39365#false} is VALID [2022-02-20 19:48:51,668 INFO L290 TraceCheckUtils]: 67: Hoare triple {39365#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {39365#false} is VALID [2022-02-20 19:48:51,668 INFO L290 TraceCheckUtils]: 68: Hoare triple {39365#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {39365#false} is VALID [2022-02-20 19:48:51,669 INFO L290 TraceCheckUtils]: 69: Hoare triple {39365#false} assume !(node6_~m6~0#1 != ~nomsg~0); {39365#false} is VALID [2022-02-20 19:48:51,669 INFO L290 TraceCheckUtils]: 70: Hoare triple {39365#false} ~mode6~0 := 0; {39365#false} is VALID [2022-02-20 19:48:51,669 INFO L290 TraceCheckUtils]: 71: Hoare triple {39365#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; {39365#false} is VALID [2022-02-20 19:48:51,669 INFO L290 TraceCheckUtils]: 72: Hoare triple {39365#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {39365#false} is VALID [2022-02-20 19:48:51,669 INFO L290 TraceCheckUtils]: 73: Hoare triple {39365#false} check_#res#1 := check_~tmp~1#1; {39365#false} is VALID [2022-02-20 19:48:51,669 INFO L290 TraceCheckUtils]: 74: Hoare triple {39365#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {39365#false} is VALID [2022-02-20 19:48:51,669 INFO L290 TraceCheckUtils]: 75: Hoare triple {39365#false} assume 0 == assert_~arg#1 % 256; {39365#false} is VALID [2022-02-20 19:48:51,669 INFO L290 TraceCheckUtils]: 76: Hoare triple {39365#false} assume !false; {39365#false} is VALID [2022-02-20 19:48:51,669 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 19:48:51,669 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:51,669 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064905773] [2022-02-20 19:48:51,670 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1064905773] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:51,670 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:51,670 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:51,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809587566] [2022-02-20 19:48:51,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:51,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:48:51,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:51,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:48:51,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:51,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:51,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:51,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:51,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:51,715 INFO L87 Difference]: Start difference. First operand 2520 states and 3944 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:48:53,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:53,583 INFO L93 Difference]: Finished difference Result 2932 states and 4594 transitions. [2022-02-20 19:48:53,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:53,584 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:48:53,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:53,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:48:53,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:53,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:48:53,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:53,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1769 transitions. [2022-02-20 19:48:54,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1769 edges. 1769 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:55,126 INFO L225 Difference]: With dead ends: 2932 [2022-02-20 19:48:55,127 INFO L226 Difference]: Without dead ends: 2714 [2022-02-20 19:48:55,128 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 19:48:55,128 INFO L933 BasicCegarLoop]: 1641 mSDtfsCounter, 1515 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1515 SdHoareTripleChecker+Valid, 1749 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 19:48:55,129 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1515 Valid, 1749 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:48:55,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2714 states. [2022-02-20 19:48:55,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2714 to 2712. [2022-02-20 19:48:55,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:55,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2714 states. Second operand has 2712 states, 2710 states have (on average 1.5660516605166053) internal successors, (4244), 2711 states have internal predecessors, (4244), 0 states have call successors, (0), 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 19:48:55,222 INFO L74 IsIncluded]: Start isIncluded. First operand 2714 states. Second operand has 2712 states, 2710 states have (on average 1.5660516605166053) internal successors, (4244), 2711 states have internal predecessors, (4244), 0 states have call successors, (0), 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 19:48:55,223 INFO L87 Difference]: Start difference. First operand 2714 states. Second operand has 2712 states, 2710 states have (on average 1.5660516605166053) internal successors, (4244), 2711 states have internal predecessors, (4244), 0 states have call successors, (0), 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 19:48:55,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:55,394 INFO L93 Difference]: Finished difference Result 2714 states and 4245 transitions. [2022-02-20 19:48:55,394 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 4245 transitions. [2022-02-20 19:48:55,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:55,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:55,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 2712 states, 2710 states have (on average 1.5660516605166053) internal successors, (4244), 2711 states have internal predecessors, (4244), 0 states have call successors, (0), 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 2714 states. [2022-02-20 19:48:55,400 INFO L87 Difference]: Start difference. First operand has 2712 states, 2710 states have (on average 1.5660516605166053) internal successors, (4244), 2711 states have internal predecessors, (4244), 0 states have call successors, (0), 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 2714 states. [2022-02-20 19:48:55,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:55,575 INFO L93 Difference]: Finished difference Result 2714 states and 4245 transitions. [2022-02-20 19:48:55,575 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 4245 transitions. [2022-02-20 19:48:55,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:48:55,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:48:55,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:48:55,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:48:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2712 states, 2710 states have (on average 1.5660516605166053) internal successors, (4244), 2711 states have internal predecessors, (4244), 0 states have call successors, (0), 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 19:48:55,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2712 states to 2712 states and 4244 transitions. [2022-02-20 19:48:55,770 INFO L78 Accepts]: Start accepts. Automaton has 2712 states and 4244 transitions. Word has length 77 [2022-02-20 19:48:55,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:48:55,770 INFO L470 AbstractCegarLoop]: Abstraction has 2712 states and 4244 transitions. [2022-02-20 19:48:55,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:48:55,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2712 states and 4244 transitions. [2022-02-20 19:48:55,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:48:55,770 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:48:55,770 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] [2022-02-20 19:48:55,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:48:55,771 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:48:55,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:48:55,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1546824319, now seen corresponding path program 1 times [2022-02-20 19:48:55,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:48:55,771 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757285622] [2022-02-20 19:48:55,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:48:55,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:48:55,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:48:55,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {50653#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {50653#true} is VALID [2022-02-20 19:48:55,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {50653#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {50653#true} is VALID [2022-02-20 19:48:55,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {50653#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {50653#true} is VALID [2022-02-20 19:48:55,833 INFO L290 TraceCheckUtils]: 3: Hoare triple {50653#true} assume 0 == ~r1~0 % 256; {50653#true} is VALID [2022-02-20 19:48:55,833 INFO L290 TraceCheckUtils]: 4: Hoare triple {50653#true} assume ~id1~0 >= 0; {50653#true} is VALID [2022-02-20 19:48:55,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {50653#true} assume 0 == ~st1~0; {50653#true} is VALID [2022-02-20 19:48:55,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {50653#true} assume ~send1~0 == ~id1~0; {50653#true} is VALID [2022-02-20 19:48:55,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {50653#true} assume 0 == ~mode1~0 % 256; {50653#true} is VALID [2022-02-20 19:48:55,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {50653#true} assume ~id2~0 >= 0; {50653#true} is VALID [2022-02-20 19:48:55,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {50653#true} assume 0 == ~st2~0; {50653#true} is VALID [2022-02-20 19:48:55,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {50653#true} assume ~send2~0 == ~id2~0; {50653#true} is VALID [2022-02-20 19:48:55,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {50653#true} assume 0 == ~mode2~0 % 256; {50653#true} is VALID [2022-02-20 19:48:55,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {50653#true} assume ~id3~0 >= 0; {50653#true} is VALID [2022-02-20 19:48:55,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {50653#true} assume 0 == ~st3~0; {50653#true} is VALID [2022-02-20 19:48:55,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {50653#true} assume ~send3~0 == ~id3~0; {50653#true} is VALID [2022-02-20 19:48:55,834 INFO L290 TraceCheckUtils]: 15: Hoare triple {50653#true} assume 0 == ~mode3~0 % 256; {50653#true} is VALID [2022-02-20 19:48:55,834 INFO L290 TraceCheckUtils]: 16: Hoare triple {50653#true} assume ~id4~0 >= 0; {50653#true} is VALID [2022-02-20 19:48:55,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {50653#true} assume 0 == ~st4~0; {50653#true} is VALID [2022-02-20 19:48:55,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {50653#true} assume ~send4~0 == ~id4~0; {50653#true} is VALID [2022-02-20 19:48:55,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {50653#true} assume 0 == ~mode4~0 % 256; {50653#true} is VALID [2022-02-20 19:48:55,834 INFO L290 TraceCheckUtils]: 20: Hoare triple {50653#true} assume ~id5~0 >= 0; {50653#true} is VALID [2022-02-20 19:48:55,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {50653#true} assume 0 == ~st5~0; {50653#true} is VALID [2022-02-20 19:48:55,834 INFO L290 TraceCheckUtils]: 22: Hoare triple {50653#true} assume ~send5~0 == ~id5~0; {50653#true} is VALID [2022-02-20 19:48:55,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {50653#true} assume 0 == ~mode5~0 % 256; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,837 INFO L290 TraceCheckUtils]: 26: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,837 INFO L290 TraceCheckUtils]: 27: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,838 INFO L290 TraceCheckUtils]: 29: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,838 INFO L290 TraceCheckUtils]: 30: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,839 INFO L290 TraceCheckUtils]: 31: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,840 INFO L290 TraceCheckUtils]: 34: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,840 INFO L290 TraceCheckUtils]: 35: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,840 INFO L290 TraceCheckUtils]: 36: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,841 INFO L290 TraceCheckUtils]: 37: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,841 INFO L290 TraceCheckUtils]: 38: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,841 INFO L290 TraceCheckUtils]: 39: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,842 INFO L290 TraceCheckUtils]: 40: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,842 INFO L290 TraceCheckUtils]: 41: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,842 INFO L290 TraceCheckUtils]: 42: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,843 INFO L290 TraceCheckUtils]: 43: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,843 INFO L290 TraceCheckUtils]: 44: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,843 INFO L290 TraceCheckUtils]: 45: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,844 INFO L290 TraceCheckUtils]: 46: Hoare triple {50655#(= (+ (* (- 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;main1_~i2~0#1 := 0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,844 INFO L290 TraceCheckUtils]: 47: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,845 INFO L290 TraceCheckUtils]: 48: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,845 INFO L290 TraceCheckUtils]: 49: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,845 INFO L290 TraceCheckUtils]: 50: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,846 INFO L290 TraceCheckUtils]: 51: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,846 INFO L290 TraceCheckUtils]: 52: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,846 INFO L290 TraceCheckUtils]: 53: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,847 INFO L290 TraceCheckUtils]: 54: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,847 INFO L290 TraceCheckUtils]: 55: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,847 INFO L290 TraceCheckUtils]: 56: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,848 INFO L290 TraceCheckUtils]: 57: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,848 INFO L290 TraceCheckUtils]: 58: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,849 INFO L290 TraceCheckUtils]: 59: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,849 INFO L290 TraceCheckUtils]: 60: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,849 INFO L290 TraceCheckUtils]: 61: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,850 INFO L290 TraceCheckUtils]: 62: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,850 INFO L290 TraceCheckUtils]: 63: Hoare triple {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {50655#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:48:55,850 INFO L290 TraceCheckUtils]: 64: Hoare triple {50655#(= (+ (* (- 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; {50654#false} is VALID [2022-02-20 19:48:55,851 INFO L290 TraceCheckUtils]: 65: Hoare triple {50654#false} assume !(node5_~m5~0#1 != ~nomsg~0); {50654#false} is VALID [2022-02-20 19:48:55,851 INFO L290 TraceCheckUtils]: 66: Hoare triple {50654#false} ~mode5~0 := 0; {50654#false} is VALID [2022-02-20 19:48:55,851 INFO L290 TraceCheckUtils]: 67: Hoare triple {50654#false} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {50654#false} is VALID [2022-02-20 19:48:55,851 INFO L290 TraceCheckUtils]: 68: Hoare triple {50654#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {50654#false} is VALID [2022-02-20 19:48:55,851 INFO L290 TraceCheckUtils]: 69: Hoare triple {50654#false} assume !(node6_~m6~0#1 != ~nomsg~0); {50654#false} is VALID [2022-02-20 19:48:55,851 INFO L290 TraceCheckUtils]: 70: Hoare triple {50654#false} ~mode6~0 := 0; {50654#false} is VALID [2022-02-20 19:48:55,851 INFO L290 TraceCheckUtils]: 71: Hoare triple {50654#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; {50654#false} is VALID [2022-02-20 19:48:55,851 INFO L290 TraceCheckUtils]: 72: Hoare triple {50654#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {50654#false} is VALID [2022-02-20 19:48:55,852 INFO L290 TraceCheckUtils]: 73: Hoare triple {50654#false} check_#res#1 := check_~tmp~1#1; {50654#false} is VALID [2022-02-20 19:48:55,852 INFO L290 TraceCheckUtils]: 74: Hoare triple {50654#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {50654#false} is VALID [2022-02-20 19:48:55,852 INFO L290 TraceCheckUtils]: 75: Hoare triple {50654#false} assume 0 == assert_~arg#1 % 256; {50654#false} is VALID [2022-02-20 19:48:55,852 INFO L290 TraceCheckUtils]: 76: Hoare triple {50654#false} assume !false; {50654#false} is VALID [2022-02-20 19:48:55,852 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 19:48:55,852 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:48:55,852 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757285622] [2022-02-20 19:48:55,853 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757285622] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:48:55,853 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:48:55,853 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:48:55,853 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948685910] [2022-02-20 19:48:55,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:48:55,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:48:55,854 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:48:55,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:48:55,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:55,898 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:48:55,898 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:48:55,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:48:55,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:48:55,899 INFO L87 Difference]: Start difference. First operand 2712 states and 4244 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:48:57,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:57,915 INFO L93 Difference]: Finished difference Result 3484 states and 5454 transitions. [2022-02-20 19:48:57,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:48:57,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:48:57,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:48:57,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:48:57,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:48:57,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:48:57,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1769 transitions. [2022-02-20 19:48:59,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1769 edges. 1769 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:48:59,564 INFO L225 Difference]: With dead ends: 3484 [2022-02-20 19:48:59,564 INFO L226 Difference]: Without dead ends: 3074 [2022-02-20 19:48:59,565 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 19:48:59,566 INFO L933 BasicCegarLoop]: 1636 mSDtfsCounter, 1511 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1511 SdHoareTripleChecker+Valid, 1748 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 19:48:59,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1511 Valid, 1748 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:48:59,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3074 states. [2022-02-20 19:48:59,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3074 to 3072. [2022-02-20 19:48:59,729 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:48:59,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3074 states. Second operand has 3072 states, 3070 states have (on average 1.5635179153094463) internal successors, (4800), 3071 states have internal predecessors, (4800), 0 states have call successors, (0), 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 19:48:59,735 INFO L74 IsIncluded]: Start isIncluded. First operand 3074 states. Second operand has 3072 states, 3070 states have (on average 1.5635179153094463) internal successors, (4800), 3071 states have internal predecessors, (4800), 0 states have call successors, (0), 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 19:48:59,737 INFO L87 Difference]: Start difference. First operand 3074 states. Second operand has 3072 states, 3070 states have (on average 1.5635179153094463) internal successors, (4800), 3071 states have internal predecessors, (4800), 0 states have call successors, (0), 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 19:48:59,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:48:59,986 INFO L93 Difference]: Finished difference Result 3074 states and 4801 transitions. [2022-02-20 19:48:59,986 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 4801 transitions. [2022-02-20 19:49:00,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:49:00,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:49:00,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 3072 states, 3070 states have (on average 1.5635179153094463) internal successors, (4800), 3071 states have internal predecessors, (4800), 0 states have call successors, (0), 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 3074 states. [2022-02-20 19:49:00,027 INFO L87 Difference]: Start difference. First operand has 3072 states, 3070 states have (on average 1.5635179153094463) internal successors, (4800), 3071 states have internal predecessors, (4800), 0 states have call successors, (0), 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 3074 states. [2022-02-20 19:49:00,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:49:00,276 INFO L93 Difference]: Finished difference Result 3074 states and 4801 transitions. [2022-02-20 19:49:00,276 INFO L276 IsEmpty]: Start isEmpty. Operand 3074 states and 4801 transitions. [2022-02-20 19:49:00,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:49:00,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:49:00,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:49:00,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:49:00,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3072 states, 3070 states have (on average 1.5635179153094463) internal successors, (4800), 3071 states have internal predecessors, (4800), 0 states have call successors, (0), 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 19:49:00,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3072 states to 3072 states and 4800 transitions. [2022-02-20 19:49:00,522 INFO L78 Accepts]: Start accepts. Automaton has 3072 states and 4800 transitions. Word has length 77 [2022-02-20 19:49:00,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:49:00,523 INFO L470 AbstractCegarLoop]: Abstraction has 3072 states and 4800 transitions. [2022-02-20 19:49:00,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:49:00,523 INFO L276 IsEmpty]: Start isEmpty. Operand 3072 states and 4800 transitions. [2022-02-20 19:49:00,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:49:00,523 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:49:00,523 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] [2022-02-20 19:49:00,524 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:49:00,524 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:49:00,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:49:00,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1884617461, now seen corresponding path program 1 times [2022-02-20 19:49:00,525 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:49:00,525 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536976470] [2022-02-20 19:49:00,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:49:00,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:49:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:49:00,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {63754#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {63754#true} is VALID [2022-02-20 19:49:00,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {63754#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {63754#true} is VALID [2022-02-20 19:49:00,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {63754#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {63754#true} is VALID [2022-02-20 19:49:00,572 INFO L290 TraceCheckUtils]: 3: Hoare triple {63754#true} assume 0 == ~r1~0 % 256; {63754#true} is VALID [2022-02-20 19:49:00,572 INFO L290 TraceCheckUtils]: 4: Hoare triple {63754#true} assume ~id1~0 >= 0; {63754#true} is VALID [2022-02-20 19:49:00,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {63754#true} assume 0 == ~st1~0; {63754#true} is VALID [2022-02-20 19:49:00,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {63754#true} assume ~send1~0 == ~id1~0; {63754#true} is VALID [2022-02-20 19:49:00,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {63754#true} assume 0 == ~mode1~0 % 256; {63754#true} is VALID [2022-02-20 19:49:00,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {63754#true} assume ~id2~0 >= 0; {63754#true} is VALID [2022-02-20 19:49:00,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {63754#true} assume 0 == ~st2~0; {63754#true} is VALID [2022-02-20 19:49:00,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {63754#true} assume ~send2~0 == ~id2~0; {63754#true} is VALID [2022-02-20 19:49:00,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {63754#true} assume 0 == ~mode2~0 % 256; {63754#true} is VALID [2022-02-20 19:49:00,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {63754#true} assume ~id3~0 >= 0; {63754#true} is VALID [2022-02-20 19:49:00,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {63754#true} assume 0 == ~st3~0; {63754#true} is VALID [2022-02-20 19:49:00,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {63754#true} assume ~send3~0 == ~id3~0; {63754#true} is VALID [2022-02-20 19:49:00,573 INFO L290 TraceCheckUtils]: 15: Hoare triple {63754#true} assume 0 == ~mode3~0 % 256; {63754#true} is VALID [2022-02-20 19:49:00,573 INFO L290 TraceCheckUtils]: 16: Hoare triple {63754#true} assume ~id4~0 >= 0; {63754#true} is VALID [2022-02-20 19:49:00,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {63754#true} assume 0 == ~st4~0; {63754#true} is VALID [2022-02-20 19:49:00,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {63754#true} assume ~send4~0 == ~id4~0; {63754#true} is VALID [2022-02-20 19:49:00,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {63754#true} assume 0 == ~mode4~0 % 256; {63754#true} is VALID [2022-02-20 19:49:00,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {63754#true} assume ~id5~0 >= 0; {63754#true} is VALID [2022-02-20 19:49:00,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {63754#true} assume 0 == ~st5~0; {63754#true} is VALID [2022-02-20 19:49:00,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {63754#true} assume ~send5~0 == ~id5~0; {63754#true} is VALID [2022-02-20 19:49:00,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {63754#true} assume 0 == ~mode5~0 % 256; {63754#true} is VALID [2022-02-20 19:49:00,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {63754#true} assume ~id6~0 >= 0; {63754#true} is VALID [2022-02-20 19:49:00,574 INFO L290 TraceCheckUtils]: 25: Hoare triple {63754#true} assume 0 == ~st6~0; {63754#true} is VALID [2022-02-20 19:49:00,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {63754#true} assume ~send6~0 == ~id6~0; {63754#true} is VALID [2022-02-20 19:49:00,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {63754#true} assume 0 == ~mode6~0 % 256; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,575 INFO L290 TraceCheckUtils]: 28: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,576 INFO L290 TraceCheckUtils]: 30: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,576 INFO L290 TraceCheckUtils]: 31: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,577 INFO L290 TraceCheckUtils]: 32: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,577 INFO L290 TraceCheckUtils]: 33: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,577 INFO L290 TraceCheckUtils]: 34: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,577 INFO L290 TraceCheckUtils]: 35: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,578 INFO L290 TraceCheckUtils]: 36: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,578 INFO L290 TraceCheckUtils]: 37: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,578 INFO L290 TraceCheckUtils]: 38: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,579 INFO L290 TraceCheckUtils]: 39: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,579 INFO L290 TraceCheckUtils]: 40: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,580 INFO L290 TraceCheckUtils]: 41: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,580 INFO L290 TraceCheckUtils]: 42: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,580 INFO L290 TraceCheckUtils]: 43: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,581 INFO L290 TraceCheckUtils]: 44: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,581 INFO L290 TraceCheckUtils]: 45: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,581 INFO L290 TraceCheckUtils]: 46: Hoare triple {63756#(= (+ (* (- 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;main1_~i2~0#1 := 0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,582 INFO L290 TraceCheckUtils]: 47: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,582 INFO L290 TraceCheckUtils]: 48: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,582 INFO L290 TraceCheckUtils]: 49: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,583 INFO L290 TraceCheckUtils]: 50: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,583 INFO L290 TraceCheckUtils]: 51: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,584 INFO L290 TraceCheckUtils]: 52: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,584 INFO L290 TraceCheckUtils]: 53: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,584 INFO L290 TraceCheckUtils]: 54: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,585 INFO L290 TraceCheckUtils]: 55: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,585 INFO L290 TraceCheckUtils]: 56: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,585 INFO L290 TraceCheckUtils]: 57: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,586 INFO L290 TraceCheckUtils]: 58: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,586 INFO L290 TraceCheckUtils]: 59: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,586 INFO L290 TraceCheckUtils]: 60: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,587 INFO L290 TraceCheckUtils]: 61: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,587 INFO L290 TraceCheckUtils]: 62: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,587 INFO L290 TraceCheckUtils]: 63: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,588 INFO L290 TraceCheckUtils]: 64: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,588 INFO L290 TraceCheckUtils]: 65: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,589 INFO L290 TraceCheckUtils]: 66: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,589 INFO L290 TraceCheckUtils]: 67: Hoare triple {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume { :end_inline_node5 } true;assume { :begin_inline_node6 } true;havoc node6_#t~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {63756#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:49:00,589 INFO L290 TraceCheckUtils]: 68: Hoare triple {63756#(= (+ (* (- 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; {63755#false} is VALID [2022-02-20 19:49:00,590 INFO L290 TraceCheckUtils]: 69: Hoare triple {63755#false} assume !(node6_~m6~0#1 != ~nomsg~0); {63755#false} is VALID [2022-02-20 19:49:00,590 INFO L290 TraceCheckUtils]: 70: Hoare triple {63755#false} ~mode6~0 := 0; {63755#false} is VALID [2022-02-20 19:49:00,590 INFO L290 TraceCheckUtils]: 71: Hoare triple {63755#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; {63755#false} is VALID [2022-02-20 19:49:00,590 INFO L290 TraceCheckUtils]: 72: Hoare triple {63755#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 <= 1);check_~tmp~1#1 := 0; {63755#false} is VALID [2022-02-20 19:49:00,590 INFO L290 TraceCheckUtils]: 73: Hoare triple {63755#false} check_#res#1 := check_~tmp~1#1; {63755#false} is VALID [2022-02-20 19:49:00,590 INFO L290 TraceCheckUtils]: 74: Hoare triple {63755#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {63755#false} is VALID [2022-02-20 19:49:00,590 INFO L290 TraceCheckUtils]: 75: Hoare triple {63755#false} assume 0 == assert_~arg#1 % 256; {63755#false} is VALID [2022-02-20 19:49:00,590 INFO L290 TraceCheckUtils]: 76: Hoare triple {63755#false} assume !false; {63755#false} is VALID [2022-02-20 19:49:00,591 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 19:49:00,591 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:49:00,591 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536976470] [2022-02-20 19:49:00,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536976470] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:49:00,591 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:49:00,591 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:49:00,591 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575418885] [2022-02-20 19:49:00,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:49:00,592 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:49:00,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:49:00,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:49:00,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:49:00,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:49:00,644 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:49:00,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:49:00,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:49:00,645 INFO L87 Difference]: Start difference. First operand 3072 states and 4800 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:49:03,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:49:03,112 INFO L93 Difference]: Finished difference Result 4516 states and 7042 transitions. [2022-02-20 19:49:03,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:49:03,113 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:49:03,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:49:03,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:49:03,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:49:03,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:49:03,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1769 transitions. [2022-02-20 19:49:03,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1769 transitions. [2022-02-20 19:49:04,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1769 edges. 1769 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:49:04,886 INFO L225 Difference]: With dead ends: 4516 [2022-02-20 19:49:04,887 INFO L226 Difference]: Without dead ends: 3746 [2022-02-20 19:49:04,888 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 19:49:04,888 INFO L933 BasicCegarLoop]: 1631 mSDtfsCounter, 1507 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1507 SdHoareTripleChecker+Valid, 1747 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 19:49:04,888 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1507 Valid, 1747 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:49:04,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3746 states. [2022-02-20 19:49:05,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3746 to 3744. [2022-02-20 19:49:05,173 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:49:05,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3746 states. Second operand has 3744 states, 3742 states have (on average 1.5563869588455372) internal successors, (5824), 3743 states have internal predecessors, (5824), 0 states have call successors, (0), 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 19:49:05,178 INFO L74 IsIncluded]: Start isIncluded. First operand 3746 states. Second operand has 3744 states, 3742 states have (on average 1.5563869588455372) internal successors, (5824), 3743 states have internal predecessors, (5824), 0 states have call successors, (0), 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 19:49:05,181 INFO L87 Difference]: Start difference. First operand 3746 states. Second operand has 3744 states, 3742 states have (on average 1.5563869588455372) internal successors, (5824), 3743 states have internal predecessors, (5824), 0 states have call successors, (0), 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 19:49:05,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:49:05,537 INFO L93 Difference]: Finished difference Result 3746 states and 5825 transitions. [2022-02-20 19:49:05,537 INFO L276 IsEmpty]: Start isEmpty. Operand 3746 states and 5825 transitions. [2022-02-20 19:49:05,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:49:05,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:49:05,545 INFO L74 IsIncluded]: Start isIncluded. First operand has 3744 states, 3742 states have (on average 1.5563869588455372) internal successors, (5824), 3743 states have internal predecessors, (5824), 0 states have call successors, (0), 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 3746 states. [2022-02-20 19:49:05,548 INFO L87 Difference]: Start difference. First operand has 3744 states, 3742 states have (on average 1.5563869588455372) internal successors, (5824), 3743 states have internal predecessors, (5824), 0 states have call successors, (0), 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 3746 states. [2022-02-20 19:49:05,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:49:05,906 INFO L93 Difference]: Finished difference Result 3746 states and 5825 transitions. [2022-02-20 19:49:05,906 INFO L276 IsEmpty]: Start isEmpty. Operand 3746 states and 5825 transitions. [2022-02-20 19:49:05,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:49:05,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:49:05,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:49:05,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:49:05,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3744 states, 3742 states have (on average 1.5563869588455372) internal successors, (5824), 3743 states have internal predecessors, (5824), 0 states have call successors, (0), 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 19:49:06,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3744 states to 3744 states and 5824 transitions. [2022-02-20 19:49:06,346 INFO L78 Accepts]: Start accepts. Automaton has 3744 states and 5824 transitions. Word has length 77 [2022-02-20 19:49:06,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:49:06,347 INFO L470 AbstractCegarLoop]: Abstraction has 3744 states and 5824 transitions. [2022-02-20 19:49:06,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:49:06,347 INFO L276 IsEmpty]: Start isEmpty. Operand 3744 states and 5824 transitions. [2022-02-20 19:49:06,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-02-20 19:49:06,347 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:49:06,347 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] [2022-02-20 19:49:06,348 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:49:06,348 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:49:06,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:49:06,348 INFO L85 PathProgramCache]: Analyzing trace with hash -2001711063, now seen corresponding path program 1 times [2022-02-20 19:49:06,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:49:06,348 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113350265] [2022-02-20 19:49:06,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:49:06,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:49:06,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:49:06,451 INFO L290 TraceCheckUtils]: 0: Hoare triple {80263#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(32, 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;~inputC~0 := 3;~inputF~0 := 6;~inputA~0 := 1;~inputB~0 := 2;~inputD~0 := 4;~inputE~0 := 5;~a17~0 := -124;~a5~0 := 4;~a24~0 := 15;~a2~0 := 170;~a7~0 := 13; {80263#true} is VALID [2022-02-20 19:49:06,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {80263#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet52#1, main_#t~ret53#1, main_#t~ret54#1;assume -2147483648 <= main_#t~nondet52#1 && main_#t~nondet52#1 <= 2147483647; {80263#true} is VALID [2022-02-20 19:49:06,452 INFO L290 TraceCheckUtils]: 2: Hoare triple {80263#true} assume 0 != main_#t~nondet52#1;havoc main_#t~nondet52#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~nondet21#1, main1_#t~nondet22#1, main1_#t~nondet23#1, main1_#t~nondet24#1, main1_#t~nondet25#1, main1_#t~nondet26#1, main1_#t~nondet27#1, main1_#t~nondet28#1, main1_#t~nondet29#1, main1_#t~nondet30#1, main1_#t~nondet31#1, main1_#t~nondet32#1, main1_#t~nondet33#1, main1_#t~nondet34#1, main1_#t~nondet35#1, main1_#t~ret36#1, main1_#t~ret37#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;~r1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;assume -128 <= main1_#t~nondet12#1 && main1_#t~nondet12#1 <= 127;~id1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~st1~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~send1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;~mode1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~id2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~st2~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~send2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;~mode2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~id3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume -128 <= main1_#t~nondet21#1 && main1_#t~nondet21#1 <= 127;~st3~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~send3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;~mode3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~id4~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;assume -128 <= main1_#t~nondet25#1 && main1_#t~nondet25#1 <= 127;~st4~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~send4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;~mode4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~id5~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;assume -128 <= main1_#t~nondet29#1 && main1_#t~nondet29#1 <= 127;~st5~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~send5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;~mode5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~id6~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;assume -128 <= main1_#t~nondet33#1 && main1_#t~nondet33#1 <= 127;~st6~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~send6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;~mode6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {80263#true} is VALID [2022-02-20 19:49:06,452 INFO L290 TraceCheckUtils]: 3: Hoare triple {80263#true} assume 0 == ~r1~0 % 256; {80263#true} is VALID [2022-02-20 19:49:06,452 INFO L290 TraceCheckUtils]: 4: Hoare triple {80263#true} assume ~id1~0 >= 0; {80263#true} is VALID [2022-02-20 19:49:06,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {80263#true} assume 0 == ~st1~0; {80265#(<= ~st1~0 0)} is VALID [2022-02-20 19:49:06,453 INFO L290 TraceCheckUtils]: 6: Hoare triple {80265#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {80265#(<= ~st1~0 0)} is VALID [2022-02-20 19:49:06,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {80265#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {80265#(<= ~st1~0 0)} is VALID [2022-02-20 19:49:06,453 INFO L290 TraceCheckUtils]: 8: Hoare triple {80265#(<= ~st1~0 0)} assume ~id2~0 >= 0; {80265#(<= ~st1~0 0)} is VALID [2022-02-20 19:49:06,454 INFO L290 TraceCheckUtils]: 9: Hoare triple {80265#(<= ~st1~0 0)} assume 0 == ~st2~0; {80266#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:49:06,454 INFO L290 TraceCheckUtils]: 10: Hoare triple {80266#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {80266#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:49:06,454 INFO L290 TraceCheckUtils]: 11: Hoare triple {80266#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {80266#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:49:06,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {80266#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {80266#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:49:06,455 INFO L290 TraceCheckUtils]: 13: Hoare triple {80266#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {80267#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:49:06,455 INFO L290 TraceCheckUtils]: 14: Hoare triple {80267#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {80267#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:49:06,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {80267#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {80267#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:49:06,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {80267#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id4~0 >= 0; {80267#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:49:06,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {80267#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st4~0; {80268#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:49:06,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {80268#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send4~0 == ~id4~0; {80268#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:49:06,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {80268#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode4~0 % 256; {80268#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:49:06,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {80268#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id5~0 >= 0; {80268#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:49:06,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {80268#(<= (+ ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st5~0; {80269#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:49:06,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {80269#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send5~0 == ~id5~0; {80269#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:49:06,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {80269#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode5~0 % 256; {80269#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:49:06,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {80269#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id6~0 >= 0; {80269#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:49:06,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {80269#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~st6~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~send6~0 == ~id6~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,460 INFO L290 TraceCheckUtils]: 27: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume 0 == ~mode6~0 % 256; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,460 INFO L290 TraceCheckUtils]: 28: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id2~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id3~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id4~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id5~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,462 INFO L290 TraceCheckUtils]: 32: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id1~0 != ~id6~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,462 INFO L290 TraceCheckUtils]: 33: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id3~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,462 INFO L290 TraceCheckUtils]: 34: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id4~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,463 INFO L290 TraceCheckUtils]: 35: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id5~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,463 INFO L290 TraceCheckUtils]: 36: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id2~0 != ~id6~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,463 INFO L290 TraceCheckUtils]: 37: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id4~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,464 INFO L290 TraceCheckUtils]: 38: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id5~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,464 INFO L290 TraceCheckUtils]: 39: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id3~0 != ~id6~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,464 INFO L290 TraceCheckUtils]: 40: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id5~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,465 INFO L290 TraceCheckUtils]: 41: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id4~0 != ~id6~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,465 INFO L290 TraceCheckUtils]: 42: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume ~id5~0 != ~id6~0;init_~tmp~0#1 := 1; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,465 INFO L290 TraceCheckUtils]: 43: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} init_#res#1 := init_~tmp~0#1; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,466 INFO L290 TraceCheckUtils]: 44: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} main1_#t~ret36#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret36#1 && main1_#t~ret36#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret36#1;havoc main1_#t~ret36#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main1_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,466 INFO L290 TraceCheckUtils]: 45: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,466 INFO L290 TraceCheckUtils]: 46: Hoare triple {80270#(<= (+ ~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;main1_~i2~0#1 := 0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,467 INFO L290 TraceCheckUtils]: 47: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !false;assume { :begin_inline_node1 } true;havoc node1_#t~ite5#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,467 INFO L290 TraceCheckUtils]: 48: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode1~0 % 256); {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,467 INFO L290 TraceCheckUtils]: 49: Hoare triple {80270#(<= (+ ~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~ite5#1 := ~send1~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,468 INFO L290 TraceCheckUtils]: 50: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p1_new~0 := (if node1_#t~ite5#1 % 256 <= 127 then node1_#t~ite5#1 % 256 else node1_#t~ite5#1 % 256 - 256);havoc node1_#t~ite5#1;~mode1~0 := 1; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,468 INFO L290 TraceCheckUtils]: 51: Hoare triple {80270#(<= (+ ~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~ite6#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,468 INFO L290 TraceCheckUtils]: 52: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode2~0 % 256); {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,469 INFO L290 TraceCheckUtils]: 53: Hoare triple {80270#(<= (+ ~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~ite6#1 := ~send2~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,469 INFO L290 TraceCheckUtils]: 54: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p2_new~0 := (if node2_#t~ite6#1 % 256 <= 127 then node2_#t~ite6#1 % 256 else node2_#t~ite6#1 % 256 - 256);havoc node2_#t~ite6#1;~mode2~0 := 1; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,469 INFO L290 TraceCheckUtils]: 55: Hoare triple {80270#(<= (+ ~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~ite7#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,470 INFO L290 TraceCheckUtils]: 56: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode3~0 % 256); {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,470 INFO L290 TraceCheckUtils]: 57: Hoare triple {80270#(<= (+ ~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~ite7#1 := ~send3~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,470 INFO L290 TraceCheckUtils]: 58: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p3_new~0 := (if node3_#t~ite7#1 % 256 <= 127 then node3_#t~ite7#1 % 256 else node3_#t~ite7#1 % 256 - 256);havoc node3_#t~ite7#1;~mode3~0 := 1; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,471 INFO L290 TraceCheckUtils]: 59: Hoare triple {80270#(<= (+ ~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~ite8#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,471 INFO L290 TraceCheckUtils]: 60: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode4~0 % 256); {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,471 INFO L290 TraceCheckUtils]: 61: Hoare triple {80270#(<= (+ ~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~ite8#1 := ~send4~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,472 INFO L290 TraceCheckUtils]: 62: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p4_new~0 := (if node4_#t~ite8#1 % 256 <= 127 then node4_#t~ite8#1 % 256 else node4_#t~ite8#1 % 256 - 256);havoc node4_#t~ite8#1;~mode4~0 := 1; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,472 INFO L290 TraceCheckUtils]: 63: Hoare triple {80270#(<= (+ ~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~ite9#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,472 INFO L290 TraceCheckUtils]: 64: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode5~0 % 256); {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,473 INFO L290 TraceCheckUtils]: 65: Hoare triple {80270#(<= (+ ~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~ite9#1 := ~send5~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,473 INFO L290 TraceCheckUtils]: 66: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p5_new~0 := (if node5_#t~ite9#1 % 256 <= 127 then node5_#t~ite9#1 % 256 else node5_#t~ite9#1 % 256 - 256);havoc node5_#t~ite9#1;~mode5~0 := 1; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,473 INFO L290 TraceCheckUtils]: 67: Hoare triple {80270#(<= (+ ~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~ite10#1, node6_~m6~0#1;havoc node6_~m6~0#1;node6_~m6~0#1 := ~nomsg~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,474 INFO L290 TraceCheckUtils]: 68: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} assume !(0 != ~mode6~0 % 256); {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,474 INFO L290 TraceCheckUtils]: 69: Hoare triple {80270#(<= (+ ~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~ite10#1 := ~p6_new~0; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,474 INFO L290 TraceCheckUtils]: 70: Hoare triple {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} ~p6_new~0 := (if node6_#t~ite10#1 % 256 <= 127 then node6_#t~ite10#1 % 256 else node6_#t~ite10#1 % 256 - 256);havoc node6_#t~ite10#1;~mode6~0 := 1; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,475 INFO L290 TraceCheckUtils]: 71: Hoare triple {80270#(<= (+ ~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; {80270#(<= (+ ~st5~0 ~st4~0 ~st3~0 ~st2~0 ~st1~0 ~st6~0) 0)} is VALID [2022-02-20 19:49:06,475 INFO L290 TraceCheckUtils]: 72: Hoare triple {80270#(<= (+ ~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; {80264#false} is VALID [2022-02-20 19:49:06,475 INFO L290 TraceCheckUtils]: 73: Hoare triple {80264#false} check_#res#1 := check_~tmp~1#1; {80264#false} is VALID [2022-02-20 19:49:06,475 INFO L290 TraceCheckUtils]: 74: Hoare triple {80264#false} main1_#t~ret37#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret37#1 && main1_#t~ret37#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret37#1;havoc main1_#t~ret37#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main1_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {80264#false} is VALID [2022-02-20 19:49:06,475 INFO L290 TraceCheckUtils]: 75: Hoare triple {80264#false} assume 0 == assert_~arg#1 % 256; {80264#false} is VALID [2022-02-20 19:49:06,476 INFO L290 TraceCheckUtils]: 76: Hoare triple {80264#false} assume !false; {80264#false} is VALID [2022-02-20 19:49:06,476 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 19:49:06,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:49:06,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113350265] [2022-02-20 19:49:06,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113350265] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:49:06,476 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:49:06,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:49:06,477 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279900539] [2022-02-20 19:49:06,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:49:06,477 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2022-02-20 19:49:06,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:49:06,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 19:49:06,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:49:06,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:49:06,529 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:49:06,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:49:06,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:49:06,529 INFO L87 Difference]: Start difference. First operand 3744 states and 5824 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)