./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label06.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.3.ufo.BOUNDED-6.pals+Problem12_label06.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 4eb775f57791ca8f3541a03278dc5eb83ecb8d3533ee7aa5dd1ca1cf24d1fbf4 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 19:39:05,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 19:39:05,180 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 19:39:05,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 19:39:05,208 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 19:39:05,211 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 19:39:05,213 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 19:39:05,215 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 19:39:05,216 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 19:39:05,216 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 19:39:05,217 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 19:39:05,218 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 19:39:05,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 19:39:05,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 19:39:05,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 19:39:05,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 19:39:05,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 19:39:05,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 19:39:05,223 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 19:39:05,225 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 19:39:05,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 19:39:05,227 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 19:39:05,228 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 19:39:05,229 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 19:39:05,231 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 19:39:05,231 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 19:39:05,231 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 19:39:05,232 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 19:39:05,232 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 19:39:05,233 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 19:39:05,233 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 19:39:05,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 19:39:05,234 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 19:39:05,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 19:39:05,235 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 19:39:05,236 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 19:39:05,236 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 19:39:05,237 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 19:39:05,237 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 19:39:05,238 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 19:39:05,238 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 19:39:05,239 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:39:05,257 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 19:39:05,259 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 19:39:05,259 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 19:39:05,260 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 19:39:05,260 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 19:39:05,261 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 19:39:05,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 19:39:05,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 19:39:05,261 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 19:39:05,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 19:39:05,262 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 19:39:05,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 19:39:05,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 19:39:05,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 19:39:05,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 19:39:05,263 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 19:39:05,263 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 19:39:05,263 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 19:39:05,263 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 19:39:05,264 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 19:39:05,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 19:39:05,264 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 19:39:05,264 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 19:39:05,264 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 19:39:05,264 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:39:05,265 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 19:39:05,265 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 19:39:05,265 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 19:39:05,265 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 19:39:05,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 19:39:05,266 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 19:39:05,266 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 19:39:05,266 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 19:39:05,266 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 -> 4eb775f57791ca8f3541a03278dc5eb83ecb8d3533ee7aa5dd1ca1cf24d1fbf4 [2022-02-20 19:39:05,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 19:39:05,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 19:39:05,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 19:39:05,480 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 19:39:05,480 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 19:39:05,481 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label06.c [2022-02-20 19:39:05,604 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/452ebc9ed/d906e8788e6c4cd9ba420c215f88d343/FLAGd873a726d [2022-02-20 19:39:06,136 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 19:39:06,136 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label06.c [2022-02-20 19:39:06,156 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/452ebc9ed/d906e8788e6c4cd9ba420c215f88d343/FLAGd873a726d [2022-02-20 19:39:06,536 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/452ebc9ed/d906e8788e6c4cd9ba420c215f88d343 [2022-02-20 19:39:06,538 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 19:39:06,540 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 19:39:06,542 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 19:39:06,542 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 19:39:06,544 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 19:39:06,545 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:39:06" (1/1) ... [2022-02-20 19:39:06,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ab892be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:06, skipping insertion in model container [2022-02-20 19:39:06,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 07:39:06" (1/1) ... [2022-02-20 19:39:06,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 19:39:06,643 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 19:39:06,836 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.3.ufo.BOUNDED-6.pals+Problem12_label06.c[6354,6367] [2022-02-20 19:39:06,858 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.3.ufo.BOUNDED-6.pals+Problem12_label06.c[9171,9184] [2022-02-20 19:39:07,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:39:07,400 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 19:39:07,430 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.3.ufo.BOUNDED-6.pals+Problem12_label06.c[6354,6367] [2022-02-20 19:39:07,438 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.3.ufo.BOUNDED-6.pals+Problem12_label06.c[9171,9184] [2022-02-20 19:39:07,755 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 19:39:07,773 INFO L208 MainTranslator]: Completed translation [2022-02-20 19:39:07,774 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:07 WrapperNode [2022-02-20 19:39:07,774 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 19:39:07,775 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 19:39:07,775 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 19:39:07,776 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 19:39:07,780 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:39:07" (1/1) ... [2022-02-20 19:39:07,832 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:39:07" (1/1) ... [2022-02-20 19:39:08,182 INFO L137 Inliner]: procedures = 33, calls = 19, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 4976 [2022-02-20 19:39:08,195 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 19:39:08,196 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 19:39:08,197 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 19:39:08,197 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 19:39:08,203 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:07" (1/1) ... [2022-02-20 19:39:08,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:07" (1/1) ... [2022-02-20 19:39:08,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:07" (1/1) ... [2022-02-20 19:39:08,303 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:07" (1/1) ... [2022-02-20 19:39:08,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:07" (1/1) ... [2022-02-20 19:39:08,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:07" (1/1) ... [2022-02-20 19:39:08,547 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:07" (1/1) ... [2022-02-20 19:39:08,597 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 19:39:08,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 19:39:08,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 19:39:08,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 19:39:08,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:07" (1/1) ... [2022-02-20 19:39:08,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 19:39:08,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 19:39:08,653 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:39:08,708 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:39:08,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 19:39:08,731 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 19:39:08,731 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 19:39:08,731 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 19:39:08,825 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 19:39:08,826 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 19:39:15,597 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 19:39:15,620 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 19:39:15,620 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 19:39:15,623 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:39:15 BoogieIcfgContainer [2022-02-20 19:39:15,623 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 19:39:15,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 19:39:15,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 19:39:15,631 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 19:39:15,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 07:39:06" (1/3) ... [2022-02-20 19:39:15,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb66478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:39:15, skipping insertion in model container [2022-02-20 19:39:15,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 07:39:07" (2/3) ... [2022-02-20 19:39:15,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cb66478 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 07:39:15, skipping insertion in model container [2022-02-20 19:39:15,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 07:39:15" (3/3) ... [2022-02-20 19:39:15,634 INFO L111 eAbstractionObserver]: Analyzing ICFG pals_lcr.3.ufo.BOUNDED-6.pals+Problem12_label06.c [2022-02-20 19:39:15,638 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 19:39:15,639 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 19:39:15,709 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 19:39:15,713 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:39:15,713 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 19:39:15,769 INFO L276 IsEmpty]: Start isEmpty. Operand has 878 states, 875 states have (on average 1.904) internal successors, (1666), 877 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have 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:39:15,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 19:39:15,774 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:15,774 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] [2022-02-20 19:39:15,775 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:15,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:15,778 INFO L85 PathProgramCache]: Analyzing trace with hash 246970709, now seen corresponding path program 1 times [2022-02-20 19:39:15,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:15,799 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408427294] [2022-02-20 19:39:15,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:15,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:16,049 INFO L290 TraceCheckUtils]: 0: Hoare triple {881#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;~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; {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:39:16,050 INFO L290 TraceCheckUtils]: 1: Hoare triple {883#(<= 15 ~a24~0)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:39:16,050 INFO L290 TraceCheckUtils]: 2: Hoare triple {883#(<= 15 ~a24~0)} assume !(0 != main_#t~nondet38#1);havoc main_#t~nondet38#1;assume { :begin_inline_main2 } true;havoc main2_#res#1;havoc main2_#t~nondet36#1, main2_#t~ret37#1, main2_~input~0#1, main2_~output~0#1;main2_~output~0#1 := -1; {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:39:16,051 INFO L290 TraceCheckUtils]: 3: Hoare triple {883#(<= 15 ~a24~0)} assume !false;havoc main2_~input~0#1;assume -2147483648 <= main2_#t~nondet36#1 && main2_#t~nondet36#1 <= 2147483647;main2_~input~0#1 := main2_#t~nondet36#1;havoc main2_#t~nondet36#1; {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:39:16,051 INFO L290 TraceCheckUtils]: 4: Hoare triple {883#(<= 15 ~a24~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~ret33#1, calculate_output_~input#1;calculate_output_~input#1 := calculate_output_#in~input#1; {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:39:16,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {883#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:39:16,052 INFO L290 TraceCheckUtils]: 6: Hoare triple {883#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:39:16,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {883#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:39:16,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {883#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:39:16,053 INFO L290 TraceCheckUtils]: 9: Hoare triple {883#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 14 == ~a24~0) && 4 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:39:16,054 INFO L290 TraceCheckUtils]: 10: Hoare triple {883#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:39:16,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {883#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:39:16,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {883#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 4 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:39:16,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {883#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:39:16,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {883#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 13 == ~a24~0) && 3 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:39:16,059 INFO L290 TraceCheckUtils]: 15: Hoare triple {883#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:39:16,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {883#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && ~a17~0 <= -108) && 15 == ~a24~0) && 3 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:39:16,060 INFO L290 TraceCheckUtils]: 17: Hoare triple {883#(<= 15 ~a24~0)} assume !((((12 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 14 == ~a24~0) && 4 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:39:16,061 INFO L290 TraceCheckUtils]: 18: Hoare triple {883#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:39:16,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {883#(<= 15 ~a24~0)} assume !((((14 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 15 == ~a24~0) && 3 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:39:16,062 INFO L290 TraceCheckUtils]: 20: Hoare triple {883#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && -108 < ~a17~0 && 111 >= ~a17~0) && 13 == ~a24~0) && 4 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:39:16,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {883#(<= 15 ~a24~0)} assume !((((13 == ~a7~0 && ~a2~0 <= 189) && 255 < ~a17~0) && 14 == ~a24~0) && 3 == ~a5~0); {883#(<= 15 ~a24~0)} is VALID [2022-02-20 19:39:16,063 INFO L290 TraceCheckUtils]: 22: Hoare triple {883#(<= 15 ~a24~0)} assume (((13 == ~a7~0 && ~a2~0 <= 189) && 111 < ~a17~0 && 255 >= ~a17~0) && 13 == ~a24~0) && 3 == ~a5~0; {882#false} is VALID [2022-02-20 19:39:16,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {882#false} assume !false; {882#false} is VALID [2022-02-20 19:39:16,064 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:39:16,065 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:16,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408427294] [2022-02-20 19:39:16,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408427294] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:16,066 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:16,066 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 19:39:16,067 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322006305] [2022-02-20 19:39:16,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:16,072 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 19:39:16,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:16,074 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:39:16,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:16,097 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:39:16,097 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:16,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:39:16,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:16,117 INFO L87 Difference]: Start difference. First operand has 878 states, 875 states have (on average 1.904) internal successors, (1666), 877 states have internal predecessors, (1666), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:39:21,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:21,565 INFO L93 Difference]: Finished difference Result 2489 states and 4794 transitions. [2022-02-20 19:39:21,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:39:21,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-02-20 19:39:21,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:21,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:39:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4794 transitions. [2022-02-20 19:39:21,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:39:21,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 4794 transitions. [2022-02-20 19:39:21,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 4794 transitions. [2022-02-20 19:39:24,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4794 edges. 4794 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:25,109 INFO L225 Difference]: With dead ends: 2489 [2022-02-20 19:39:25,109 INFO L226 Difference]: Without dead ends: 1563 [2022-02-20 19:39:25,114 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:39:25,116 INFO L933 BasicCegarLoop]: 569 mSDtfsCounter, 908 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2334 mSolverCounterSat, 651 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 580 SdHoareTripleChecker+Invalid, 2985 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 651 IncrementalHoareTripleChecker+Valid, 2334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-02-20 19:39:25,117 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [908 Valid, 580 Invalid, 2985 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [651 Valid, 2334 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-02-20 19:39:25,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2022-02-20 19:39:25,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2022-02-20 19:39:25,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:25,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1563 states. Second operand has 1563 states, 1561 states have (on average 1.6399743754003844) internal successors, (2560), 1562 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have 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:39:25,219 INFO L74 IsIncluded]: Start isIncluded. First operand 1563 states. Second operand has 1563 states, 1561 states have (on average 1.6399743754003844) internal successors, (2560), 1562 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have 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:39:25,221 INFO L87 Difference]: Start difference. First operand 1563 states. Second operand has 1563 states, 1561 states have (on average 1.6399743754003844) internal successors, (2560), 1562 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have 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:39:25,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:25,308 INFO L93 Difference]: Finished difference Result 1563 states and 2560 transitions. [2022-02-20 19:39:25,309 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2560 transitions. [2022-02-20 19:39:25,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:25,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:25,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 1563 states, 1561 states have (on average 1.6399743754003844) internal successors, (2560), 1562 states have internal predecessors, (2560), 0 states have call successors, (0), 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 1563 states. [2022-02-20 19:39:25,322 INFO L87 Difference]: Start difference. First operand has 1563 states, 1561 states have (on average 1.6399743754003844) internal successors, (2560), 1562 states have internal predecessors, (2560), 0 states have call successors, (0), 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 1563 states. [2022-02-20 19:39:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:25,407 INFO L93 Difference]: Finished difference Result 1563 states and 2560 transitions. [2022-02-20 19:39:25,407 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2560 transitions. [2022-02-20 19:39:25,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:25,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:25,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:25,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:25,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1561 states have (on average 1.6399743754003844) internal successors, (2560), 1562 states have internal predecessors, (2560), 0 states have call successors, (0), 0 states have 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:39:25,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2560 transitions. [2022-02-20 19:39:25,500 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2560 transitions. Word has length 24 [2022-02-20 19:39:25,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:25,501 INFO L470 AbstractCegarLoop]: Abstraction has 1563 states and 2560 transitions. [2022-02-20 19:39:25,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have 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:39:25,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2560 transitions. [2022-02-20 19:39:25,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 19:39:25,502 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:25,503 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] [2022-02-20 19:39:25,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 19:39:25,507 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:25,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:25,509 INFO L85 PathProgramCache]: Analyzing trace with hash 157814817, now seen corresponding path program 1 times [2022-02-20 19:39:25,509 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:25,509 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75888456] [2022-02-20 19:39:25,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:25,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:25,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {8114#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;~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; {8114#true} is VALID [2022-02-20 19:39:25,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {8114#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {8114#true} is VALID [2022-02-20 19:39:25,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {8114#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {8114#true} is VALID [2022-02-20 19:39:25,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {8114#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {8116#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-20 19:39:25,587 INFO L290 TraceCheckUtils]: 4: Hoare triple {8116#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {8117#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-20 19:39:25,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {8117#(= |ULTIMATE.start_init_#res#1| 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {8118#(= |ULTIMATE.start_main1_~i2~0#1| 0)} is VALID [2022-02-20 19:39:25,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {8118#(= |ULTIMATE.start_main1_~i2~0#1| 0)} assume !(0 == main1_~i2~0#1); {8115#false} is VALID [2022-02-20 19:39:25,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {8115#false} ~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;main1_~i2~0#1 := 0; {8115#false} is VALID [2022-02-20 19:39:25,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {8115#false} assume !!(main1_~i2~0#1 < 6);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; {8115#false} is VALID [2022-02-20 19:39:25,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {8115#false} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {8115#false} is VALID [2022-02-20 19:39:25,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {8115#false} assume !(node1_~m1~0#1 != ~nomsg~0); {8115#false} is VALID [2022-02-20 19:39:25,589 INFO L290 TraceCheckUtils]: 11: Hoare triple {8115#false} ~mode1~0 := 0; {8115#false} is VALID [2022-02-20 19:39:25,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {8115#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; {8115#false} is VALID [2022-02-20 19:39:25,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {8115#false} assume !(0 != ~mode2~0 % 256); {8115#false} is VALID [2022-02-20 19:39:25,589 INFO L290 TraceCheckUtils]: 14: Hoare triple {8115#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {8115#false} is VALID [2022-02-20 19:39:25,589 INFO L290 TraceCheckUtils]: 15: Hoare triple {8115#false} ~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; {8115#false} is VALID [2022-02-20 19:39:25,590 INFO L290 TraceCheckUtils]: 16: Hoare triple {8115#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; {8115#false} is VALID [2022-02-20 19:39:25,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {8115#false} assume !(0 != ~mode3~0 % 256); {8115#false} is VALID [2022-02-20 19:39:25,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {8115#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {8115#false} is VALID [2022-02-20 19:39:25,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {8115#false} ~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; {8115#false} is VALID [2022-02-20 19:39:25,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {8115#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {8115#false} is VALID [2022-02-20 19:39:25,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {8115#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {8115#false} is VALID [2022-02-20 19:39:25,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {8115#false} check_#res#1 := check_~tmp~1#1; {8115#false} is VALID [2022-02-20 19:39:25,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {8115#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {8115#false} is VALID [2022-02-20 19:39:25,592 INFO L290 TraceCheckUtils]: 24: Hoare triple {8115#false} assume 0 == assert_~arg#1 % 256; {8115#false} is VALID [2022-02-20 19:39:25,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {8115#false} assume !false; {8115#false} is VALID [2022-02-20 19:39:25,595 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:39:25,595 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:25,596 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75888456] [2022-02-20 19:39:25,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75888456] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:25,596 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:25,596 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:39:25,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028082594] [2022-02-20 19:39:25,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:25,597 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-20 19:39:25,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:25,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:39:25,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:25,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:39:25,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:25,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:39:25,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:39:25,618 INFO L87 Difference]: Start difference. First operand 1563 states and 2560 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:39:29,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:29,489 INFO L93 Difference]: Finished difference Result 1639 states and 2676 transitions. [2022-02-20 19:39:29,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 19:39:29,490 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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 26 [2022-02-20 19:39:29,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:29,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:39:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1649 transitions. [2022-02-20 19:39:29,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:39:29,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1649 transitions. [2022-02-20 19:39:29,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 1649 transitions. [2022-02-20 19:39:30,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1649 edges. 1649 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:30,857 INFO L225 Difference]: With dead ends: 1639 [2022-02-20 19:39:30,857 INFO L226 Difference]: Without dead ends: 1599 [2022-02-20 19:39:30,857 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:39:30,858 INFO L933 BasicCegarLoop]: 1529 mSDtfsCounter, 58 mSDsluCounter, 4566 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 6095 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:39:30,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 6095 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:30,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1599 states. [2022-02-20 19:39:30,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1599 to 1563. [2022-02-20 19:39:30,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:30,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1599 states. Second operand has 1563 states, 1561 states have (on average 1.6297245355541319) internal successors, (2544), 1562 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have 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:39:30,897 INFO L74 IsIncluded]: Start isIncluded. First operand 1599 states. Second operand has 1563 states, 1561 states have (on average 1.6297245355541319) internal successors, (2544), 1562 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have 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:39:30,900 INFO L87 Difference]: Start difference. First operand 1599 states. Second operand has 1563 states, 1561 states have (on average 1.6297245355541319) internal successors, (2544), 1562 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have 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:39:30,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:30,997 INFO L93 Difference]: Finished difference Result 1599 states and 2600 transitions. [2022-02-20 19:39:30,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2600 transitions. [2022-02-20 19:39:31,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:31,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:31,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 1563 states, 1561 states have (on average 1.6297245355541319) internal successors, (2544), 1562 states have internal predecessors, (2544), 0 states have call successors, (0), 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 1599 states. [2022-02-20 19:39:31,012 INFO L87 Difference]: Start difference. First operand has 1563 states, 1561 states have (on average 1.6297245355541319) internal successors, (2544), 1562 states have internal predecessors, (2544), 0 states have call successors, (0), 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 1599 states. [2022-02-20 19:39:31,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:31,103 INFO L93 Difference]: Finished difference Result 1599 states and 2600 transitions. [2022-02-20 19:39:31,103 INFO L276 IsEmpty]: Start isEmpty. Operand 1599 states and 2600 transitions. [2022-02-20 19:39:31,105 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:31,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:31,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:31,106 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:31,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1561 states have (on average 1.6297245355541319) internal successors, (2544), 1562 states have internal predecessors, (2544), 0 states have call successors, (0), 0 states have 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:39:31,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2544 transitions. [2022-02-20 19:39:31,190 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2544 transitions. Word has length 26 [2022-02-20 19:39:31,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:31,190 INFO L470 AbstractCegarLoop]: Abstraction has 1563 states and 2544 transitions. [2022-02-20 19:39:31,191 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have 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:39:31,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2544 transitions. [2022-02-20 19:39:31,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:39:31,192 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:31,192 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] [2022-02-20 19:39:31,193 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 19:39:31,193 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:31,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:31,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1324654887, now seen corresponding path program 1 times [2022-02-20 19:39:31,193 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:31,194 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726911977] [2022-02-20 19:39:31,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:31,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:31,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {14572#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;~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; {14572#true} is VALID [2022-02-20 19:39:31,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {14572#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {14572#true} is VALID [2022-02-20 19:39:31,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {14572#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {14572#true} is VALID [2022-02-20 19:39:31,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {14572#true} assume 0 == ~r1~0; {14572#true} is VALID [2022-02-20 19:39:31,287 INFO L290 TraceCheckUtils]: 4: Hoare triple {14572#true} assume ~id1~0 >= 0; {14572#true} is VALID [2022-02-20 19:39:31,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {14572#true} assume 0 == ~st1~0; {14572#true} is VALID [2022-02-20 19:39:31,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {14572#true} assume ~send1~0 == ~id1~0; {14572#true} is VALID [2022-02-20 19:39:31,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {14572#true} assume 0 == ~mode1~0 % 256; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:31,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:31,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:31,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:31,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:31,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:31,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:31,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:31,295 INFO L290 TraceCheckUtils]: 15: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:31,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:31,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:31,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:31,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:31,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:31,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == main1_~i2~0#1); {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:31,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} ~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;main1_~i2~0#1 := 0; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:31,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main1_~i2~0#1 < 6);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; {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-20 19:39:31,301 INFO L290 TraceCheckUtils]: 24: Hoare triple {14574#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {14573#false} is VALID [2022-02-20 19:39:31,301 INFO L290 TraceCheckUtils]: 25: Hoare triple {14573#false} assume !(node1_~m1~0#1 != ~nomsg~0); {14573#false} is VALID [2022-02-20 19:39:31,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {14573#false} ~mode1~0 := 0; {14573#false} is VALID [2022-02-20 19:39:31,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {14573#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; {14573#false} is VALID [2022-02-20 19:39:31,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {14573#false} assume !(0 != ~mode2~0 % 256); {14573#false} is VALID [2022-02-20 19:39:31,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {14573#false} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {14573#false} is VALID [2022-02-20 19:39:31,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {14573#false} ~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; {14573#false} is VALID [2022-02-20 19:39:31,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {14573#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; {14573#false} is VALID [2022-02-20 19:39:31,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {14573#false} assume !(0 != ~mode3~0 % 256); {14573#false} is VALID [2022-02-20 19:39:31,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {14573#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {14573#false} is VALID [2022-02-20 19:39:31,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {14573#false} ~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; {14573#false} is VALID [2022-02-20 19:39:31,303 INFO L290 TraceCheckUtils]: 35: Hoare triple {14573#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {14573#false} is VALID [2022-02-20 19:39:31,303 INFO L290 TraceCheckUtils]: 36: Hoare triple {14573#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {14573#false} is VALID [2022-02-20 19:39:31,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {14573#false} check_#res#1 := check_~tmp~1#1; {14573#false} is VALID [2022-02-20 19:39:31,303 INFO L290 TraceCheckUtils]: 38: Hoare triple {14573#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {14573#false} is VALID [2022-02-20 19:39:31,303 INFO L290 TraceCheckUtils]: 39: Hoare triple {14573#false} assume 0 == assert_~arg#1 % 256; {14573#false} is VALID [2022-02-20 19:39:31,303 INFO L290 TraceCheckUtils]: 40: Hoare triple {14573#false} assume !false; {14573#false} is VALID [2022-02-20 19:39:31,304 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:39:31,304 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:31,304 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726911977] [2022-02-20 19:39:31,305 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726911977] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:31,305 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:31,305 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:39:31,305 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726443822] [2022-02-20 19:39:31,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:31,306 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 19:39:31,306 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:31,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:39:31,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:31,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:39:31,333 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:31,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:39:31,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:31,334 INFO L87 Difference]: Start difference. First operand 1563 states and 2544 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:39:33,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:33,055 INFO L93 Difference]: Finished difference Result 1629 states and 2646 transitions. [2022-02-20 19:39:33,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:39:33,056 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 19:39:33,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:33,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:39:33,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:33,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:39:33,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:33,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions. [2022-02-20 19:39:34,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1619 edges. 1619 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:34,552 INFO L225 Difference]: With dead ends: 1629 [2022-02-20 19:39:34,552 INFO L226 Difference]: Without dead ends: 1593 [2022-02-20 19:39:34,553 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:39:34,554 INFO L933 BasicCegarLoop]: 1559 mSDtfsCounter, 1485 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1485 SdHoareTripleChecker+Valid, 1613 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:39:34,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1485 Valid, 1613 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:34,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2022-02-20 19:39:34,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1591. [2022-02-20 19:39:34,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:34,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1593 states. Second operand has 1591 states, 1589 states have (on average 1.6286972938955318) internal successors, (2588), 1590 states have internal predecessors, (2588), 0 states have call successors, (0), 0 states have 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:39:34,636 INFO L74 IsIncluded]: Start isIncluded. First operand 1593 states. Second operand has 1591 states, 1589 states have (on average 1.6286972938955318) internal successors, (2588), 1590 states have internal predecessors, (2588), 0 states have call successors, (0), 0 states have 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:39:34,649 INFO L87 Difference]: Start difference. First operand 1593 states. Second operand has 1591 states, 1589 states have (on average 1.6286972938955318) internal successors, (2588), 1590 states have internal predecessors, (2588), 0 states have call successors, (0), 0 states have 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:39:34,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:34,727 INFO L93 Difference]: Finished difference Result 1593 states and 2589 transitions. [2022-02-20 19:39:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2589 transitions. [2022-02-20 19:39:34,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:34,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:34,732 INFO L74 IsIncluded]: Start isIncluded. First operand has 1591 states, 1589 states have (on average 1.6286972938955318) internal successors, (2588), 1590 states have internal predecessors, (2588), 0 states have call successors, (0), 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 1593 states. [2022-02-20 19:39:34,734 INFO L87 Difference]: Start difference. First operand has 1591 states, 1589 states have (on average 1.6286972938955318) internal successors, (2588), 1590 states have internal predecessors, (2588), 0 states have call successors, (0), 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 1593 states. [2022-02-20 19:39:34,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:34,820 INFO L93 Difference]: Finished difference Result 1593 states and 2589 transitions. [2022-02-20 19:39:34,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 2589 transitions. [2022-02-20 19:39:34,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:34,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:34,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:34,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:34,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1589 states have (on average 1.6286972938955318) internal successors, (2588), 1590 states have internal predecessors, (2588), 0 states have call successors, (0), 0 states have 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:39:34,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2588 transitions. [2022-02-20 19:39:34,907 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2588 transitions. Word has length 41 [2022-02-20 19:39:34,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:34,907 INFO L470 AbstractCegarLoop]: Abstraction has 1591 states and 2588 transitions. [2022-02-20 19:39:34,907 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:39:34,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2588 transitions. [2022-02-20 19:39:34,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 19:39:34,908 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:34,909 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] [2022-02-20 19:39:34,909 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 19:39:34,909 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:34,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:34,909 INFO L85 PathProgramCache]: Analyzing trace with hash 1376027727, now seen corresponding path program 1 times [2022-02-20 19:39:34,910 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:34,910 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721913984] [2022-02-20 19:39:34,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:34,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:34,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:34,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {21035#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;~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; {21035#true} is VALID [2022-02-20 19:39:34,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {21035#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {21035#true} is VALID [2022-02-20 19:39:34,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {21035#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {21035#true} is VALID [2022-02-20 19:39:34,997 INFO L290 TraceCheckUtils]: 3: Hoare triple {21035#true} assume 0 == ~r1~0; {21035#true} is VALID [2022-02-20 19:39:34,997 INFO L290 TraceCheckUtils]: 4: Hoare triple {21035#true} assume ~id1~0 >= 0; {21035#true} is VALID [2022-02-20 19:39:34,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {21035#true} assume 0 == ~st1~0; {21037#(<= ~st1~0 0)} is VALID [2022-02-20 19:39:34,998 INFO L290 TraceCheckUtils]: 6: Hoare triple {21037#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {21037#(<= ~st1~0 0)} is VALID [2022-02-20 19:39:34,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {21037#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {21037#(<= ~st1~0 0)} is VALID [2022-02-20 19:39:34,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {21037#(<= ~st1~0 0)} assume ~id2~0 >= 0; {21037#(<= ~st1~0 0)} is VALID [2022-02-20 19:39:34,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {21037#(<= ~st1~0 0)} assume 0 == ~st2~0; {21038#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {21038#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {21038#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {21038#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {21038#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {21038#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {21038#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {21038#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 == main1_~i2~0#1); {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,019 INFO L290 TraceCheckUtils]: 22: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} ~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;main1_~i2~0#1 := 0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,020 INFO L290 TraceCheckUtils]: 23: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !!(main1_~i2~0#1 < 6);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; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~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; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~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; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,024 INFO L290 TraceCheckUtils]: 28: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,025 INFO L290 TraceCheckUtils]: 30: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~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; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,025 INFO L290 TraceCheckUtils]: 31: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~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; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,026 INFO L290 TraceCheckUtils]: 32: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,026 INFO L290 TraceCheckUtils]: 33: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,026 INFO L290 TraceCheckUtils]: 34: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~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; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,027 INFO L290 TraceCheckUtils]: 35: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:39:35,027 INFO L290 TraceCheckUtils]: 36: Hoare triple {21039#(<= (+ ~st3~0 ~st2~0 ~st1~0) 0)} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {21036#false} is VALID [2022-02-20 19:39:35,027 INFO L290 TraceCheckUtils]: 37: Hoare triple {21036#false} check_#res#1 := check_~tmp~1#1; {21036#false} is VALID [2022-02-20 19:39:35,028 INFO L290 TraceCheckUtils]: 38: Hoare triple {21036#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {21036#false} is VALID [2022-02-20 19:39:35,028 INFO L290 TraceCheckUtils]: 39: Hoare triple {21036#false} assume 0 == assert_~arg#1 % 256; {21036#false} is VALID [2022-02-20 19:39:35,028 INFO L290 TraceCheckUtils]: 40: Hoare triple {21036#false} assume !false; {21036#false} is VALID [2022-02-20 19:39:35,028 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:39:35,028 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:35,029 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721913984] [2022-02-20 19:39:35,029 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721913984] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:35,029 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:35,029 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:39:35,029 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296133044] [2022-02-20 19:39:35,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:35,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 19:39:35,030 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:35,030 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:39:35,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:35,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:39:35,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:35,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:39:35,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:39:35,056 INFO L87 Difference]: Start difference. First operand 1591 states and 2588 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:39:37,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:37,465 INFO L93 Difference]: Finished difference Result 1975 states and 3188 transitions. [2022-02-20 19:39:37,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 19:39:37,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 19:39:37,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:37,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:39:37,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1853 transitions. [2022-02-20 19:39:37,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:39:37,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1853 transitions. [2022-02-20 19:39:37,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 1853 transitions. [2022-02-20 19:39:38,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1853 edges. 1853 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:38,759 INFO L225 Difference]: With dead ends: 1975 [2022-02-20 19:39:38,759 INFO L226 Difference]: Without dead ends: 1911 [2022-02-20 19:39:38,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:39:38,763 INFO L933 BasicCegarLoop]: 1511 mSDtfsCounter, 4709 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4709 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:39:38,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4709 Valid, 1779 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:38,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1911 states. [2022-02-20 19:39:38,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1911 to 1653. [2022-02-20 19:39:38,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:38,851 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1911 states. Second operand has 1653 states, 1651 states have (on average 1.6250757116898848) internal successors, (2683), 1652 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have 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:39:38,853 INFO L74 IsIncluded]: Start isIncluded. First operand 1911 states. Second operand has 1653 states, 1651 states have (on average 1.6250757116898848) internal successors, (2683), 1652 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have 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:39:38,854 INFO L87 Difference]: Start difference. First operand 1911 states. Second operand has 1653 states, 1651 states have (on average 1.6250757116898848) internal successors, (2683), 1652 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have 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:39:38,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:38,968 INFO L93 Difference]: Finished difference Result 1911 states and 3076 transitions. [2022-02-20 19:39:38,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 3076 transitions. [2022-02-20 19:39:38,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:38,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:38,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 1653 states, 1651 states have (on average 1.6250757116898848) internal successors, (2683), 1652 states have internal predecessors, (2683), 0 states have call successors, (0), 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 1911 states. [2022-02-20 19:39:38,975 INFO L87 Difference]: Start difference. First operand has 1653 states, 1651 states have (on average 1.6250757116898848) internal successors, (2683), 1652 states have internal predecessors, (2683), 0 states have call successors, (0), 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 1911 states. [2022-02-20 19:39:39,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:39,078 INFO L93 Difference]: Finished difference Result 1911 states and 3076 transitions. [2022-02-20 19:39:39,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1911 states and 3076 transitions. [2022-02-20 19:39:39,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:39,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:39,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:39,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:39,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1653 states, 1651 states have (on average 1.6250757116898848) internal successors, (2683), 1652 states have internal predecessors, (2683), 0 states have call successors, (0), 0 states have 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:39:39,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1653 states to 1653 states and 2683 transitions. [2022-02-20 19:39:39,179 INFO L78 Accepts]: Start accepts. Automaton has 1653 states and 2683 transitions. Word has length 41 [2022-02-20 19:39:39,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:39,179 INFO L470 AbstractCegarLoop]: Abstraction has 1653 states and 2683 transitions. [2022-02-20 19:39:39,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have 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:39:39,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1653 states and 2683 transitions. [2022-02-20 19:39:39,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:39:39,180 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:39,181 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] [2022-02-20 19:39:39,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 19:39:39,181 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:39,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:39,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1902982177, now seen corresponding path program 1 times [2022-02-20 19:39:39,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:39,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195487521] [2022-02-20 19:39:39,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:39,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:39,248 INFO L290 TraceCheckUtils]: 0: Hoare triple {28629#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;~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; {28629#true} is VALID [2022-02-20 19:39:39,249 INFO L290 TraceCheckUtils]: 1: Hoare triple {28629#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {28629#true} is VALID [2022-02-20 19:39:39,249 INFO L290 TraceCheckUtils]: 2: Hoare triple {28629#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {28629#true} is VALID [2022-02-20 19:39:39,249 INFO L290 TraceCheckUtils]: 3: Hoare triple {28629#true} assume 0 == ~r1~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,250 INFO L290 TraceCheckUtils]: 4: Hoare triple {28631#(<= ~r1~0 0)} assume ~id1~0 >= 0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {28631#(<= ~r1~0 0)} assume 0 == ~st1~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {28631#(<= ~r1~0 0)} assume ~send1~0 == ~id1~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {28631#(<= ~r1~0 0)} assume 0 == ~mode1~0 % 256; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,251 INFO L290 TraceCheckUtils]: 8: Hoare triple {28631#(<= ~r1~0 0)} assume ~id2~0 >= 0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {28631#(<= ~r1~0 0)} assume 0 == ~st2~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {28631#(<= ~r1~0 0)} assume ~send2~0 == ~id2~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {28631#(<= ~r1~0 0)} assume 0 == ~mode2~0 % 256; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {28631#(<= ~r1~0 0)} assume ~id3~0 >= 0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,252 INFO L290 TraceCheckUtils]: 13: Hoare triple {28631#(<= ~r1~0 0)} assume 0 == ~st3~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {28631#(<= ~r1~0 0)} assume ~send3~0 == ~id3~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,253 INFO L290 TraceCheckUtils]: 15: Hoare triple {28631#(<= ~r1~0 0)} assume 0 == ~mode3~0 % 256; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {28631#(<= ~r1~0 0)} assume ~id1~0 != ~id2~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,254 INFO L290 TraceCheckUtils]: 17: Hoare triple {28631#(<= ~r1~0 0)} assume ~id1~0 != ~id3~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,254 INFO L290 TraceCheckUtils]: 18: Hoare triple {28631#(<= ~r1~0 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,254 INFO L290 TraceCheckUtils]: 19: Hoare triple {28631#(<= ~r1~0 0)} init_#res#1 := init_~tmp~0#1; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,254 INFO L290 TraceCheckUtils]: 20: Hoare triple {28631#(<= ~r1~0 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,255 INFO L290 TraceCheckUtils]: 21: Hoare triple {28631#(<= ~r1~0 0)} assume !(0 == main1_~i2~0#1); {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,255 INFO L290 TraceCheckUtils]: 22: Hoare triple {28631#(<= ~r1~0 0)} ~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;main1_~i2~0#1 := 0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,255 INFO L290 TraceCheckUtils]: 23: Hoare triple {28631#(<= ~r1~0 0)} assume !!(main1_~i2~0#1 < 6);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; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,256 INFO L290 TraceCheckUtils]: 24: Hoare triple {28631#(<= ~r1~0 0)} assume !(0 != ~mode1~0 % 256); {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,256 INFO L290 TraceCheckUtils]: 25: Hoare triple {28631#(<= ~r1~0 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,256 INFO L290 TraceCheckUtils]: 26: Hoare triple {28631#(<= ~r1~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; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,257 INFO L290 TraceCheckUtils]: 27: Hoare triple {28631#(<= ~r1~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; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,257 INFO L290 TraceCheckUtils]: 28: Hoare triple {28631#(<= ~r1~0 0)} assume !(0 != ~mode2~0 % 256); {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,257 INFO L290 TraceCheckUtils]: 29: Hoare triple {28631#(<= ~r1~0 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,258 INFO L290 TraceCheckUtils]: 30: Hoare triple {28631#(<= ~r1~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; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,258 INFO L290 TraceCheckUtils]: 31: Hoare triple {28631#(<= ~r1~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; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,258 INFO L290 TraceCheckUtils]: 32: Hoare triple {28631#(<= ~r1~0 0)} assume !(0 != ~mode3~0 % 256); {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,258 INFO L290 TraceCheckUtils]: 33: Hoare triple {28631#(<= ~r1~0 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,259 INFO L290 TraceCheckUtils]: 34: Hoare triple {28631#(<= ~r1~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; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,259 INFO L290 TraceCheckUtils]: 35: Hoare triple {28631#(<= ~r1~0 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,259 INFO L290 TraceCheckUtils]: 36: Hoare triple {28631#(<= ~r1~0 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {28631#(<= ~r1~0 0)} is VALID [2022-02-20 19:39:39,260 INFO L290 TraceCheckUtils]: 37: Hoare triple {28631#(<= ~r1~0 0)} assume ~r1~0 >= 3; {28630#false} is VALID [2022-02-20 19:39:39,260 INFO L290 TraceCheckUtils]: 38: Hoare triple {28630#false} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {28630#false} is VALID [2022-02-20 19:39:39,260 INFO L290 TraceCheckUtils]: 39: Hoare triple {28630#false} check_#res#1 := check_~tmp~1#1; {28630#false} is VALID [2022-02-20 19:39:39,260 INFO L290 TraceCheckUtils]: 40: Hoare triple {28630#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {28630#false} is VALID [2022-02-20 19:39:39,260 INFO L290 TraceCheckUtils]: 41: Hoare triple {28630#false} assume 0 == assert_~arg#1 % 256; {28630#false} is VALID [2022-02-20 19:39:39,260 INFO L290 TraceCheckUtils]: 42: Hoare triple {28630#false} assume !false; {28630#false} is VALID [2022-02-20 19:39:39,261 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:39:39,261 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:39,261 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195487521] [2022-02-20 19:39:39,261 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195487521] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:39,261 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:39,261 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:39:39,262 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116140500] [2022-02-20 19:39:39,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:39,263 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:39:39,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:39,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:39,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:39,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:39:39,284 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:39,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:39:39,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:39,285 INFO L87 Difference]: Start difference. First operand 1653 states and 2683 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:40,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:40,735 INFO L93 Difference]: Finished difference Result 1840 states and 2970 transitions. [2022-02-20 19:39:40,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:39:40,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:39:40,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:40,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:40,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1620 transitions. [2022-02-20 19:39:40,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1620 transitions. [2022-02-20 19:39:40,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1620 transitions. [2022-02-20 19:39:41,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1620 edges. 1620 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:42,078 INFO L225 Difference]: With dead ends: 1840 [2022-02-20 19:39:42,079 INFO L226 Difference]: Without dead ends: 1714 [2022-02-20 19:39:42,079 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:39:42,081 INFO L933 BasicCegarLoop]: 1514 mSDtfsCounter, 1469 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1469 SdHoareTripleChecker+Valid, 1565 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:39:42,081 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1469 Valid, 1565 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:42,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2022-02-20 19:39:42,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1712. [2022-02-20 19:39:42,182 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:42,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.62046783625731) internal successors, (2771), 1711 states have internal predecessors, (2771), 0 states have call successors, (0), 0 states have 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:39:42,187 INFO L74 IsIncluded]: Start isIncluded. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.62046783625731) internal successors, (2771), 1711 states have internal predecessors, (2771), 0 states have call successors, (0), 0 states have 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:39:42,189 INFO L87 Difference]: Start difference. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.62046783625731) internal successors, (2771), 1711 states have internal predecessors, (2771), 0 states have call successors, (0), 0 states have 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:39:42,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:42,284 INFO L93 Difference]: Finished difference Result 1714 states and 2772 transitions. [2022-02-20 19:39:42,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2772 transitions. [2022-02-20 19:39:42,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:42,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:42,289 INFO L74 IsIncluded]: Start isIncluded. First operand has 1712 states, 1710 states have (on average 1.62046783625731) internal successors, (2771), 1711 states have internal predecessors, (2771), 0 states have call successors, (0), 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 1714 states. [2022-02-20 19:39:42,290 INFO L87 Difference]: Start difference. First operand has 1712 states, 1710 states have (on average 1.62046783625731) internal successors, (2771), 1711 states have internal predecessors, (2771), 0 states have call successors, (0), 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 1714 states. [2022-02-20 19:39:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:42,378 INFO L93 Difference]: Finished difference Result 1714 states and 2772 transitions. [2022-02-20 19:39:42,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2772 transitions. [2022-02-20 19:39:42,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:42,380 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:42,380 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:42,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:42,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1710 states have (on average 1.62046783625731) internal successors, (2771), 1711 states have internal predecessors, (2771), 0 states have call successors, (0), 0 states have 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:39:42,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2771 transitions. [2022-02-20 19:39:42,494 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2771 transitions. Word has length 43 [2022-02-20 19:39:42,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:42,494 INFO L470 AbstractCegarLoop]: Abstraction has 1712 states and 2771 transitions. [2022-02-20 19:39:42,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:42,495 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2771 transitions. [2022-02-20 19:39:42,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:39:42,495 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:42,495 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] [2022-02-20 19:39:42,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 19:39:42,496 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:42,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:42,496 INFO L85 PathProgramCache]: Analyzing trace with hash -1836488665, now seen corresponding path program 1 times [2022-02-20 19:39:42,496 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:42,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810870459] [2022-02-20 19:39:42,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:42,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:42,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {35732#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;~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; {35732#true} is VALID [2022-02-20 19:39:42,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {35732#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {35732#true} is VALID [2022-02-20 19:39:42,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {35732#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {35732#true} is VALID [2022-02-20 19:39:42,599 INFO L290 TraceCheckUtils]: 3: Hoare triple {35732#true} assume 0 == ~r1~0; {35732#true} is VALID [2022-02-20 19:39:42,599 INFO L290 TraceCheckUtils]: 4: Hoare triple {35732#true} assume ~id1~0 >= 0; {35732#true} is VALID [2022-02-20 19:39:42,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {35732#true} assume 0 == ~st1~0; {35734#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:39:42,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {35734#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~send1~0 == ~id1~0; {35734#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:39:42,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {35734#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~mode1~0 % 256; {35734#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:39:42,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {35734#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume ~id2~0 >= 0; {35734#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} is VALID [2022-02-20 19:39:42,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {35734#(and (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 ~st1~0)) (or (<= ~st1~0 0) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0)))} assume 0 == ~st2~0; {35735#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:39:42,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {35735#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~send2~0 == ~id2~0; {35735#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:39:42,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {35735#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~mode2~0 % 256; {35735#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:39:42,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {35735#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume ~id3~0 >= 0; {35735#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} is VALID [2022-02-20 19:39:42,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {35735#(and (or (<= (+ ~st3~0 ~st2~0 ~st1~0) 0) (<= (+ ~st2~0 ~st1~0) 0)) (or (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= 0 (+ ~st2~0 ~st1~0))))} assume 0 == ~st3~0; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 == ~id3~0; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume 0 == ~mode3~0 % 256; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id2~0; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id1~0 != ~id3~0; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,606 INFO L290 TraceCheckUtils]: 19: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} init_#res#1 := init_~tmp~0#1; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,606 INFO L290 TraceCheckUtils]: 20: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == main1_~i2~0#1); {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} ~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;main1_~i2~0#1 := 0; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,607 INFO L290 TraceCheckUtils]: 23: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !!(main1_~i2~0#1 < 6);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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode1~0 % 256); {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,608 INFO L290 TraceCheckUtils]: 25: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,609 INFO L290 TraceCheckUtils]: 26: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,609 INFO L290 TraceCheckUtils]: 27: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,609 INFO L290 TraceCheckUtils]: 28: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode2~0 % 256); {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,610 INFO L290 TraceCheckUtils]: 29: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,610 INFO L290 TraceCheckUtils]: 30: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,611 INFO L290 TraceCheckUtils]: 31: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,611 INFO L290 TraceCheckUtils]: 32: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 != ~mode3~0 % 256); {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,611 INFO L290 TraceCheckUtils]: 33: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~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; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,613 INFO L290 TraceCheckUtils]: 36: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,613 INFO L290 TraceCheckUtils]: 37: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(~r1~0 >= 3); {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:39:42,614 INFO L290 TraceCheckUtils]: 38: Hoare triple {35736#(and (< 0 (+ ~st3~0 ~st2~0 ~st1~0 1)) (<= (+ ~st3~0 ~st2~0 ~st1~0) 0))} assume !(0 == ~st1~0 + ~st2~0 + ~st3~0);check_~tmp~1#1 := 0; {35733#false} is VALID [2022-02-20 19:39:42,614 INFO L290 TraceCheckUtils]: 39: Hoare triple {35733#false} check_#res#1 := check_~tmp~1#1; {35733#false} is VALID [2022-02-20 19:39:42,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {35733#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {35733#false} is VALID [2022-02-20 19:39:42,614 INFO L290 TraceCheckUtils]: 41: Hoare triple {35733#false} assume 0 == assert_~arg#1 % 256; {35733#false} is VALID [2022-02-20 19:39:42,614 INFO L290 TraceCheckUtils]: 42: Hoare triple {35733#false} assume !false; {35733#false} is VALID [2022-02-20 19:39:42,614 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:39:42,615 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:42,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810870459] [2022-02-20 19:39:42,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810870459] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:42,615 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:42,615 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:39:42,615 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131921195] [2022-02-20 19:39:42,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:42,616 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:39:42,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:42,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:42,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:42,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:39:42,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:42,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:39:42,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:39:42,646 INFO L87 Difference]: Start difference. First operand 1712 states and 2771 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:45,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:45,234 INFO L93 Difference]: Finished difference Result 1897 states and 3053 transitions. [2022-02-20 19:39:45,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:39:45,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:39:45,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:45,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:45,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1627 transitions. [2022-02-20 19:39:45,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:45,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1627 transitions. [2022-02-20 19:39:45,244 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1627 transitions. [2022-02-20 19:39:46,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1627 edges. 1627 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:46,739 INFO L225 Difference]: With dead ends: 1897 [2022-02-20 19:39:46,740 INFO L226 Difference]: Without dead ends: 1714 [2022-02-20 19:39:46,741 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 19:39:46,741 INFO L933 BasicCegarLoop]: 1529 mSDtfsCounter, 3002 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3002 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:39:46,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3002 Valid, 1633 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:46,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1714 states. [2022-02-20 19:39:46,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1714 to 1712. [2022-02-20 19:39:46,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:46,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.6187134502923977) internal successors, (2768), 1711 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have 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:39:46,886 INFO L74 IsIncluded]: Start isIncluded. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.6187134502923977) internal successors, (2768), 1711 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have 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:39:46,887 INFO L87 Difference]: Start difference. First operand 1714 states. Second operand has 1712 states, 1710 states have (on average 1.6187134502923977) internal successors, (2768), 1711 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have 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:39:47,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:47,010 INFO L93 Difference]: Finished difference Result 1714 states and 2769 transitions. [2022-02-20 19:39:47,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2769 transitions. [2022-02-20 19:39:47,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:47,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:47,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 1712 states, 1710 states have (on average 1.6187134502923977) internal successors, (2768), 1711 states have internal predecessors, (2768), 0 states have call successors, (0), 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 1714 states. [2022-02-20 19:39:47,017 INFO L87 Difference]: Start difference. First operand has 1712 states, 1710 states have (on average 1.6187134502923977) internal successors, (2768), 1711 states have internal predecessors, (2768), 0 states have call successors, (0), 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 1714 states. [2022-02-20 19:39:47,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:47,153 INFO L93 Difference]: Finished difference Result 1714 states and 2769 transitions. [2022-02-20 19:39:47,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1714 states and 2769 transitions. [2022-02-20 19:39:47,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:47,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:47,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:47,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:47,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1710 states have (on average 1.6187134502923977) internal successors, (2768), 1711 states have internal predecessors, (2768), 0 states have call successors, (0), 0 states have 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:39:47,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2768 transitions. [2022-02-20 19:39:47,260 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2768 transitions. Word has length 43 [2022-02-20 19:39:47,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:47,260 INFO L470 AbstractCegarLoop]: Abstraction has 1712 states and 2768 transitions. [2022-02-20 19:39:47,260 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:47,260 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2768 transitions. [2022-02-20 19:39:47,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:39:47,262 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:47,263 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] [2022-02-20 19:39:47,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 19:39:47,263 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:47,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:47,264 INFO L85 PathProgramCache]: Analyzing trace with hash -47574589, now seen corresponding path program 1 times [2022-02-20 19:39:47,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:47,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516224496] [2022-02-20 19:39:47,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:47,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:47,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {42907#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;~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; {42907#true} is VALID [2022-02-20 19:39:47,353 INFO L290 TraceCheckUtils]: 1: Hoare triple {42907#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {42907#true} is VALID [2022-02-20 19:39:47,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {42907#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {42907#true} is VALID [2022-02-20 19:39:47,353 INFO L290 TraceCheckUtils]: 3: Hoare triple {42907#true} assume 0 == ~r1~0; {42907#true} is VALID [2022-02-20 19:39:47,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {42907#true} assume ~id1~0 >= 0; {42907#true} is VALID [2022-02-20 19:39:47,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {42907#true} assume 0 == ~st1~0; {42907#true} is VALID [2022-02-20 19:39:47,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {42907#true} assume ~send1~0 == ~id1~0; {42907#true} is VALID [2022-02-20 19:39:47,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {42907#true} assume 0 == ~mode1~0 % 256; {42907#true} is VALID [2022-02-20 19:39:47,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {42907#true} assume ~id2~0 >= 0; {42907#true} is VALID [2022-02-20 19:39:47,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {42907#true} assume 0 == ~st2~0; {42907#true} is VALID [2022-02-20 19:39:47,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {42907#true} assume ~send2~0 == ~id2~0; {42907#true} is VALID [2022-02-20 19:39:47,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {42907#true} assume 0 == ~mode2~0 % 256; {42907#true} is VALID [2022-02-20 19:39:47,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {42907#true} assume ~id3~0 >= 0; {42907#true} is VALID [2022-02-20 19:39:47,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {42907#true} assume 0 == ~st3~0; {42907#true} is VALID [2022-02-20 19:39:47,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {42907#true} assume ~send3~0 == ~id3~0; {42907#true} is VALID [2022-02-20 19:39:47,355 INFO L290 TraceCheckUtils]: 15: Hoare triple {42907#true} assume 0 == ~mode3~0 % 256; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:47,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id2~0; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:47,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id1~0 != ~id3~0; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:47,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:47,357 INFO L290 TraceCheckUtils]: 19: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} init_#res#1 := init_~tmp~0#1; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:47,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:47,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 == main1_~i2~0#1); {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:47,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} ~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;main1_~i2~0#1 := 0; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:47,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !!(main1_~i2~0#1 < 6);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; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:47,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode1~0 % 256); {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:47,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:47,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {42909#(= (+ (* (- 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; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:47,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {42909#(= (+ (* (- 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; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:47,360 INFO L290 TraceCheckUtils]: 28: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume !(0 != ~mode2~0 % 256); {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:47,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:47,361 INFO L290 TraceCheckUtils]: 30: Hoare triple {42909#(= (+ (* (- 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; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:47,361 INFO L290 TraceCheckUtils]: 31: Hoare triple {42909#(= (+ (* (- 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; {42909#(= (+ (* (- 256) (div ~mode3~0 256)) ~mode3~0) 0)} is VALID [2022-02-20 19:39:47,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {42909#(= (+ (* (- 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; {42908#false} is VALID [2022-02-20 19:39:47,362 INFO L290 TraceCheckUtils]: 33: Hoare triple {42908#false} assume node3_~m3~0#1 != ~nomsg~0; {42908#false} is VALID [2022-02-20 19:39:47,362 INFO L290 TraceCheckUtils]: 34: Hoare triple {42908#false} assume !(node3_~m3~0#1 > ~id3~0); {42908#false} is VALID [2022-02-20 19:39:47,362 INFO L290 TraceCheckUtils]: 35: Hoare triple {42908#false} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {42908#false} is VALID [2022-02-20 19:39:47,362 INFO L290 TraceCheckUtils]: 36: Hoare triple {42908#false} ~mode3~0 := 0; {42908#false} is VALID [2022-02-20 19:39:47,362 INFO L290 TraceCheckUtils]: 37: Hoare triple {42908#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {42908#false} is VALID [2022-02-20 19:39:47,362 INFO L290 TraceCheckUtils]: 38: Hoare triple {42908#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {42908#false} is VALID [2022-02-20 19:39:47,363 INFO L290 TraceCheckUtils]: 39: Hoare triple {42908#false} check_#res#1 := check_~tmp~1#1; {42908#false} is VALID [2022-02-20 19:39:47,363 INFO L290 TraceCheckUtils]: 40: Hoare triple {42908#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {42908#false} is VALID [2022-02-20 19:39:47,363 INFO L290 TraceCheckUtils]: 41: Hoare triple {42908#false} assume 0 == assert_~arg#1 % 256; {42908#false} is VALID [2022-02-20 19:39:47,363 INFO L290 TraceCheckUtils]: 42: Hoare triple {42908#false} assume !false; {42908#false} is VALID [2022-02-20 19:39:47,363 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:39:47,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:47,364 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516224496] [2022-02-20 19:39:47,364 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516224496] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:47,365 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:47,365 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:39:47,365 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852761961] [2022-02-20 19:39:47,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:47,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:39:47,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:47,367 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:47,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:47,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:39:47,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:47,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:39:47,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:47,406 INFO L87 Difference]: Start difference. First operand 1712 states and 2768 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:49,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:49,219 INFO L93 Difference]: Finished difference Result 2042 states and 3264 transitions. [2022-02-20 19:39:49,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:39:49,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:39:49,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:49,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:49,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:49,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:49,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:49,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions. [2022-02-20 19:39:50,576 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1619 edges. 1619 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:50,701 INFO L225 Difference]: With dead ends: 2042 [2022-02-20 19:39:50,701 INFO L226 Difference]: Without dead ends: 1859 [2022-02-20 19:39:50,702 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:39:50,705 INFO L933 BasicCegarLoop]: 1541 mSDtfsCounter, 1477 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1477 SdHoareTripleChecker+Valid, 1603 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:39:50,721 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1477 Valid, 1603 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:50,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1859 states. [2022-02-20 19:39:50,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1859 to 1857. [2022-02-20 19:39:50,885 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:50,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1859 states. Second operand has 1857 states, 1855 states have (on average 1.6059299191374663) internal successors, (2979), 1856 states have internal predecessors, (2979), 0 states have call successors, (0), 0 states have 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:39:50,890 INFO L74 IsIncluded]: Start isIncluded. First operand 1859 states. Second operand has 1857 states, 1855 states have (on average 1.6059299191374663) internal successors, (2979), 1856 states have internal predecessors, (2979), 0 states have call successors, (0), 0 states have 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:39:50,891 INFO L87 Difference]: Start difference. First operand 1859 states. Second operand has 1857 states, 1855 states have (on average 1.6059299191374663) internal successors, (2979), 1856 states have internal predecessors, (2979), 0 states have call successors, (0), 0 states have 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:39:51,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:51,044 INFO L93 Difference]: Finished difference Result 1859 states and 2980 transitions. [2022-02-20 19:39:51,044 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2980 transitions. [2022-02-20 19:39:51,046 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:51,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:51,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 1857 states, 1855 states have (on average 1.6059299191374663) internal successors, (2979), 1856 states have internal predecessors, (2979), 0 states have call successors, (0), 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 1859 states. [2022-02-20 19:39:51,066 INFO L87 Difference]: Start difference. First operand has 1857 states, 1855 states have (on average 1.6059299191374663) internal successors, (2979), 1856 states have internal predecessors, (2979), 0 states have call successors, (0), 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 1859 states. [2022-02-20 19:39:51,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:51,278 INFO L93 Difference]: Finished difference Result 1859 states and 2980 transitions. [2022-02-20 19:39:51,278 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2980 transitions. [2022-02-20 19:39:51,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:51,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:51,280 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:51,280 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:51,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1857 states, 1855 states have (on average 1.6059299191374663) internal successors, (2979), 1856 states have internal predecessors, (2979), 0 states have call successors, (0), 0 states have 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:39:51,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 2979 transitions. [2022-02-20 19:39:51,437 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 2979 transitions. Word has length 43 [2022-02-20 19:39:51,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:51,438 INFO L470 AbstractCegarLoop]: Abstraction has 1857 states and 2979 transitions. [2022-02-20 19:39:51,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:51,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 2979 transitions. [2022-02-20 19:39:51,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 19:39:51,438 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:51,438 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] [2022-02-20 19:39:51,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 19:39:51,439 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:51,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:51,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1199933027, now seen corresponding path program 1 times [2022-02-20 19:39:51,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:51,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272322486] [2022-02-20 19:39:51,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:51,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:51,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {50728#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;~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; {50728#true} is VALID [2022-02-20 19:39:51,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {50728#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {50728#true} is VALID [2022-02-20 19:39:51,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {50728#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {50728#true} is VALID [2022-02-20 19:39:51,525 INFO L290 TraceCheckUtils]: 3: Hoare triple {50728#true} assume 0 == ~r1~0; {50728#true} is VALID [2022-02-20 19:39:51,525 INFO L290 TraceCheckUtils]: 4: Hoare triple {50728#true} assume ~id1~0 >= 0; {50728#true} is VALID [2022-02-20 19:39:51,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {50728#true} assume 0 == ~st1~0; {50728#true} is VALID [2022-02-20 19:39:51,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {50728#true} assume ~send1~0 == ~id1~0; {50728#true} is VALID [2022-02-20 19:39:51,525 INFO L290 TraceCheckUtils]: 7: Hoare triple {50728#true} assume 0 == ~mode1~0 % 256; {50728#true} is VALID [2022-02-20 19:39:51,525 INFO L290 TraceCheckUtils]: 8: Hoare triple {50728#true} assume ~id2~0 >= 0; {50728#true} is VALID [2022-02-20 19:39:51,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {50728#true} assume 0 == ~st2~0; {50728#true} is VALID [2022-02-20 19:39:51,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {50728#true} assume ~send2~0 == ~id2~0; {50728#true} is VALID [2022-02-20 19:39:51,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {50728#true} assume 0 == ~mode2~0 % 256; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:51,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id3~0 >= 0; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:51,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~st3~0; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:51,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send3~0 == ~id3~0; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:51,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume 0 == ~mode3~0 % 256; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:51,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id2~0; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:51,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id1~0 != ~id3~0; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:51,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:51,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} init_#res#1 := init_~tmp~0#1; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:51,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:51,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 == main1_~i2~0#1); {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:51,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} ~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;main1_~i2~0#1 := 0; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:51,532 INFO L290 TraceCheckUtils]: 23: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !!(main1_~i2~0#1 < 6);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; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:51,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume !(0 != ~mode1~0 % 256); {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:51,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:51,533 INFO L290 TraceCheckUtils]: 26: Hoare triple {50730#(= (+ (* (- 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; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:51,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {50730#(= (+ (* (- 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; {50730#(= (+ (* (- 256) (div ~mode2~0 256)) ~mode2~0) 0)} is VALID [2022-02-20 19:39:51,534 INFO L290 TraceCheckUtils]: 28: Hoare triple {50730#(= (+ (* (- 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; {50729#false} is VALID [2022-02-20 19:39:51,534 INFO L290 TraceCheckUtils]: 29: Hoare triple {50729#false} assume node2_~m2~0#1 != ~nomsg~0; {50729#false} is VALID [2022-02-20 19:39:51,534 INFO L290 TraceCheckUtils]: 30: Hoare triple {50729#false} assume !(node2_~m2~0#1 > ~id2~0); {50729#false} is VALID [2022-02-20 19:39:51,534 INFO L290 TraceCheckUtils]: 31: Hoare triple {50729#false} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {50729#false} is VALID [2022-02-20 19:39:51,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {50729#false} ~mode2~0 := 0; {50729#false} is VALID [2022-02-20 19:39:51,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {50729#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; {50729#false} is VALID [2022-02-20 19:39:51,534 INFO L290 TraceCheckUtils]: 34: Hoare triple {50729#false} assume !(0 != ~mode3~0 % 256); {50729#false} is VALID [2022-02-20 19:39:51,535 INFO L290 TraceCheckUtils]: 35: Hoare triple {50729#false} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {50729#false} is VALID [2022-02-20 19:39:51,535 INFO L290 TraceCheckUtils]: 36: Hoare triple {50729#false} ~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; {50729#false} is VALID [2022-02-20 19:39:51,535 INFO L290 TraceCheckUtils]: 37: Hoare triple {50729#false} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {50729#false} is VALID [2022-02-20 19:39:51,535 INFO L290 TraceCheckUtils]: 38: Hoare triple {50729#false} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {50729#false} is VALID [2022-02-20 19:39:51,535 INFO L290 TraceCheckUtils]: 39: Hoare triple {50729#false} check_#res#1 := check_~tmp~1#1; {50729#false} is VALID [2022-02-20 19:39:51,535 INFO L290 TraceCheckUtils]: 40: Hoare triple {50729#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {50729#false} is VALID [2022-02-20 19:39:51,535 INFO L290 TraceCheckUtils]: 41: Hoare triple {50729#false} assume 0 == assert_~arg#1 % 256; {50729#false} is VALID [2022-02-20 19:39:51,536 INFO L290 TraceCheckUtils]: 42: Hoare triple {50729#false} assume !false; {50729#false} is VALID [2022-02-20 19:39:51,536 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:39:51,536 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:51,536 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272322486] [2022-02-20 19:39:51,536 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272322486] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:51,536 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:51,536 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 19:39:51,537 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629479741] [2022-02-20 19:39:51,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:51,537 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:39:51,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:51,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:51,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:51,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 19:39:51,562 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:51,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 19:39:51,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 19:39:51,563 INFO L87 Difference]: Start difference. First operand 1857 states and 2979 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:53,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:53,278 INFO L93 Difference]: Finished difference Result 2441 states and 3837 transitions. [2022-02-20 19:39:53,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 19:39:53,279 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 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 43 [2022-02-20 19:39:53,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:39:53,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:53,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:53,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:53,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1619 transitions. [2022-02-20 19:39:53,289 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 1619 transitions. [2022-02-20 19:39:54,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1619 edges. 1619 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:54,493 INFO L225 Difference]: With dead ends: 2441 [2022-02-20 19:39:54,493 INFO L226 Difference]: Without dead ends: 2113 [2022-02-20 19:39:54,507 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:39:54,508 INFO L933 BasicCegarLoop]: 1554 mSDtfsCounter, 1481 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1481 SdHoareTripleChecker+Valid, 1612 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:39:54,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1481 Valid, 1612 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:39:54,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2113 states. [2022-02-20 19:39:54,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2113 to 2111. [2022-02-20 19:39:54,807 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:39:54,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2113 states. Second operand has 2111 states, 2109 states have (on average 1.5813181602655286) internal successors, (3335), 2110 states have internal predecessors, (3335), 0 states have call successors, (0), 0 states have 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:39:54,811 INFO L74 IsIncluded]: Start isIncluded. First operand 2113 states. Second operand has 2111 states, 2109 states have (on average 1.5813181602655286) internal successors, (3335), 2110 states have internal predecessors, (3335), 0 states have call successors, (0), 0 states have 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:39:54,812 INFO L87 Difference]: Start difference. First operand 2113 states. Second operand has 2111 states, 2109 states have (on average 1.5813181602655286) internal successors, (3335), 2110 states have internal predecessors, (3335), 0 states have call successors, (0), 0 states have 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:39:54,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:54,935 INFO L93 Difference]: Finished difference Result 2113 states and 3336 transitions. [2022-02-20 19:39:54,935 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 3336 transitions. [2022-02-20 19:39:54,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:54,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:54,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 2111 states, 2109 states have (on average 1.5813181602655286) internal successors, (3335), 2110 states have internal predecessors, (3335), 0 states have call successors, (0), 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 2113 states. [2022-02-20 19:39:54,940 INFO L87 Difference]: Start difference. First operand has 2111 states, 2109 states have (on average 1.5813181602655286) internal successors, (3335), 2110 states have internal predecessors, (3335), 0 states have call successors, (0), 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 2113 states. [2022-02-20 19:39:55,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:39:55,062 INFO L93 Difference]: Finished difference Result 2113 states and 3336 transitions. [2022-02-20 19:39:55,062 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 3336 transitions. [2022-02-20 19:39:55,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:39:55,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:39:55,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:39:55,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:39:55,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2111 states, 2109 states have (on average 1.5813181602655286) internal successors, (3335), 2110 states have internal predecessors, (3335), 0 states have call successors, (0), 0 states have 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:39:55,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2111 states to 2111 states and 3335 transitions. [2022-02-20 19:39:55,199 INFO L78 Accepts]: Start accepts. Automaton has 2111 states and 3335 transitions. Word has length 43 [2022-02-20 19:39:55,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:39:55,199 INFO L470 AbstractCegarLoop]: Abstraction has 2111 states and 3335 transitions. [2022-02-20 19:39:55,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have 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:39:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 2111 states and 3335 transitions. [2022-02-20 19:39:55,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-02-20 19:39:55,200 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:39:55,200 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] [2022-02-20 19:39:55,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 19:39:55,200 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:39:55,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:39:55,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1511296967, now seen corresponding path program 1 times [2022-02-20 19:39:55,201 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:39:55,201 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355012512] [2022-02-20 19:39:55,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:39:55,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:39:55,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:39:55,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {59885#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;~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; {59885#true} is VALID [2022-02-20 19:39:55,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {59885#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {59885#true} is VALID [2022-02-20 19:39:55,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {59885#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {59885#true} is VALID [2022-02-20 19:39:55,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {59885#true} assume 0 == ~r1~0; {59885#true} is VALID [2022-02-20 19:39:55,290 INFO L290 TraceCheckUtils]: 4: Hoare triple {59885#true} assume ~id1~0 >= 0; {59885#true} is VALID [2022-02-20 19:39:55,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {59885#true} assume 0 == ~st1~0; {59885#true} is VALID [2022-02-20 19:39:55,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {59885#true} assume ~send1~0 == ~id1~0; {59885#true} is VALID [2022-02-20 19:39:55,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {59885#true} assume 0 == ~mode1~0 % 256; {59885#true} is VALID [2022-02-20 19:39:55,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {59885#true} assume ~id2~0 >= 0; {59885#true} is VALID [2022-02-20 19:39:55,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {59885#true} assume 0 == ~st2~0; {59885#true} is VALID [2022-02-20 19:39:55,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {59885#true} assume ~send2~0 == ~id2~0; {59885#true} is VALID [2022-02-20 19:39:55,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {59885#true} assume 0 == ~mode2~0 % 256; {59885#true} is VALID [2022-02-20 19:39:55,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {59885#true} assume ~id3~0 >= 0; {59885#true} is VALID [2022-02-20 19:39:55,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {59885#true} assume 0 == ~st3~0; {59885#true} is VALID [2022-02-20 19:39:55,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {59885#true} assume ~send3~0 == ~id3~0; {59885#true} is VALID [2022-02-20 19:39:55,292 INFO L290 TraceCheckUtils]: 15: Hoare triple {59885#true} assume 0 == ~mode3~0 % 256; {59885#true} is VALID [2022-02-20 19:39:55,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {59885#true} assume ~id1~0 != ~id2~0; {59885#true} is VALID [2022-02-20 19:39:55,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {59885#true} assume ~id1~0 != ~id3~0; {59885#true} is VALID [2022-02-20 19:39:55,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {59885#true} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {59887#(= |ULTIMATE.start_init_~tmp~0#1| 1)} is VALID [2022-02-20 19:39:55,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {59887#(= |ULTIMATE.start_init_~tmp~0#1| 1)} init_#res#1 := init_~tmp~0#1; {59888#(= |ULTIMATE.start_init_#res#1| 1)} is VALID [2022-02-20 19:39:55,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {59888#(= |ULTIMATE.start_init_#res#1| 1)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {59889#(= |ULTIMATE.start_main1_~i2~0#1| 1)} is VALID [2022-02-20 19:39:55,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {59889#(= |ULTIMATE.start_main1_~i2~0#1| 1)} assume !(0 == main1_~i2~0#1); {59885#true} is VALID [2022-02-20 19:39:55,293 INFO L290 TraceCheckUtils]: 22: Hoare triple {59885#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;main1_~i2~0#1 := 0; {59885#true} is VALID [2022-02-20 19:39:55,293 INFO L290 TraceCheckUtils]: 23: Hoare triple {59885#true} assume !!(main1_~i2~0#1 < 6);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; {59885#true} is VALID [2022-02-20 19:39:55,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {59885#true} assume !(0 != ~mode1~0 % 256); {59885#true} is VALID [2022-02-20 19:39:55,294 INFO L290 TraceCheckUtils]: 25: Hoare triple {59885#true} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {59885#true} is VALID [2022-02-20 19:39:55,294 INFO L290 TraceCheckUtils]: 26: Hoare triple {59885#true} ~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; {59885#true} is VALID [2022-02-20 19:39:55,294 INFO L290 TraceCheckUtils]: 27: Hoare triple {59885#true} 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; {59885#true} is VALID [2022-02-20 19:39:55,294 INFO L290 TraceCheckUtils]: 28: Hoare triple {59885#true} assume !(0 != ~mode2~0 % 256); {59885#true} is VALID [2022-02-20 19:39:55,294 INFO L290 TraceCheckUtils]: 29: Hoare triple {59885#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {59885#true} is VALID [2022-02-20 19:39:55,294 INFO L290 TraceCheckUtils]: 30: Hoare triple {59885#true} ~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; {59885#true} is VALID [2022-02-20 19:39:55,294 INFO L290 TraceCheckUtils]: 31: Hoare triple {59885#true} 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; {59885#true} is VALID [2022-02-20 19:39:55,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {59885#true} assume !(0 != ~mode3~0 % 256); {59885#true} is VALID [2022-02-20 19:39:55,295 INFO L290 TraceCheckUtils]: 33: Hoare triple {59885#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {59885#true} is VALID [2022-02-20 19:39:55,295 INFO L290 TraceCheckUtils]: 34: Hoare triple {59885#true} ~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; {59885#true} is VALID [2022-02-20 19:39:55,295 INFO L290 TraceCheckUtils]: 35: Hoare triple {59885#true} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {59885#true} is VALID [2022-02-20 19:39:55,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {59885#true} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {59885#true} is VALID [2022-02-20 19:39:55,295 INFO L290 TraceCheckUtils]: 37: Hoare triple {59885#true} assume !(~r1~0 >= 3); {59885#true} is VALID [2022-02-20 19:39:55,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {59885#true} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {59885#true} is VALID [2022-02-20 19:39:55,296 INFO L290 TraceCheckUtils]: 39: Hoare triple {59885#true} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {59890#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} is VALID [2022-02-20 19:39:55,296 INFO L290 TraceCheckUtils]: 40: Hoare triple {59890#(not (= |ULTIMATE.start_check_~tmp~1#1| 0))} check_#res#1 := check_~tmp~1#1; {59891#(not (= 0 |ULTIMATE.start_check_#res#1|))} is VALID [2022-02-20 19:39:55,297 INFO L290 TraceCheckUtils]: 41: Hoare triple {59891#(not (= 0 |ULTIMATE.start_check_#res#1|))} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {59892#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} is VALID [2022-02-20 19:39:55,297 INFO L290 TraceCheckUtils]: 42: Hoare triple {59892#(and (<= (div |ULTIMATE.start_assert_~arg#1| 256) 0) (<= 1 |ULTIMATE.start_assert_~arg#1|))} assume 0 == assert_~arg#1 % 256; {59886#false} is VALID [2022-02-20 19:39:55,297 INFO L290 TraceCheckUtils]: 43: Hoare triple {59886#false} assume !false; {59886#false} is VALID [2022-02-20 19:39:55,297 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:39:55,298 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:39:55,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355012512] [2022-02-20 19:39:55,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355012512] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:39:55,298 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:39:55,298 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 19:39:55,298 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850210396] [2022-02-20 19:39:55,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:39:55,299 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-02-20 19:39:55,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:39:55,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:39:55,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:39:55,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 19:39:55,320 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:39:55,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 19:39:55,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 19:39:55,321 INFO L87 Difference]: Start difference. First operand 2111 states and 3335 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:40:02,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:02,230 INFO L93 Difference]: Finished difference Result 2634 states and 4063 transitions. [2022-02-20 19:40:02,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 19:40:02,231 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2022-02-20 19:40:02,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:02,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:40:02,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1577 transitions. [2022-02-20 19:40:02,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:40:02,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1577 transitions. [2022-02-20 19:40:02,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 1577 transitions. [2022-02-20 19:40:03,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1577 edges. 1577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:03,587 INFO L225 Difference]: With dead ends: 2634 [2022-02-20 19:40:03,587 INFO L226 Difference]: Without dead ends: 2632 [2022-02-20 19:40:03,588 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=146, Unknown=0, NotChecked=0, Total=210 [2022-02-20 19:40:03,591 INFO L933 BasicCegarLoop]: 1531 mSDtfsCounter, 331 mSDsluCounter, 8972 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 331 SdHoareTripleChecker+Valid, 10503 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:03,591 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [331 Valid, 10503 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:03,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2632 states. [2022-02-20 19:40:04,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2632 to 2159. [2022-02-20 19:40:04,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:04,092 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2632 states. Second operand has 2159 states, 2157 states have (on average 1.5665275846082523) internal successors, (3379), 2158 states have internal predecessors, (3379), 0 states have call successors, (0), 0 states have 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:40:04,094 INFO L74 IsIncluded]: Start isIncluded. First operand 2632 states. Second operand has 2159 states, 2157 states have (on average 1.5665275846082523) internal successors, (3379), 2158 states have internal predecessors, (3379), 0 states have call successors, (0), 0 states have 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:40:04,095 INFO L87 Difference]: Start difference. First operand 2632 states. Second operand has 2159 states, 2157 states have (on average 1.5665275846082523) internal successors, (3379), 2158 states have internal predecessors, (3379), 0 states have call successors, (0), 0 states have 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:40:04,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:04,320 INFO L93 Difference]: Finished difference Result 2632 states and 4042 transitions. [2022-02-20 19:40:04,320 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 4042 transitions. [2022-02-20 19:40:04,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:04,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:04,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 2159 states, 2157 states have (on average 1.5665275846082523) internal successors, (3379), 2158 states have internal predecessors, (3379), 0 states have call successors, (0), 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 2632 states. [2022-02-20 19:40:04,327 INFO L87 Difference]: Start difference. First operand has 2159 states, 2157 states have (on average 1.5665275846082523) internal successors, (3379), 2158 states have internal predecessors, (3379), 0 states have call successors, (0), 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 2632 states. [2022-02-20 19:40:04,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:04,522 INFO L93 Difference]: Finished difference Result 2632 states and 4042 transitions. [2022-02-20 19:40:04,522 INFO L276 IsEmpty]: Start isEmpty. Operand 2632 states and 4042 transitions. [2022-02-20 19:40:04,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:04,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:04,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:04,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:04,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2159 states, 2157 states have (on average 1.5665275846082523) internal successors, (3379), 2158 states have internal predecessors, (3379), 0 states have call successors, (0), 0 states have 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:40:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2159 states to 2159 states and 3379 transitions. [2022-02-20 19:40:04,681 INFO L78 Accepts]: Start accepts. Automaton has 2159 states and 3379 transitions. Word has length 44 [2022-02-20 19:40:04,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:04,682 INFO L470 AbstractCegarLoop]: Abstraction has 2159 states and 3379 transitions. [2022-02-20 19:40:04,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 8 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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:40:04,682 INFO L276 IsEmpty]: Start isEmpty. Operand 2159 states and 3379 transitions. [2022-02-20 19:40:04,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:40:04,683 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:04,683 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:04,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 19:40:04,683 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:04,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:04,685 INFO L85 PathProgramCache]: Analyzing trace with hash -213997176, now seen corresponding path program 1 times [2022-02-20 19:40:04,685 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:04,685 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447475691] [2022-02-20 19:40:04,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:04,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:04,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {70437#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;~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; {70437#true} is VALID [2022-02-20 19:40:04,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {70437#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {70437#true} is VALID [2022-02-20 19:40:04,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {70437#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {70437#true} is VALID [2022-02-20 19:40:04,747 INFO L290 TraceCheckUtils]: 3: Hoare triple {70437#true} assume 0 == ~r1~0; {70437#true} is VALID [2022-02-20 19:40:04,747 INFO L290 TraceCheckUtils]: 4: Hoare triple {70437#true} assume ~id1~0 >= 0; {70437#true} is VALID [2022-02-20 19:40:04,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {70437#true} assume 0 == ~st1~0; {70439#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:04,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {70439#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {70439#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:04,748 INFO L290 TraceCheckUtils]: 7: Hoare triple {70439#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {70439#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:04,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {70439#(<= ~st1~0 0)} assume ~id2~0 >= 0; {70439#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:04,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {70439#(<= ~st1~0 0)} assume 0 == ~st2~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,749 INFO L290 TraceCheckUtils]: 10: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 == ~id2~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode2~0 % 256; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id3~0 >= 0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st3~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,758 INFO L290 TraceCheckUtils]: 21: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == main1_~i2~0#1); {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} ~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;main1_~i2~0#1 := 0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,759 INFO L290 TraceCheckUtils]: 23: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(main1_~i2~0#1 < 6);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; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,759 INFO L290 TraceCheckUtils]: 24: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,760 INFO L290 TraceCheckUtils]: 26: Hoare triple {70440#(<= (+ ~st2~0 ~st1~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; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,760 INFO L290 TraceCheckUtils]: 27: Hoare triple {70440#(<= (+ ~st2~0 ~st1~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; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,760 INFO L290 TraceCheckUtils]: 28: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,761 INFO L290 TraceCheckUtils]: 29: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {70440#(<= (+ ~st2~0 ~st1~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; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,762 INFO L290 TraceCheckUtils]: 31: Hoare triple {70440#(<= (+ ~st2~0 ~st1~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; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,762 INFO L290 TraceCheckUtils]: 32: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,762 INFO L290 TraceCheckUtils]: 33: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,763 INFO L290 TraceCheckUtils]: 34: Hoare triple {70440#(<= (+ ~st2~0 ~st1~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; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,763 INFO L290 TraceCheckUtils]: 35: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,763 INFO L290 TraceCheckUtils]: 36: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,764 INFO L290 TraceCheckUtils]: 37: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,764 INFO L290 TraceCheckUtils]: 38: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,764 INFO L290 TraceCheckUtils]: 39: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,764 INFO L290 TraceCheckUtils]: 40: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,765 INFO L290 TraceCheckUtils]: 41: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,765 INFO L290 TraceCheckUtils]: 42: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,766 INFO L290 TraceCheckUtils]: 43: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume { :end_inline_assert } true;main1_#t~post23#1 := main1_~i2~0#1;main1_~i2~0#1 := 1 + main1_#t~post23#1;havoc main1_#t~post23#1; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,766 INFO L290 TraceCheckUtils]: 44: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume !!(main1_~i2~0#1 < 6);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; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,766 INFO L290 TraceCheckUtils]: 45: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,767 INFO L290 TraceCheckUtils]: 46: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume !(node1_~m1~0#1 != ~nomsg~0); {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,767 INFO L290 TraceCheckUtils]: 47: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} ~mode1~0 := 0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,767 INFO L290 TraceCheckUtils]: 48: Hoare triple {70440#(<= (+ ~st2~0 ~st1~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; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,767 INFO L290 TraceCheckUtils]: 49: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,768 INFO L290 TraceCheckUtils]: 50: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,768 INFO L290 TraceCheckUtils]: 51: Hoare triple {70440#(<= (+ ~st2~0 ~st1~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; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {70440#(<= (+ ~st2~0 ~st1~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; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,769 INFO L290 TraceCheckUtils]: 53: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,769 INFO L290 TraceCheckUtils]: 54: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 != ~nomsg~0; {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,769 INFO L290 TraceCheckUtils]: 55: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume !(node3_~m3~0#1 > ~id3~0); {70440#(<= (+ ~st2~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:04,770 INFO L290 TraceCheckUtils]: 56: Hoare triple {70440#(<= (+ ~st2~0 ~st1~0) 0)} assume node3_~m3~0#1 == ~id3~0;~st3~0 := 1; {70441#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:04,770 INFO L290 TraceCheckUtils]: 57: Hoare triple {70441#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} ~mode3~0 := 0; {70441#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:04,771 INFO L290 TraceCheckUtils]: 58: Hoare triple {70441#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {70441#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} is VALID [2022-02-20 19:40:04,771 INFO L290 TraceCheckUtils]: 59: Hoare triple {70441#(and (= (+ (- 1) ~st3~0) 0) (<= (+ ~st2~0 ~st1~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {70438#false} is VALID [2022-02-20 19:40:04,771 INFO L290 TraceCheckUtils]: 60: Hoare triple {70438#false} check_#res#1 := check_~tmp~1#1; {70438#false} is VALID [2022-02-20 19:40:04,771 INFO L290 TraceCheckUtils]: 61: Hoare triple {70438#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {70438#false} is VALID [2022-02-20 19:40:04,771 INFO L290 TraceCheckUtils]: 62: Hoare triple {70438#false} assume 0 == assert_~arg#1 % 256; {70438#false} is VALID [2022-02-20 19:40:04,772 INFO L290 TraceCheckUtils]: 63: Hoare triple {70438#false} assume !false; {70438#false} is VALID [2022-02-20 19:40:04,772 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-02-20 19:40:04,772 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:04,772 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447475691] [2022-02-20 19:40:04,772 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447475691] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:04,773 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:04,773 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:04,773 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102138523] [2022-02-20 19:40:04,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:04,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 64 [2022-02-20 19:40:04,774 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:04,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have 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:40:04,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:04,811 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:04,811 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:04,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:04,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:04,812 INFO L87 Difference]: Start difference. First operand 2159 states and 3379 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have 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:40:09,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:09,889 INFO L93 Difference]: Finished difference Result 4187 states and 6227 transitions. [2022-02-20 19:40:09,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 19:40:09,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 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 64 [2022-02-20 19:40:09,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 19:40:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have 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:40:09,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1738 transitions. [2022-02-20 19:40:09,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have 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:40:09,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1738 transitions. [2022-02-20 19:40:09,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 1738 transitions. [2022-02-20 19:40:10,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1738 edges. 1738 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:11,337 INFO L225 Difference]: With dead ends: 4187 [2022-02-20 19:40:11,337 INFO L226 Difference]: Without dead ends: 3557 [2022-02-20 19:40:11,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 19:40:11,339 INFO L933 BasicCegarLoop]: 1563 mSDtfsCounter, 3075 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3075 SdHoareTripleChecker+Valid, 3177 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 19:40:11,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3075 Valid, 3177 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 19:40:11,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3557 states. [2022-02-20 19:40:11,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3557 to 2787. [2022-02-20 19:40:11,961 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 19:40:11,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3557 states. Second operand has 2787 states, 2785 states have (on average 1.5278276481149013) internal successors, (4255), 2786 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have 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:40:11,967 INFO L74 IsIncluded]: Start isIncluded. First operand 3557 states. Second operand has 2787 states, 2785 states have (on average 1.5278276481149013) internal successors, (4255), 2786 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have 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:40:11,969 INFO L87 Difference]: Start difference. First operand 3557 states. Second operand has 2787 states, 2785 states have (on average 1.5278276481149013) internal successors, (4255), 2786 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have 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:40:12,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:12,374 INFO L93 Difference]: Finished difference Result 3557 states and 5326 transitions. [2022-02-20 19:40:12,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 5326 transitions. [2022-02-20 19:40:12,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:12,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:12,381 INFO L74 IsIncluded]: Start isIncluded. First operand has 2787 states, 2785 states have (on average 1.5278276481149013) internal successors, (4255), 2786 states have internal predecessors, (4255), 0 states have call successors, (0), 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 3557 states. [2022-02-20 19:40:12,382 INFO L87 Difference]: Start difference. First operand has 2787 states, 2785 states have (on average 1.5278276481149013) internal successors, (4255), 2786 states have internal predecessors, (4255), 0 states have call successors, (0), 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 3557 states. [2022-02-20 19:40:12,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 19:40:12,776 INFO L93 Difference]: Finished difference Result 3557 states and 5326 transitions. [2022-02-20 19:40:12,777 INFO L276 IsEmpty]: Start isEmpty. Operand 3557 states and 5326 transitions. [2022-02-20 19:40:12,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 19:40:12,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 19:40:12,780 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 19:40:12,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 19:40:12,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2787 states, 2785 states have (on average 1.5278276481149013) internal successors, (4255), 2786 states have internal predecessors, (4255), 0 states have call successors, (0), 0 states have 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:40:13,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2787 states to 2787 states and 4255 transitions. [2022-02-20 19:40:13,045 INFO L78 Accepts]: Start accepts. Automaton has 2787 states and 4255 transitions. Word has length 64 [2022-02-20 19:40:13,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 19:40:13,045 INFO L470 AbstractCegarLoop]: Abstraction has 2787 states and 4255 transitions. [2022-02-20 19:40:13,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have 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:40:13,045 INFO L276 IsEmpty]: Start isEmpty. Operand 2787 states and 4255 transitions. [2022-02-20 19:40:13,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-02-20 19:40:13,046 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 19:40:13,046 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:13,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 19:40:13,046 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 19:40:13,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 19:40:13,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1033510440, now seen corresponding path program 1 times [2022-02-20 19:40:13,047 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 19:40:13,047 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987109634] [2022-02-20 19:40:13,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 19:40:13,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 19:40:13,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 19:40:13,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {85533#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;~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; {85533#true} is VALID [2022-02-20 19:40:13,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {85533#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet38#1, main_#t~ret39#1, main_#t~ret40#1;assume -2147483648 <= main_#t~nondet38#1 && main_#t~nondet38#1 <= 2147483647; {85533#true} is VALID [2022-02-20 19:40:13,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {85533#true} assume 0 != main_#t~nondet38#1;havoc main_#t~nondet38#1;assume { :begin_inline_main1 } true;havoc main1_#res#1;havoc main1_#t~nondet8#1, main1_#t~nondet9#1, main1_#t~nondet10#1, main1_#t~nondet11#1, main1_#t~nondet12#1, main1_#t~nondet13#1, main1_#t~nondet14#1, main1_#t~nondet15#1, main1_#t~nondet16#1, main1_#t~nondet17#1, main1_#t~nondet18#1, main1_#t~nondet19#1, main1_#t~nondet20#1, main1_#t~ret21#1, main1_#t~ret22#1, main1_#t~post23#1, main1_~c1~0#1, main1_~i2~0#1;havoc main1_~c1~0#1;havoc main1_~i2~0#1;main1_~c1~0#1 := 0;assume -128 <= main1_#t~nondet8#1 && main1_#t~nondet8#1 <= 127;~r1~0 := main1_#t~nondet8#1;havoc main1_#t~nondet8#1;assume -128 <= main1_#t~nondet9#1 && main1_#t~nondet9#1 <= 127;~id1~0 := main1_#t~nondet9#1;havoc main1_#t~nondet9#1;assume -128 <= main1_#t~nondet10#1 && main1_#t~nondet10#1 <= 127;~st1~0 := main1_#t~nondet10#1;havoc main1_#t~nondet10#1;assume -128 <= main1_#t~nondet11#1 && main1_#t~nondet11#1 <= 127;~send1~0 := main1_#t~nondet11#1;havoc main1_#t~nondet11#1;~mode1~0 := main1_#t~nondet12#1;havoc main1_#t~nondet12#1;assume -128 <= main1_#t~nondet13#1 && main1_#t~nondet13#1 <= 127;~id2~0 := main1_#t~nondet13#1;havoc main1_#t~nondet13#1;assume -128 <= main1_#t~nondet14#1 && main1_#t~nondet14#1 <= 127;~st2~0 := main1_#t~nondet14#1;havoc main1_#t~nondet14#1;assume -128 <= main1_#t~nondet15#1 && main1_#t~nondet15#1 <= 127;~send2~0 := main1_#t~nondet15#1;havoc main1_#t~nondet15#1;~mode2~0 := main1_#t~nondet16#1;havoc main1_#t~nondet16#1;assume -128 <= main1_#t~nondet17#1 && main1_#t~nondet17#1 <= 127;~id3~0 := main1_#t~nondet17#1;havoc main1_#t~nondet17#1;assume -128 <= main1_#t~nondet18#1 && main1_#t~nondet18#1 <= 127;~st3~0 := main1_#t~nondet18#1;havoc main1_#t~nondet18#1;assume -128 <= main1_#t~nondet19#1 && main1_#t~nondet19#1 <= 127;~send3~0 := main1_#t~nondet19#1;havoc main1_#t~nondet19#1;~mode3~0 := main1_#t~nondet20#1;havoc main1_#t~nondet20#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {85533#true} is VALID [2022-02-20 19:40:13,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {85533#true} assume 0 == ~r1~0; {85533#true} is VALID [2022-02-20 19:40:13,093 INFO L290 TraceCheckUtils]: 4: Hoare triple {85533#true} assume ~id1~0 >= 0; {85533#true} is VALID [2022-02-20 19:40:13,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {85533#true} assume 0 == ~st1~0; {85535#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:13,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {85535#(<= ~st1~0 0)} assume ~send1~0 == ~id1~0; {85535#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:13,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {85535#(<= ~st1~0 0)} assume 0 == ~mode1~0 % 256; {85535#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:13,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {85535#(<= ~st1~0 0)} assume ~id2~0 >= 0; {85535#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:13,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {85535#(<= ~st1~0 0)} assume 0 == ~st2~0; {85535#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:13,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {85535#(<= ~st1~0 0)} assume ~send2~0 == ~id2~0; {85535#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:13,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {85535#(<= ~st1~0 0)} assume 0 == ~mode2~0 % 256; {85535#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:13,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {85535#(<= ~st1~0 0)} assume ~id3~0 >= 0; {85535#(<= ~st1~0 0)} is VALID [2022-02-20 19:40:13,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {85535#(<= ~st1~0 0)} assume 0 == ~st3~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 == ~id3~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,096 INFO L290 TraceCheckUtils]: 15: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~mode3~0 % 256; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,096 INFO L290 TraceCheckUtils]: 16: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id2~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,096 INFO L290 TraceCheckUtils]: 17: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id1~0 != ~id3~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,097 INFO L290 TraceCheckUtils]: 18: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume ~id2~0 != ~id3~0;init_~tmp~0#1 := 1; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,097 INFO L290 TraceCheckUtils]: 19: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} init_#res#1 := init_~tmp~0#1; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,097 INFO L290 TraceCheckUtils]: 20: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} main1_#t~ret21#1 := init_#res#1;assume { :end_inline_init } true;assume -2147483648 <= main1_#t~ret21#1 && main1_#t~ret21#1 <= 2147483647;main1_~i2~0#1 := main1_#t~ret21#1;havoc main1_#t~ret21#1; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == main1_~i2~0#1); {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,098 INFO L290 TraceCheckUtils]: 22: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} ~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;main1_~i2~0#1 := 0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,098 INFO L290 TraceCheckUtils]: 23: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(main1_~i2~0#1 < 6);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; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,098 INFO L290 TraceCheckUtils]: 24: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode1~0 % 256); {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send1~0 != ~nomsg~0 && ~p1_new~0 == ~nomsg~0;node1_#t~ite5#1 := ~send1~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,099 INFO L290 TraceCheckUtils]: 26: Hoare triple {85536#(<= (+ ~st3~0 ~st1~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; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,099 INFO L290 TraceCheckUtils]: 27: Hoare triple {85536#(<= (+ ~st3~0 ~st1~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; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,100 INFO L290 TraceCheckUtils]: 28: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode2~0 % 256); {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,100 INFO L290 TraceCheckUtils]: 29: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite6#1 := ~send2~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,100 INFO L290 TraceCheckUtils]: 30: Hoare triple {85536#(<= (+ ~st3~0 ~st1~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; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {85536#(<= (+ ~st3~0 ~st1~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; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,101 INFO L290 TraceCheckUtils]: 32: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 != ~mode3~0 % 256); {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,101 INFO L290 TraceCheckUtils]: 33: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,101 INFO L290 TraceCheckUtils]: 34: Hoare triple {85536#(<= (+ ~st3~0 ~st1~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; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,102 INFO L290 TraceCheckUtils]: 35: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,102 INFO L290 TraceCheckUtils]: 36: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,102 INFO L290 TraceCheckUtils]: 37: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume !(~r1~0 >= 3); {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,103 INFO L290 TraceCheckUtils]: 38: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,103 INFO L290 TraceCheckUtils]: 39: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,103 INFO L290 TraceCheckUtils]: 40: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} check_#res#1 := check_~tmp~1#1; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,103 INFO L290 TraceCheckUtils]: 41: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume !(0 == assert_~arg#1 % 256); {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume { :end_inline_assert } true;main1_#t~post23#1 := main1_~i2~0#1;main1_~i2~0#1 := 1 + main1_#t~post23#1;havoc main1_#t~post23#1; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,104 INFO L290 TraceCheckUtils]: 44: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume !!(main1_~i2~0#1 < 6);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; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,104 INFO L290 TraceCheckUtils]: 45: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,105 INFO L290 TraceCheckUtils]: 46: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume !(node1_~m1~0#1 != ~nomsg~0); {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,105 INFO L290 TraceCheckUtils]: 47: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} ~mode1~0 := 0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,105 INFO L290 TraceCheckUtils]: 48: Hoare triple {85536#(<= (+ ~st3~0 ~st1~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; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,106 INFO L290 TraceCheckUtils]: 49: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,106 INFO L290 TraceCheckUtils]: 50: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume node2_~m2~0#1 != ~nomsg~0; {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,106 INFO L290 TraceCheckUtils]: 51: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume !(node2_~m2~0#1 > ~id2~0); {85536#(<= (+ ~st3~0 ~st1~0) 0)} is VALID [2022-02-20 19:40:13,107 INFO L290 TraceCheckUtils]: 52: Hoare triple {85536#(<= (+ ~st3~0 ~st1~0) 0)} assume node2_~m2~0#1 == ~id2~0;~st2~0 := 1; {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:40:13,107 INFO L290 TraceCheckUtils]: 53: Hoare triple {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} ~mode2~0 := 0; {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:40:13,107 INFO L290 TraceCheckUtils]: 54: Hoare triple {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~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; {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:40:13,108 INFO L290 TraceCheckUtils]: 55: Hoare triple {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(0 != ~mode3~0 % 256); {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:40:13,108 INFO L290 TraceCheckUtils]: 56: Hoare triple {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite7#1 := ~send3~0; {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:40:13,108 INFO L290 TraceCheckUtils]: 57: Hoare triple {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~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; {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:40:13,109 INFO L290 TraceCheckUtils]: 58: Hoare triple {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume { :end_inline_node3 } 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;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} is VALID [2022-02-20 19:40:13,109 INFO L290 TraceCheckUtils]: 59: Hoare triple {85537#(and (<= (+ ~st3~0 ~st1~0) 0) (= (+ (- 1) ~st2~0) 0))} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {85534#false} is VALID [2022-02-20 19:40:13,109 INFO L290 TraceCheckUtils]: 60: Hoare triple {85534#false} check_#res#1 := check_~tmp~1#1; {85534#false} is VALID [2022-02-20 19:40:13,109 INFO L290 TraceCheckUtils]: 61: Hoare triple {85534#false} main1_#t~ret22#1 := check_#res#1;assume { :end_inline_check } true;assume -2147483648 <= main1_#t~ret22#1 && main1_#t~ret22#1 <= 2147483647;main1_~c1~0#1 := main1_#t~ret22#1;havoc main1_#t~ret22#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; {85534#false} is VALID [2022-02-20 19:40:13,110 INFO L290 TraceCheckUtils]: 62: Hoare triple {85534#false} assume 0 == assert_~arg#1 % 256; {85534#false} is VALID [2022-02-20 19:40:13,110 INFO L290 TraceCheckUtils]: 63: Hoare triple {85534#false} assume !false; {85534#false} is VALID [2022-02-20 19:40:13,110 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 19:40:13,110 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 19:40:13,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987109634] [2022-02-20 19:40:13,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987109634] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 19:40:13,110 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 19:40:13,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 19:40:13,111 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402851949] [2022-02-20 19:40:13,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 19:40:13,111 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 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 64 [2022-02-20 19:40:13,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 19:40:13,112 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have 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:40:13,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 19:40:13,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 19:40:13,155 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 19:40:13,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 19:40:13,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 19:40:13,156 INFO L87 Difference]: Start difference. First operand 2787 states and 4255 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)