./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label02.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.8.ufo.UNBOUNDED.pals+Problem12_label02.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 82a99c0caa947a7848bb6875be4893ad373e372b2b1f190b4cefbfd2e0a95c5c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:53:00,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:53:00,962 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:53:00,995 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:53:00,996 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:53:00,998 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:53:00,999 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:53:01,002 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:53:01,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:53:01,006 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:53:01,007 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:53:01,008 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:53:01,008 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:53:01,010 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:53:01,011 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:53:01,014 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:53:01,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:53:01,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:53:01,017 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:53:01,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:53:01,023 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:53:01,023 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:53:01,025 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:53:01,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:53:01,030 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:53:01,030 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:53:01,030 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:53:01,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:53:01,032 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:53:01,033 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:53:01,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:53:01,034 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:53:01,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:53:01,036 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:53:01,037 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:53:01,037 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:53:01,037 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:53:01,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:53:01,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:53:01,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:53:01,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:53:01,040 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:53:01,064 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:53:01,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:53:01,064 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:53:01,065 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:53:01,065 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:53:01,065 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:53:01,066 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:53:01,066 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:53:01,066 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:53:01,066 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:53:01,067 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:53:01,067 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:53:01,067 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:53:01,068 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:53:01,068 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:53:01,068 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:53:01,068 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:53:01,068 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:53:01,069 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:53:01,069 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:53:01,069 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:53:01,069 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:53:01,069 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:53:01,069 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:53:01,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:53:01,070 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:53:01,070 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:53:01,070 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:53:01,070 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:53:01,070 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:53:01,071 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:53:01,071 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:53:01,071 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:53:01,071 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 -> 82a99c0caa947a7848bb6875be4893ad373e372b2b1f190b4cefbfd2e0a95c5c [2022-02-20 19:53:01,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:53:01,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:53:01,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:53:01,291 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:53:01,291 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:53:01,292 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label02.c [2022-02-20 19:53:01,333 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8711b3ba/5c52962249614cf19b27938f1ac23e3d/FLAG191a565b4 [2022-02-20 19:53:01,821 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:53:01,821 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label02.c [2022-02-20 19:53:01,847 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8711b3ba/5c52962249614cf19b27938f1ac23e3d/FLAG191a565b4 [2022-02-20 19:53:02,070 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f8711b3ba/5c52962249614cf19b27938f1ac23e3d [2022-02-20 19:53:02,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:53:02,074 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:53:02,076 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:53:02,076 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:53:02,086 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:53:02,087 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:53:02" (1/1) ... [2022-02-20 19:53:02,087 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23f17eba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:02, skipping insertion in model container [2022-02-20 19:53:02,088 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:53:02" (1/1) ... [2022-02-20 19:53:02,092 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:53:02,173 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:53:02,555 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.8.ufo.UNBOUNDED.pals+Problem12_label02.c[26888,26901] [2022-02-20 19:53:02,597 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.8.ufo.UNBOUNDED.pals+Problem12_label02.c[34178,34191] [2022-02-20 19:53:03,126 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:53:03,136 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:53:03,190 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.8.ufo.UNBOUNDED.pals+Problem12_label02.c[26888,26901] [2022-02-20 19:53:03,203 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.8.ufo.UNBOUNDED.pals+Problem12_label02.c[34178,34191] [2022-02-20 19:53:03,546 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:53:03,583 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:53:03,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:03 WrapperNode [2022-02-20 19:53:03,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:53:03,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:53:03,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:53:03,584 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:53:03,589 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:53:03" (1/1) ... [2022-02-20 19:53:03,632 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:53:03" (1/1) ... [2022-02-20 19:53:03,977 INFO L137 Inliner]: procedures = 40, calls = 25, calls flagged for inlining = 20, calls inlined = 20, statements flattened = 5279 [2022-02-20 19:53:03,977 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:53:03,978 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:53:03,978 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:53:03,978 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:53:03,984 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:03" (1/1) ... [2022-02-20 19:53:03,984 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:03" (1/1) ... [2022-02-20 19:53:04,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:03" (1/1) ... [2022-02-20 19:53:04,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:03" (1/1) ... [2022-02-20 19:53:04,116 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:03" (1/1) ... [2022-02-20 19:53:04,142 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:03" (1/1) ... [2022-02-20 19:53:04,160 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:03" (1/1) ... [2022-02-20 19:53:04,199 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:53:04,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:53:04,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:53:04,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:53:04,202 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:03" (1/1) ... [2022-02-20 19:53:04,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:53:04,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:53:04,236 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:53:04,263 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:53:04,272 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:53:04,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:53:04,272 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:53:04,272 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:53:04,372 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:53:04,373 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:53:10,845 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:53:10,857 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:53:10,857 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:53:10,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:53:10 BoogieIcfgContainer [2022-02-20 19:53:10,860 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:53:10,861 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:53:10,861 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:53:10,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:53:10,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:53:02" (1/3) ... [2022-02-20 19:53:10,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dec72c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:53:10, skipping insertion in model container [2022-02-20 19:53:10,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:53:03" (2/3) ... [2022-02-20 19:53:10,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5dec72c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:53:10, skipping insertion in model container [2022-02-20 19:53:10,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:53:10" (3/3) ... [2022-02-20 19:53:10,865 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.8.ufo.UNBOUNDED.pals+Problem12_label02.c [2022-02-20 19:53:10,869 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:53:10,869 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:53:10,899 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:53:10,904 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:53:10,904 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:53:10,941 INFO L276 IsEmpty]: Start isEmpty. Operand has 965 states, 962 states have (on average 1.8960498960498962) internal successors, (1824), 964 states have internal predecessors, (1824), 0 states have call successors, (0), 0 states have 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:53:10,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 19:53:10,948 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:10,948 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] [2022-02-20 19:53:10,949 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:10,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:10,952 INFO L85 PathProgramCache]: Analyzing trace with hash -805214309, now seen corresponding path program 1 times [2022-02-20 19:53:10,958 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:10,958 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541236640] [2022-02-20 19:53:10,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:10,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:11,209 INFO L290 TraceCheckUtils]: 0: Hoare triple {968#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;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {968#true} is VALID [2022-02-20 19:53:11,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {968#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {968#true} is VALID [2022-02-20 19:53:11,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {968#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#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~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {968#true} is VALID [2022-02-20 19:53:11,210 INFO L290 TraceCheckUtils]: 3: Hoare triple {968#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {968#true} is VALID [2022-02-20 19:53:11,211 INFO L290 TraceCheckUtils]: 4: Hoare triple {968#true} init_#res#1 := init_~tmp~0#1; {968#true} is VALID [2022-02-20 19:53:11,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {968#true} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {968#true} is VALID [2022-02-20 19:53:11,214 INFO L290 TraceCheckUtils]: 6: Hoare triple {968#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {969#false} is VALID [2022-02-20 19:53:11,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {969#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;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {969#false} is VALID [2022-02-20 19:53:11,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:11,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {969#false} assume !(0 != ~mode1~0 % 256); {969#false} is VALID [2022-02-20 19:53:11,215 INFO L290 TraceCheckUtils]: 10: Hoare triple {969#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {969#false} is VALID [2022-02-20 19:53:11,215 INFO L290 TraceCheckUtils]: 11: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:11,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:11,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {969#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:11,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {969#false} assume !(node2_~m2~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:11,216 INFO L290 TraceCheckUtils]: 15: Hoare triple {969#false} ~mode2~0 := 0; {969#false} is VALID [2022-02-20 19:53:11,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:11,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {969#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:11,216 INFO L290 TraceCheckUtils]: 18: Hoare triple {969#false} assume !(node3_~m3~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:11,216 INFO L290 TraceCheckUtils]: 19: Hoare triple {969#false} ~mode3~0 := 0; {969#false} is VALID [2022-02-20 19:53:11,217 INFO L290 TraceCheckUtils]: 20: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:11,217 INFO L290 TraceCheckUtils]: 21: Hoare triple {969#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:11,217 INFO L290 TraceCheckUtils]: 22: Hoare triple {969#false} assume !(node4_~m4~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:11,217 INFO L290 TraceCheckUtils]: 23: Hoare triple {969#false} ~mode4~0 := 0; {969#false} is VALID [2022-02-20 19:53:11,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:11,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {969#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:11,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {969#false} assume !(node5_~m5~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:11,218 INFO L290 TraceCheckUtils]: 27: Hoare triple {969#false} ~mode5~0 := 0; {969#false} is VALID [2022-02-20 19:53:11,218 INFO L290 TraceCheckUtils]: 28: Hoare triple {969#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; {969#false} is VALID [2022-02-20 19:53:11,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {969#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:11,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {969#false} assume !(node6_~m6~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:11,219 INFO L290 TraceCheckUtils]: 31: Hoare triple {969#false} ~mode6~0 := 0; {969#false} is VALID [2022-02-20 19:53:11,219 INFO L290 TraceCheckUtils]: 32: Hoare triple {969#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:11,219 INFO L290 TraceCheckUtils]: 33: Hoare triple {969#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:11,219 INFO L290 TraceCheckUtils]: 34: Hoare triple {969#false} assume !(node7_~m7~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:11,219 INFO L290 TraceCheckUtils]: 35: Hoare triple {969#false} ~mode7~0 := 0; {969#false} is VALID [2022-02-20 19:53:11,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {969#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:11,220 INFO L290 TraceCheckUtils]: 37: Hoare triple {969#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {969#false} is VALID [2022-02-20 19:53:11,220 INFO L290 TraceCheckUtils]: 38: Hoare triple {969#false} assume !(node8_~m8~0#1 != ~nomsg~0); {969#false} is VALID [2022-02-20 19:53:11,220 INFO L290 TraceCheckUtils]: 39: Hoare triple {969#false} ~mode8~0 := 0; {969#false} is VALID [2022-02-20 19:53:11,220 INFO L290 TraceCheckUtils]: 40: Hoare triple {969#false} assume { :end_inline_node8 } 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;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {969#false} is VALID [2022-02-20 19:53:11,221 INFO L290 TraceCheckUtils]: 41: Hoare triple {969#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {969#false} is VALID [2022-02-20 19:53:11,221 INFO L290 TraceCheckUtils]: 42: Hoare triple {969#false} check_#res#1 := check_~tmp~1#1; {969#false} is VALID [2022-02-20 19:53:11,221 INFO L290 TraceCheckUtils]: 43: Hoare triple {969#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {969#false} is VALID [2022-02-20 19:53:11,221 INFO L290 TraceCheckUtils]: 44: Hoare triple {969#false} assume 0 == assert_~arg#1 % 256; {969#false} is VALID [2022-02-20 19:53:11,221 INFO L290 TraceCheckUtils]: 45: Hoare triple {969#false} assume !false; {969#false} is VALID [2022-02-20 19:53:11,222 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:53:11,222 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:11,223 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541236640] [2022-02-20 19:53:11,223 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541236640] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:11,223 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:11,223 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:53:11,224 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724154244] [2022-02-20 19:53:11,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:11,228 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 19:53:11,229 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:11,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:11,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:11,269 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 19:53:11,269 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:11,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 19:53:11,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 19:53:11,286 INFO L87 Difference]: Start difference. First operand has 965 states, 962 states have (on average 1.8960498960498962) internal successors, (1824), 964 states have internal predecessors, (1824), 0 states have call successors, (0), 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 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:12,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:12,546 INFO L93 Difference]: Finished difference Result 1861 states and 3516 transitions. [2022-02-20 19:53:12,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 19:53:12,547 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 19:53:12,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:12,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:12,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3516 transitions. [2022-02-20 19:53:12,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:12,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 3516 transitions. [2022-02-20 19:53:12,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 3516 transitions. [2022-02-20 19:53:15,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3516 edges. 3516 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:15,125 INFO L225 Difference]: With dead ends: 1861 [2022-02-20 19:53:15,126 INFO L226 Difference]: Without dead ends: 899 [2022-02-20 19:53:15,130 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:53:15,132 INFO L933 BasicCegarLoop]: 1755 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, 1755 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:53:15,132 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 1755 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:15,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2022-02-20 19:53:15,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2022-02-20 19:53:15,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:15,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have 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:53:15,192 INFO L74 IsIncluded]: Start isIncluded. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have 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:53:15,194 INFO L87 Difference]: Start difference. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have 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:53:15,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:15,224 INFO L93 Difference]: Finished difference Result 899 states and 1691 transitions. [2022-02-20 19:53:15,224 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1691 transitions. [2022-02-20 19:53:15,227 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:15,227 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:15,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 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 899 states. [2022-02-20 19:53:15,231 INFO L87 Difference]: Start difference. First operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 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 899 states. [2022-02-20 19:53:15,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:15,261 INFO L93 Difference]: Finished difference Result 899 states and 1691 transitions. [2022-02-20 19:53:15,261 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1691 transitions. [2022-02-20 19:53:15,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:15,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:15,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:15,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:15,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 897 states have (on average 1.8851727982162765) internal successors, (1691), 898 states have internal predecessors, (1691), 0 states have call successors, (0), 0 states have 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:53:15,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1691 transitions. [2022-02-20 19:53:15,295 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1691 transitions. Word has length 46 [2022-02-20 19:53:15,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:15,295 INFO L470 AbstractCegarLoop]: Abstraction has 899 states and 1691 transitions. [2022-02-20 19:53:15,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:15,296 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1691 transitions. [2022-02-20 19:53:15,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 19:53:15,296 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:15,297 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] [2022-02-20 19:53:15,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:53:15,297 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:15,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:15,298 INFO L85 PathProgramCache]: Analyzing trace with hash 2117945689, now seen corresponding path program 1 times [2022-02-20 19:53:15,298 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:15,298 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011345132] [2022-02-20 19:53:15,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:15,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:15,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:15,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {5583#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;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {5583#true} is VALID [2022-02-20 19:53:15,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {5583#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {5583#true} is VALID [2022-02-20 19:53:15,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {5583#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#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~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {5583#true} is VALID [2022-02-20 19:53:15,387 INFO L290 TraceCheckUtils]: 3: Hoare triple {5583#true} assume !(0 == ~r1~0 % 256);init_~tmp~0#1 := 0; {5585#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:53:15,387 INFO L290 TraceCheckUtils]: 4: Hoare triple {5585#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {5586#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:53:15,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {5586#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {5587#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-20 19:53:15,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {5587#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {5584#false} is VALID [2022-02-20 19:53:15,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {5584#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;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {5584#false} is VALID [2022-02-20 19:53:15,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:15,388 INFO L290 TraceCheckUtils]: 9: Hoare triple {5584#false} assume !(0 != ~mode1~0 % 256); {5584#false} is VALID [2022-02-20 19:53:15,388 INFO L290 TraceCheckUtils]: 10: Hoare triple {5584#false} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {5584#false} is VALID [2022-02-20 19:53:15,388 INFO L290 TraceCheckUtils]: 11: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:15,389 INFO L290 TraceCheckUtils]: 12: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:15,389 INFO L290 TraceCheckUtils]: 13: Hoare triple {5584#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:15,389 INFO L290 TraceCheckUtils]: 14: Hoare triple {5584#false} assume !(node2_~m2~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:15,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {5584#false} ~mode2~0 := 0; {5584#false} is VALID [2022-02-20 19:53:15,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:15,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {5584#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:15,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {5584#false} assume !(node3_~m3~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:15,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {5584#false} ~mode3~0 := 0; {5584#false} is VALID [2022-02-20 19:53:15,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:15,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {5584#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:15,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {5584#false} assume !(node4_~m4~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:15,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {5584#false} ~mode4~0 := 0; {5584#false} is VALID [2022-02-20 19:53:15,403 INFO L290 TraceCheckUtils]: 24: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:15,403 INFO L290 TraceCheckUtils]: 25: Hoare triple {5584#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:15,403 INFO L290 TraceCheckUtils]: 26: Hoare triple {5584#false} assume !(node5_~m5~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:15,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {5584#false} ~mode5~0 := 0; {5584#false} is VALID [2022-02-20 19:53:15,404 INFO L290 TraceCheckUtils]: 28: Hoare triple {5584#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; {5584#false} is VALID [2022-02-20 19:53:15,404 INFO L290 TraceCheckUtils]: 29: Hoare triple {5584#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:15,404 INFO L290 TraceCheckUtils]: 30: Hoare triple {5584#false} assume !(node6_~m6~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:15,404 INFO L290 TraceCheckUtils]: 31: Hoare triple {5584#false} ~mode6~0 := 0; {5584#false} is VALID [2022-02-20 19:53:15,404 INFO L290 TraceCheckUtils]: 32: Hoare triple {5584#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:15,404 INFO L290 TraceCheckUtils]: 33: Hoare triple {5584#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:15,405 INFO L290 TraceCheckUtils]: 34: Hoare triple {5584#false} assume !(node7_~m7~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:15,405 INFO L290 TraceCheckUtils]: 35: Hoare triple {5584#false} ~mode7~0 := 0; {5584#false} is VALID [2022-02-20 19:53:15,405 INFO L290 TraceCheckUtils]: 36: Hoare triple {5584#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:15,405 INFO L290 TraceCheckUtils]: 37: Hoare triple {5584#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {5584#false} is VALID [2022-02-20 19:53:15,405 INFO L290 TraceCheckUtils]: 38: Hoare triple {5584#false} assume !(node8_~m8~0#1 != ~nomsg~0); {5584#false} is VALID [2022-02-20 19:53:15,406 INFO L290 TraceCheckUtils]: 39: Hoare triple {5584#false} ~mode8~0 := 0; {5584#false} is VALID [2022-02-20 19:53:15,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {5584#false} assume { :end_inline_node8 } 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;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {5584#false} is VALID [2022-02-20 19:53:15,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {5584#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {5584#false} is VALID [2022-02-20 19:53:15,406 INFO L290 TraceCheckUtils]: 42: Hoare triple {5584#false} check_#res#1 := check_~tmp~1#1; {5584#false} is VALID [2022-02-20 19:53:15,406 INFO L290 TraceCheckUtils]: 43: Hoare triple {5584#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {5584#false} is VALID [2022-02-20 19:53:15,406 INFO L290 TraceCheckUtils]: 44: Hoare triple {5584#false} assume 0 == assert_~arg#1 % 256; {5584#false} is VALID [2022-02-20 19:53:15,407 INFO L290 TraceCheckUtils]: 45: Hoare triple {5584#false} assume !false; {5584#false} is VALID [2022-02-20 19:53:15,407 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:53:15,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:15,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011345132] [2022-02-20 19:53:15,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011345132] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:15,408 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:15,408 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:53:15,408 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1027224443] [2022-02-20 19:53:15,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:15,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 19:53:15,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:15,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:15,437 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:15,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:53:15,437 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:15,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:53:15,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:53:15,438 INFO L87 Difference]: Start difference. First operand 899 states and 1691 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:19,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:19,332 INFO L93 Difference]: Finished difference Result 981 states and 1819 transitions. [2022-02-20 19:53:19,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:53:19,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 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 46 [2022-02-20 19:53:19,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:19,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:19,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1819 transitions. [2022-02-20 19:53:19,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:19,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1819 transitions. [2022-02-20 19:53:19,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1819 transitions. [2022-02-20 19:53:20,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1819 edges. 1819 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:20,714 INFO L225 Difference]: With dead ends: 981 [2022-02-20 19:53:20,715 INFO L226 Difference]: Without dead ends: 899 [2022-02-20 19:53:20,718 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:53:20,720 INFO L933 BasicCegarLoop]: 1689 mSDtfsCounter, 3 mSDsluCounter, 5003 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 6692 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:20,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 6692 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:20,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2022-02-20 19:53:20,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 899. [2022-02-20 19:53:20,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:20,741 INFO L82 GeneralOperation]: Start isEquivalent. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:53:20,742 INFO L74 IsIncluded]: Start isIncluded. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:53:20,744 INFO L87 Difference]: Start difference. First operand 899 states. Second operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:53:20,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:20,776 INFO L93 Difference]: Finished difference Result 899 states and 1630 transitions. [2022-02-20 19:53:20,777 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1630 transitions. [2022-02-20 19:53:20,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:20,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:20,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 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 899 states. [2022-02-20 19:53:20,784 INFO L87 Difference]: Start difference. First operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 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 899 states. [2022-02-20 19:53:20,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:20,817 INFO L93 Difference]: Finished difference Result 899 states and 1630 transitions. [2022-02-20 19:53:20,817 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1630 transitions. [2022-02-20 19:53:20,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:20,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:20,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:20,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:20,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 897 states have (on average 1.8171683389074693) internal successors, (1630), 898 states have internal predecessors, (1630), 0 states have call successors, (0), 0 states have 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:53:20,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1630 transitions. [2022-02-20 19:53:20,857 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1630 transitions. Word has length 46 [2022-02-20 19:53:20,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:20,857 INFO L470 AbstractCegarLoop]: Abstraction has 899 states and 1630 transitions. [2022-02-20 19:53:20,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:53:20,857 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1630 transitions. [2022-02-20 19:53:20,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-02-20 19:53:20,860 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:20,860 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] [2022-02-20 19:53:20,860 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:53:20,860 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:20,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:20,861 INFO L85 PathProgramCache]: Analyzing trace with hash 614555915, now seen corresponding path program 1 times [2022-02-20 19:53:20,861 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:20,861 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265022380] [2022-02-20 19:53:20,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:20,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:21,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {9318#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;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !(0 != main_#t~nondet62#1);havoc main_#t~nondet62#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet60#1, main2_#t~ret61#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,012 INFO L290 TraceCheckUtils]: 3: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet60#1 && main2_#t~nondet60#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet60#1;havoc main2_#t~nondet60#1; {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,012 INFO L290 TraceCheckUtils]: 4: Hoare triple {9320#(<= (+ ~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~ret57#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,013 INFO L290 TraceCheckUtils]: 5: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,013 INFO L290 TraceCheckUtils]: 6: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,015 INFO L290 TraceCheckUtils]: 10: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,015 INFO L290 TraceCheckUtils]: 11: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,017 INFO L290 TraceCheckUtils]: 16: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,018 INFO L290 TraceCheckUtils]: 18: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,018 INFO L290 TraceCheckUtils]: 19: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,018 INFO L290 TraceCheckUtils]: 20: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,019 INFO L290 TraceCheckUtils]: 21: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,019 INFO L290 TraceCheckUtils]: 23: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,021 INFO L290 TraceCheckUtils]: 27: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,021 INFO L290 TraceCheckUtils]: 28: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,021 INFO L290 TraceCheckUtils]: 29: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,022 INFO L290 TraceCheckUtils]: 30: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,022 INFO L290 TraceCheckUtils]: 31: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,022 INFO L290 TraceCheckUtils]: 32: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,023 INFO L290 TraceCheckUtils]: 34: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,023 INFO L290 TraceCheckUtils]: 35: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,024 INFO L290 TraceCheckUtils]: 36: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,024 INFO L290 TraceCheckUtils]: 37: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,024 INFO L290 TraceCheckUtils]: 38: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,025 INFO L290 TraceCheckUtils]: 39: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,025 INFO L290 TraceCheckUtils]: 40: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,025 INFO L290 TraceCheckUtils]: 41: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,026 INFO L290 TraceCheckUtils]: 42: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,026 INFO L290 TraceCheckUtils]: 43: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,026 INFO L290 TraceCheckUtils]: 44: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,026 INFO L290 TraceCheckUtils]: 45: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,027 INFO L290 TraceCheckUtils]: 46: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,027 INFO L290 TraceCheckUtils]: 47: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,027 INFO L290 TraceCheckUtils]: 48: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,028 INFO L290 TraceCheckUtils]: 49: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,028 INFO L290 TraceCheckUtils]: 50: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,028 INFO L290 TraceCheckUtils]: 51: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,029 INFO L290 TraceCheckUtils]: 52: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,029 INFO L290 TraceCheckUtils]: 53: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,029 INFO L290 TraceCheckUtils]: 54: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,030 INFO L290 TraceCheckUtils]: 55: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,030 INFO L290 TraceCheckUtils]: 56: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,030 INFO L290 TraceCheckUtils]: 57: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,031 INFO L290 TraceCheckUtils]: 58: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,031 INFO L290 TraceCheckUtils]: 59: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,031 INFO L290 TraceCheckUtils]: 60: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {9320#(<= (+ ~a17~0 124) 0)} is VALID [2022-02-20 19:53:21,032 INFO L290 TraceCheckUtils]: 61: Hoare triple {9320#(<= (+ ~a17~0 124) 0)} assume (((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {9319#false} is VALID [2022-02-20 19:53:21,032 INFO L290 TraceCheckUtils]: 62: Hoare triple {9319#false} assume !false; {9319#false} is VALID [2022-02-20 19:53:21,032 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:53:21,033 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:21,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265022380] [2022-02-20 19:53:21,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265022380] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:21,033 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:21,033 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:53:21,033 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870244331] [2022-02-20 19:53:21,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:21,034 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 19:53:21,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:21,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have 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:53:21,072 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:21,072 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:21,072 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:21,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:21,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:21,073 INFO L87 Difference]: Start difference. First operand 899 states and 1630 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have 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:53:26,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:26,218 INFO L93 Difference]: Finished difference Result 2403 states and 4503 transitions. [2022-02-20 19:53:26,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:26,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2022-02-20 19:53:26,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:26,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have 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:53:26,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4503 transitions. [2022-02-20 19:53:26,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have 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:53:26,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4503 transitions. [2022-02-20 19:53:26,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4503 transitions. [2022-02-20 19:53:29,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4503 edges. 4503 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:29,642 INFO L225 Difference]: With dead ends: 2403 [2022-02-20 19:53:29,642 INFO L226 Difference]: Without dead ends: 1650 [2022-02-20 19:53:29,645 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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:53:29,649 INFO L933 BasicCegarLoop]: 659 mSDtfsCounter, 929 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2261 mSolverCounterSat, 652 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 2913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 652 IncrementalHoareTripleChecker+Valid, 2261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-02-20 19:53:29,650 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [929 Valid, 666 Invalid, 2913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [652 Valid, 2261 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-02-20 19:53:29,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1650 states. [2022-02-20 19:53:29,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1650 to 1650. [2022-02-20 19:53:29,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:29,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1650 states. Second operand has 1650 states, 1648 states have (on average 1.583131067961165) internal successors, (2609), 1649 states have internal predecessors, (2609), 0 states have call successors, (0), 0 states have 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:53:29,687 INFO L74 IsIncluded]: Start isIncluded. First operand 1650 states. Second operand has 1650 states, 1648 states have (on average 1.583131067961165) internal successors, (2609), 1649 states have internal predecessors, (2609), 0 states have call successors, (0), 0 states have 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:53:29,690 INFO L87 Difference]: Start difference. First operand 1650 states. Second operand has 1650 states, 1648 states have (on average 1.583131067961165) internal successors, (2609), 1649 states have internal predecessors, (2609), 0 states have call successors, (0), 0 states have 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:53:29,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:29,776 INFO L93 Difference]: Finished difference Result 1650 states and 2609 transitions. [2022-02-20 19:53:29,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2609 transitions. [2022-02-20 19:53:29,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:29,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:29,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 1650 states, 1648 states have (on average 1.583131067961165) internal successors, (2609), 1649 states have internal predecessors, (2609), 0 states have call successors, (0), 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 1650 states. [2022-02-20 19:53:29,784 INFO L87 Difference]: Start difference. First operand has 1650 states, 1648 states have (on average 1.583131067961165) internal successors, (2609), 1649 states have internal predecessors, (2609), 0 states have call successors, (0), 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 1650 states. [2022-02-20 19:53:29,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:29,877 INFO L93 Difference]: Finished difference Result 1650 states and 2609 transitions. [2022-02-20 19:53:29,877 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2609 transitions. [2022-02-20 19:53:29,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:29,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:29,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:29,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:29,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1650 states, 1648 states have (on average 1.583131067961165) internal successors, (2609), 1649 states have internal predecessors, (2609), 0 states have call successors, (0), 0 states have 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:53:29,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2609 transitions. [2022-02-20 19:53:29,980 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2609 transitions. Word has length 63 [2022-02-20 19:53:29,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:29,981 INFO L470 AbstractCegarLoop]: Abstraction has 1650 states and 2609 transitions. [2022-02-20 19:53:29,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 2 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have 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:53:29,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2609 transitions. [2022-02-20 19:53:29,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:53:29,984 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:29,984 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:53:29,985 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:53:29,985 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:29,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:29,985 INFO L85 PathProgramCache]: Analyzing trace with hash 211182729, now seen corresponding path program 1 times [2022-02-20 19:53:29,986 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:29,986 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181072396] [2022-02-20 19:53:29,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:29,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:30,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {16725#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;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {16725#true} is VALID [2022-02-20 19:53:30,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {16725#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {16725#true} is VALID [2022-02-20 19:53:30,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {16725#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#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~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {16725#true} is VALID [2022-02-20 19:53:30,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {16725#true} assume 0 == ~r1~0 % 256; {16725#true} is VALID [2022-02-20 19:53:30,128 INFO L290 TraceCheckUtils]: 4: Hoare triple {16725#true} assume ~id1~0 >= 0; {16725#true} is VALID [2022-02-20 19:53:30,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {16725#true} assume 0 == ~st1~0; {16725#true} is VALID [2022-02-20 19:53:30,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {16725#true} assume ~send1~0 == ~id1~0; {16725#true} is VALID [2022-02-20 19:53:30,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {16725#true} assume 0 == ~mode1~0 % 256; {16725#true} is VALID [2022-02-20 19:53:30,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {16725#true} assume ~id2~0 >= 0; {16725#true} is VALID [2022-02-20 19:53:30,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {16725#true} assume 0 == ~st2~0; {16725#true} is VALID [2022-02-20 19:53:30,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {16725#true} assume ~send2~0 == ~id2~0; {16725#true} is VALID [2022-02-20 19:53:30,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {16725#true} assume 0 == ~mode2~0 % 256; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,130 INFO L290 TraceCheckUtils]: 13: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 >= 0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st4~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send4~0 == ~id4~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode4~0 % 256; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,140 INFO L290 TraceCheckUtils]: 20: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 >= 0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st5~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send5~0 == ~id5~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode5~0 % 256; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 >= 0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st6~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,142 INFO L290 TraceCheckUtils]: 26: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send6~0 == ~id6~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,142 INFO L290 TraceCheckUtils]: 27: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode6~0 % 256; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,143 INFO L290 TraceCheckUtils]: 28: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 >= 0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send7~0 == ~id7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode7~0 % 256; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,146 INFO L290 TraceCheckUtils]: 32: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id8~0 >= 0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,146 INFO L290 TraceCheckUtils]: 33: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,147 INFO L290 TraceCheckUtils]: 34: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send8~0 == ~id8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,147 INFO L290 TraceCheckUtils]: 35: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode8~0 % 256; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,148 INFO L290 TraceCheckUtils]: 36: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,150 INFO L290 TraceCheckUtils]: 37: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,150 INFO L290 TraceCheckUtils]: 38: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id4~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,151 INFO L290 TraceCheckUtils]: 39: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id5~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,151 INFO L290 TraceCheckUtils]: 40: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id6~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,151 INFO L290 TraceCheckUtils]: 41: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,152 INFO L290 TraceCheckUtils]: 42: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,152 INFO L290 TraceCheckUtils]: 43: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,152 INFO L290 TraceCheckUtils]: 44: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id4~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,153 INFO L290 TraceCheckUtils]: 45: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id5~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,153 INFO L290 TraceCheckUtils]: 46: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id6~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,153 INFO L290 TraceCheckUtils]: 47: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,154 INFO L290 TraceCheckUtils]: 48: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,154 INFO L290 TraceCheckUtils]: 49: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id4~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,155 INFO L290 TraceCheckUtils]: 50: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id5~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,155 INFO L290 TraceCheckUtils]: 51: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id6~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,155 INFO L290 TraceCheckUtils]: 52: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,156 INFO L290 TraceCheckUtils]: 53: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 != ~id8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,156 INFO L290 TraceCheckUtils]: 54: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id5~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,156 INFO L290 TraceCheckUtils]: 55: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id6~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,157 INFO L290 TraceCheckUtils]: 56: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,157 INFO L290 TraceCheckUtils]: 57: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id4~0 != ~id8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,158 INFO L290 TraceCheckUtils]: 58: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id6~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,158 INFO L290 TraceCheckUtils]: 59: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,158 INFO L290 TraceCheckUtils]: 60: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id5~0 != ~id8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,159 INFO L290 TraceCheckUtils]: 61: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id7~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,159 INFO L290 TraceCheckUtils]: 62: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id6~0 != ~id8~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,159 INFO L290 TraceCheckUtils]: 63: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,160 INFO L290 TraceCheckUtils]: 64: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,160 INFO L290 TraceCheckUtils]: 65: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,161 INFO L290 TraceCheckUtils]: 66: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,162 INFO L290 TraceCheckUtils]: 67: Hoare triple {16727#(= (+ (* (- 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;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,162 INFO L290 TraceCheckUtils]: 68: Hoare triple {16727#(= (+ (* (- 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; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,162 INFO L290 TraceCheckUtils]: 69: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,163 INFO L290 TraceCheckUtils]: 70: Hoare triple {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,163 INFO L290 TraceCheckUtils]: 71: Hoare triple {16727#(= (+ (* (- 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; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,163 INFO L290 TraceCheckUtils]: 72: Hoare triple {16727#(= (+ (* (- 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; {16727#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:53:30,164 INFO L290 TraceCheckUtils]: 73: Hoare triple {16727#(= (+ (* (- 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; {16726#false} is VALID [2022-02-20 19:53:30,164 INFO L290 TraceCheckUtils]: 74: Hoare triple {16726#false} assume !(node2_~m2~0#1 != ~nomsg~0); {16726#false} is VALID [2022-02-20 19:53:30,164 INFO L290 TraceCheckUtils]: 75: Hoare triple {16726#false} ~mode2~0 := 0; {16726#false} is VALID [2022-02-20 19:53:30,164 INFO L290 TraceCheckUtils]: 76: Hoare triple {16726#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; {16726#false} is VALID [2022-02-20 19:53:30,164 INFO L290 TraceCheckUtils]: 77: Hoare triple {16726#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:30,165 INFO L290 TraceCheckUtils]: 78: Hoare triple {16726#false} assume !(node3_~m3~0#1 != ~nomsg~0); {16726#false} is VALID [2022-02-20 19:53:30,165 INFO L290 TraceCheckUtils]: 79: Hoare triple {16726#false} ~mode3~0 := 0; {16726#false} is VALID [2022-02-20 19:53:30,165 INFO L290 TraceCheckUtils]: 80: Hoare triple {16726#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; {16726#false} is VALID [2022-02-20 19:53:30,165 INFO L290 TraceCheckUtils]: 81: Hoare triple {16726#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:30,165 INFO L290 TraceCheckUtils]: 82: Hoare triple {16726#false} assume !(node4_~m4~0#1 != ~nomsg~0); {16726#false} is VALID [2022-02-20 19:53:30,165 INFO L290 TraceCheckUtils]: 83: Hoare triple {16726#false} ~mode4~0 := 0; {16726#false} is VALID [2022-02-20 19:53:30,165 INFO L290 TraceCheckUtils]: 84: Hoare triple {16726#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; {16726#false} is VALID [2022-02-20 19:53:30,166 INFO L290 TraceCheckUtils]: 85: Hoare triple {16726#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:30,166 INFO L290 TraceCheckUtils]: 86: Hoare triple {16726#false} assume !(node5_~m5~0#1 != ~nomsg~0); {16726#false} is VALID [2022-02-20 19:53:30,166 INFO L290 TraceCheckUtils]: 87: Hoare triple {16726#false} ~mode5~0 := 0; {16726#false} is VALID [2022-02-20 19:53:30,166 INFO L290 TraceCheckUtils]: 88: Hoare triple {16726#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; {16726#false} is VALID [2022-02-20 19:53:30,166 INFO L290 TraceCheckUtils]: 89: Hoare triple {16726#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:30,166 INFO L290 TraceCheckUtils]: 90: Hoare triple {16726#false} assume !(node6_~m6~0#1 != ~nomsg~0); {16726#false} is VALID [2022-02-20 19:53:30,166 INFO L290 TraceCheckUtils]: 91: Hoare triple {16726#false} ~mode6~0 := 0; {16726#false} is VALID [2022-02-20 19:53:30,167 INFO L290 TraceCheckUtils]: 92: Hoare triple {16726#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:30,167 INFO L290 TraceCheckUtils]: 93: Hoare triple {16726#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:30,167 INFO L290 TraceCheckUtils]: 94: Hoare triple {16726#false} assume !(node7_~m7~0#1 != ~nomsg~0); {16726#false} is VALID [2022-02-20 19:53:30,167 INFO L290 TraceCheckUtils]: 95: Hoare triple {16726#false} ~mode7~0 := 0; {16726#false} is VALID [2022-02-20 19:53:30,167 INFO L290 TraceCheckUtils]: 96: Hoare triple {16726#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:30,168 INFO L290 TraceCheckUtils]: 97: Hoare triple {16726#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {16726#false} is VALID [2022-02-20 19:53:30,168 INFO L290 TraceCheckUtils]: 98: Hoare triple {16726#false} assume !(node8_~m8~0#1 != ~nomsg~0); {16726#false} is VALID [2022-02-20 19:53:30,168 INFO L290 TraceCheckUtils]: 99: Hoare triple {16726#false} ~mode8~0 := 0; {16726#false} is VALID [2022-02-20 19:53:30,168 INFO L290 TraceCheckUtils]: 100: Hoare triple {16726#false} assume { :end_inline_node8 } 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;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {16726#false} is VALID [2022-02-20 19:53:30,168 INFO L290 TraceCheckUtils]: 101: Hoare triple {16726#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {16726#false} is VALID [2022-02-20 19:53:30,168 INFO L290 TraceCheckUtils]: 102: Hoare triple {16726#false} check_#res#1 := check_~tmp~1#1; {16726#false} is VALID [2022-02-20 19:53:30,168 INFO L290 TraceCheckUtils]: 103: Hoare triple {16726#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {16726#false} is VALID [2022-02-20 19:53:30,168 INFO L290 TraceCheckUtils]: 104: Hoare triple {16726#false} assume 0 == assert_~arg#1 % 256; {16726#false} is VALID [2022-02-20 19:53:30,169 INFO L290 TraceCheckUtils]: 105: Hoare triple {16726#false} assume !false; {16726#false} is VALID [2022-02-20 19:53:30,169 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:53:30,169 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:30,169 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181072396] [2022-02-20 19:53:30,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181072396] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:30,170 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:30,170 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:30,170 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188304318] [2022-02-20 19:53:30,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:30,171 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:30,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:30,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:30,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:30,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:30,235 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:30,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:30,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:30,235 INFO L87 Difference]: Start difference. First operand 1650 states and 2609 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:31,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:31,958 INFO L93 Difference]: Finished difference Result 1800 states and 2847 transitions. [2022-02-20 19:53:31,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:31,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:31,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:31,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:31,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:31,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:31,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions. [2022-02-20 19:53:33,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1868 edges. 1868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:33,465 INFO L225 Difference]: With dead ends: 1800 [2022-02-20 19:53:33,466 INFO L226 Difference]: Without dead ends: 1722 [2022-02-20 19:53:33,466 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:53:33,467 INFO L933 BasicCegarLoop]: 1724 mSDtfsCounter, 1549 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 1850 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:53:33,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1549 Valid, 1850 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:33,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2022-02-20 19:53:33,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1720. [2022-02-20 19:53:33,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:33,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1722 states. Second operand has 1720 states, 1718 states have (on average 1.5838183934807917) internal successors, (2721), 1719 states have internal predecessors, (2721), 0 states have call successors, (0), 0 states have 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:53:33,505 INFO L74 IsIncluded]: Start isIncluded. First operand 1722 states. Second operand has 1720 states, 1718 states have (on average 1.5838183934807917) internal successors, (2721), 1719 states have internal predecessors, (2721), 0 states have call successors, (0), 0 states have 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:53:33,506 INFO L87 Difference]: Start difference. First operand 1722 states. Second operand has 1720 states, 1718 states have (on average 1.5838183934807917) internal successors, (2721), 1719 states have internal predecessors, (2721), 0 states have call successors, (0), 0 states have 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:53:33,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:33,599 INFO L93 Difference]: Finished difference Result 1722 states and 2722 transitions. [2022-02-20 19:53:33,599 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2722 transitions. [2022-02-20 19:53:33,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:33,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:33,603 INFO L74 IsIncluded]: Start isIncluded. First operand has 1720 states, 1718 states have (on average 1.5838183934807917) internal successors, (2721), 1719 states have internal predecessors, (2721), 0 states have call successors, (0), 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 1722 states. [2022-02-20 19:53:33,605 INFO L87 Difference]: Start difference. First operand has 1720 states, 1718 states have (on average 1.5838183934807917) internal successors, (2721), 1719 states have internal predecessors, (2721), 0 states have call successors, (0), 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 1722 states. [2022-02-20 19:53:33,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:33,694 INFO L93 Difference]: Finished difference Result 1722 states and 2722 transitions. [2022-02-20 19:53:33,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 2722 transitions. [2022-02-20 19:53:33,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:33,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:33,698 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:33,698 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:33,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1720 states, 1718 states have (on average 1.5838183934807917) internal successors, (2721), 1719 states have internal predecessors, (2721), 0 states have call successors, (0), 0 states have 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:53:33,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1720 states to 1720 states and 2721 transitions. [2022-02-20 19:53:33,795 INFO L78 Accepts]: Start accepts. Automaton has 1720 states and 2721 transitions. Word has length 106 [2022-02-20 19:53:33,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:33,796 INFO L470 AbstractCegarLoop]: Abstraction has 1720 states and 2721 transitions. [2022-02-20 19:53:33,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:33,796 INFO L276 IsEmpty]: Start isEmpty. Operand 1720 states and 2721 transitions. [2022-02-20 19:53:33,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:53:33,797 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:33,797 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:53:33,797 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:53:33,797 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:33,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:33,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1458691583, now seen corresponding path program 1 times [2022-02-20 19:53:33,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:33,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931404645] [2022-02-20 19:53:33,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:33,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:33,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:33,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {23771#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;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {23771#true} is VALID [2022-02-20 19:53:33,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {23771#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {23771#true} is VALID [2022-02-20 19:53:33,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {23771#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#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~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {23771#true} is VALID [2022-02-20 19:53:33,889 INFO L290 TraceCheckUtils]: 3: Hoare triple {23771#true} assume 0 == ~r1~0 % 256; {23771#true} is VALID [2022-02-20 19:53:33,889 INFO L290 TraceCheckUtils]: 4: Hoare triple {23771#true} assume ~id1~0 >= 0; {23771#true} is VALID [2022-02-20 19:53:33,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {23771#true} assume 0 == ~st1~0; {23771#true} is VALID [2022-02-20 19:53:33,889 INFO L290 TraceCheckUtils]: 6: Hoare triple {23771#true} assume ~send1~0 == ~id1~0; {23771#true} is VALID [2022-02-20 19:53:33,889 INFO L290 TraceCheckUtils]: 7: Hoare triple {23771#true} assume 0 == ~mode1~0 % 256; {23771#true} is VALID [2022-02-20 19:53:33,890 INFO L290 TraceCheckUtils]: 8: Hoare triple {23771#true} assume ~id2~0 >= 0; {23771#true} is VALID [2022-02-20 19:53:33,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {23771#true} assume 0 == ~st2~0; {23771#true} is VALID [2022-02-20 19:53:33,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {23771#true} assume ~send2~0 == ~id2~0; {23771#true} is VALID [2022-02-20 19:53:33,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {23771#true} assume 0 == ~mode2~0 % 256; {23771#true} is VALID [2022-02-20 19:53:33,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {23771#true} assume ~id3~0 >= 0; {23771#true} is VALID [2022-02-20 19:53:33,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {23771#true} assume 0 == ~st3~0; {23771#true} is VALID [2022-02-20 19:53:33,890 INFO L290 TraceCheckUtils]: 14: Hoare triple {23771#true} assume ~send3~0 == ~id3~0; {23771#true} is VALID [2022-02-20 19:53:33,891 INFO L290 TraceCheckUtils]: 15: Hoare triple {23771#true} assume 0 == ~mode3~0 % 256; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 >= 0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,892 INFO L290 TraceCheckUtils]: 17: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st4~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,892 INFO L290 TraceCheckUtils]: 18: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send4~0 == ~id4~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,892 INFO L290 TraceCheckUtils]: 19: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode4~0 % 256; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,893 INFO L290 TraceCheckUtils]: 20: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 >= 0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,893 INFO L290 TraceCheckUtils]: 21: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st5~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,893 INFO L290 TraceCheckUtils]: 22: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send5~0 == ~id5~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode5~0 % 256; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,895 INFO L290 TraceCheckUtils]: 24: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 >= 0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st6~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send6~0 == ~id6~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,896 INFO L290 TraceCheckUtils]: 27: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode6~0 % 256; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,896 INFO L290 TraceCheckUtils]: 28: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 >= 0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,897 INFO L290 TraceCheckUtils]: 30: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send7~0 == ~id7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,897 INFO L290 TraceCheckUtils]: 31: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode7~0 % 256; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id8~0 >= 0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~st8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,899 INFO L290 TraceCheckUtils]: 34: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send8~0 == ~id8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,899 INFO L290 TraceCheckUtils]: 35: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume 0 == ~mode8~0 % 256; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,899 INFO L290 TraceCheckUtils]: 36: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,900 INFO L290 TraceCheckUtils]: 37: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,900 INFO L290 TraceCheckUtils]: 38: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id4~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,900 INFO L290 TraceCheckUtils]: 39: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id5~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,902 INFO L290 TraceCheckUtils]: 40: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id6~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,902 INFO L290 TraceCheckUtils]: 41: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,903 INFO L290 TraceCheckUtils]: 42: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,903 INFO L290 TraceCheckUtils]: 43: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,903 INFO L290 TraceCheckUtils]: 44: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id4~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,904 INFO L290 TraceCheckUtils]: 45: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id5~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,905 INFO L290 TraceCheckUtils]: 46: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id6~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,905 INFO L290 TraceCheckUtils]: 47: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,906 INFO L290 TraceCheckUtils]: 48: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,906 INFO L290 TraceCheckUtils]: 49: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id4~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,906 INFO L290 TraceCheckUtils]: 50: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id5~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,907 INFO L290 TraceCheckUtils]: 51: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id6~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,907 INFO L290 TraceCheckUtils]: 52: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,907 INFO L290 TraceCheckUtils]: 53: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id3~0 != ~id8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,908 INFO L290 TraceCheckUtils]: 54: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id5~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,908 INFO L290 TraceCheckUtils]: 55: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id6~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,909 INFO L290 TraceCheckUtils]: 56: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,909 INFO L290 TraceCheckUtils]: 57: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id4~0 != ~id8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,909 INFO L290 TraceCheckUtils]: 58: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id6~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,910 INFO L290 TraceCheckUtils]: 59: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,910 INFO L290 TraceCheckUtils]: 60: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id5~0 != ~id8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,910 INFO L290 TraceCheckUtils]: 61: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id7~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,911 INFO L290 TraceCheckUtils]: 62: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id6~0 != ~id8~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,911 INFO L290 TraceCheckUtils]: 63: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,911 INFO L290 TraceCheckUtils]: 64: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,912 INFO L290 TraceCheckUtils]: 65: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,912 INFO L290 TraceCheckUtils]: 66: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,913 INFO L290 TraceCheckUtils]: 67: Hoare triple {23773#(= (+ (* (- 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;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,913 INFO L290 TraceCheckUtils]: 68: Hoare triple {23773#(= (+ (* (- 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; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,913 INFO L290 TraceCheckUtils]: 69: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,914 INFO L290 TraceCheckUtils]: 70: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,914 INFO L290 TraceCheckUtils]: 71: Hoare triple {23773#(= (+ (* (- 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; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,914 INFO L290 TraceCheckUtils]: 72: Hoare triple {23773#(= (+ (* (- 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; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,915 INFO L290 TraceCheckUtils]: 73: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,915 INFO L290 TraceCheckUtils]: 74: Hoare triple {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,916 INFO L290 TraceCheckUtils]: 75: Hoare triple {23773#(= (+ (* (- 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; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,916 INFO L290 TraceCheckUtils]: 76: Hoare triple {23773#(= (+ (* (- 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; {23773#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:53:33,916 INFO L290 TraceCheckUtils]: 77: Hoare triple {23773#(= (+ (* (- 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; {23772#false} is VALID [2022-02-20 19:53:33,917 INFO L290 TraceCheckUtils]: 78: Hoare triple {23772#false} assume !(node3_~m3~0#1 != ~nomsg~0); {23772#false} is VALID [2022-02-20 19:53:33,917 INFO L290 TraceCheckUtils]: 79: Hoare triple {23772#false} ~mode3~0 := 0; {23772#false} is VALID [2022-02-20 19:53:33,917 INFO L290 TraceCheckUtils]: 80: Hoare triple {23772#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; {23772#false} is VALID [2022-02-20 19:53:33,917 INFO L290 TraceCheckUtils]: 81: Hoare triple {23772#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {23772#false} is VALID [2022-02-20 19:53:33,917 INFO L290 TraceCheckUtils]: 82: Hoare triple {23772#false} assume !(node4_~m4~0#1 != ~nomsg~0); {23772#false} is VALID [2022-02-20 19:53:33,917 INFO L290 TraceCheckUtils]: 83: Hoare triple {23772#false} ~mode4~0 := 0; {23772#false} is VALID [2022-02-20 19:53:33,917 INFO L290 TraceCheckUtils]: 84: Hoare triple {23772#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; {23772#false} is VALID [2022-02-20 19:53:33,917 INFO L290 TraceCheckUtils]: 85: Hoare triple {23772#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {23772#false} is VALID [2022-02-20 19:53:33,918 INFO L290 TraceCheckUtils]: 86: Hoare triple {23772#false} assume !(node5_~m5~0#1 != ~nomsg~0); {23772#false} is VALID [2022-02-20 19:53:33,918 INFO L290 TraceCheckUtils]: 87: Hoare triple {23772#false} ~mode5~0 := 0; {23772#false} is VALID [2022-02-20 19:53:33,918 INFO L290 TraceCheckUtils]: 88: Hoare triple {23772#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; {23772#false} is VALID [2022-02-20 19:53:33,918 INFO L290 TraceCheckUtils]: 89: Hoare triple {23772#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {23772#false} is VALID [2022-02-20 19:53:33,918 INFO L290 TraceCheckUtils]: 90: Hoare triple {23772#false} assume !(node6_~m6~0#1 != ~nomsg~0); {23772#false} is VALID [2022-02-20 19:53:33,918 INFO L290 TraceCheckUtils]: 91: Hoare triple {23772#false} ~mode6~0 := 0; {23772#false} is VALID [2022-02-20 19:53:33,918 INFO L290 TraceCheckUtils]: 92: Hoare triple {23772#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {23772#false} is VALID [2022-02-20 19:53:33,919 INFO L290 TraceCheckUtils]: 93: Hoare triple {23772#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {23772#false} is VALID [2022-02-20 19:53:33,919 INFO L290 TraceCheckUtils]: 94: Hoare triple {23772#false} assume !(node7_~m7~0#1 != ~nomsg~0); {23772#false} is VALID [2022-02-20 19:53:33,919 INFO L290 TraceCheckUtils]: 95: Hoare triple {23772#false} ~mode7~0 := 0; {23772#false} is VALID [2022-02-20 19:53:33,919 INFO L290 TraceCheckUtils]: 96: Hoare triple {23772#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {23772#false} is VALID [2022-02-20 19:53:33,919 INFO L290 TraceCheckUtils]: 97: Hoare triple {23772#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {23772#false} is VALID [2022-02-20 19:53:33,919 INFO L290 TraceCheckUtils]: 98: Hoare triple {23772#false} assume !(node8_~m8~0#1 != ~nomsg~0); {23772#false} is VALID [2022-02-20 19:53:33,919 INFO L290 TraceCheckUtils]: 99: Hoare triple {23772#false} ~mode8~0 := 0; {23772#false} is VALID [2022-02-20 19:53:33,919 INFO L290 TraceCheckUtils]: 100: Hoare triple {23772#false} assume { :end_inline_node8 } 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;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {23772#false} is VALID [2022-02-20 19:53:33,920 INFO L290 TraceCheckUtils]: 101: Hoare triple {23772#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {23772#false} is VALID [2022-02-20 19:53:33,920 INFO L290 TraceCheckUtils]: 102: Hoare triple {23772#false} check_#res#1 := check_~tmp~1#1; {23772#false} is VALID [2022-02-20 19:53:33,920 INFO L290 TraceCheckUtils]: 103: Hoare triple {23772#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {23772#false} is VALID [2022-02-20 19:53:33,920 INFO L290 TraceCheckUtils]: 104: Hoare triple {23772#false} assume 0 == assert_~arg#1 % 256; {23772#false} is VALID [2022-02-20 19:53:33,920 INFO L290 TraceCheckUtils]: 105: Hoare triple {23772#false} assume !false; {23772#false} is VALID [2022-02-20 19:53:33,921 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:53:33,922 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:33,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931404645] [2022-02-20 19:53:33,922 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1931404645] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:33,923 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:33,923 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:33,923 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493124134] [2022-02-20 19:53:33,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:33,924 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:33,924 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:33,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:33,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:33,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:33,988 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:33,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:33,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:33,989 INFO L87 Difference]: Start difference. First operand 1720 states and 2721 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:35,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:35,764 INFO L93 Difference]: Finished difference Result 2004 states and 3173 transitions. [2022-02-20 19:53:35,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:35,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:35,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:35,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:35,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:35,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions. [2022-02-20 19:53:37,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1868 edges. 1868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:37,281 INFO L225 Difference]: With dead ends: 2004 [2022-02-20 19:53:37,281 INFO L226 Difference]: Without dead ends: 1856 [2022-02-20 19:53:37,282 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:53:37,282 INFO L933 BasicCegarLoop]: 1719 mSDtfsCounter, 1545 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1545 SdHoareTripleChecker+Valid, 1849 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:53:37,283 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1545 Valid, 1849 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:37,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1856 states. [2022-02-20 19:53:37,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1856 to 1854. [2022-02-20 19:53:37,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:37,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1856 states. Second operand has 1854 states, 1852 states have (on average 1.5842332613390928) internal successors, (2934), 1853 states have internal predecessors, (2934), 0 states have call successors, (0), 0 states have 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:53:37,327 INFO L74 IsIncluded]: Start isIncluded. First operand 1856 states. Second operand has 1854 states, 1852 states have (on average 1.5842332613390928) internal successors, (2934), 1853 states have internal predecessors, (2934), 0 states have call successors, (0), 0 states have 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:53:37,329 INFO L87 Difference]: Start difference. First operand 1856 states. Second operand has 1854 states, 1852 states have (on average 1.5842332613390928) internal successors, (2934), 1853 states have internal predecessors, (2934), 0 states have call successors, (0), 0 states have 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:53:37,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:37,429 INFO L93 Difference]: Finished difference Result 1856 states and 2935 transitions. [2022-02-20 19:53:37,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2935 transitions. [2022-02-20 19:53:37,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:37,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:37,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 1854 states, 1852 states have (on average 1.5842332613390928) internal successors, (2934), 1853 states have internal predecessors, (2934), 0 states have call successors, (0), 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 1856 states. [2022-02-20 19:53:37,436 INFO L87 Difference]: Start difference. First operand has 1854 states, 1852 states have (on average 1.5842332613390928) internal successors, (2934), 1853 states have internal predecessors, (2934), 0 states have call successors, (0), 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 1856 states. [2022-02-20 19:53:37,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:37,534 INFO L93 Difference]: Finished difference Result 1856 states and 2935 transitions. [2022-02-20 19:53:37,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1856 states and 2935 transitions. [2022-02-20 19:53:37,536 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:37,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:37,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:37,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:37,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1852 states have (on average 1.5842332613390928) internal successors, (2934), 1853 states have internal predecessors, (2934), 0 states have call successors, (0), 0 states have 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:53:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2934 transitions. [2022-02-20 19:53:37,643 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2934 transitions. Word has length 106 [2022-02-20 19:53:37,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:37,643 INFO L470 AbstractCegarLoop]: Abstraction has 1854 states and 2934 transitions. [2022-02-20 19:53:37,644 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:37,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2934 transitions. [2022-02-20 19:53:37,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:53:37,644 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:37,645 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:53:37,645 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:53:37,645 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:37,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:37,645 INFO L85 PathProgramCache]: Analyzing trace with hash 717259381, now seen corresponding path program 1 times [2022-02-20 19:53:37,646 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:37,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906094493] [2022-02-20 19:53:37,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:37,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:37,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:37,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {31478#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;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {31478#true} is VALID [2022-02-20 19:53:37,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {31478#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {31478#true} is VALID [2022-02-20 19:53:37,723 INFO L290 TraceCheckUtils]: 2: Hoare triple {31478#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#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~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {31478#true} is VALID [2022-02-20 19:53:37,723 INFO L290 TraceCheckUtils]: 3: Hoare triple {31478#true} assume 0 == ~r1~0 % 256; {31478#true} is VALID [2022-02-20 19:53:37,723 INFO L290 TraceCheckUtils]: 4: Hoare triple {31478#true} assume ~id1~0 >= 0; {31478#true} is VALID [2022-02-20 19:53:37,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {31478#true} assume 0 == ~st1~0; {31478#true} is VALID [2022-02-20 19:53:37,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {31478#true} assume ~send1~0 == ~id1~0; {31478#true} is VALID [2022-02-20 19:53:37,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {31478#true} assume 0 == ~mode1~0 % 256; {31478#true} is VALID [2022-02-20 19:53:37,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {31478#true} assume ~id2~0 >= 0; {31478#true} is VALID [2022-02-20 19:53:37,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {31478#true} assume 0 == ~st2~0; {31478#true} is VALID [2022-02-20 19:53:37,725 INFO L290 TraceCheckUtils]: 10: Hoare triple {31478#true} assume ~send2~0 == ~id2~0; {31478#true} is VALID [2022-02-20 19:53:37,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {31478#true} assume 0 == ~mode2~0 % 256; {31478#true} is VALID [2022-02-20 19:53:37,730 INFO L290 TraceCheckUtils]: 12: Hoare triple {31478#true} assume ~id3~0 >= 0; {31478#true} is VALID [2022-02-20 19:53:37,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {31478#true} assume 0 == ~st3~0; {31478#true} is VALID [2022-02-20 19:53:37,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {31478#true} assume ~send3~0 == ~id3~0; {31478#true} is VALID [2022-02-20 19:53:37,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {31478#true} assume 0 == ~mode3~0 % 256; {31478#true} is VALID [2022-02-20 19:53:37,734 INFO L290 TraceCheckUtils]: 16: Hoare triple {31478#true} assume ~id4~0 >= 0; {31478#true} is VALID [2022-02-20 19:53:37,734 INFO L290 TraceCheckUtils]: 17: Hoare triple {31478#true} assume 0 == ~st4~0; {31478#true} is VALID [2022-02-20 19:53:37,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {31478#true} assume ~send4~0 == ~id4~0; {31478#true} is VALID [2022-02-20 19:53:37,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {31478#true} assume 0 == ~mode4~0 % 256; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 >= 0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st5~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,736 INFO L290 TraceCheckUtils]: 22: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send5~0 == ~id5~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,736 INFO L290 TraceCheckUtils]: 23: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode5~0 % 256; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 >= 0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st6~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send6~0 == ~id6~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,737 INFO L290 TraceCheckUtils]: 27: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode6~0 % 256; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 >= 0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,738 INFO L290 TraceCheckUtils]: 30: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send7~0 == ~id7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,739 INFO L290 TraceCheckUtils]: 31: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode7~0 % 256; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,739 INFO L290 TraceCheckUtils]: 32: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id8~0 >= 0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,739 INFO L290 TraceCheckUtils]: 33: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~st8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,740 INFO L290 TraceCheckUtils]: 34: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send8~0 == ~id8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume 0 == ~mode8~0 % 256; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,741 INFO L290 TraceCheckUtils]: 36: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id2~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,741 INFO L290 TraceCheckUtils]: 37: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id3~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,741 INFO L290 TraceCheckUtils]: 38: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id4~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,742 INFO L290 TraceCheckUtils]: 39: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id5~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,742 INFO L290 TraceCheckUtils]: 40: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id6~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,742 INFO L290 TraceCheckUtils]: 41: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,743 INFO L290 TraceCheckUtils]: 42: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id1~0 != ~id8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,743 INFO L290 TraceCheckUtils]: 43: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id3~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,743 INFO L290 TraceCheckUtils]: 44: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id4~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,744 INFO L290 TraceCheckUtils]: 45: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id5~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,744 INFO L290 TraceCheckUtils]: 46: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id6~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,744 INFO L290 TraceCheckUtils]: 47: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,745 INFO L290 TraceCheckUtils]: 48: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id2~0 != ~id8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,745 INFO L290 TraceCheckUtils]: 49: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id4~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,745 INFO L290 TraceCheckUtils]: 50: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id5~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,746 INFO L290 TraceCheckUtils]: 51: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id6~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,746 INFO L290 TraceCheckUtils]: 52: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,746 INFO L290 TraceCheckUtils]: 53: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id3~0 != ~id8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,747 INFO L290 TraceCheckUtils]: 54: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id5~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,747 INFO L290 TraceCheckUtils]: 55: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id6~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,747 INFO L290 TraceCheckUtils]: 56: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,748 INFO L290 TraceCheckUtils]: 57: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id4~0 != ~id8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,748 INFO L290 TraceCheckUtils]: 58: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id6~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,748 INFO L290 TraceCheckUtils]: 59: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,749 INFO L290 TraceCheckUtils]: 60: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id5~0 != ~id8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,749 INFO L290 TraceCheckUtils]: 61: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id7~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,749 INFO L290 TraceCheckUtils]: 62: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id6~0 != ~id8~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,750 INFO L290 TraceCheckUtils]: 63: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,750 INFO L290 TraceCheckUtils]: 64: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} init_#res#1 := init_~tmp~0#1; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,750 INFO L290 TraceCheckUtils]: 65: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,751 INFO L290 TraceCheckUtils]: 66: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,751 INFO L290 TraceCheckUtils]: 67: Hoare triple {31480#(= (+ (* (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;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,752 INFO L290 TraceCheckUtils]: 68: Hoare triple {31480#(= (+ (* (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; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,752 INFO L290 TraceCheckUtils]: 69: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode1~0 % 256); {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,753 INFO L290 TraceCheckUtils]: 70: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,753 INFO L290 TraceCheckUtils]: 71: Hoare triple {31480#(= (+ (* (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; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,753 INFO L290 TraceCheckUtils]: 72: Hoare triple {31480#(= (+ (* (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; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,754 INFO L290 TraceCheckUtils]: 73: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode2~0 % 256); {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,754 INFO L290 TraceCheckUtils]: 74: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,754 INFO L290 TraceCheckUtils]: 75: Hoare triple {31480#(= (+ (* (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; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,755 INFO L290 TraceCheckUtils]: 76: Hoare triple {31480#(= (+ (* (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; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,755 INFO L290 TraceCheckUtils]: 77: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume !(0 != ~mode3~0 % 256); {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,755 INFO L290 TraceCheckUtils]: 78: Hoare triple {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,756 INFO L290 TraceCheckUtils]: 79: Hoare triple {31480#(= (+ (* (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; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,756 INFO L290 TraceCheckUtils]: 80: Hoare triple {31480#(= (+ (* (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; {31480#(= (+ (* (div ~mode4~0 256) (- 256)) ~mode4~0) 0)} is VALID [2022-02-20 19:53:37,757 INFO L290 TraceCheckUtils]: 81: Hoare triple {31480#(= (+ (* (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; {31479#false} is VALID [2022-02-20 19:53:37,757 INFO L290 TraceCheckUtils]: 82: Hoare triple {31479#false} assume !(node4_~m4~0#1 != ~nomsg~0); {31479#false} is VALID [2022-02-20 19:53:37,757 INFO L290 TraceCheckUtils]: 83: Hoare triple {31479#false} ~mode4~0 := 0; {31479#false} is VALID [2022-02-20 19:53:37,757 INFO L290 TraceCheckUtils]: 84: Hoare triple {31479#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; {31479#false} is VALID [2022-02-20 19:53:37,757 INFO L290 TraceCheckUtils]: 85: Hoare triple {31479#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {31479#false} is VALID [2022-02-20 19:53:37,757 INFO L290 TraceCheckUtils]: 86: Hoare triple {31479#false} assume !(node5_~m5~0#1 != ~nomsg~0); {31479#false} is VALID [2022-02-20 19:53:37,757 INFO L290 TraceCheckUtils]: 87: Hoare triple {31479#false} ~mode5~0 := 0; {31479#false} is VALID [2022-02-20 19:53:37,757 INFO L290 TraceCheckUtils]: 88: Hoare triple {31479#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; {31479#false} is VALID [2022-02-20 19:53:37,758 INFO L290 TraceCheckUtils]: 89: Hoare triple {31479#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {31479#false} is VALID [2022-02-20 19:53:37,758 INFO L290 TraceCheckUtils]: 90: Hoare triple {31479#false} assume !(node6_~m6~0#1 != ~nomsg~0); {31479#false} is VALID [2022-02-20 19:53:37,758 INFO L290 TraceCheckUtils]: 91: Hoare triple {31479#false} ~mode6~0 := 0; {31479#false} is VALID [2022-02-20 19:53:37,758 INFO L290 TraceCheckUtils]: 92: Hoare triple {31479#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {31479#false} is VALID [2022-02-20 19:53:37,758 INFO L290 TraceCheckUtils]: 93: Hoare triple {31479#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {31479#false} is VALID [2022-02-20 19:53:37,758 INFO L290 TraceCheckUtils]: 94: Hoare triple {31479#false} assume !(node7_~m7~0#1 != ~nomsg~0); {31479#false} is VALID [2022-02-20 19:53:37,758 INFO L290 TraceCheckUtils]: 95: Hoare triple {31479#false} ~mode7~0 := 0; {31479#false} is VALID [2022-02-20 19:53:37,758 INFO L290 TraceCheckUtils]: 96: Hoare triple {31479#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {31479#false} is VALID [2022-02-20 19:53:37,759 INFO L290 TraceCheckUtils]: 97: Hoare triple {31479#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {31479#false} is VALID [2022-02-20 19:53:37,759 INFO L290 TraceCheckUtils]: 98: Hoare triple {31479#false} assume !(node8_~m8~0#1 != ~nomsg~0); {31479#false} is VALID [2022-02-20 19:53:37,759 INFO L290 TraceCheckUtils]: 99: Hoare triple {31479#false} ~mode8~0 := 0; {31479#false} is VALID [2022-02-20 19:53:37,759 INFO L290 TraceCheckUtils]: 100: Hoare triple {31479#false} assume { :end_inline_node8 } 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;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {31479#false} is VALID [2022-02-20 19:53:37,759 INFO L290 TraceCheckUtils]: 101: Hoare triple {31479#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {31479#false} is VALID [2022-02-20 19:53:37,759 INFO L290 TraceCheckUtils]: 102: Hoare triple {31479#false} check_#res#1 := check_~tmp~1#1; {31479#false} is VALID [2022-02-20 19:53:37,759 INFO L290 TraceCheckUtils]: 103: Hoare triple {31479#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {31479#false} is VALID [2022-02-20 19:53:37,759 INFO L290 TraceCheckUtils]: 104: Hoare triple {31479#false} assume 0 == assert_~arg#1 % 256; {31479#false} is VALID [2022-02-20 19:53:37,760 INFO L290 TraceCheckUtils]: 105: Hoare triple {31479#false} assume !false; {31479#false} is VALID [2022-02-20 19:53:37,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:53:37,762 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:37,762 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906094493] [2022-02-20 19:53:37,762 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906094493] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:37,762 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:37,762 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:37,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561342443] [2022-02-20 19:53:37,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:37,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:37,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:37,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:37,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:37,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:37,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:37,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:37,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:37,825 INFO L87 Difference]: Start difference. First operand 1854 states and 2934 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:39,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:39,633 INFO L93 Difference]: Finished difference Result 2394 states and 3792 transitions. [2022-02-20 19:53:39,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:39,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:39,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:39,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:39,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:39,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:39,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:39,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions. [2022-02-20 19:53:41,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1868 edges. 1868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:41,167 INFO L225 Difference]: With dead ends: 2394 [2022-02-20 19:53:41,168 INFO L226 Difference]: Without dead ends: 2112 [2022-02-20 19:53:41,168 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:53:41,169 INFO L933 BasicCegarLoop]: 1714 mSDtfsCounter, 1541 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1541 SdHoareTripleChecker+Valid, 1848 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:53:41,169 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1541 Valid, 1848 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:41,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2112 states. [2022-02-20 19:53:41,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2112 to 2110. [2022-02-20 19:53:41,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:41,230 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2112 states. Second operand has 2110 states, 2108 states have (on average 1.5834914611005693) internal successors, (3338), 2109 states have internal predecessors, (3338), 0 states have call successors, (0), 0 states have 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:53:41,231 INFO L74 IsIncluded]: Start isIncluded. First operand 2112 states. Second operand has 2110 states, 2108 states have (on average 1.5834914611005693) internal successors, (3338), 2109 states have internal predecessors, (3338), 0 states have call successors, (0), 0 states have 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:53:41,232 INFO L87 Difference]: Start difference. First operand 2112 states. Second operand has 2110 states, 2108 states have (on average 1.5834914611005693) internal successors, (3338), 2109 states have internal predecessors, (3338), 0 states have call successors, (0), 0 states have 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:53:41,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:41,358 INFO L93 Difference]: Finished difference Result 2112 states and 3339 transitions. [2022-02-20 19:53:41,358 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 3339 transitions. [2022-02-20 19:53:41,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:41,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:41,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 2110 states, 2108 states have (on average 1.5834914611005693) internal successors, (3338), 2109 states have internal predecessors, (3338), 0 states have call successors, (0), 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 2112 states. [2022-02-20 19:53:41,363 INFO L87 Difference]: Start difference. First operand has 2110 states, 2108 states have (on average 1.5834914611005693) internal successors, (3338), 2109 states have internal predecessors, (3338), 0 states have call successors, (0), 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 2112 states. [2022-02-20 19:53:41,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:41,484 INFO L93 Difference]: Finished difference Result 2112 states and 3339 transitions. [2022-02-20 19:53:41,485 INFO L276 IsEmpty]: Start isEmpty. Operand 2112 states and 3339 transitions. [2022-02-20 19:53:41,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:41,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:41,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:41,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:41,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2110 states, 2108 states have (on average 1.5834914611005693) internal successors, (3338), 2109 states have internal predecessors, (3338), 0 states have call successors, (0), 0 states have 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:53:41,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2110 states to 2110 states and 3338 transitions. [2022-02-20 19:53:41,622 INFO L78 Accepts]: Start accepts. Automaton has 2110 states and 3338 transitions. Word has length 106 [2022-02-20 19:53:41,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:41,622 INFO L470 AbstractCegarLoop]: Abstraction has 2110 states and 3338 transitions. [2022-02-20 19:53:41,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:41,623 INFO L276 IsEmpty]: Start isEmpty. Operand 2110 states and 3338 transitions. [2022-02-20 19:53:41,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:53:41,623 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:41,623 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:53:41,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:53:41,624 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:41,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:41,624 INFO L85 PathProgramCache]: Analyzing trace with hash -28323349, now seen corresponding path program 1 times [2022-02-20 19:53:41,624 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:41,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247950329] [2022-02-20 19:53:41,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:41,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:41,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:41,678 INFO L290 TraceCheckUtils]: 0: Hoare triple {40453#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;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {40453#true} is VALID [2022-02-20 19:53:41,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {40453#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {40453#true} is VALID [2022-02-20 19:53:41,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {40453#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#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~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {40453#true} is VALID [2022-02-20 19:53:41,679 INFO L290 TraceCheckUtils]: 3: Hoare triple {40453#true} assume 0 == ~r1~0 % 256; {40453#true} is VALID [2022-02-20 19:53:41,679 INFO L290 TraceCheckUtils]: 4: Hoare triple {40453#true} assume ~id1~0 >= 0; {40453#true} is VALID [2022-02-20 19:53:41,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {40453#true} assume 0 == ~st1~0; {40453#true} is VALID [2022-02-20 19:53:41,679 INFO L290 TraceCheckUtils]: 6: Hoare triple {40453#true} assume ~send1~0 == ~id1~0; {40453#true} is VALID [2022-02-20 19:53:41,679 INFO L290 TraceCheckUtils]: 7: Hoare triple {40453#true} assume 0 == ~mode1~0 % 256; {40453#true} is VALID [2022-02-20 19:53:41,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {40453#true} assume ~id2~0 >= 0; {40453#true} is VALID [2022-02-20 19:53:41,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {40453#true} assume 0 == ~st2~0; {40453#true} is VALID [2022-02-20 19:53:41,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {40453#true} assume ~send2~0 == ~id2~0; {40453#true} is VALID [2022-02-20 19:53:41,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {40453#true} assume 0 == ~mode2~0 % 256; {40453#true} is VALID [2022-02-20 19:53:41,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {40453#true} assume ~id3~0 >= 0; {40453#true} is VALID [2022-02-20 19:53:41,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {40453#true} assume 0 == ~st3~0; {40453#true} is VALID [2022-02-20 19:53:41,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {40453#true} assume ~send3~0 == ~id3~0; {40453#true} is VALID [2022-02-20 19:53:41,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {40453#true} assume 0 == ~mode3~0 % 256; {40453#true} is VALID [2022-02-20 19:53:41,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {40453#true} assume ~id4~0 >= 0; {40453#true} is VALID [2022-02-20 19:53:41,681 INFO L290 TraceCheckUtils]: 17: Hoare triple {40453#true} assume 0 == ~st4~0; {40453#true} is VALID [2022-02-20 19:53:41,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {40453#true} assume ~send4~0 == ~id4~0; {40453#true} is VALID [2022-02-20 19:53:41,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {40453#true} assume 0 == ~mode4~0 % 256; {40453#true} is VALID [2022-02-20 19:53:41,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {40453#true} assume ~id5~0 >= 0; {40453#true} is VALID [2022-02-20 19:53:41,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {40453#true} assume 0 == ~st5~0; {40453#true} is VALID [2022-02-20 19:53:41,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {40453#true} assume ~send5~0 == ~id5~0; {40453#true} is VALID [2022-02-20 19:53:41,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {40453#true} assume 0 == ~mode5~0 % 256; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 >= 0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st6~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send6~0 == ~id6~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode6~0 % 256; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 >= 0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,684 INFO L290 TraceCheckUtils]: 29: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,684 INFO L290 TraceCheckUtils]: 30: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send7~0 == ~id7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,685 INFO L290 TraceCheckUtils]: 31: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode7~0 % 256; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,685 INFO L290 TraceCheckUtils]: 32: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id8~0 >= 0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,685 INFO L290 TraceCheckUtils]: 33: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~st8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,686 INFO L290 TraceCheckUtils]: 34: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send8~0 == ~id8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,686 INFO L290 TraceCheckUtils]: 35: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume 0 == ~mode8~0 % 256; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,686 INFO L290 TraceCheckUtils]: 36: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id2~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,687 INFO L290 TraceCheckUtils]: 37: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id3~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,687 INFO L290 TraceCheckUtils]: 38: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id4~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,687 INFO L290 TraceCheckUtils]: 39: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id5~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,688 INFO L290 TraceCheckUtils]: 40: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id6~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,688 INFO L290 TraceCheckUtils]: 41: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,688 INFO L290 TraceCheckUtils]: 42: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id1~0 != ~id8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,689 INFO L290 TraceCheckUtils]: 43: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id3~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,689 INFO L290 TraceCheckUtils]: 44: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id4~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,689 INFO L290 TraceCheckUtils]: 45: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id5~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,690 INFO L290 TraceCheckUtils]: 46: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id6~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,690 INFO L290 TraceCheckUtils]: 47: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,690 INFO L290 TraceCheckUtils]: 48: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id2~0 != ~id8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,690 INFO L290 TraceCheckUtils]: 49: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id4~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,691 INFO L290 TraceCheckUtils]: 50: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id5~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,691 INFO L290 TraceCheckUtils]: 51: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id6~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,691 INFO L290 TraceCheckUtils]: 52: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,692 INFO L290 TraceCheckUtils]: 53: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id3~0 != ~id8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,692 INFO L290 TraceCheckUtils]: 54: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id5~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,692 INFO L290 TraceCheckUtils]: 55: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id6~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,693 INFO L290 TraceCheckUtils]: 56: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,693 INFO L290 TraceCheckUtils]: 57: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id4~0 != ~id8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,693 INFO L290 TraceCheckUtils]: 58: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id6~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,694 INFO L290 TraceCheckUtils]: 59: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,694 INFO L290 TraceCheckUtils]: 60: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id5~0 != ~id8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,694 INFO L290 TraceCheckUtils]: 61: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id7~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,695 INFO L290 TraceCheckUtils]: 62: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id6~0 != ~id8~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,695 INFO L290 TraceCheckUtils]: 63: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,695 INFO L290 TraceCheckUtils]: 64: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} init_#res#1 := init_~tmp~0#1; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,696 INFO L290 TraceCheckUtils]: 65: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,696 INFO L290 TraceCheckUtils]: 66: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,697 INFO L290 TraceCheckUtils]: 67: Hoare triple {40455#(= (+ (* (- 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;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,697 INFO L290 TraceCheckUtils]: 68: Hoare triple {40455#(= (+ (* (- 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; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,697 INFO L290 TraceCheckUtils]: 69: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode1~0 % 256); {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,698 INFO L290 TraceCheckUtils]: 70: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,698 INFO L290 TraceCheckUtils]: 71: Hoare triple {40455#(= (+ (* (- 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; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,698 INFO L290 TraceCheckUtils]: 72: Hoare triple {40455#(= (+ (* (- 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; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,699 INFO L290 TraceCheckUtils]: 73: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode2~0 % 256); {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,699 INFO L290 TraceCheckUtils]: 74: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,699 INFO L290 TraceCheckUtils]: 75: Hoare triple {40455#(= (+ (* (- 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; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,700 INFO L290 TraceCheckUtils]: 76: Hoare triple {40455#(= (+ (* (- 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; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,700 INFO L290 TraceCheckUtils]: 77: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode3~0 % 256); {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,700 INFO L290 TraceCheckUtils]: 78: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,701 INFO L290 TraceCheckUtils]: 79: Hoare triple {40455#(= (+ (* (- 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; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,701 INFO L290 TraceCheckUtils]: 80: Hoare triple {40455#(= (+ (* (- 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; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,701 INFO L290 TraceCheckUtils]: 81: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume !(0 != ~mode4~0 % 256); {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,702 INFO L290 TraceCheckUtils]: 82: Hoare triple {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,702 INFO L290 TraceCheckUtils]: 83: Hoare triple {40455#(= (+ (* (- 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; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,702 INFO L290 TraceCheckUtils]: 84: Hoare triple {40455#(= (+ (* (- 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; {40455#(= (+ (* (- 256) (div ~mode5~0 256)) ~mode5~0) 0)} is VALID [2022-02-20 19:53:41,703 INFO L290 TraceCheckUtils]: 85: Hoare triple {40455#(= (+ (* (- 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; {40454#false} is VALID [2022-02-20 19:53:41,703 INFO L290 TraceCheckUtils]: 86: Hoare triple {40454#false} assume !(node5_~m5~0#1 != ~nomsg~0); {40454#false} is VALID [2022-02-20 19:53:41,703 INFO L290 TraceCheckUtils]: 87: Hoare triple {40454#false} ~mode5~0 := 0; {40454#false} is VALID [2022-02-20 19:53:41,703 INFO L290 TraceCheckUtils]: 88: Hoare triple {40454#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; {40454#false} is VALID [2022-02-20 19:53:41,704 INFO L290 TraceCheckUtils]: 89: Hoare triple {40454#false} assume 0 != ~mode6~0 % 256;node6_~m6~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {40454#false} is VALID [2022-02-20 19:53:41,704 INFO L290 TraceCheckUtils]: 90: Hoare triple {40454#false} assume !(node6_~m6~0#1 != ~nomsg~0); {40454#false} is VALID [2022-02-20 19:53:41,704 INFO L290 TraceCheckUtils]: 91: Hoare triple {40454#false} ~mode6~0 := 0; {40454#false} is VALID [2022-02-20 19:53:41,704 INFO L290 TraceCheckUtils]: 92: Hoare triple {40454#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {40454#false} is VALID [2022-02-20 19:53:41,704 INFO L290 TraceCheckUtils]: 93: Hoare triple {40454#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {40454#false} is VALID [2022-02-20 19:53:41,704 INFO L290 TraceCheckUtils]: 94: Hoare triple {40454#false} assume !(node7_~m7~0#1 != ~nomsg~0); {40454#false} is VALID [2022-02-20 19:53:41,704 INFO L290 TraceCheckUtils]: 95: Hoare triple {40454#false} ~mode7~0 := 0; {40454#false} is VALID [2022-02-20 19:53:41,704 INFO L290 TraceCheckUtils]: 96: Hoare triple {40454#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {40454#false} is VALID [2022-02-20 19:53:41,704 INFO L290 TraceCheckUtils]: 97: Hoare triple {40454#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {40454#false} is VALID [2022-02-20 19:53:41,705 INFO L290 TraceCheckUtils]: 98: Hoare triple {40454#false} assume !(node8_~m8~0#1 != ~nomsg~0); {40454#false} is VALID [2022-02-20 19:53:41,705 INFO L290 TraceCheckUtils]: 99: Hoare triple {40454#false} ~mode8~0 := 0; {40454#false} is VALID [2022-02-20 19:53:41,705 INFO L290 TraceCheckUtils]: 100: Hoare triple {40454#false} assume { :end_inline_node8 } 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;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {40454#false} is VALID [2022-02-20 19:53:41,705 INFO L290 TraceCheckUtils]: 101: Hoare triple {40454#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {40454#false} is VALID [2022-02-20 19:53:41,705 INFO L290 TraceCheckUtils]: 102: Hoare triple {40454#false} check_#res#1 := check_~tmp~1#1; {40454#false} is VALID [2022-02-20 19:53:41,705 INFO L290 TraceCheckUtils]: 103: Hoare triple {40454#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {40454#false} is VALID [2022-02-20 19:53:41,705 INFO L290 TraceCheckUtils]: 104: Hoare triple {40454#false} assume 0 == assert_~arg#1 % 256; {40454#false} is VALID [2022-02-20 19:53:41,705 INFO L290 TraceCheckUtils]: 105: Hoare triple {40454#false} assume !false; {40454#false} is VALID [2022-02-20 19:53:41,706 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:53:41,706 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:41,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247950329] [2022-02-20 19:53:41,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247950329] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:41,706 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:41,706 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:41,707 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540172851] [2022-02-20 19:53:41,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:41,707 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:41,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:41,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:41,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:41,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:41,790 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:41,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:41,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:41,791 INFO L87 Difference]: Start difference. First operand 2110 states and 3338 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:43,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:43,804 INFO L93 Difference]: Finished difference Result 3138 states and 4964 transitions. [2022-02-20 19:53:43,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:43,804 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:43,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:43,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:43,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:43,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:43,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:43,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions. [2022-02-20 19:53:45,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1868 edges. 1868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:45,413 INFO L225 Difference]: With dead ends: 3138 [2022-02-20 19:53:45,413 INFO L226 Difference]: Without dead ends: 2600 [2022-02-20 19:53:45,415 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:53:45,415 INFO L933 BasicCegarLoop]: 1709 mSDtfsCounter, 1537 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 1847 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:53:45,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1537 Valid, 1847 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:45,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2600 states. [2022-02-20 19:53:45,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2600 to 2598. [2022-02-20 19:53:45,521 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:45,568 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2600 states. Second operand has 2598 states, 2596 states have (on average 1.5801232665639446) internal successors, (4102), 2597 states have internal predecessors, (4102), 0 states have call successors, (0), 0 states have 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:53:45,571 INFO L74 IsIncluded]: Start isIncluded. First operand 2600 states. Second operand has 2598 states, 2596 states have (on average 1.5801232665639446) internal successors, (4102), 2597 states have internal predecessors, (4102), 0 states have call successors, (0), 0 states have 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:53:45,572 INFO L87 Difference]: Start difference. First operand 2600 states. Second operand has 2598 states, 2596 states have (on average 1.5801232665639446) internal successors, (4102), 2597 states have internal predecessors, (4102), 0 states have call successors, (0), 0 states have 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:53:45,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:45,753 INFO L93 Difference]: Finished difference Result 2600 states and 4103 transitions. [2022-02-20 19:53:45,753 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 4103 transitions. [2022-02-20 19:53:45,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:45,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:45,758 INFO L74 IsIncluded]: Start isIncluded. First operand has 2598 states, 2596 states have (on average 1.5801232665639446) internal successors, (4102), 2597 states have internal predecessors, (4102), 0 states have call successors, (0), 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 2600 states. [2022-02-20 19:53:45,760 INFO L87 Difference]: Start difference. First operand has 2598 states, 2596 states have (on average 1.5801232665639446) internal successors, (4102), 2597 states have internal predecessors, (4102), 0 states have call successors, (0), 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 2600 states. [2022-02-20 19:53:45,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:45,943 INFO L93 Difference]: Finished difference Result 2600 states and 4103 transitions. [2022-02-20 19:53:45,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2600 states and 4103 transitions. [2022-02-20 19:53:45,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:45,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:45,945 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:45,945 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:45,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2598 states, 2596 states have (on average 1.5801232665639446) internal successors, (4102), 2597 states have internal predecessors, (4102), 0 states have call successors, (0), 0 states have 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:53:46,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 4102 transitions. [2022-02-20 19:53:46,146 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 4102 transitions. Word has length 106 [2022-02-20 19:53:46,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:46,146 INFO L470 AbstractCegarLoop]: Abstraction has 2598 states and 4102 transitions. [2022-02-20 19:53:46,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:46,147 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 4102 transitions. [2022-02-20 19:53:46,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:53:46,147 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:46,147 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:53:46,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:53:46,148 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:46,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:46,149 INFO L85 PathProgramCache]: Analyzing trace with hash -1968354207, now seen corresponding path program 1 times [2022-02-20 19:53:46,149 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:46,149 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722659251] [2022-02-20 19:53:46,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:46,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:46,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:46,204 INFO L290 TraceCheckUtils]: 0: Hoare triple {51856#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;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {51856#true} is VALID [2022-02-20 19:53:46,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {51856#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {51856#true} is VALID [2022-02-20 19:53:46,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {51856#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#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~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {51856#true} is VALID [2022-02-20 19:53:46,205 INFO L290 TraceCheckUtils]: 3: Hoare triple {51856#true} assume 0 == ~r1~0 % 256; {51856#true} is VALID [2022-02-20 19:53:46,205 INFO L290 TraceCheckUtils]: 4: Hoare triple {51856#true} assume ~id1~0 >= 0; {51856#true} is VALID [2022-02-20 19:53:46,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {51856#true} assume 0 == ~st1~0; {51856#true} is VALID [2022-02-20 19:53:46,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {51856#true} assume ~send1~0 == ~id1~0; {51856#true} is VALID [2022-02-20 19:53:46,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {51856#true} assume 0 == ~mode1~0 % 256; {51856#true} is VALID [2022-02-20 19:53:46,205 INFO L290 TraceCheckUtils]: 8: Hoare triple {51856#true} assume ~id2~0 >= 0; {51856#true} is VALID [2022-02-20 19:53:46,205 INFO L290 TraceCheckUtils]: 9: Hoare triple {51856#true} assume 0 == ~st2~0; {51856#true} is VALID [2022-02-20 19:53:46,205 INFO L290 TraceCheckUtils]: 10: Hoare triple {51856#true} assume ~send2~0 == ~id2~0; {51856#true} is VALID [2022-02-20 19:53:46,206 INFO L290 TraceCheckUtils]: 11: Hoare triple {51856#true} assume 0 == ~mode2~0 % 256; {51856#true} is VALID [2022-02-20 19:53:46,206 INFO L290 TraceCheckUtils]: 12: Hoare triple {51856#true} assume ~id3~0 >= 0; {51856#true} is VALID [2022-02-20 19:53:46,206 INFO L290 TraceCheckUtils]: 13: Hoare triple {51856#true} assume 0 == ~st3~0; {51856#true} is VALID [2022-02-20 19:53:46,206 INFO L290 TraceCheckUtils]: 14: Hoare triple {51856#true} assume ~send3~0 == ~id3~0; {51856#true} is VALID [2022-02-20 19:53:46,206 INFO L290 TraceCheckUtils]: 15: Hoare triple {51856#true} assume 0 == ~mode3~0 % 256; {51856#true} is VALID [2022-02-20 19:53:46,206 INFO L290 TraceCheckUtils]: 16: Hoare triple {51856#true} assume ~id4~0 >= 0; {51856#true} is VALID [2022-02-20 19:53:46,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {51856#true} assume 0 == ~st4~0; {51856#true} is VALID [2022-02-20 19:53:46,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {51856#true} assume ~send4~0 == ~id4~0; {51856#true} is VALID [2022-02-20 19:53:46,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {51856#true} assume 0 == ~mode4~0 % 256; {51856#true} is VALID [2022-02-20 19:53:46,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {51856#true} assume ~id5~0 >= 0; {51856#true} is VALID [2022-02-20 19:53:46,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {51856#true} assume 0 == ~st5~0; {51856#true} is VALID [2022-02-20 19:53:46,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {51856#true} assume ~send5~0 == ~id5~0; {51856#true} is VALID [2022-02-20 19:53:46,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {51856#true} assume 0 == ~mode5~0 % 256; {51856#true} is VALID [2022-02-20 19:53:46,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {51856#true} assume ~id6~0 >= 0; {51856#true} is VALID [2022-02-20 19:53:46,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {51856#true} assume 0 == ~st6~0; {51856#true} is VALID [2022-02-20 19:53:46,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {51856#true} assume ~send6~0 == ~id6~0; {51856#true} is VALID [2022-02-20 19:53:46,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {51856#true} assume 0 == ~mode6~0 % 256; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 >= 0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send7~0 == ~id7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,209 INFO L290 TraceCheckUtils]: 31: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode7~0 % 256; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,209 INFO L290 TraceCheckUtils]: 32: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id8~0 >= 0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~st8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send8~0 == ~id8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume 0 == ~mode8~0 % 256; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,211 INFO L290 TraceCheckUtils]: 36: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id2~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id3~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,211 INFO L290 TraceCheckUtils]: 38: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id4~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,212 INFO L290 TraceCheckUtils]: 39: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id5~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id6~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,212 INFO L290 TraceCheckUtils]: 41: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,213 INFO L290 TraceCheckUtils]: 42: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id1~0 != ~id8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,213 INFO L290 TraceCheckUtils]: 43: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id3~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,213 INFO L290 TraceCheckUtils]: 44: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id4~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,213 INFO L290 TraceCheckUtils]: 45: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id5~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,214 INFO L290 TraceCheckUtils]: 46: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id6~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,214 INFO L290 TraceCheckUtils]: 47: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,214 INFO L290 TraceCheckUtils]: 48: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id2~0 != ~id8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,215 INFO L290 TraceCheckUtils]: 49: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id4~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,215 INFO L290 TraceCheckUtils]: 50: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id5~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,215 INFO L290 TraceCheckUtils]: 51: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id6~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,216 INFO L290 TraceCheckUtils]: 52: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,216 INFO L290 TraceCheckUtils]: 53: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id3~0 != ~id8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,216 INFO L290 TraceCheckUtils]: 54: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id5~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,217 INFO L290 TraceCheckUtils]: 55: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id6~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,217 INFO L290 TraceCheckUtils]: 56: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,217 INFO L290 TraceCheckUtils]: 57: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id4~0 != ~id8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,218 INFO L290 TraceCheckUtils]: 58: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id6~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,218 INFO L290 TraceCheckUtils]: 59: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,218 INFO L290 TraceCheckUtils]: 60: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id5~0 != ~id8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,219 INFO L290 TraceCheckUtils]: 61: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id7~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,219 INFO L290 TraceCheckUtils]: 62: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id6~0 != ~id8~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,219 INFO L290 TraceCheckUtils]: 63: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,220 INFO L290 TraceCheckUtils]: 64: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} init_#res#1 := init_~tmp~0#1; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,220 INFO L290 TraceCheckUtils]: 65: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,220 INFO L290 TraceCheckUtils]: 66: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,221 INFO L290 TraceCheckUtils]: 67: Hoare triple {51858#(= (+ (* (- 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;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,221 INFO L290 TraceCheckUtils]: 68: Hoare triple {51858#(= (+ (* (- 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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,221 INFO L290 TraceCheckUtils]: 69: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode1~0 % 256); {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,222 INFO L290 TraceCheckUtils]: 70: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,222 INFO L290 TraceCheckUtils]: 71: Hoare triple {51858#(= (+ (* (- 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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,222 INFO L290 TraceCheckUtils]: 72: Hoare triple {51858#(= (+ (* (- 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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,223 INFO L290 TraceCheckUtils]: 73: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode2~0 % 256); {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,223 INFO L290 TraceCheckUtils]: 74: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,223 INFO L290 TraceCheckUtils]: 75: Hoare triple {51858#(= (+ (* (- 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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,224 INFO L290 TraceCheckUtils]: 76: Hoare triple {51858#(= (+ (* (- 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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,224 INFO L290 TraceCheckUtils]: 77: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode3~0 % 256); {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,224 INFO L290 TraceCheckUtils]: 78: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,225 INFO L290 TraceCheckUtils]: 79: Hoare triple {51858#(= (+ (* (- 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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,225 INFO L290 TraceCheckUtils]: 80: Hoare triple {51858#(= (+ (* (- 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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,225 INFO L290 TraceCheckUtils]: 81: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode4~0 % 256); {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,226 INFO L290 TraceCheckUtils]: 82: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,226 INFO L290 TraceCheckUtils]: 83: Hoare triple {51858#(= (+ (* (- 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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,226 INFO L290 TraceCheckUtils]: 84: Hoare triple {51858#(= (+ (* (- 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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,227 INFO L290 TraceCheckUtils]: 85: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume !(0 != ~mode5~0 % 256); {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,227 INFO L290 TraceCheckUtils]: 86: Hoare triple {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,227 INFO L290 TraceCheckUtils]: 87: Hoare triple {51858#(= (+ (* (- 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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,228 INFO L290 TraceCheckUtils]: 88: Hoare triple {51858#(= (+ (* (- 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; {51858#(= (+ (* (- 256) (div ~mode6~0 256)) ~mode6~0) 0)} is VALID [2022-02-20 19:53:46,228 INFO L290 TraceCheckUtils]: 89: Hoare triple {51858#(= (+ (* (- 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; {51857#false} is VALID [2022-02-20 19:53:46,228 INFO L290 TraceCheckUtils]: 90: Hoare triple {51857#false} assume !(node6_~m6~0#1 != ~nomsg~0); {51857#false} is VALID [2022-02-20 19:53:46,228 INFO L290 TraceCheckUtils]: 91: Hoare triple {51857#false} ~mode6~0 := 0; {51857#false} is VALID [2022-02-20 19:53:46,228 INFO L290 TraceCheckUtils]: 92: Hoare triple {51857#false} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {51857#false} is VALID [2022-02-20 19:53:46,229 INFO L290 TraceCheckUtils]: 93: Hoare triple {51857#false} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {51857#false} is VALID [2022-02-20 19:53:46,229 INFO L290 TraceCheckUtils]: 94: Hoare triple {51857#false} assume !(node7_~m7~0#1 != ~nomsg~0); {51857#false} is VALID [2022-02-20 19:53:46,229 INFO L290 TraceCheckUtils]: 95: Hoare triple {51857#false} ~mode7~0 := 0; {51857#false} is VALID [2022-02-20 19:53:46,229 INFO L290 TraceCheckUtils]: 96: Hoare triple {51857#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {51857#false} is VALID [2022-02-20 19:53:46,229 INFO L290 TraceCheckUtils]: 97: Hoare triple {51857#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {51857#false} is VALID [2022-02-20 19:53:46,229 INFO L290 TraceCheckUtils]: 98: Hoare triple {51857#false} assume !(node8_~m8~0#1 != ~nomsg~0); {51857#false} is VALID [2022-02-20 19:53:46,229 INFO L290 TraceCheckUtils]: 99: Hoare triple {51857#false} ~mode8~0 := 0; {51857#false} is VALID [2022-02-20 19:53:46,229 INFO L290 TraceCheckUtils]: 100: Hoare triple {51857#false} assume { :end_inline_node8 } 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;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {51857#false} is VALID [2022-02-20 19:53:46,230 INFO L290 TraceCheckUtils]: 101: Hoare triple {51857#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {51857#false} is VALID [2022-02-20 19:53:46,230 INFO L290 TraceCheckUtils]: 102: Hoare triple {51857#false} check_#res#1 := check_~tmp~1#1; {51857#false} is VALID [2022-02-20 19:53:46,230 INFO L290 TraceCheckUtils]: 103: Hoare triple {51857#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {51857#false} is VALID [2022-02-20 19:53:46,230 INFO L290 TraceCheckUtils]: 104: Hoare triple {51857#false} assume 0 == assert_~arg#1 % 256; {51857#false} is VALID [2022-02-20 19:53:46,230 INFO L290 TraceCheckUtils]: 105: Hoare triple {51857#false} assume !false; {51857#false} is VALID [2022-02-20 19:53:46,230 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:53:46,231 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:46,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722659251] [2022-02-20 19:53:46,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722659251] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:46,231 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:46,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:46,231 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442671380] [2022-02-20 19:53:46,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:46,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:46,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:46,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:46,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:46,297 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:46,297 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:46,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:46,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:46,298 INFO L87 Difference]: Start difference. First operand 2598 states and 4102 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:48,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:48,763 INFO L93 Difference]: Finished difference Result 4554 states and 7176 transitions. [2022-02-20 19:53:48,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:48,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:48,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:48,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:48,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:48,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:48,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:48,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions. [2022-02-20 19:53:50,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1868 edges. 1868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:50,666 INFO L225 Difference]: With dead ends: 4554 [2022-02-20 19:53:50,667 INFO L226 Difference]: Without dead ends: 3528 [2022-02-20 19:53:50,668 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:53:50,668 INFO L933 BasicCegarLoop]: 1704 mSDtfsCounter, 1533 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1533 SdHoareTripleChecker+Valid, 1846 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:53:50,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1533 Valid, 1846 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:50,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3528 states. [2022-02-20 19:53:50,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3528 to 3526. [2022-02-20 19:53:50,874 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:50,877 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3528 states. Second operand has 3526 states, 3524 states have (on average 1.572644721906924) internal successors, (5542), 3525 states have internal predecessors, (5542), 0 states have call successors, (0), 0 states have 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:53:50,880 INFO L74 IsIncluded]: Start isIncluded. First operand 3528 states. Second operand has 3526 states, 3524 states have (on average 1.572644721906924) internal successors, (5542), 3525 states have internal predecessors, (5542), 0 states have call successors, (0), 0 states have 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:53:50,883 INFO L87 Difference]: Start difference. First operand 3528 states. Second operand has 3526 states, 3524 states have (on average 1.572644721906924) internal successors, (5542), 3525 states have internal predecessors, (5542), 0 states have call successors, (0), 0 states have 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:53:51,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:51,232 INFO L93 Difference]: Finished difference Result 3528 states and 5543 transitions. [2022-02-20 19:53:51,232 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 5543 transitions. [2022-02-20 19:53:51,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:51,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:51,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 3526 states, 3524 states have (on average 1.572644721906924) internal successors, (5542), 3525 states have internal predecessors, (5542), 0 states have call successors, (0), 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 3528 states. [2022-02-20 19:53:51,241 INFO L87 Difference]: Start difference. First operand has 3526 states, 3524 states have (on average 1.572644721906924) internal successors, (5542), 3525 states have internal predecessors, (5542), 0 states have call successors, (0), 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 3528 states. [2022-02-20 19:53:51,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:51,615 INFO L93 Difference]: Finished difference Result 3528 states and 5543 transitions. [2022-02-20 19:53:51,615 INFO L276 IsEmpty]: Start isEmpty. Operand 3528 states and 5543 transitions. [2022-02-20 19:53:51,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:51,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:51,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:53:51,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:53:51,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3526 states, 3524 states have (on average 1.572644721906924) internal successors, (5542), 3525 states have internal predecessors, (5542), 0 states have call successors, (0), 0 states have 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:53:52,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5542 transitions. [2022-02-20 19:53:52,061 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5542 transitions. Word has length 106 [2022-02-20 19:53:52,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:53:52,062 INFO L470 AbstractCegarLoop]: Abstraction has 3526 states and 5542 transitions. [2022-02-20 19:53:52,062 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:52,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5542 transitions. [2022-02-20 19:53:52,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:53:52,064 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:53:52,064 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:53:52,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:53:52,064 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:53:52,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:53:52,064 INFO L85 PathProgramCache]: Analyzing trace with hash 732328407, now seen corresponding path program 1 times [2022-02-20 19:53:52,064 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:53:52,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277998599] [2022-02-20 19:53:52,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:53:52,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:53:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:53:52,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {67899#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;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {67899#true} is VALID [2022-02-20 19:53:52,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {67899#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {67899#true} is VALID [2022-02-20 19:53:52,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {67899#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#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~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {67899#true} is VALID [2022-02-20 19:53:52,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {67899#true} assume 0 == ~r1~0 % 256; {67899#true} is VALID [2022-02-20 19:53:52,118 INFO L290 TraceCheckUtils]: 4: Hoare triple {67899#true} assume ~id1~0 >= 0; {67899#true} is VALID [2022-02-20 19:53:52,118 INFO L290 TraceCheckUtils]: 5: Hoare triple {67899#true} assume 0 == ~st1~0; {67899#true} is VALID [2022-02-20 19:53:52,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {67899#true} assume ~send1~0 == ~id1~0; {67899#true} is VALID [2022-02-20 19:53:52,119 INFO L290 TraceCheckUtils]: 7: Hoare triple {67899#true} assume 0 == ~mode1~0 % 256; {67899#true} is VALID [2022-02-20 19:53:52,119 INFO L290 TraceCheckUtils]: 8: Hoare triple {67899#true} assume ~id2~0 >= 0; {67899#true} is VALID [2022-02-20 19:53:52,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {67899#true} assume 0 == ~st2~0; {67899#true} is VALID [2022-02-20 19:53:52,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {67899#true} assume ~send2~0 == ~id2~0; {67899#true} is VALID [2022-02-20 19:53:52,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {67899#true} assume 0 == ~mode2~0 % 256; {67899#true} is VALID [2022-02-20 19:53:52,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {67899#true} assume ~id3~0 >= 0; {67899#true} is VALID [2022-02-20 19:53:52,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {67899#true} assume 0 == ~st3~0; {67899#true} is VALID [2022-02-20 19:53:52,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {67899#true} assume ~send3~0 == ~id3~0; {67899#true} is VALID [2022-02-20 19:53:52,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {67899#true} assume 0 == ~mode3~0 % 256; {67899#true} is VALID [2022-02-20 19:53:52,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {67899#true} assume ~id4~0 >= 0; {67899#true} is VALID [2022-02-20 19:53:52,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {67899#true} assume 0 == ~st4~0; {67899#true} is VALID [2022-02-20 19:53:52,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {67899#true} assume ~send4~0 == ~id4~0; {67899#true} is VALID [2022-02-20 19:53:52,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {67899#true} assume 0 == ~mode4~0 % 256; {67899#true} is VALID [2022-02-20 19:53:52,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {67899#true} assume ~id5~0 >= 0; {67899#true} is VALID [2022-02-20 19:53:52,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {67899#true} assume 0 == ~st5~0; {67899#true} is VALID [2022-02-20 19:53:52,120 INFO L290 TraceCheckUtils]: 22: Hoare triple {67899#true} assume ~send5~0 == ~id5~0; {67899#true} is VALID [2022-02-20 19:53:52,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {67899#true} assume 0 == ~mode5~0 % 256; {67899#true} is VALID [2022-02-20 19:53:52,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {67899#true} assume ~id6~0 >= 0; {67899#true} is VALID [2022-02-20 19:53:52,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {67899#true} assume 0 == ~st6~0; {67899#true} is VALID [2022-02-20 19:53:52,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {67899#true} assume ~send6~0 == ~id6~0; {67899#true} is VALID [2022-02-20 19:53:52,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {67899#true} assume 0 == ~mode6~0 % 256; {67899#true} is VALID [2022-02-20 19:53:52,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {67899#true} assume ~id7~0 >= 0; {67899#true} is VALID [2022-02-20 19:53:52,121 INFO L290 TraceCheckUtils]: 29: Hoare triple {67899#true} assume 0 == ~st7~0; {67899#true} is VALID [2022-02-20 19:53:52,121 INFO L290 TraceCheckUtils]: 30: Hoare triple {67899#true} assume ~send7~0 == ~id7~0; {67899#true} is VALID [2022-02-20 19:53:52,127 INFO L290 TraceCheckUtils]: 31: Hoare triple {67899#true} assume 0 == ~mode7~0 % 256; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,128 INFO L290 TraceCheckUtils]: 32: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id8~0 >= 0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,128 INFO L290 TraceCheckUtils]: 33: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume 0 == ~st8~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,129 INFO L290 TraceCheckUtils]: 34: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send8~0 == ~id8~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,129 INFO L290 TraceCheckUtils]: 35: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume 0 == ~mode8~0 % 256; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,129 INFO L290 TraceCheckUtils]: 36: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id2~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,130 INFO L290 TraceCheckUtils]: 37: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id3~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,130 INFO L290 TraceCheckUtils]: 38: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id4~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,130 INFO L290 TraceCheckUtils]: 39: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id5~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,131 INFO L290 TraceCheckUtils]: 40: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id6~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,131 INFO L290 TraceCheckUtils]: 41: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id7~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,131 INFO L290 TraceCheckUtils]: 42: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id1~0 != ~id8~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,132 INFO L290 TraceCheckUtils]: 43: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id3~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,132 INFO L290 TraceCheckUtils]: 44: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id4~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,132 INFO L290 TraceCheckUtils]: 45: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id5~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,133 INFO L290 TraceCheckUtils]: 46: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id6~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,133 INFO L290 TraceCheckUtils]: 47: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id7~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,134 INFO L290 TraceCheckUtils]: 48: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id2~0 != ~id8~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,134 INFO L290 TraceCheckUtils]: 49: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id4~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,134 INFO L290 TraceCheckUtils]: 50: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id5~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,135 INFO L290 TraceCheckUtils]: 51: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id6~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,135 INFO L290 TraceCheckUtils]: 52: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id7~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,135 INFO L290 TraceCheckUtils]: 53: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id3~0 != ~id8~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,136 INFO L290 TraceCheckUtils]: 54: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id5~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,136 INFO L290 TraceCheckUtils]: 55: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id6~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,136 INFO L290 TraceCheckUtils]: 56: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id7~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,137 INFO L290 TraceCheckUtils]: 57: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id4~0 != ~id8~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,137 INFO L290 TraceCheckUtils]: 58: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id6~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,137 INFO L290 TraceCheckUtils]: 59: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id7~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,138 INFO L290 TraceCheckUtils]: 60: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id5~0 != ~id8~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,138 INFO L290 TraceCheckUtils]: 61: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id6~0 != ~id7~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,138 INFO L290 TraceCheckUtils]: 62: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id6~0 != ~id8~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,139 INFO L290 TraceCheckUtils]: 63: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,139 INFO L290 TraceCheckUtils]: 64: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} init_#res#1 := init_~tmp~0#1; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,139 INFO L290 TraceCheckUtils]: 65: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,140 INFO L290 TraceCheckUtils]: 66: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 == assume_abort_if_not_~cond#1); {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,140 INFO L290 TraceCheckUtils]: 67: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,140 INFO L290 TraceCheckUtils]: 68: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,141 INFO L290 TraceCheckUtils]: 69: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode1~0 % 256); {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,141 INFO L290 TraceCheckUtils]: 70: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,141 INFO L290 TraceCheckUtils]: 71: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,142 INFO L290 TraceCheckUtils]: 72: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,142 INFO L290 TraceCheckUtils]: 73: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode2~0 % 256); {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,142 INFO L290 TraceCheckUtils]: 74: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,143 INFO L290 TraceCheckUtils]: 75: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,143 INFO L290 TraceCheckUtils]: 76: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,144 INFO L290 TraceCheckUtils]: 77: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode3~0 % 256); {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,144 INFO L290 TraceCheckUtils]: 78: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,144 INFO L290 TraceCheckUtils]: 79: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,145 INFO L290 TraceCheckUtils]: 80: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,145 INFO L290 TraceCheckUtils]: 81: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode4~0 % 256); {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,145 INFO L290 TraceCheckUtils]: 82: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,146 INFO L290 TraceCheckUtils]: 83: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,146 INFO L290 TraceCheckUtils]: 84: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,146 INFO L290 TraceCheckUtils]: 85: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode5~0 % 256); {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,147 INFO L290 TraceCheckUtils]: 86: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,147 INFO L290 TraceCheckUtils]: 87: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,147 INFO L290 TraceCheckUtils]: 88: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,148 INFO L290 TraceCheckUtils]: 89: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume !(0 != ~mode6~0 % 256); {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,148 INFO L290 TraceCheckUtils]: 90: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,148 INFO L290 TraceCheckUtils]: 91: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 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; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,149 INFO L290 TraceCheckUtils]: 92: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} is VALID [2022-02-20 19:53:52,149 INFO L290 TraceCheckUtils]: 93: Hoare triple {67901#(= (+ ~mode7~0 (* (- 256) (div ~mode7~0 256))) 0)} assume 0 != ~mode7~0 % 256;node7_~m7~0#1 := ~p6_old~0;~p6_old~0 := ~nomsg~0; {67900#false} is VALID [2022-02-20 19:53:52,149 INFO L290 TraceCheckUtils]: 94: Hoare triple {67900#false} assume !(node7_~m7~0#1 != ~nomsg~0); {67900#false} is VALID [2022-02-20 19:53:52,150 INFO L290 TraceCheckUtils]: 95: Hoare triple {67900#false} ~mode7~0 := 0; {67900#false} is VALID [2022-02-20 19:53:52,150 INFO L290 TraceCheckUtils]: 96: Hoare triple {67900#false} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {67900#false} is VALID [2022-02-20 19:53:52,150 INFO L290 TraceCheckUtils]: 97: Hoare triple {67900#false} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {67900#false} is VALID [2022-02-20 19:53:52,150 INFO L290 TraceCheckUtils]: 98: Hoare triple {67900#false} assume !(node8_~m8~0#1 != ~nomsg~0); {67900#false} is VALID [2022-02-20 19:53:52,150 INFO L290 TraceCheckUtils]: 99: Hoare triple {67900#false} ~mode8~0 := 0; {67900#false} is VALID [2022-02-20 19:53:52,150 INFO L290 TraceCheckUtils]: 100: Hoare triple {67900#false} assume { :end_inline_node8 } 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;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {67900#false} is VALID [2022-02-20 19:53:52,150 INFO L290 TraceCheckUtils]: 101: Hoare triple {67900#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {67900#false} is VALID [2022-02-20 19:53:52,150 INFO L290 TraceCheckUtils]: 102: Hoare triple {67900#false} check_#res#1 := check_~tmp~1#1; {67900#false} is VALID [2022-02-20 19:53:52,150 INFO L290 TraceCheckUtils]: 103: Hoare triple {67900#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {67900#false} is VALID [2022-02-20 19:53:52,151 INFO L290 TraceCheckUtils]: 104: Hoare triple {67900#false} assume 0 == assert_~arg#1 % 256; {67900#false} is VALID [2022-02-20 19:53:52,151 INFO L290 TraceCheckUtils]: 105: Hoare triple {67900#false} assume !false; {67900#false} is VALID [2022-02-20 19:53:52,151 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:53:52,151 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:53:52,151 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277998599] [2022-02-20 19:53:52,152 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277998599] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:53:52,152 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:53:52,152 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:53:52,152 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124070065] [2022-02-20 19:53:52,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:53:52,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:52,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:53:52,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:52,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:52,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:53:52,222 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:53:52,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:53:52,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:53:52,223 INFO L87 Difference]: Start difference. First operand 3526 states and 5542 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:55,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:55,930 INFO L93 Difference]: Finished difference Result 7242 states and 11336 transitions. [2022-02-20 19:53:55,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:53:55,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:53:55,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:53:55,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:55,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:55,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:53:55,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1868 transitions. [2022-02-20 19:53:55,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1868 transitions. [2022-02-20 19:53:57,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1868 edges. 1868 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:53:58,206 INFO L225 Difference]: With dead ends: 7242 [2022-02-20 19:53:58,206 INFO L226 Difference]: Without dead ends: 5288 [2022-02-20 19:53:58,208 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:53:58,209 INFO L933 BasicCegarLoop]: 1699 mSDtfsCounter, 1529 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1529 SdHoareTripleChecker+Valid, 1845 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:53:58,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1529 Valid, 1845 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:53:58,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5288 states. [2022-02-20 19:53:58,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5288 to 5286. [2022-02-20 19:53:58,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:53:58,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5288 states. Second operand has 5286 states, 5284 states have (on average 1.560560181680545) internal successors, (8246), 5285 states have internal predecessors, (8246), 0 states have call successors, (0), 0 states have 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:53:58,633 INFO L74 IsIncluded]: Start isIncluded. First operand 5288 states. Second operand has 5286 states, 5284 states have (on average 1.560560181680545) internal successors, (8246), 5285 states have internal predecessors, (8246), 0 states have call successors, (0), 0 states have 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:53:58,639 INFO L87 Difference]: Start difference. First operand 5288 states. Second operand has 5286 states, 5284 states have (on average 1.560560181680545) internal successors, (8246), 5285 states have internal predecessors, (8246), 0 states have call successors, (0), 0 states have 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:53:59,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:53:59,401 INFO L93 Difference]: Finished difference Result 5288 states and 8247 transitions. [2022-02-20 19:53:59,401 INFO L276 IsEmpty]: Start isEmpty. Operand 5288 states and 8247 transitions. [2022-02-20 19:53:59,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:53:59,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:53:59,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 5286 states, 5284 states have (on average 1.560560181680545) internal successors, (8246), 5285 states have internal predecessors, (8246), 0 states have call successors, (0), 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 5288 states. [2022-02-20 19:53:59,416 INFO L87 Difference]: Start difference. First operand has 5286 states, 5284 states have (on average 1.560560181680545) internal successors, (8246), 5285 states have internal predecessors, (8246), 0 states have call successors, (0), 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 5288 states. [2022-02-20 19:54:00,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:54:00,189 INFO L93 Difference]: Finished difference Result 5288 states and 8247 transitions. [2022-02-20 19:54:00,189 INFO L276 IsEmpty]: Start isEmpty. Operand 5288 states and 8247 transitions. [2022-02-20 19:54:00,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:54:00,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:54:00,194 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:54:00,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:54:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5286 states, 5284 states have (on average 1.560560181680545) internal successors, (8246), 5285 states have internal predecessors, (8246), 0 states have call successors, (0), 0 states have 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:54:01,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5286 states to 5286 states and 8246 transitions. [2022-02-20 19:54:01,195 INFO L78 Accepts]: Start accepts. Automaton has 5286 states and 8246 transitions. Word has length 106 [2022-02-20 19:54:01,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:54:01,195 INFO L470 AbstractCegarLoop]: Abstraction has 5286 states and 8246 transitions. [2022-02-20 19:54:01,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:54:01,195 INFO L276 IsEmpty]: Start isEmpty. Operand 5286 states and 8246 transitions. [2022-02-20 19:54:01,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-02-20 19:54:01,196 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:54:01,196 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 19:54:01,196 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:54:01,196 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:54:01,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:54:01,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1070121549, now seen corresponding path program 1 times [2022-02-20 19:54:01,197 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:54:01,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760712870] [2022-02-20 19:54:01,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:54:01,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:54:01,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:54:01,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {92790#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;~p7~0 := 0;~p7_old~0 := 0;~p7_new~0 := 0;~id7~0 := 0;~st7~0 := 0;~send7~0 := 0;~mode7~0 := 0;~p8~0 := 0;~p8_old~0 := 0;~p8_new~0 := 0;~id8~0 := 0;~st8~0 := 0;~send8~0 := 0;~mode8~0 := 0;~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[0 := #funAddr~node1.base], ~nodes~0.offset[0 := #funAddr~node1.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[1 := #funAddr~node2.base], ~nodes~0.offset[1 := #funAddr~node2.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[2 := #funAddr~node3.base], ~nodes~0.offset[2 := #funAddr~node3.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[3 := #funAddr~node4.base], ~nodes~0.offset[3 := #funAddr~node4.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[4 := #funAddr~node5.base], ~nodes~0.offset[4 := #funAddr~node5.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[5 := #funAddr~node6.base], ~nodes~0.offset[5 := #funAddr~node6.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[6 := #funAddr~node7.base], ~nodes~0.offset[6 := #funAddr~node7.offset];~nodes~0.base, ~nodes~0.offset := ~nodes~0.base[7 := #funAddr~node8.base], ~nodes~0.offset[7 := #funAddr~node8.offset];~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; {92790#true} is VALID [2022-02-20 19:54:01,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {92790#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet62#1, main_#t~ret63#1, main_#t~ret64#1;assume -2147483648 <= main_#t~nondet62#1 && main_#t~nondet62#1 <= 2147483647; {92790#true} is VALID [2022-02-20 19:54:01,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {92790#true} assume 0 != main_#t~nondet62#1;havoc main_#t~nondet62#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc 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~nondet36#1, main1_#t~nondet37#1, main1_#t~nondet38#1, main1_#t~nondet39#1, main1_#t~nondet40#1, main1_#t~nondet41#1, main1_#t~nondet42#1, main1_#t~nondet43#1, main1_#t~nondet44#1, main1_#t~nondet45#1, main1_#t~ret46#1, main1_#t~ret47#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~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~id1~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~st1~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;assume -128 <= main1_#t~nondet16#1 && main1_#t~nondet16#1 <= 127;~send1~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;~mode1~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~id2~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~st2~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;assume -128 <= main1_#t~nondet20#1 && main1_#t~nondet20#1 <= 127;~send2~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;~mode2~0 := main1_#t~nondet21#1;havoc main1_#t~nondet21#1;assume -128 <= main1_#t~nondet22#1 && main1_#t~nondet22#1 <= 127;~id3~0 := main1_#t~nondet22#1;havoc main1_#t~nondet22#1;assume -128 <= main1_#t~nondet23#1 && main1_#t~nondet23#1 <= 127;~st3~0 := main1_#t~nondet23#1;havoc main1_#t~nondet23#1;assume -128 <= main1_#t~nondet24#1 && main1_#t~nondet24#1 <= 127;~send3~0 := main1_#t~nondet24#1;havoc main1_#t~nondet24#1;~mode3~0 := main1_#t~nondet25#1;havoc main1_#t~nondet25#1;assume -128 <= main1_#t~nondet26#1 && main1_#t~nondet26#1 <= 127;~id4~0 := main1_#t~nondet26#1;havoc main1_#t~nondet26#1;assume -128 <= main1_#t~nondet27#1 && main1_#t~nondet27#1 <= 127;~st4~0 := main1_#t~nondet27#1;havoc main1_#t~nondet27#1;assume -128 <= main1_#t~nondet28#1 && main1_#t~nondet28#1 <= 127;~send4~0 := main1_#t~nondet28#1;havoc main1_#t~nondet28#1;~mode4~0 := main1_#t~nondet29#1;havoc main1_#t~nondet29#1;assume -128 <= main1_#t~nondet30#1 && main1_#t~nondet30#1 <= 127;~id5~0 := main1_#t~nondet30#1;havoc main1_#t~nondet30#1;assume -128 <= main1_#t~nondet31#1 && main1_#t~nondet31#1 <= 127;~st5~0 := main1_#t~nondet31#1;havoc main1_#t~nondet31#1;assume -128 <= main1_#t~nondet32#1 && main1_#t~nondet32#1 <= 127;~send5~0 := main1_#t~nondet32#1;havoc main1_#t~nondet32#1;~mode5~0 := main1_#t~nondet33#1;havoc main1_#t~nondet33#1;assume -128 <= main1_#t~nondet34#1 && main1_#t~nondet34#1 <= 127;~id6~0 := main1_#t~nondet34#1;havoc main1_#t~nondet34#1;assume -128 <= main1_#t~nondet35#1 && main1_#t~nondet35#1 <= 127;~st6~0 := main1_#t~nondet35#1;havoc main1_#t~nondet35#1;assume -128 <= main1_#t~nondet36#1 && main1_#t~nondet36#1 <= 127;~send6~0 := main1_#t~nondet36#1;havoc main1_#t~nondet36#1;~mode6~0 := main1_#t~nondet37#1;havoc main1_#t~nondet37#1;assume -128 <= main1_#t~nondet38#1 && main1_#t~nondet38#1 <= 127;~id7~0 := main1_#t~nondet38#1;havoc main1_#t~nondet38#1;assume -128 <= main1_#t~nondet39#1 && main1_#t~nondet39#1 <= 127;~st7~0 := main1_#t~nondet39#1;havoc main1_#t~nondet39#1;assume -128 <= main1_#t~nondet40#1 && main1_#t~nondet40#1 <= 127;~send7~0 := main1_#t~nondet40#1;havoc main1_#t~nondet40#1;~mode7~0 := main1_#t~nondet41#1;havoc main1_#t~nondet41#1;assume -128 <= main1_#t~nondet42#1 && main1_#t~nondet42#1 <= 127;~id8~0 := main1_#t~nondet42#1;havoc main1_#t~nondet42#1;assume -128 <= main1_#t~nondet43#1 && main1_#t~nondet43#1 <= 127;~st8~0 := main1_#t~nondet43#1;havoc main1_#t~nondet43#1;assume -128 <= main1_#t~nondet44#1 && main1_#t~nondet44#1 <= 127;~send8~0 := main1_#t~nondet44#1;havoc main1_#t~nondet44#1;~mode8~0 := main1_#t~nondet45#1;havoc main1_#t~nondet45#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {92790#true} is VALID [2022-02-20 19:54:01,249 INFO L290 TraceCheckUtils]: 3: Hoare triple {92790#true} assume 0 == ~r1~0 % 256; {92790#true} is VALID [2022-02-20 19:54:01,249 INFO L290 TraceCheckUtils]: 4: Hoare triple {92790#true} assume ~id1~0 >= 0; {92790#true} is VALID [2022-02-20 19:54:01,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {92790#true} assume 0 == ~st1~0; {92790#true} is VALID [2022-02-20 19:54:01,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {92790#true} assume ~send1~0 == ~id1~0; {92790#true} is VALID [2022-02-20 19:54:01,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {92790#true} assume 0 == ~mode1~0 % 256; {92790#true} is VALID [2022-02-20 19:54:01,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {92790#true} assume ~id2~0 >= 0; {92790#true} is VALID [2022-02-20 19:54:01,250 INFO L290 TraceCheckUtils]: 9: Hoare triple {92790#true} assume 0 == ~st2~0; {92790#true} is VALID [2022-02-20 19:54:01,250 INFO L290 TraceCheckUtils]: 10: Hoare triple {92790#true} assume ~send2~0 == ~id2~0; {92790#true} is VALID [2022-02-20 19:54:01,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {92790#true} assume 0 == ~mode2~0 % 256; {92790#true} is VALID [2022-02-20 19:54:01,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {92790#true} assume ~id3~0 >= 0; {92790#true} is VALID [2022-02-20 19:54:01,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {92790#true} assume 0 == ~st3~0; {92790#true} is VALID [2022-02-20 19:54:01,250 INFO L290 TraceCheckUtils]: 14: Hoare triple {92790#true} assume ~send3~0 == ~id3~0; {92790#true} is VALID [2022-02-20 19:54:01,250 INFO L290 TraceCheckUtils]: 15: Hoare triple {92790#true} assume 0 == ~mode3~0 % 256; {92790#true} is VALID [2022-02-20 19:54:01,250 INFO L290 TraceCheckUtils]: 16: Hoare triple {92790#true} assume ~id4~0 >= 0; {92790#true} is VALID [2022-02-20 19:54:01,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {92790#true} assume 0 == ~st4~0; {92790#true} is VALID [2022-02-20 19:54:01,251 INFO L290 TraceCheckUtils]: 18: Hoare triple {92790#true} assume ~send4~0 == ~id4~0; {92790#true} is VALID [2022-02-20 19:54:01,251 INFO L290 TraceCheckUtils]: 19: Hoare triple {92790#true} assume 0 == ~mode4~0 % 256; {92790#true} is VALID [2022-02-20 19:54:01,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {92790#true} assume ~id5~0 >= 0; {92790#true} is VALID [2022-02-20 19:54:01,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {92790#true} assume 0 == ~st5~0; {92790#true} is VALID [2022-02-20 19:54:01,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {92790#true} assume ~send5~0 == ~id5~0; {92790#true} is VALID [2022-02-20 19:54:01,251 INFO L290 TraceCheckUtils]: 23: Hoare triple {92790#true} assume 0 == ~mode5~0 % 256; {92790#true} is VALID [2022-02-20 19:54:01,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {92790#true} assume ~id6~0 >= 0; {92790#true} is VALID [2022-02-20 19:54:01,251 INFO L290 TraceCheckUtils]: 25: Hoare triple {92790#true} assume 0 == ~st6~0; {92790#true} is VALID [2022-02-20 19:54:01,252 INFO L290 TraceCheckUtils]: 26: Hoare triple {92790#true} assume ~send6~0 == ~id6~0; {92790#true} is VALID [2022-02-20 19:54:01,252 INFO L290 TraceCheckUtils]: 27: Hoare triple {92790#true} assume 0 == ~mode6~0 % 256; {92790#true} is VALID [2022-02-20 19:54:01,252 INFO L290 TraceCheckUtils]: 28: Hoare triple {92790#true} assume ~id7~0 >= 0; {92790#true} is VALID [2022-02-20 19:54:01,252 INFO L290 TraceCheckUtils]: 29: Hoare triple {92790#true} assume 0 == ~st7~0; {92790#true} is VALID [2022-02-20 19:54:01,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {92790#true} assume ~send7~0 == ~id7~0; {92790#true} is VALID [2022-02-20 19:54:01,252 INFO L290 TraceCheckUtils]: 31: Hoare triple {92790#true} assume 0 == ~mode7~0 % 256; {92790#true} is VALID [2022-02-20 19:54:01,252 INFO L290 TraceCheckUtils]: 32: Hoare triple {92790#true} assume ~id8~0 >= 0; {92790#true} is VALID [2022-02-20 19:54:01,252 INFO L290 TraceCheckUtils]: 33: Hoare triple {92790#true} assume 0 == ~st8~0; {92790#true} is VALID [2022-02-20 19:54:01,253 INFO L290 TraceCheckUtils]: 34: Hoare triple {92790#true} assume ~send8~0 == ~id8~0; {92790#true} is VALID [2022-02-20 19:54:01,253 INFO L290 TraceCheckUtils]: 35: Hoare triple {92790#true} assume 0 == ~mode8~0 % 256; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,254 INFO L290 TraceCheckUtils]: 36: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id2~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,254 INFO L290 TraceCheckUtils]: 37: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id3~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,254 INFO L290 TraceCheckUtils]: 38: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id4~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,254 INFO L290 TraceCheckUtils]: 39: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id5~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,255 INFO L290 TraceCheckUtils]: 40: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id6~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,255 INFO L290 TraceCheckUtils]: 41: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id7~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,255 INFO L290 TraceCheckUtils]: 42: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id1~0 != ~id8~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,256 INFO L290 TraceCheckUtils]: 43: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id3~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,256 INFO L290 TraceCheckUtils]: 44: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id4~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,256 INFO L290 TraceCheckUtils]: 45: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id5~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,257 INFO L290 TraceCheckUtils]: 46: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id6~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,260 INFO L290 TraceCheckUtils]: 47: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id7~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,260 INFO L290 TraceCheckUtils]: 48: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id2~0 != ~id8~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,261 INFO L290 TraceCheckUtils]: 49: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id4~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,261 INFO L290 TraceCheckUtils]: 50: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id5~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,261 INFO L290 TraceCheckUtils]: 51: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id6~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,262 INFO L290 TraceCheckUtils]: 52: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id7~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,262 INFO L290 TraceCheckUtils]: 53: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id3~0 != ~id8~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,262 INFO L290 TraceCheckUtils]: 54: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id5~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,263 INFO L290 TraceCheckUtils]: 55: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id6~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,263 INFO L290 TraceCheckUtils]: 56: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id7~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,263 INFO L290 TraceCheckUtils]: 57: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id4~0 != ~id8~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,264 INFO L290 TraceCheckUtils]: 58: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id5~0 != ~id6~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,264 INFO L290 TraceCheckUtils]: 59: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id5~0 != ~id7~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,264 INFO L290 TraceCheckUtils]: 60: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id5~0 != ~id8~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,265 INFO L290 TraceCheckUtils]: 61: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id6~0 != ~id7~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,265 INFO L290 TraceCheckUtils]: 62: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id6~0 != ~id8~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,265 INFO L290 TraceCheckUtils]: 63: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~id7~0 != ~id8~0;init_~tmp~0#1 := 1; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,266 INFO L290 TraceCheckUtils]: 64: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} init_#res#1 := init_~tmp~0#1; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,266 INFO L290 TraceCheckUtils]: 65: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} main1_#t~ret46#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret46#1 && main1_#t~ret46#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret46#1;havoc main1_#t~ret46#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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,266 INFO L290 TraceCheckUtils]: 66: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,267 INFO L290 TraceCheckUtils]: 67: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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;~p7_old~0 := ~nomsg~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~nomsg~0;~p8_new~0 := ~nomsg~0;main1_~i2~0#1 := 0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,267 INFO L290 TraceCheckUtils]: 68: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,267 INFO L290 TraceCheckUtils]: 69: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode1~0 % 256); {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,268 INFO L290 TraceCheckUtils]: 70: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,268 INFO L290 TraceCheckUtils]: 71: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,269 INFO L290 TraceCheckUtils]: 72: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,269 INFO L290 TraceCheckUtils]: 73: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode2~0 % 256); {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,269 INFO L290 TraceCheckUtils]: 74: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,270 INFO L290 TraceCheckUtils]: 75: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,270 INFO L290 TraceCheckUtils]: 76: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,270 INFO L290 TraceCheckUtils]: 77: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode3~0 % 256); {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,271 INFO L290 TraceCheckUtils]: 78: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,271 INFO L290 TraceCheckUtils]: 79: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,271 INFO L290 TraceCheckUtils]: 80: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,272 INFO L290 TraceCheckUtils]: 81: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode4~0 % 256); {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,272 INFO L290 TraceCheckUtils]: 82: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite8#1 := ~send4~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,272 INFO L290 TraceCheckUtils]: 83: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,273 INFO L290 TraceCheckUtils]: 84: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,273 INFO L290 TraceCheckUtils]: 85: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode5~0 % 256); {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,274 INFO L290 TraceCheckUtils]: 86: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send5~0 != ~nomsg~0 && ~p5_new~0 == ~nomsg~0;node5_#t~ite9#1 := ~send5~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,274 INFO L290 TraceCheckUtils]: 87: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,274 INFO L290 TraceCheckUtils]: 88: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,275 INFO L290 TraceCheckUtils]: 89: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode6~0 % 256); {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,275 INFO L290 TraceCheckUtils]: 90: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send6~0 != ~nomsg~0 && ~p6_new~0 == ~nomsg~0;node6_#t~ite10#1 := ~send6~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,275 INFO L290 TraceCheckUtils]: 91: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~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; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,276 INFO L290 TraceCheckUtils]: 92: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume { :end_inline_node6 } true;assume { :begin_inline_node7 } true;havoc node7_#t~ite11#1, node7_~m7~0#1;havoc node7_~m7~0#1;node7_~m7~0#1 := ~nomsg~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,276 INFO L290 TraceCheckUtils]: 93: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume !(0 != ~mode7~0 % 256); {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,276 INFO L290 TraceCheckUtils]: 94: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume ~send7~0 != ~nomsg~0 && ~p7_new~0 == ~nomsg~0;node7_#t~ite11#1 := ~send7~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,277 INFO L290 TraceCheckUtils]: 95: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} ~p7_new~0 := (if node7_#t~ite11#1 % 256 <= 127 then node7_#t~ite11#1 % 256 else node7_#t~ite11#1 % 256 - 256);havoc node7_#t~ite11#1;~mode7~0 := 1; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,277 INFO L290 TraceCheckUtils]: 96: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume { :end_inline_node7 } true;assume { :begin_inline_node8 } true;havoc node8_#t~ite12#1, node8_~m8~0#1;havoc node8_~m8~0#1;node8_~m8~0#1 := ~nomsg~0; {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} is VALID [2022-02-20 19:54:01,278 INFO L290 TraceCheckUtils]: 97: Hoare triple {92792#(= (+ (* (div ~mode8~0 256) (- 256)) ~mode8~0) 0)} assume 0 != ~mode8~0 % 256;node8_~m8~0#1 := ~p7_old~0;~p7_old~0 := ~nomsg~0; {92791#false} is VALID [2022-02-20 19:54:01,278 INFO L290 TraceCheckUtils]: 98: Hoare triple {92791#false} assume !(node8_~m8~0#1 != ~nomsg~0); {92791#false} is VALID [2022-02-20 19:54:01,278 INFO L290 TraceCheckUtils]: 99: Hoare triple {92791#false} ~mode8~0 := 0; {92791#false} is VALID [2022-02-20 19:54:01,278 INFO L290 TraceCheckUtils]: 100: Hoare triple {92791#false} assume { :end_inline_node8 } 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;~p7_old~0 := ~p7_new~0;~p7_new~0 := ~nomsg~0;~p8_old~0 := ~p8_new~0;~p8_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {92791#false} is VALID [2022-02-20 19:54:01,278 INFO L290 TraceCheckUtils]: 101: Hoare triple {92791#false} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 + ~st6~0 + ~st7~0 + ~st8~0 <= 1);check_~tmp~1#1 := 0; {92791#false} is VALID [2022-02-20 19:54:01,278 INFO L290 TraceCheckUtils]: 102: Hoare triple {92791#false} check_#res#1 := check_~tmp~1#1; {92791#false} is VALID [2022-02-20 19:54:01,278 INFO L290 TraceCheckUtils]: 103: Hoare triple {92791#false} main1_#t~ret47#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret47#1 && main1_#t~ret47#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret47#1;havoc main1_#t~ret47#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; {92791#false} is VALID [2022-02-20 19:54:01,278 INFO L290 TraceCheckUtils]: 104: Hoare triple {92791#false} assume 0 == assert_~arg#1 % 256; {92791#false} is VALID [2022-02-20 19:54:01,279 INFO L290 TraceCheckUtils]: 105: Hoare triple {92791#false} assume !false; {92791#false} is VALID [2022-02-20 19:54:01,279 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:54:01,279 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:54:01,279 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760712870] [2022-02-20 19:54:01,279 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760712870] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:54:01,279 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:54:01,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:54:01,280 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931065977] [2022-02-20 19:54:01,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:54:01,280 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2022-02-20 19:54:01,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:54:01,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have 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:54:01,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:54:01,369 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:54:01,369 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:54:01,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:54:01,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:54:01,369 INFO L87 Difference]: Start difference. First operand 5286 states and 8246 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)